The surface code is the leading candidate for fault-tolerant quantum computation owing to its planar nearest-neighbor connectivity, high threshold, and efficient decoding, but its low encoding rate demands on the order of a thousand physical qubits per logical qubit in the teraquop regime. Yoked surface codes improve the density by a factor of two or three by concatenating a high-density parity check code on top of the surface code while retaining planar nearest-neighbor connectivity. In this work, we generalize this idea to multiple levels of concatenation and introduce multi-yoked surface codes. Our construction rests on two new ingredients. First, we propose a family of outer codes called chain codes, built by chaining copies of a seed code that detects the block errors of the code one level below; the resulting codes use all logical qubits of the lower level and achieve a high encoding rate within a few concatenation levels. Second, we design a patch allocation in which movable workspaces perform the yoking checks by lattice surgery with a hierarchy of yoking intervals, so that lower-level checks are performed frequently while higher-level checks are performed less often, which avoids the long yoking intervals that a single large-distance outer code would require. As a benchmark, we construct a three-yoked surface code with a $[[256,166,8]]$ outer code and evaluate it numerically under the SI1000 noise model using soft information from the surface code decoder. The logical error rate is suppressed exponentially in the inner code distance, and in the teraquop regime the three-yoked surface code is about 4 to 4.5$\times$ denser than the unyoked surface code.
AI Summary
The paper asks whether multilevel concatenation can increase the density of yoked surface-code memories while retaining planar nearest-neighbor connectivity and avoiding long outer-check intervals. It introduces “chain codes”: copies of a seed check set are chained across lower-level blocks to detect correlated logical errors that would otherwise prevent distance multiplication. For a $[[n,k=n-2,2]]$ iceberg inner code, each Pauli-type seed requires at least $\lceil\log_2(k+1)\rceil$ checks; explicit constructions meet this bound for selected sizes.
A movable-workspace lattice-surgery layout measures lower-level checks frequently and higher-level checks less frequently. The benchmark concatenates iceberg and two chain-code levels, producing a $[[256,166,8]]$ outer code over surface-code patches. Check-weight optimization permits workspace width $4d_{\mathrm{inner}}$ while preserving the intended fault distance. Under SI1000 noise at physical error rate $10^{-3}$, simulations show exponential suppression with inner distance. Extrapolated fits predict approximately $4$–$4.5\times$ higher density than unyoked surface codes near $10^{-15}$ logical error per inner round, using $d_{\mathrm{inner}}=10$, and $1.3$–$1.5\times$ higher density than prior yoked designs.
The evaluation samples inner-code decoder confidence gaps and uses them in a separate Tesseract outer-code simulation rather than simulating the full circuit. It neglects outer-check measurement errors, hook errors, and spacetime-like error events. The three-level fitted suppression slope is below the ideal distance-based expectation. Density estimates describe cold storage and exclude load/store access infrastructure. Real-time decoding of the non-matchable outer codes, access latency and scheduling, higher concatenation levels, and systematic alternatives to heuristic code construction remain unresolved.
No sign of AI-generated textAI use disclosedStrong assumptions
the authors used Claude Fable 5.1 (Anthropic) to assist in language editing and developing heuristic optimization codes for the yoking weight reduction
Central claim may not hold: The claimed SI1000 density advantage is conditional on neglected outer-check measurement, hook, and spacetime-like errors being negligible, without a full noisy-memory simulation or a quantitative bound establishing this.
The three-yoked teraquop density estimate relies on extrapolating a fitted logical-error curve to inner distance d=10, whose performance is not directly simulated.
The reported density advantage applies to cold storage excluding load/store access resources, rather than to a fully accessible memory architecture.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
The surface code is the leading candidate for fault-tolerant quantum computation owing to its planar nearest-neighbor connectivity, high threshold, and efficient decoding, but its low encoding rate demands on the order of a thousand physical qubits per logical qubit in the teraquop regime. Yoked surface codes improve the density by a factor of two or three by concatenating a high-density parity check code on top of the surface code while retaining planar nearest-neighbor connectivity. In this work, we generalize this idea to multiple levels of concatenation and introduce multi-yoked surface codes. Our construction rests on two new ingredients. First, we propose a family of outer codes called chain codes, built by chaining copies of a seed code that detects the block errors of the code one level below; the resulting codes use all logical qubits of the lower level and achieve a high encoding rate within a few concatenation levels. Second, we design a patch allocation in which movable workspaces perform the yoking checks by lattice surgery with a hierarchy of yoking intervals, so that lower-level checks are performed frequently while higher-level checks are performed less often, which avoids the long yoking intervals that a single large-distance outer code would require. As a benchmark, we construct a three-yoked surface code with a [[256,166,8]] outer code and evaluate it numerically under the SI1000 noise model using soft information from the surface code decoder. The logical error rate is suppressed exponentially in the inner code distance, and in the teraquop regime the three-yoked surface code is about 4 to 4.5× denser than the unyoked surface code.
The paper asks whether multilevel concatenation can increase the density of yoked surface-code memories while retaining planar nearest-neighbor connectivity and avoiding long outer-check intervals. It introduces “chain codes”: copies of a seed check set are chained across lower-level blocks to detect correlated logical errors that would otherwise prevent distance multiplication. For a [[n,k=n−2,2]] iceberg inner code, each Pauli-type seed requires at least ⌈log2(k+1)⌉ checks; explicit constructions meet this bound for selected sizes.
A movable-workspace lattice-surgery layout measures lower-level checks frequently and higher-level checks less frequently. The benchmark concatenates iceberg and two chain-code levels, producing a [[256,166,8]] outer code over surface-code patches. Check-weight optimization permits workspace width 4dinner while preserving the intended fault distance. Under SI1000 noise at physical error rate 10−3, simulations show exponential suppression with inner distance. Extrapolated fits predict approximately 4–4.5× higher density than unyoked surface codes near 10−15 logical error per inner round, using dinner=10, and 1.3–1.5× higher density than prior yoked designs.
The evaluation samples inner-code decoder confidence gaps and uses them in a separate Tesseract outer-code simulation rather than simulating the full circuit. It neglects outer-check measurement errors, hook errors, and spacetime-like error events. The three-level fitted suppression slope is below the ideal distance-based expectation. Density estimates describe cold storage and exclude load/store access infrastructure. Real-time decoding of the non-matchable outer codes, access latency and scheduling, higher concatenation levels, and systematic alternatives to heuristic code construction remain unresolved.
Abstract 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 −3 . 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.
Fault-Tolerant Quantum Computers (FTQCs) commonly use the surface code to encode program qubits as error-corrected logical qubits. Unfortunately, the surface code has a poor encoding rate, so recent work has proposed Yoked Surface Codes (YSCs), which concatenate the surface code with a high-rate quantum code. The surface code qubits in YSCs are protected by the checks, or yokes, of the high-rate code. YSCs have 1D and 2D variants, which are 1.8× and 4.5× more efficient than the surface code, respectively.
Modern FTQC architectures use a two-level hierarchy: surface codes perform logical operations (compute) while 2D YSCs store idle program qubits (memory). To load a qubit from memory, the FTQC first performs retrieval, which logically moves a program qubit from a 2D YSC into a surface code (8 cycles). However, retrieval is not fault-tolerant, so the FTQC must verify the load by measuring all the yokes of the 2D YSC (178 cycles). As verification dominates memory access latency, eliminating it can provide a speedup of 5.7×.
Our goal is to reduce the verification overhead of 2D YSCs while retaining their storage efficiency. We exploit the fact that 1D YSCs, though less storage-efficient, incur negligible verification latency. We propose Trident, which expands the two-level hierarchy into a three-level hierarchy by adding a small intermediate level containing a 1D YSC (L1). If most loads hit L1 rather than L2 (2D YSC tier), it can significantly reduce verification overhead. We present two variants: Trident-D (demand-driven) and Trident-P (prefetch-driven), which achieve speedups of 2.8× and 4.2×, respectively, while increasing the physical qubit cost of memory by only 4.9%.
We present a fault-tolerant quantum-memory architecture that concatenates four distance-t rotated surface-code patches with the [[4,2,2]] outer code, encoding two logical qubits at code distance d = 2t in a physical footprint of N < 2(2t+1)^2 qubits on a square lattice with nearest-neighbor connectivity. The outer-code stabilizer generators XXXX and ZZZZ, each of physical weight 4t, are measured in situ via verified Greenberger-Horne-Zeilinger (GHZ) ancillae distributed through narrow corridors between adjacent patches, without lattice surgery or long-range gates. The outer-code gadgets introduce hyperedge fault mechanisms, but by design each decomposes into graphlike components, so the complete syndrome is decoded by a single minimum-weight-perfect-matching pass. Circuit-level simulations show logical error rates that scale as p^t, consistent with distance-2t protection. Finally, we implement the construction experimentally on a 105-qubit Willow superconducting processor in both the ZZ and XX memory bases. With the correlated-matching decoder, increasing the code distance from d = 4 to d = 6 reduces the block logical error rate by a factor of 1.52. The construction thus provides a near-term testbed for concatenated architectures beyond the standard surface code.
We present a quantum code implementable on a regular 2D hex grid with an estimated encoding rate up to 4.5× of that of a rotated surface code patch using circuit-level noise in a one- and two-qubit 10−3 error uniform depolarizing model. Our approach is based on yoking a dense packing of surface code twist defects, enabled by new stabilizer measurement cycles with an optimal four layers of nearest-neighbor two-qubit gates, almost no distance-reducing hook errors, and efficient decoding. We demonstrate a space-efficient architecture for computing on densely packed logical qubits, including new padding-free lattice surgery protocols in an optimal bounding box of 2d2 data and measurement qubits per patch. Assuming a 1μs surface code cycle time and a 10μs reaction time, these developments enable chemically accurate ground state phase estimation of a broad class of `utility-scale' electronic structure simulation problems such as the 108 spin-orbital FeMoco-based nitrogen fixation catalyst in under a month with 89k noisy superconducting qubits. We elucidate a Pareto frontier of space-time trade-offs and find a minimum physical quantum volume of 1.3 mega-qubit-hours. These correspond to a 36× space and 6.6× spacetime improvement, respectively, over our previous state-of-the-art minimum-Toffoli resource estimates (Phys. Rev. X 15, 041016).
Abstract We propose and analyze a hierarchical quantum error correction (QEC) scheme that concatenates hypergraph product (HGP) codes with rotated surface codes and that is compatible with quantum computers with only nearest-neighbor interactions. The outer code employs (3,4)-random HGP codes, known for their constant encoding rate and favorable distance scaling, while the inner code consists of a rotated surface code with distance 5, allowing hardware compatibility through lattice surgery. To address the decoding bottleneck, we utilize a soft-decision decoding strategy that combines belief propagation with ordered statistics decoding, enhanced by a syndrome-conditioned logical error probability computed via a tailored lookup table for the inner code. Numerical simulations under a code capacity noise model demonstrate that our hierarchical codes achieve logical error suppression below the threshold. Furthermore, we derive explicit conditions under which the proposed codes surpass surface codes as a QEC code in both qubit efficiency and error rate. In particular, for the size parameter s≥4 (which corresponds to 16 logical qubits) and the distance d≥25, our construction outperforms the rotated surface code in practical regimes with physical error rates around or less than 10−2. These results suggest that concatenated quantum low-density parity-check surface architectures can offer a scalable and resource-efficient path toward near-term fault-tolerant quantum computation.
Low-overhead quantum error-correction schemes are essential for enabling quantum computation on registers containing multiple logical qubits. For planar architectures with limited nearest-neighbor qubit connectivity, the surface code has emerged as the leading paradigm. Recent theoretical and experimental work has shown that a physical-qubit connectivity of degree three is sufficient to implement fault-tolerant quantum error correction. In this work, we study lattice surgery in the context of such trivalent architectures and introduce scalable circuit constructions to implement it. Compared with the four-valent measurement scheme, the trivalent lattice-surgery protocol reduces the required resources by O(d) qubits out of a total qubit count of O(d2) and by O(d) two-qubit gates out of a total two-qubit gate count of O(d3). We benchmark the logical fidelity of both lattice-surgery schemes in terms of experimentally realistic simulations targeting an implementation with a fluxonium qubit based architecture and find a potential improvement of up to ≈25% for distance-three. These results open a way for scalable planar trivalent qubit architectures to host a surface-code-based logical quantum processor.