Yoked surface codes
One of the biggest obstacles to building a large scale quantum computer is the high qubit cost of protecting quantum information. For two-dimensional architectures, the surface code has long been the leading candidate quantum memory, but can require upwards of a thousand physical qubits per logical qubit to reach algorithmically-relevant logical error rates. In this work, we introduce a hierarchical memory formed from surface codes concatenated into high-density parity check codes. These yoked surface codes are arrayed in a rectangular grid, with parity checks (yokes) measured along each row, and optionally along each column, using lattice surgery. Our construction assumes no additional connectivity beyond a nearest-neighbor square qubit grid operating at a physical error rate of 10<sup>-3</sup>. At algorithmically-relevant logical error rates, yoked surface codes use as few as one-third the number of physical qubits per logical qubit as standard surface codes, enabling moderate-overhead fault-tolerant quantum memories in two dimensions.
Authors
- Peter Brooks
- Michael Newman (ORCID: https://orcid.org/0000-0002-6640-1072)
- Craig Gidney
- Cody Jones
Institutions
- Google (United States) (US)
Publication Details
- Journal
- Nature Communications
- Published
- 2025-05-14
- DOI
- https://doi.org/10.1038/s41467-025-59714-1
- Citations
- 17
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 42.18