Parity-encoding-based quantum computing with Bayesian error tracking
arXiv:2207.06805 · doi:10.1038/s41534-023-00705-9
Abstract
Measurement-based quantum computing (MBQC) in linear optical systems is promising for near-future quantum computing architecture. However, the nondeterministic nature of entangling operations and photon losses hinder the large-scale generation of graph states and introduce logical errors. In this work, we propose a linear optical topological MBQC protocol employing multiphoton qubits based on the parity encoding, which turns out to be highly photon-loss tolerant and resource-efficient even under the effects of nonideal entangling operations that unavoidably corrupt nearby qubits. For the realistic error analysis, we introduce a Bayesian methodology, in conjunction with the stabilizer formalism, to track errors caused by such detrimental effects. We additionally suggest a graph-theoretical optimization scheme for the process of constructing an arbitrary graph state, which greatly reduces its resource overhead. Notably, we show that our protocol is advantageous over several other existing approaches in terms of fault-tolerance, resource overhead, or feasibility of basic elements.
Main text: 15 pages, 10 figures / Supplemental Material: 17 pages, 8 figures
References in corpus (13)
- Resource-efficient linear optical quantum computation
- Topological fault-tolerance in cluster state quantum computation
- How good must single photon sources and detectors be for efficient linear optical quantum computation?
- From three-photon GHZ states to ballistic universal quantum computation
- 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Realizing a Deterministic Source of Multipartite-Entangled Photonic Qubits
- Logical blocks for fault-tolerant topological quantum computation
- Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
- All-photonic architectural roadmap for scalable quantum computing using Greenberger-Horne-Zeilinger states
- Near-deterministic creation of universal cluster states with probabilistic Bell measurements and 3-qubit resource states
- Highly photon loss tolerant quantum computing using hybrid qubits
- Universal resource-efficient topological measurement-based quantum computation via color-code-based cluster states
Cited by in corpus (5)
- Fault-tolerant quantum computation by hybrid qubits with bosonic cat-code and single photons
- Graph-theoretical optimization of fusion-based graph state generation
- Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics
- Photonic Hybrid Quantum Computing
- Building a fusion-based quantum computer using teleported gates