Distance-four quantum codes with combined postselection and error correction
arXiv:2112.03785 · doi:10.1103/PhysRevA.110.012419
Abstract
When storing encoded qubits, if single faults can be corrected and double faults postselected against, logical errors only occur due to at least three faults. At current noise rates, having to restart when two errors are detected prevents very long-term storage, but this should not be an issue for low-depth computations. We consider distance-four, efficient encodings of multiple qubits into a modified planar patch of the -qubit surface code. We simulate postselected error correction for up to rounds of parallel stabilizer measurements, and subsequently estimate the cumulative probability of logical error for up to twelve encoded qubits. Our results demonstrate a combination of low logical error rate and low physical overhead. For example, the distance-four surface code, using postselection, accumulates times less error than its distance-five counterpart. For encoded qubits, a distance-four code using qubits protects as well as the distance-five surface code using qubits. Hence distance-four codes, using postselection and in a planar geometry, are qubit-efficient candidates for fault-tolerant, moderate-depth computations.
arXiv comment12 pages, 13 figures
References in corpus (36)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Surface codes: Towards practical large-scale quantum computation
- Dynamical Decoupling of Open Quantum Systems
- Noisy intermediate-scale quantum (NISQ) algorithms
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Error Correction for Quantum Memories
- Quantum Computing with Very Noisy Devices
- Towards Practical Quantum Variational Algorithms
- Roads towards fault-tolerant universal quantum computation
- Experimental Quantum Computations on a Topologically Encoded Qubit
- A compact ion-trap quantum computing demonstrator
- Repeated Quantum Error Detection in a Surface Code
- Active stabilisation, quantum computation and quantum state synthesis
- Low-distance Surface Codes under Realistic Quantum Noise
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Experimental demonstration of fault-tolerant state preparation with superconducting qubits
- Almost-linear time decoding algorithm for topological codes
- Quantum error correction with only two extra qubits
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Topological and subsystem codes on low-degree graphs with flag qubits
- Fault-tolerant quantum error detection
- Flag fault-tolerant error correction with arbitrary distance codes
- Decoding quantum errors with subspace expansions
- Optimality Study of Existing Quantum Computing Layout Synthesis Tools
- Triangular color codes on trivalent graphs with flag qubits
- A Fault-Tolerant Honeycomb Memory
- Flag fault-tolerant error correction for any stabilizer code
- Whole-device entanglement in a 65-qubit superconducting quantum computer
- Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits
- Beyond single-shot fault-tolerant quantum error correction
- Benchmarking near-term devices with quantum error correction
- Quantum key distribution over quantum repeaters with encoding: Using Error Detection as an Effective Post-Selection Tool
- Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation