REVIEW 10 cited by
High-threshold and low-overhead fault-tolerant quantum memory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Quantum error correction becomes a practical possibility only if the physical error rate is below a threshold value that depends on a particular quantum code, syndrome measurement circuit, and decoding algorithm. Here we present an end-to-end quantum error correction protocol that implements fault-tolerant memory based on a family of LDPC codes with a high encoding rate that achieves an error threshold of $0.8\%$ for the standard circuit-based noise model. This is on par with the surface code which has remained an uncontested leader in terms of its high error threshold for nearly 20 years. The full syndrome measurement cycle for a length-$n$ code in our family requires $n$ ancillary qubits and a depth-7 circuit composed of nearest-neighbor CNOT gates. The required qubit connectivity is a degree-6 graph that consists of two edge-disjoint planar subgraphs. As a concrete example, we show that 12 logical qubits can be preserved for nearly one million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of $0.1\%$. We argue that achieving the same level of error suppression on 12 logical qubits with the surface code would require nearly 3000 physical qubits. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.
Forward citations
Cited by 10 Pith papers
-
The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus
A quantum bus connects many logical qubits through a gauge-code strip, with a claimed factor O(d) reduction in qubit overhead for long-range logical interactions.
-
Finding diagonal logical gates in CSS codes and circuits
Diagonal logical gates of a CSS code or circuit are exactly the kernel of a pullback map on phase functions, and that kernel can be computed in cubic time.
-
Logical Spectroscopy: Lifted-Product Codes with Addressable Bases
Logical spectroscopy decomposes Abelian lifted-product codes into Frobenius packets, builds a complete addressable conjugate logical basis by finite-field algebra plus idempotent lifts, and supplies design diagnostics...
-
(2,2)-GB Codes: Classification and Comparison with weight-4 Surface Codes
Three new families of (2,2)-generalized bicycle codes reach optimal parameters, including the first optimal even-distance family [[4r^2,2,2r]].
-
Improved belief propagation is sufficient for real-time decoding of quantum memory
Relay-BP, a message-passing decoder using disordered memory strengths and relay ensembling, matches or beats benchmark decoders for bivariate-bicycle and surface codes within a real-time iteration budget.
-
Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays
The authors complete a transversal Clifford gate set on rotated surface codes by embedding a fold-transversal S gate inside a syndrome extraction round, with detector construction and numerical support.
-
Quantum Cellular Automata from Kramers-Wannier Dualities and Modular Relations
Gravitational topological responses are shown to appear as the projective phase (ST)^3=Y in gauging/stacking relations, corresponding on the lattice to nontrivial QCAs implementable via finite-depth circuits, measurem...
-
Quantum XYZ Stabilizer Codes
A structured family of non-CSS quantum stabilizer codes built from three orthogonal classical codes, with rank-based genuineness tests, distance bounds, and finite-length decoding improvements.
-
Plaquette: A hardware-aware design platform for fault-tolerant quantum computers
Plaquette compiles realistic quantum hardware noise models into multiple sampler representations, showing that Pauli-twirled approximations can misestimate logical error rates by an order of magnitude compared to leak...
-
Quantum Error Correction Codes for Truncated SU(2) Lattice Gauge Theories
Gauss's law constraints in jmax=1/2 SU(2) lattice gauge theory are converted into stabilizer codes that correct single-qubit errors using about 9N or 12N physical qubits per N plaquettes.
Discussion (0). Continue with ORCID to comment.