Fusion-based quantum computation
By Sara Bartolucci, P. Birchall, H. Bombin, H. Cable, Christopher M. Dawson, Mercedes Gimeno-Segovia, Eric R. Johnston, K. Kieling, Naomi H. Nickerson, M. Pant and 3 more. Nature Communications, 2021
479 citations recorded by the source corpus.
Fusion gates are common operations in photonic quantum information platforms, where they are employed to create entanglement. Here, the authors propose a quantum computation scheme where the same measurements used to generate entanglement can also be used to achieve fault-tolerance leading to an increased tolerance to errors. The standard primitives of quantum computing include deterministic unitary entangling gates, which are not natural operations in many systems including photonics. Here, we present fusion-based quantum computation, a model for fault tolerant quantum computing constructed from physical primitives readily accessible in photonic systems. These are entangling measurements, called fusions, which are performed on the qubits of small constant sized entangled resource states. Probabilistic photonic gates as well as errors are directly dealt with by the quantum error correction protocol. We show that this computational model can achieve a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion, which corresponds to a 2.7% probability of loss of each individual photon. The architecture is also highly modular and has reduced classical processing requirements compared to previous photonic quantum computing architectures.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/9d82c7e11a220e9848003d5cc0c198ff96e0a448
Citations in the corpus
- Quantum computational advantage with a programmable photonic processor (2022, unknown): “T η T B α φ = ⊗ ⊗ (VBS ( , )) (10) C d D”