.png){kind=icon}
.png){kind=icon}
Return
Fusion-based quantum computation
.png){kind=icon}
OA
AI
DOI：10.1038/s41467-023-36493-1.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. 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.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
15.7
Papers:
9.2W
Citations:
91.2W
Organization
No organization information available