A New Way to Build Quantum Memory with Fewer Parts

In the paper's words

The planar surface code protects quantum information robustly but pays for its two-dimensional layout with an encoding rate that vanishes as the distance grows, so fault-tolerant memories require hundreds to thousands of physical qubits per logical qubit. A recent proposal constructs modular hyperbolic surface and color codes by partitioning a quantum processor into flat Euclidean modules and wiring sparse, static boundary connections between them, yielding semi-hyperbolic codes with constant encoding rate [1,4]. In this paper we provide an independent, fully explicit quantitative analysis of that proposal.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Storing 12 logical qubits at $d = 22$ requires $n_{\mathrm{rot}}(22) = 925$ data qubits per logical, $11100$ total ($\approx 22200$ including syndrome qubits).

   from 5. Results

2. At $k/n = 1/16$ and $d \geq 22$, 12 logical qubits require $n_{\mathrm{mod}} = 192$ physical qubits, i.e., 16 per logical.

   from 5. Results

3. Taking the reported parameters — encoding rate $k/n = 1/16$ and distance $d \geq 22$ — as inputs, we compute that a twelve-logical-qubit modular memory requires $n_{\mathrm{mod}} = 192$ physical qubits, versus $11100$ data qubits for twelve distance-$22$ rotated surface-code patches, a raw overhead reduction of $57.8\times$; the reduction remains $\geq 30\times$ even if the true modular implementation uses up to $370$ physical qubits.

   from Abstract

4. We further develop a seam-noise mixture model and compute the seam-error budget under which the modular advantage survives: with a seam fraction $f = 0.1443$, seam links may carry up to $\gamma \approx 2.5\times$ the intra-module error rate before a tenfold advantage at matched distance is exhausted.

   from Abstract

5. We compare against the $[[288,12,18]]$ bivariate bicycle code ($1.5\times$ fewer qubits for the modular code, at strictly larger distance) and situate the proposal within the low-overhead QEC landscape.

   from Abstract

6. The work under analysis here [1,4] attacks the overhead wall geometrically.

   from 1. Introduction

How it is done

1. Taking the reported parameters — encoding rate $k/n = 1/16$ and distance $d \geq 22$ — as inputs, we compute that a twelve-logical-qubit modular memory requires $n_{\mathrm{mod}} = 192$ physical qubits, versus $11100$ data qubits for twelve distance-$22$ rotated surface-code patches, a raw overhead reduction of $57.8\times$; the reduction remains $\geq 30\times$ even if the true modular implementation uses up to $370$ physical qubits.

   from Abstract

2. Facing the Eastin–Knill no-go theorem, this work proposes measurement-free switching between a stabilizer code supporting transversal gates and codes for universality, avoiding resource-intensive magic state distillation.

   from 2. Background and Related Work

3. Our method is analytic reconstruction.

   from 3. Methods

4. Every input number below is stated with its source; all arithmetic is shown step by step.

   from 4. Analysis

What would falsify it

1. Our central quantitative claim — a $30\times$–$58\times$ overhead reduction at competitive logical error rates — is falsified if circuit-level simulation of the actual modular codes shows logical error rates worse than the surface code by more than the qubit-saving factor at matched $k = 12$, or if the achieved distance at rate $1/16$ falls below $22$ in practice.

   from 6. Discussion

2. It is also falsified empirically if platforms such as silicon colour centres [7] cannot demonstrate seam links with $\gamma \lesssim 2.5$–$4$ at the assumed seam fractions.

   from 6. Discussion

Where the claim stops

1. Our seam model (Model C) assumes independent stochastic errors and power-law subthreshold scaling with a single threshold; real seam faults may be correlated (a single fabrication defect or crosstalk source can hit multiple seam qubits), and correlated failures can defeat distance-$d$ protection entirely if they form a weight-$\leq d$ logical operator along a seam.

   from 6. Discussion

2. The prefactor $A$ and threshold $p_{\mathrm{th}}$ are surface-code-class assumptions; semi-hyperbolic codes may have different constants that we cannot compute without the simulation data of [1,4].

   from 6. Discussion

3. It is also falsified empirically if platforms such as silicon colour centres [7] cannot demonstrate seam links with $\gamma \lesssim 2.5$–$4$ at the assumed seam fractions.

   from 6. Discussion

Where to read

1. Abstract239 words · 1 min
2. 1. Introduction364 words · 2 min
3. 2. Background and Related Work766 words · 3 min
4. 3. Methods314 words · 1 min
5. 4. Analysis975 words · 4 min
6. 5. Results277 words · 1 min
7. 6. Discussion603 words · 3 min
8. 7. Conclusion188 words · 1 min