Quantum computing with nearest neighbor interactions and error rates over 1%
David S. Wang, Austin G. Fowler, Lloyd C. L. Hollenberg

TL;DR
This paper presents a 2-D nearest neighbor quantum error correction method that tolerates error rates over 1%, representing a significant improvement in threshold error rates for geometrically constrained quantum systems.
Contribution
It introduces a quantum error correction procedure compatible with 2-D nearest neighbor interactions that achieves the highest threshold error rates to date under such constraints.
Findings
Maximum tolerable error rate ranges from 1.1% to 1.4% depending on the error model.
Achieves a 50% improvement over previous threshold error rates.
Supports scalable quantum computation with realistic physical constraints.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
