Elevator Codes: Concatenation for resource-efficient quantum memory under biased noise
Peter Shanahan, Diego Ruiz

TL;DR
This paper introduces a concatenated 2D local quantum error-correcting code that significantly reduces qubit overhead under highly biased noise conditions by addressing phase-flip and bit-flip errors at different layers.
Contribution
It presents a novel concatenation-based code construction that outperforms existing codes for large noise bias, optimizing resource efficiency in quantum memory.
Findings
Reduces qubit overhead by over 50% at specific error rates and biases.
Achieves a logical error rate of 10^{-12} with fewer qubits than previous codes.
Effective in regimes with noise bias η ≥ 7×10^4.
Abstract
Biased-noise qubits, in which one type of error (e.g. - and -type errors) is significantly suppressed relative to the other (e.g. -type errors), can significantly reduce the overhead of quantum error correction. Codes such as the rectangular surface code or XZZX code substantially reduce the qubit overhead under biased noise, but they still face challenges. The rectangular surface code suffers from a relatively low threshold, while the XZZX code requires twice as many physical qubits to maintain the same code distance as the surface code. In this work, we introduce a 2D local code construction that outperforms these codes for noise biases , reducing the qubit overhead by over 50% at and to achieve a logical error rate of . Our construction relies on the concatenation of two classical codes. The inner codes…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
