Quantum computing with nearest neighbor interactions and error rates over 1%

2010/09/20 by David S. Wang, Austin G. Fowler, Lloyd C. L. Hollenberg · 1 citation
Physics and Astronomy · #quant-ph

paper · pdf · doi:10.1103/physreva.83.020302

published as Phys. Rev. A 83, 020302(R) (2011) · 4 pages, 8 figures

arxiv created 2010/09/20 · arxiv updated 2011/02/22

Abstract

Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure that requires only a 2-D square lattice of qubits that can interact with their nearest neighbors, yet can tolerate quantum gate error rates over 1%. The precise maximum tolerable error rate depends on the error model, and we calculate values in the range 1.1--1.4% for various physically reasonable models. Even the lowest value represents the highest threshold error rate calculated to date in a geometrically constrained setting, and a 50% improvement over the previous record.

Cited by

• Lattice patch structure for fixed-frequency transmon quantum computer with high-fidelity CNOT gates

Related

• Proof of Finite Surface Code Threshold for Matching
• Scalability of quantum error mitigation techniques: from utility to advantage
• Quantum error correction below the surface code threshold
• Fault-tolerant quantum computation
• A lower bound on the overhead of quantum error correction in low dimensions