pith. sign in

arxiv: 2511.10729 · v2 · submitted 2025-11-13 · 🪐 quant-ph

Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation

Shinichi Sunami , Yutaka Hirano , Toshihide Hinokuma , Hayata Yamasaki This is my paper

Pith reviewed 2026-05-17 22:02 UTC · model grok-4.3

classification 🪐 quant-ph
keywords logical Bell pairsdistributed quantum computingsurface codeentanglement distillationfault-tolerant quantum computationpostselectionsoft-information decodinglink-limited volume
0
0 comments X

The pith

Entanglement boosting prepares logical Bell pairs with orders-of-magnitude lower link-limited volume.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes an entanglement boosting protocol for preparing high-fidelity logical Bell pairs that connect separate quantum processors. It defines link-limited volume as a cost metric counting both the physical Bell pairs consumed and the spacetime volume of local operations. Using soft-information decoders and postselection on rotated surface codes, the protocol reaches logical error rates around 10 to the minus 10 from 86 physical pairs at 1 percent error. All local operations fit inside one surface-code patch with only 2D connectivity. A pipelined version using high-rate codes allows scaling to even lower errors while remaining physically efficient.

Core claim

We introduce a metric for characterizing the practical cost of preparing high-fidelity logical Bell pairs, link-limited volume (LLV), which is a circuit-volume metric incorporating both the cost of physical Bell pairs and the spacetime volume of local operations. Guided by this metric, we propose entanglement boosting protocol, which achieves efficient preparation of logical Bell pairs encoded in rotated surface code with LLV reduced by orders of magnitude compared to prior state-of-the-art methods. In this protocol, we employ soft-information decoders and postselection to suppress the logical error rates of Bell pairs to practical levels in the order of 10^{-10} from 86 noisy physical Bell

What carries the argument

Entanglement boosting protocol that applies soft-information decoders and postselection inside a single rotated surface code patch to prepare logical Bell pairs at low link-limited volume.

Load-bearing premise

Soft-information decoders combined with postselection can reliably reach logical error rates of order 10^{-10} from 86 physical pairs at 1 percent error while confining all operations to one surface code patch with only 2D connectivity.

What would settle it

A detailed simulation or small-scale experiment that measures the achieved logical error rate when applying the boosting steps to 86 physical Bell pairs each having 1 percent error rate and checks whether the operations remain confined to one surface code patch without extra overhead.

Figures

Figures reproduced from arXiv: 2511.10729 by Hayata Yamasaki, Shinichi Sunami, Toshihide Hinokuma, Yutaka Hirano.

Figure 1
Figure 1. Figure 1: FIG. 1. Two entanglement distillation protocols based on [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. The link-limited volume (LLV). LLV consists of network [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Entanglement boosting. Entanglement boosting begins with the preparation of [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Numerical simulation results for the entanglement boosting protocol. a) Numerical simulation results of the logical error rates of the [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Scaling of the logical error rate of the Bell pairs produced with the entanglement boosting protocol. a-b) logical error rate as a function [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. The link-limited volume (LLV) to prepare a logical Bell pair [PITH_FULL_IMAGE:figures/full_fig_p008_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. Pipelined entanglement distillation based on CSS codes. (a,b) standard form of [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Reconfigurable-qubit implementation of pipelined entanglement distillation with [PITH_FULL_IMAGE:figures/full_fig_p010_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: FIG. 9. Comparison between the entanglement boosting and the combined boosting + pipelined distillation scheme, with an example of [PITH_FULL_IMAGE:figures/full_fig_p011_9.png] view at source ↗
read the original abstract

Distributed architecture is a promising route to scaling fault-tolerant quantum computing (FTQC) beyond the inherent limitations of single processors. For practical implementation of distributed FTQC, logical Bell pair preparation must be designed not only for efficient Bell pair consumption but also for the spacetime volume of the protocol; however, entanglement distillation protocols have primarily focused on minimizing the consumption of Bell pairs, often resulting in protocols that require a substantial number of local operations. To resolve this issue, we introduce a metric for characterizing the practical cost of preparing high-fidelity logical Bell pairs, link-limited volume (LLV), which is a circuit-volume metric incorporating both the cost of physical Bell pairs and the spacetime volume of local operations. Guided by this metric, we propose entanglement boosting protocol, which achieves efficient preparation of logical Bell pairs encoded in rotated surface code with LLV reduced by orders of magnitude compared to prior state-of-the-art methods. In this protocol, paralleling recent advances in magic state cultivation, we employ soft-information decoders and postselection to suppress the logical error rates of Bell pairs to practical levels in the order of $10^{-10}$ from 86 noisy physical Bell pairs at 1% error, while all local operations are implementable within a spatial region of a single surface code patch with 2D local connectivity. We also present a pipelined implementation of entanglement distillation using high-rate quantum error-correcting codes, enabling arbitrarily low logical error rates while also maintaining physically efficient implementations. These results pave the way for the practical implementation of distributed FTQC, reinforcing the benefits of fast interconnect technologies and serving as a guiding principle for the efficient design of protocols and devices.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces the link-limited volume (LLV) metric to quantify the combined cost of physical Bell-pair consumption and local-operation spacetime volume for logical Bell-pair preparation in distributed FTQC. It proposes an entanglement-boosting protocol that employs soft-information decoding and postselection on rotated surface-code patches to prepare logical Bell pairs with logical error rate O(10^{-10}) from 86 physical pairs at 1% physical error, all operations confined to a single patch with 2D nearest-neighbor connectivity, claiming orders-of-magnitude LLV improvement over prior distillation methods. A pipelined implementation using high-rate QECCs is also described for arbitrarily low error rates.

Significance. If the numerical performance claims are substantiated with explicit simulation data, the work would be significant for practical distributed FTQC: the LLV metric offers a concrete optimization criterion that balances entanglement and local resources, and the protocol demonstrates how recent soft-decoder and postselection techniques (analogous to magic-state cultivation) can be adapted to entanglement distribution while respecting strict locality. This could directly inform interconnect and device design.

major comments (2)
  1. The central performance claim (logical error ~10^{-10} from exactly 86 physical pairs at p=1%, single-patch 2D connectivity, no LLV inflation) is load-bearing for the asserted orders-of-magnitude LLV reduction. The manuscript must supply the concrete simulation methodology, acceptance probabilities after postselection, finite-size scaling, and error-bar analysis that simultaneously satisfy the locality constraint; without these data the LLV advantage cannot be verified.
  2. Protocol section: the integration of soft-information decoder outputs with postselection must be shown to preserve strict 2D nearest-neighbor connectivity inside one rotated surface-code patch; any auxiliary routing or additional patches required by the decoder would increase the effective LLV and undermine the comparison to prior methods.
minor comments (2)
  1. Abstract and introduction: the baseline LLV values and exact prior protocols used for the 'orders of magnitude' comparison should be stated explicitly rather than left as a qualitative claim.
  2. Notation: the definition of LLV should be given as an explicit formula (including how physical Bell-pair cost and local spacetime volume are combined) at first use, with units and scaling clarified.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback. We address the major comments point by point below, providing clarifications on the simulation details and protocol locality while outlining revisions to strengthen the manuscript.

read point-by-point responses

  1. Referee: The central performance claim (logical error ~10^{-10} from exactly 86 physical pairs at p=1%, single-patch 2D connectivity, no LLV inflation) is load-bearing for the asserted orders-of-magnitude LLV reduction. The manuscript must supply the concrete simulation methodology, acceptance probabilities after postselection, finite-size scaling, and error-bar analysis that simultaneously satisfy the locality constraint; without these data the LLV advantage cannot be verified.

    Authors: We agree that explicit details on the simulation methodology are necessary to fully substantiate the performance claims and enable verification of the LLV reduction. The manuscript reports Monte Carlo simulation results achieving the stated logical error rate with 86 physical pairs at 1% error under the single-patch constraint. In the revised manuscript we will add a dedicated subsection in the Methods or Results section that details: (i) the soft decoder implementation (belief propagation with soft syndrome information), (ii) postselection criteria and the associated acceptance probabilities, (iii) finite-size scaling across code distances, and (iv) statistical error bars derived from the simulation ensemble. All simulations are performed strictly within the rotated surface-code patch using only 2D nearest-neighbor connectivity, with no auxiliary resources that would inflate LLV. These additions will allow independent verification of the reported advantage. revision: yes

  2. Referee: Protocol section: the integration of soft-information decoder outputs with postselection must be shown to preserve strict 2D nearest-neighbor connectivity inside one rotated surface-code patch; any auxiliary routing or additional patches required by the decoder would increase the effective LLV and undermine the comparison to prior methods.

    Authors: The entanglement-boosting protocol is constructed so that every operation, including syndrome extraction, soft decoding, and postselection, occurs entirely inside a single rotated surface-code patch with 2D nearest-neighbor connectivity. The soft decoder processes only locally available syndrome data, and postselection decisions are made from the decoder output without requiring inter-patch communication or auxiliary routing. In the revised manuscript we will expand the protocol section with an explicit step-by-step description of the data flow and add a schematic figure that illustrates the locality constraint. This will confirm that no additional patches or routing are introduced and that the LLV comparison remains valid. revision: yes

Circularity Check

0 steps flagged

No significant circularity; claims rest on numerical protocol evaluation under standard assumptions

full rationale

The paper defines a new cost metric LLV and describes an entanglement boosting protocol that applies soft-information decoding plus postselection to rotated surface-code Bell pairs. Performance figures such as 10^{-10} logical error from 86 physical pairs at 1% error are presented as outcomes of the protocol rather than quantities defined in terms of themselves. No equations, self-citations, or ansatzes are shown that reduce the central LLV reduction or error-suppression claims to fitted inputs or prior author results by construction. The derivation chain therefore remains self-contained against external surface-code benchmarks and does not exhibit any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

Central claim rests on standard surface-code error-correction assumptions and decoder behavior at 1% physical error; the new LLV metric is introduced without independent external validation in the abstract. No free parameters are explicitly fitted in the provided text.

axioms (1)
  • domain assumption Rotated surface code supports soft-information decoding that can suppress logical errors to 10^{-10} from 86 physical Bell pairs at 1% physical error rate when combined with postselection
    Invoked to justify the claimed error rates and single-patch implementation.
invented entities (1)
  • Link-limited volume (LLV) metric no independent evidence
    purpose: Characterize practical cost of logical Bell pair preparation by combining physical Bell pair cost with spacetime volume of local operations
    Newly defined in the paper as the guiding figure of merit.

pith-pipeline@v0.9.0 · 5614 in / 1501 out tokens · 39890 ms · 2026-05-17T22:02:41.538772+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    we employ soft-information decoders and postselection to suppress the logical error rates of Bell pairs to practical levels in the order of 10^{-10} from 86 noisy physical Bell pairs at 1% error, while all local operations are implementable within a spatial region of a single surface code patch with 2D local connectivity

  • IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    introduce a metric ... link-limited volume (LLV), which is a circuit-volume metric incorporating both the cost of physical Bell pairs and the spacetime volume of local operations

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Operational criteria for quantum advantage in latency-constrained nonlocal games

    quant-ph 2026-04 unverdicted novelty 5.0

    A framework with operational criteria and a trapped-atom hardware proposal for achieving statistically significant quantum advantage in latency-constrained nonlocal games.

Reference graph

Works this paper leans on

78 extracted references · 78 canonical work pages · cited by 1 Pith paper · 6 internal anchors

  1. [1]

    The𝑛-qubitPauligroupP 𝑛 consistsoftensor 3 products of single-qubit Pauli operators up to a global phase 𝛼∈ {±1,±i}

    On this space, the Pauli operators are defined as𝑋:=|0⟩⟨1| + |1⟩⟨0|, 𝑌:=i |1⟩⟨0| −i |0⟩⟨1|,𝑍:= |0⟩⟨0| − |1⟩⟨1|,𝐼:= |0⟩⟨0| + |1⟩⟨1|, wherei= √ −1. The𝑛-qubitPauligroupP 𝑛 consistsoftensor 3 products of single-qubit Pauli operators up to a global phase 𝛼∈ {±1,±i}. AstabilizerSis an Abelian subgroup ofP 𝑛 that does not include−𝐼 ⊗𝑛. The correspondingstabiliz...

    work page

  2. [2]

    ##$ 𝑑$ Area II Node A Node B … Bell pairs Φ%%&''( |0⟩ |+⟩ 𝑑!

    perform SE3. soft-output decoding of communicated checks 𝑑!"##$ 𝑑$ Area II Node A Node B … Bell pairs Φ%%&''( |0⟩ |+⟩ 𝑑!"## 𝑑$ Area II Area I Area I Bell pairs𝑑!"##$

    work page

  3. [3]

    arrange qubits and Bell pairs

    work page

  4. [4]

    discard or correct logical Bell pairMWPM + complementary gap classical communication FIG. 3. Entanglement boosting. Entanglement boosting begins with the preparation of𝑑2 Bell physical Bell pairs, which are to be arranged in a squaregrid,togetherwithqubitsin |0⟩ and |+⟩ aroundthemtoforma𝑑 𝑠 ×𝑑 𝑠 squaregrid. Thisisfollowedby𝑑 𝑠 cyclesofsyndromeextraction (...

    work page

  5. [5]

    valid” if it is not discarded and the outcomes of the𝑋 𝑋 and 𝑍 𝑍measurements match the expected values. A sample is “wrong

    Circuit-level simulation of entanglement boosting We perform a Monte Carlo sampling simulation to evalu- ate the performance of the entanglement boosting protocol in Sec. IV using Stim [64] and PyMatching [65]. We adopt the following noise model for the simulation: for the input Bell pairs, we first prepare ideal Bell pairs and subject one of the arms of ...

    work page

  6. [6]

    ## SE…SE SE…SE The error syndrome of the first round is sent to B and used as the baseline.SESELogical XX and ZZ measurements A B time 𝑑$ times 𝑑$ timesInit 0,+𝑝!

    Complementary gap The complementary gap is a value that represents the de- coder’s confidence in its decoding results. As a simple exam- ple,weconsiderthedistance-5rotatedsurfacecode(Fig.A2). For simplicity, in this subsection, we focus on𝑋stabilizer checks that detect𝑍errors. We additionally assume that syn- drome extraction is noise-free. Init 0,+ Φ⊗ #!...

    work page

  7. [7]

    Effect of idling errors Wehaveneglectedtheeffectofidlingerrorsthroughoutthis work, which is justifiable for reconfigurable qubits such as neutralatomsandtrappedionswithcoherencetimesoforders of magnitude longer than typical gate times (for example, for neutralatoms,thecoherencetimesareontheorderofseconds while the Rydberg gate times are on the order of 10...

    work page

  8. [8]

    Additional circuit-level simulation data and the scaling of logical error rate Here, we show additional data from the circuit-level simu- lation of the entanglement boosting protocol. In Fig. A5, we showthelogicalerrorratesforvarying𝑑 Bell,𝑝 Bell,anddiscard rates0,10,35,50,and70%. Withsmall𝑑 Belland𝑝 Bell,weob- servenogapvaluesthatcanbeusedtodiscardlargef...

    work page

  9. [9]

    Remote lattice surgery protocol for rotated surface code We perform numerical simulations of the remote lattice surgery by adopting the protocol of Ref. [25] for a rotated surfacecode,followingthesyndromeextractionschedulepro- posedinRefs.[26]andusingthesameerrormodelasthatused for the simulation of entanglement boosting, summarized in TableA2. Thisallows...

    work page

  10. [10]

    Remote lattice surgery For the lattice-surgery-based protocol described in Ap- pendixA5,2𝑑 𝑠 −1BellpairsareconsumedineachSEcycle, 16 = !! Node A Node B Node ANode Ba) b) c)|ω1→ |!→ |ω2→ X Z Z X FIG. A6. Remote lattice surgery with rotated surface code. a) The zig-zag interface for remote lattice surgery of a merged patch [26], where the blue line represen...

    work page

  11. [11]

    IV, the boosting stage proceeds by first preparing𝑑 2 Bell physical Bell pairs and𝑑2 𝑠 −𝑑 2 Bell qubits, followedby𝑑 𝑠 cyclesofSEs

    Entanglement boosting As discussed in Sec. IV, the boosting stage proceeds by first preparing𝑑 2 Bell physical Bell pairs and𝑑2 𝑠 −𝑑 2 Bell qubits, followedby𝑑 𝑠 cyclesofSEs. Toinitiatethisprotocol,wefirst wait for𝑑2 Bell/𝑅cycles, during which𝑑 2 Bell physical Bell pairs are accumulated (Fig. 2). The single-trial LLV is hence V0 = 𝑑4 Bell 𝑅 +𝑑 𝑠 × (2𝑑 2 𝑠...

    work page

  12. [12]

    (6) for the pipelined entan- glement distillation with qubit reconfigurations is derived as follows

    Pipelined entanglement distillation The general expression in Eq. (6) for the pipelined entan- glement distillation with qubit reconfigurations is derived as follows. First,V 𝑘 corresponds to the𝑘output patches that remain stationary throughout the circuit in Fig. 7e–f. Each of these patches interacts with up to(𝑛−𝑘)incoming qubits throughtransversalCNOTl...

    work page

  13. [13]

    Forthisevaluation, we assume the use of𝑑𝑠 =19rotated surface code, which is the same as the boosting and boosting+distillation proto- cols evaluated in Fig

    Concatenated entanglement distillation InFig.9a,weshowtheLLVforconcatenatedentanglement distillationinRef.[30]toachievetheoutputlogicalerrorrates of10 −12, with buffer space (the space allocated for logical 17 entanglement distillation) of 10 rotated surface code patches, which is the same space required for the boosting+distillation withthe[[10,8,2]]code...

    work page

  14. [14]

    Panayi, M

    C. Panayi, M. Razavi, X. Ma, and N. Lütkenhaus, Memory- assisted measurement-device-independent quantum key distri- bution, New Journal of Physics16, 043005 (2014)

    work page 2014

  15. [15]

    Azuma, S

    K. Azuma, S. E. Economou, D. Elkouss, P. Hilaire, L. Jiang, H.-K. Lo, and I. Tzitrin, Quantum repeaters: From quantum networks to the quantum internet, Rev. Mod. Phys.95, 045006 (2023)

    work page 2023

  16. [16]

    J. F. Fitzsimons, Private quantum computation: an introduction toblindquantumcomputingandrelatedprotocols,npjQuantum Information3, 23 (2017)

    work page 2017

  17. [17]

    D.Gottesman,T.Jennewein,andS.Croke,Longer-baselinetele- scopes using quantum repeaters, Phys. Rev. Lett.109, 070503 (2012)

    work page 2012

  18. [18]

    Monroe, R

    C. Monroe, R. Raussendorf, A. Ruthven, K. R. Brown, P. Maunz, L.-M. Duan, and J. Kim, Large-scale modular quantum-computer architecture with atomic memory and pho- tonic interconnects, Phys. Rev. A89, 022317 (2014)

    work page 2014

  19. [19]

    Sunami, S

    S. Sunami, S. Tamiya, R. Inoue, H. Yamasaki, and A. Goban, Scalable networking of neutral-atom qubits: Nanofiber-based approach for multiprocessor fault-tolerant quantum computers, PRX Quantum6, 010101 (2025)

    work page 2025

  20. [20]

    C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin,andW.K.Wootters,Purificationofnoisyentanglement and faithful teleportation via noisy channels, Phys. Rev. Lett. 76, 722 (1996)

    work page 1996

  21. [21]

    Horodecki, P

    R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Quantum entanglement, Rev. Mod. Phys.81, 865 (2009)

    work page 2009

  22. [22]

    Deutsch, A

    D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, andA.Sanpera,Quantumprivacyamplificationandthesecurity of quantum cryptography over noisy channels, Phys. Rev. Lett. 77, 2818 (1996)

    work page 1996

  23. [23]

    C.H.Bennett,D.P.DiVincenzo,J.A.Smolin,andW.K.Woot- ters, Mixed-state entanglement and quantum error correction, Phys. Rev. A54, 3824 (1996)

    work page 1996

  24. [24]

    Dür and H

    W. Dür and H. J. Briegel, Entanglement purification and quan- tum error correction, Reports on Progress in Physics70, 1381 (2007)

    work page 2007

  25. [25]

    L.J.Stephenson,D.P.Nadlinger,B.C.Nichol,S.An,P.Drmota, T.G.Ballance,K.Thirumalai,J.F.Goodwin,D.M.Lucas,and C. J. Ballance, High-rate, high-fidelity entanglement of qubits across an elementary quantum network, Phys. Rev. Lett.124, 110501 (2020)

    work page 2020

  26. [26]

    D.Main,P.Drmota,D.P.Nadlinger,E.M.Ainley,A.Agrawal, B. C. Nichol, R. Srinivas, G. Araneda, and D. M. Lucas, Dis- tributed quantum computing across an optical network link, Nature638, 383 (2025)

    work page 2025

  27. [27]

    Li and J

    Y. Li and J. D. Thompson, High-rate and high-fidelity modular interconnects between neutral atom quantum processors, PRX Quantum5, 020363 (2024)

    work page 2024

  28. [28]

    Sinclair, J

    J. Sinclair, J. Ramette, B. Grinkemeyer, D. Bluvstein, M. D. Lukin, and V. Vuletić, Fault-tolerant optical interconnects for neutral-atom arrays, Phys. Rev. Res.7, 013313 (2025)

    work page 2025

  29. [29]

    Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum3, 128 (2019)

    D. Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum3, 128 (2019)

    work page 2019

  30. [30]

    A.G.Fowler,M.Mariantoni,J.M.Martinis,andA.N.Cleland, Surface codes: Towards practical large-scale quantum compu- tation, Phys. Rev. A86, 032324 (2012)

    work page 2012

  31. [31]

    C.GidneyandM.Ekerå,Howtofactor2048bitRSAintegersin 8 hours using 20 million noisy qubits, Quantum5, 433 (2021)

    work page 2021

  32. [32]

    Litinski, Magic State Distillation: Not as Costly as You Think, Quantum3, 205 (2019)

    D. Litinski, Magic State Distillation: Not as Costly as You Think, Quantum3, 205 (2019)

    work page 2019

  33. [33]

    Itogawa, Y

    T. Itogawa, Y. Takada, Y. Hirano, and K. Fujii, Efficient magic state distillation by zero-level distillation, PRX Quantum6, 020356 (2025)

    work page 2025

  34. [34]

    Magic state cultivation: growing T states as cheap as CNOT gates

    C. Gidney, N. Shutty, and C. Jones, Magic state cultivation: growingtstatesascheapascnotgates(2024),arXiv:2409.17595 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  35. [35]

    01 (2024) pp

    Y.Hirano,T.Itogawa,andK.Fujii,Leveragingzero-leveldistil- lationtogeneratehigh-fidelitymagicstates,in2024IEEEInter- national Conference on Quantum Computing and Engineering (QCE), Vol. 01 (2024) pp. 843–853

    work page 2024

  36. [36]

    Z.-H.Chen,M.-C.Chen,C.-Y.Lu,andJ.-W.Pan,Efficientmagic state cultivation onRP2 (2025), arXiv:2503.18657 [quant-ph]

    work page arXiv 2025

  37. [37]

    How to factor 2048 bit RSA integers with less than a million noisy qubits

    C. Gidney, How to factor 2048 bit rsa integers with less than a million noisy qubits (2025), arXiv:2505.15917 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2048

  38. [38]

    J.Ramette,J.Sinclair,N.P.Breuckmann,andV.Vuletíc,Fault- tolerant connection of error-corrected qubits with noisy links, npj Quantum Information10, 58 (2024)

    work page 2024

  39. [39]

    M.A.Shalby,R.Wang,D.Sedov,andL.P.Pryadko,Optimized noise-resilient surface code teleportation interfaces, Phys. Rev. A112, L020403 (2025)

    work page 2025

  40. [40]

    Glancy, E

    S. Glancy, E. Knill, and H. M. Vasconcelos, Entanglement pu- rificationofanystabilizerstate,Phys.Rev.A74,032319(2006)

    work page 2006

  41. [41]

    Y.Maeda,Y.Suzuki,T.Kobayashi,T.Yamamoto,Y.Tokunaga, and K.Fujii, Logicalentanglement distributionbetween distant 18 2d array qubits (2025), arXiv:2503.14894 [quant-ph]

    work page arXiv 2025

  42. [42]

    J. P. Bonilla Ataides, H. Zhou, Q. Xu, G. Baranes, B. Li, M. D. Lukin, and L. Jiang, Constant-overhead fault-tolerant bell-pair distillation using high-rate codes, Phys. Rev. Lett.135, 130804 (2025)

    work page 2025

  43. [43]

    Pattison, G

    C. Pattison, G. Baranes, J. P. Bonilla Ataides, M. D. Lukin, and H. Zhou, Constant-rate entanglement distillation for fast quantum interconnects, inProceedings of the 52nd Annual In- ternational Symposium on Computer Architecture, ISCA ’25 (Association for Computing Machinery, New York, NY, USA,

    work page

  44. [44]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado, Optimal resources for topological two-dimensional stabilizer codes: Comparative study, Phys. Rev. A76, 012305 (2007)

    work page 2007

  45. [45]

    Zapatero, T

    V. Zapatero, T. van Leent, R. Arnon-Friedman, W.-Z. Liu, Q. Zhang, H. Weinfurter, and M. Curty, Advances in device- independentquantumkeydistribution,npjquantuminformation 9, 10 (2023)

    work page 2023

  46. [46]

    Meier and H

    F. Meier and H. Yamasaki, Energy-consumption advantage of quantum computation, PRX Energy4, 023008 (2025)

    work page 2025

  47. [47]

    A. R. Calderbank and P. W. Shor, Good quantum error- correcting codes exist, Phys. Rev. A54, 1098 (1996)

    work page 1996

  48. [48]

    Series A: Mathematical, Physical and Engineering Sciences452, 2551 (1996)

    A.Steane,Multiple-particleinterferenceandquantumerrorcor- rection, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences452, 2551 (1996)

    work page 1996

  49. [49]

    R.Matsumoto,Conversionofageneralquantumstabilizercode to an entanglement distillation protocol, Journal of Physics A: Mathematical and General36, 8113 (2003)

    work page 2003

  50. [50]

    E.Hostens,J.Dehaene,andB.D.Moor,Theequivalenceoftwo approaches to the design of entanglement distillation protocols (2004), arXiv:quant-ph/0406017 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  51. [51]

    Bluvstein, H

    D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M.Kalinowski,A.Keesling,N.Maskara,H.Pichler,M.Greiner, V. Vuletić, and M. D. Lukin, A quantum processor based on coherent transport of entangled atom arrays, Nature604, 451 (2022)

    work page 2022

  52. [52]

    Duan and C

    L.-M. Duan and C. Monroe, Colloquium: Quantum networks with trapped ions, Rev. Mod. Phys.82, 1209 (2010)

    work page 2010

  53. [53]

    Horsman, A

    D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New Journal of Physics14, 123011 (2012)

    work page 2012

  54. [54]

    Sahay, Y

    K. Sahay, Y. Lin, S. Huang, K. R. Brown, and S. Puri, Error correction of transversal cnot gates for scalable surface-code computation, PRX Quantum6, 020326 (2025)

    work page 2025

  55. [55]

    C.Gidney,M.Newman,P.Brooks,andC.Jones,Yokedsurface codes, Nature Communications16, 4498 (2025)

    work page 2025

  56. [56]

    O’Reilly, G

    J. O’Reilly, G. Toh, I. Goetting, S. Saha, M. Shalaev, A. L. Carter,A.Risinger,A.Kalakuntla,T.Li,A.Verma,andC.Mon- roe,Fastphoton-mediatedentanglementofcontinuouslycooled trapped ions for quantum networking, Phys. Rev. Lett.133, 090802 (2024)

    work page 2024

  57. [57]

    Lekitsch, S

    B. Lekitsch, S. Weidt, A. G. Fowler, K. Mølmer, S. J. Devitt, C.Wunderlich,andW.K.Hensinger,Blueprintforamicrowave trapped ion quantum computer, Science Advances3, e1601540 (2017)

    work page 2017

  58. [58]

    M. E. Beverland, P. Murali, M. Troyer, K. M. Svore, T. Hoe- fler, V. Kliuchnikov, G. H. Low, M. Soeken, A. Sundaram, and A.Vaschillo,Assessingrequirementstoscaletopracticalquan- tum advantage (2022), arXiv:2211.07629 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2022

  59. [59]

    Magnard, S

    P. Magnard, S. Storz, P. Kurpiers, J. Schär, F. Marxer, J. Lü- tolf, T. Walter, J.-C. Besse, M. Gabureac, K. Reuer, A. Akin, B. Royer, A. Blais, and A. Wallraff, Microwave quantum link between superconducting circuits housed in spatially separated cryogenic systems, Phys. Rev. Lett.125, 260502 (2020)

    work page 2020

  60. [60]

    Hartung, M

    L. Hartung, M. Seubert, S. Welte, E. Distante, and G. Rempe, Aquantum-networkregisterassembledwithopticaltweezersin an optical cavity, Science385, 179 (2024)

    work page 2024

  61. [61]

    Bombín, M

    H. Bombín, M. Pant, S. Roberts, and K. I. Seetharam, Fault- tolerantpostselectionforlow-overheadmagicstatepreparation, PRX Quantum5, 010302 (2024)

    work page 2024

  62. [62]

    Li, A magic state’s fidelity can be superior to the operations that created it, New Journal of Physics17, 023037 (2015)

    Y. Li, A magic state’s fidelity can be superior to the operations that created it, New Journal of Physics17, 023037 (2015)

    work page 2015

  63. [63]

    H. Chen, D. Xu, G. M. Sommers, D. A. Huse, J. D. Thompson, and S. Gopalakrishnan, Scalable accuracy gains from postselection in quantum error correcting codes (2025), arXiv:2510.05222 [cond-mat.stat-mech]

    work page internal anchor Pith review arXiv 2025

  64. [64]

    Stabilizer Codes and Quantum Error Correction

    D. Gottesman, Stabilizer codes and quantum error correction (1997), arXiv:quant-ph/9705052 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  65. [65]

    Gottesman, Theory of fault-tolerant quantum computation, Phys

    D. Gottesman, Theory of fault-tolerant quantum computation, Phys. Rev. A57, 127 (1998)

    work page 1998

  66. [66]

    A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett.77, 793 (1996)

    work page 1996

  67. [67]

    A. M. Steane, Simple quantum error-correcting codes, Phys. Rev. A54, 4741 (1996)

    work page 1996

  68. [68]

    Yamasaki and M

    H. Yamasaki and M. Koashi, Time-efficient constant-space- overhead fault-tolerant quantum computation, Nature Physics 20, 247 (2024)

    work page 2024

  69. [69]

    Tillich and G

    J.-P. Tillich and G. Zémor, Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Transactions on Information Theory60, 1193 (2014)

    work page 2014

  70. [70]

    Leverrier, J.-P

    A. Leverrier, J.-P. Tillich, and G. Zémor, Quantum expander codes, in2015 IEEE 56th Annual Symposium on Foundations of Computer Science(2015) pp. 810–824

    work page 2015

  71. [71]

    Grassl, T

    M. Grassl, T. Beth, and T. Pellizzari, Codes for the quantum erasure channel, Phys. Rev. A56, 33 (1997)

    work page 1997

  72. [72]

    Kikura, R

    S. Kikura, R. Inoue, H. Yamasaki, A. Goban, and S. Sunami, Taming recoil effect in cavity-assisted quantum interconnects (2025), arXiv:2502.14859 [physics.atom-ph]

    work page arXiv 2025

  73. [73]

    Y.Wu,S.Kolkowitz,S.Puri,andJ.D.Thompson,Erasurecon- version for fault-tolerant quantum computing in alkaline earth Rydbergatomarrays,NatureCommunications13,4657(2022)

    work page 2022

  74. [74]

    S.Kikura,K.Tanji,A.Goban,andS.Sunami,Passivequantum interconnects: High-fidelityquantumnetworkingathigherrates with less overhead (2025), arXiv:2507.01229 [quant-ph]

    work page arXiv 2025

  75. [75]

    H.Zhou,C.Zhao,M.Cain,D.Bluvstein,N.Maskara,C.Duck- ering,H.-Y.Hu,S.-T.Wang,A.Kubica,andM.D.Lukin,Low- overheadtransversalfaulttoleranceforuniversalquantumcom- putation, Nature646, 303 (2025)

    work page 2025

  76. [76]

    Sunami, G

    S. Sunami, A. Goban, and H. Yamasaki, Transversal surface- codegamepoweredbyneutralatoms(2025),arXiv:2506.18979 [quant-ph]

    work page arXiv 2025

  77. [77]

    Gidney, Stim: a fast stabilizer circuit simulator, Quantum5, 497 (2021)

    C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum5, 497 (2021)

    work page 2021

  78. [78]

    Higgott and C

    O. Higgott and C. Gidney, Sparse Blossom: correcting a mil- lion errors per core second with minimum-weight matching, Quantum9, 1600 (2025)

    work page 2025