Pith. sign in

REVIEW 3 major objections 5 minor 85 references

Canonical lifted-product codes get a full native logical instruction set from a structured conjugate basis.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-31 02:23 UTC pith:PCLZMBEH

load-bearing objection Real co-design: canonical LP basis plus a modular, certifiable instruction set that actually shrinks seed gadgets and extractors on high-rate codes. the 3 major comments →

arxiv 2607.28605 v1 pith:PCLZMBEH submitted 2026-07-30 quant-ph

Logical computation with canonical lifted product codes

Han Zheng , Guo Zheng , Liang Jiang , Qian Xu This is my paper
classification quant-ph
keywords qLDPC codeslifted-product codescanonical logical basiscode surgeryfold-transversal gatesmagic-state injectionfault-tolerant computation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

High-rate quantum LDPC codes pack many logical qubits into few physical ones, but running logic on them has been hard: generic surgery and teleportation ignore code structure and become bulky and hard to certify. This paper co-designs a family of cyclic lifted-product codes so that their logical operators form a canonical basis—conjugate pairs laid out in rows and columns of cyclic orbits, inherited from the classical base codes. That layout yields constant-depth automorphism and fold-transversal Clifford gates, modular surgery from a handful of reusable seed gadgets or one compact extractor, parallel Pauli-product measurements, and parallel magic-state injection. Concrete codes such as [[1122,148,≤20]] need only two seed gadgets, and arbitrary high-weight measurements fit in an extractor smaller than half the data block. A sympathetic reader cares because the result turns ultra-high-rate memories into architectures that can actually compute with modular, certifiable, low-overhead gadgets.

Core claim

A broad family of canonical lifted-product codes with cyclic symmetry admits a canonical logical basis: conjugate logical operators organized into rows and columns of cyclic orbits inherited from the underlying classical codes. This basis unlocks a complete native logical instruction set—constant-depth automorphism and fold-transversal Cliffords, modular graph surgeries from a constant number of seed gadgets or a compact cyclic extractor, highly parallel Pauli-product measurements, and parallel magic-state injection—making efficient fault-tolerant computation practical on ultra-high-rate codes.

What carries the argument

The canonical logical basis of an LPl(A,B) code (odd lift, aligned information sets): conjugate pairs (Z̄i,j,m, X̄i,j,m) that intersect on one qubit, form cyclic fibres of length l, and share row/column and ZX-duality symmetries. Those symmetries reduce arbitrary low-weight Pauli products to rA reusable seed surgery gadgets and enable a fixed cyclic extractor of size Õ(nA l).

Load-bearing premise

Fault tolerance is certified mainly by small-set soundness of merged graphs and phenomenological distance, not full circuit-level noise with hooks and realistic schedules, and many headline distances are only upper bounds under odd-lift algebraic assumptions.

What would settle it

Build the two seed gadgets and the half-size extractor for the [[1122,148,≤20]] code, run the claimed parallel single- and two-body measurements and distance-7 magic injection under a circuit-level noise model, and check whether the merged-code distance and logical error rates match the paper’s phenomenological lower bounds.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Arbitrary low-weight logical Pauli products on these codes reduce to bridging a constant (rA) set of small certified gadgets, independent of lift size.
  • High-weight logical measurements become practical via a single cyclic extractor smaller than the data block.
  • Entire blocks of magic states can be injected in parallel from surface-code patches through a transistor LP code while preserving phenomenological distance min(d, ds).
  • Constant-depth automorphism and fold-transversal Cliffords give free global logical gates with no ancilla.
  • Ultra-high-rate LP memories become candidates for modular, addressable logical processors rather than storage alone.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same row/column fibre picture may extend to other Abelian and some non-Abelian balanced-product families once information-set alignment is checked.
  • Single-shot or constant-time surgery variants would cut the Θ(d) logical cycle and further raise throughput on slow hardware.
  • If circuit-level simulations confirm the phenomenological bounds, these codes become natural targets for early high-rate FTQC demonstrations.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper co-designs a family of canonical lifted-product (LP) codes over the cyclic group ring with a native logical instruction set. Under mild algebraic conditions (odd lift size and aligned information sets of the classical base codes), these codes admit a canonical logical basis of conjugate pairs organized into r_A imes r_B^* logical fibres of length l, inherited from ker/coker of the base matrices via Künneth and CRT field decomposition (Theorems 1–3, 11–13; Prop. III.3). From the basis symmetries (cyclic shifts, row/column parallelism, ZX-duality) the authors construct constant-depth automorphism and fold-transversal Cliffords, modular graph surgery from only r_A reusable seed gadgets or one compact cyclic extractor of size Õ(n_A l), parallel intra- and inter-column hypergraph surgery, and parallel magic-state injection via a transistor LP code with phenomenological distance min(d, d_s). Concrete parameters are given for LP^{3 imes5}_{33}=[[1122,148,≤20]] and LP^{3 imes7}_{75}=[[4350,1224,≤20]] (Tables II–V).

Significance. If the constructions hold as stated, this is a substantial advance for fault-tolerant computation on high-rate qLDPC codes. It extends the tractable HGP-style logical toolkit to LP codes with far better parameters, replacing code-agnostic surgery with a modular, symmetry-exploiting instruction set whose seed-gadget count is independent of lift size. Strengths include explicit algebraic generator constructions with conjugate bases and dimension formulas, fully specified gadget desiderata (small-set soundness, added degree), concrete certified tables for large codes, and a parallel injection protocol with a clear phenomenological distance bound. The work is constructive mathematics and gadget design rather than empirical fitting; residual logicals are acknowledged and do not scale with l. These results meaningfully push the frontier of ultra-high-rate FT architectures, even if full circuit-level validation remains future work.

major comments (3)
  1. [§§IV–V, Theorems 6–7, Tables II–V] Fault tolerance throughout §§IV–V (surgery desiderata Def. IV.3, bridging Prop. IV.6, extractor Thm. 5, thickening Thm. 6, injection Thm. 7) is certified via small-set soundness/spectral criteria and phenomenological distance of merged codes, not full circuit-level noise including hook errors, measurement scheduling, and realistic connectivity. Tables II–V report ρ_d and merged degrees under this model. The central co-design claim remains intact, but the manuscript should state explicitly in §II and the Outlook that circuit-level FT (including single-shot or faster surgery) is left open, so that the ‘fully certifiable’ language in the abstract is not over-read.
  2. [Abstract; Table I; Tables II–III; §II B] Headline distances are only upper bounds (d≤20 for both showcase codes). Seed gadgets and extractors are certified to preserve ‘at least d’ under the soundness criteria, but without matching lower bounds the concrete space–time overheads in Table I and the injection example remain conditional. A short remark on how overhead claims degrade if the true distance is substantially below 20, or a pointer to existing/ongoing distance lower-bound work for these instances, would strengthen the quantitative claims.
  3. [§III; Theorems 1–3; Appendix B] Core basis theorems (Thm. 1–3, 11–13) and the semi-simple Künneth argument assume odd l. Even-l and non-monomial base matrices are flagged as future or partial (App. B). Since several practically interesting LP/BB families use even lifts, the manuscript should clarify in §III and the Outlook which pieces of the instruction set (automorphisms, seed count, extractor R-linearity, inter-column surgery) survive when semi-simplicity fails or only hold for the odd-l canonical sector.
minor comments (5)
  1. [Fig. 1, Fig. 3] Fig. 1 and Fig. 3 captions are dense; a short legend defining physical fibre / logical fibre / information sub-grid once would help readers unfamiliar with HGP/LP geometry.
  2. [§III; Appendix A] Notation switches between R-valued and binarized objects (B(·), rs_R vs rs_F2) are correct but heavy; a small notation table in §III or App. A would reduce cognitive load.
  3. [Table I] Table I uses Õ and hides polylog factors; briefly state what the polylog covers (graph augmentation/thickening) so overhead comparisons to generic surgery are fair.
  4. [§IV B; Appendix C] Several appendix cross-references appear as ‘Section ??’ or incomplete (e.g. near the Y-measurement caveat and Lemma on logical classification). Please fix before publication.
  5. [§VI; Acknowledgements] Concurrent non-Abelian LP works [48, 49] are acknowledged; a one-sentence contrast of what the canonical-basis route gives that those works do not (or vice versa) would help place the contribution.

Circularity Check

0 steps flagged

No significant circularity: constructive algebraic co-design, not fit-or-self-define loops.

full rationale

The paper defines canonical LP codes by an explicit algebraic condition (odd lift; aligned information sets of component kernels/cokernels), then derives a canonical logical basis from the Künneth formula and CRT field decomposition of R=F2[x]/(xl+1), and builds surgery/injection gadgets from the stated symmetries of that basis (cyclic orbits, row/column parallelism, ZX-duality). Seed-gadget count rA, extractor size Õ(nA l), and parallel primitives follow by construction from those symmetries once the basis is granted—they are not retrofitted predictions. Citations to prior surgery frameworks, HGP fold-transversal gates, and distillation factories are standard modular building blocks with independent content; they do not define the target canonical-LP basis or the rA-seed reduction. There is no empirical parameter fit renamed as prediction, no uniqueness theorem imported solely from overlapping authors to forbid alternatives, and no renaming of a known empirical pattern. Residual logicals and d≤20 upper bounds are acknowledged rather than smuggled. Circularity score 0 is appropriate.

Axiom & Free-Parameter Ledger

3 free parameters · 5 axioms · 4 invented entities

Results rest on standard CSS/homological coding, group-algebra LP definitions, and prior graph-surgery soundness frameworks, plus domain choices (odd lift, aligned information sets, phenomenological FT) that delimit the family. No fitted physical constants; free parameters are design choices (base A, lift l, thickening m, surface distance ds). Invented entities are named constructions (canonical basis, seed gadgets, canonical extractor, transistor code), each with explicit mathematical definitions inside the paper.

free parameters (3)
  • Base matrix A and lift size l (code family choice) = e.g. l=33,75; rA=2,4
    Concrete codes (LP3×5_33, LP3×7_75, toy LP2×4_5) are selected examples; parameters and gadget counts depend on these design choices, not data fits.
  • Thickening length m and target soundness ρd = m=10 analytical / m=7 numerical examples
    Hypergraph surgery depth and expander boosting are chosen to meet distance criteria (analytical m or numerical m=7 vs 10 in Table IV).
  • Surface-code distance ds for magic injection = ds=7 in Table V example
    Injection FT distance is min(d,ds); example uses ds=7 as a design parameter.
axioms (5)
  • standard math For odd l, R=F2[x]/(x^l+1) is semi-simple; Künneth gives H1 of the LP complex from ker/coker of A and B over R.
    Appendix B; standard for Abelian LP over odd-order cyclic groups.
  • domain assumption Graph/hypergraph surgery with (d,ρd)-soundness and elementary connectivity preserves dressed/phenomenological distance of the merged code (Desiderata IV.3, Theorem 14 citing prior surgery work).
    Load-bearing FT reduction used throughout §§IV–V; circuit-level hooks not re-proved.
  • domain assumption Information sets of component kernels can be aligned so [rA]⊆∩I_A^{(i)} and [r*_B]⊆∩I_{B*}^{(i)} (canonical condition).
    Theorem 3/13; mild but necessary; random odd-l codes with rA,r*_B≥1 are claimed typically canonical.
  • domain assumption Bridging adapters of Ref. [21] compose seed gadgets while preserving soundness and measuring the product operator.
    Used for modular multi-body PPMs; correctness inherited from cited universal adapters.
  • domain assumption Parallel magic injection plus transversal CNOT distillation factories yield high-throughput magic supply.
    Injection is proved phenomenologically; factory performance cited from prior transversal distillation work [31,41].
invented entities (4)
  • Canonical LP logical basis / canonical LP codes independent evidence
    purpose: Organize conjugate logicals into cyclic row/column fibres so HGP-style logic lifts to better-parameter LP codes.
    Defined Definition III.2; characterized by information-set alignment; not an external physical entity.
  • Seed surgery gadgets (set of size rA) independent evidence
    purpose: Measure all basis Paulis up to symmetry by rewiring one small graph per seed orbit.
    Theorem 4; explicit tables for two code instances.
  • Canonical (cyclic) extractor independent evidence
    purpose: Fixed ancilla graph measuring arbitrary logical Paulis with size Õ(nA l), often < data block.
    Definitions IV.7–IV.8, Theorem 5, Table III.
  • Transistor LP code Q'=LPl(A,D*) for parallel magic injection independent evidence
    purpose: Mediate parallel XX/ZZ teleportation from stacked surface codes into one logical column of the data LP code.
    Definition V.6, Theorem 7, Table V.

pith-pipeline@v1.2.0-daily-grok45 · 72881 in / 3834 out tokens · 84972 ms · 2026-07-31T02:23:50.600507+00:00 · methodology

0 comments
read the original abstract

High-rate quantum low-density parity-check (qLDPC) codes encode many logical qubits with low physical-qubit overhead, but realizing efficient fault-tolerant computation on such dense encodings remains a major challenge. Generic, code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes whose structure is left unexploited. Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of \emph{canonical} lifted-product (LP) codes with cyclic symmetry. We show that these codes admit a \emph{canonical logical basis}, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes, analogous to the structure that makes hypergraph-product codes so tractable. This canonical basis unlocks a complete logical instruction set, including constant-depth automorphism and fold-transversal Clifford gates, modular graph code surgeries built from a constant number of reusable seed surgery gadgets or a compact canonical extractor, highly parallel logical Pauli-product measurements, and parallel magic-state injection. For example, a $[[1122,148,\leq\!20]]$ (resp. $[[4350,1224,\leq\!20]]$) LP code requires only two (resp. four) seed surgery gadgets, while arbitrary high-weight logical measurements can be implemented using a full extractor smaller than half of the data code block. These results advance the frontier of fault-tolerant quantum computation on ultra-high-rate quantum architectures.

Figures

Figures reproduced from arXiv: 2607.28605 by Guo Zheng, Han Zheng, Liang Jiang, Qian Xu.

Figure 1
Figure 1. Figure 1: FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2 [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3 [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4 [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: (b)(c)) using the X-type inter-column surgery gadget (Definition V.5). These measurements are all performed in parallel. Record the parity mea￾surement outcome vector a. 3. Transistor-to-data MZ¯Z¯. We measure joint M⊗rAl Z¯Z¯ between the transistor code Q′ and the j-th column of logical qubits in the data canonical LP code Q similarly using the Z-type LP inter-column surgery gadget ((Def. V.5)). Record th… view at source ↗

discussion (0)

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

Reference graph

Works this paper leans on

85 extracted references · 22 linked inside Pith

  1. [1]

    Let ¯L and ¯L′ be two Z-type (resp

    (Chain map for same-type logical operators). Let ¯L and ¯L′ be two Z-type (resp. X-type) logical opera- tors. Suppose there exists a chain mapΓ = (Γ 1, Γ0): Q1 Q0 Q1 Q0 HX Γ1 Γ0 HX (C24) such that ωcol(Γ1) ≤r andΓ 1(l) = l′ for two phys- ical, binary representatives l and l′ of ¯L and ¯L′, respectively. Then the transformed surgery gad- get S[G; (Γ1Φ1, Γ0...

  2. [2]

    Here we give an algebraic view on the surgery, especially on their connectivity maps

    Code symmetries for surgery The above Section C 1 establishes the basic principles on surgery techniques. Here we give an algebraic view on the surgery, especially on their connectivity maps. A key characterization is that there are potentially many possible chain maps which satisfy Definition C.1 above. Hence, a surgery ancilla graph may measure many log...

  3. [3]

    Let, without loss of generality, ¯LZ be a Z-type logical operator and ¯LX be an X-type logical operator

    (Chain map for mixed-type logical operators). Let, without loss of generality, ¯LZ be a Z-type logical operator and ¯LX be an X-type logical operator. Sup- pose that there exists a chain mapΨ = (Ψ 1,Ψ 0): Q1 Q0 Q1 Q2 HX Ψ1 Ψ0 HZ (C25) such that ωcol(Ψ1) ≤r andΨ 1(lZ) = lX with lZ and lX being physical, binary representatives of ¯LZ and ¯LX , respectively....

  4. [4]

    In this section, we only consider thegraph surgery according to Definition C.1, which is a special case of the hypergraph surgery according to Definition C.2

    F ault-tolerant graph surgery gadgets In this section, we formally introduce the conditions for which the surgery gadgets can be used to fault-tolerantly measure logical operators. In this section, we only consider thegraph surgery according to Definition C.1, which is a special case of the hypergraph surgery according to Definition C.2. The use of a conn...

  5. [5]

    (41), and the surgery gadget S[G; (Φ(µ) 1 , Φ(µ) 0 )] defines a (hyper)surgery gadget according to Definition C.1 (resp

    For each index µ, the connectivity map satisfies the commutation relation Eq. (41), and the surgery gadget S[G; (Φ(µ) 1 , Φ(µ) 0 )] defines a (hyper)surgery gadget according to Definition C.1 (resp. Defini- tion C.2)

  6. [6]

    Definition C.2)

    If any F2-linear combination from {Φ(µ) 1 , Φ(µ) 0 }µ de- fines a (hyper)surgery gadget according to Defini- tion C.1 (resp. Definition C.2). In the next section, we show how the extractor is used; the notion encompasses seed gadgets and LP canonical extractors. We discuss two types of linear extractors: (i) Z-type (resp. X-type) linear extractor, which m...

  7. [7]

    Hence, without loss of generality, we only prove the soundness for a single-type Pauli operators, e.g., Z-type Pauli operators

    Thickening of hypergraph surgery As observed from the proof, the argument (of distance- preserving) is symmetric in X- and Z-direction. Hence, without loss of generality, we only prove the soundness for a single-type Pauli operators, e.g., Z-type Pauli operators. In this regard, we will continue the abuse of notation by Φ 1 = Φ (Z) 1 , whenever the contex...

  8. [8]

    Let LG be the graph Laplacian of G, and let Dmax be the maximum degree of any vertices or the maximum diagonal entry to DG

    Graph spectral criterion Let G be a graph with vertex set V, edge set E, and cycle set C. Let LG be the graph Laplacian of G, and let Dmax be the maximum degree of any vertices or the maximum diagonal entry to DG. The Cheeger constant h is defined as h:= min S⊂V |∂S| min(|S|,|V \S|) (D1) where∂Sis the set of edges with one endpoint inSand the other endpoi...

  9. [9]

    F urther numerics for graph surgery gadgets for canonical LP codes Table VI collects the full resource menu of the certified seed surgery gadgets for the two code instances: the twelve 1-body gadgets, at both soundness levels ρd ≥ 1 and ρd ≥ 2, and the seven bridged cross-pair 2-body gadgets

  10. [10]

    Parallel hypergraph surgery gadgets to canonical LP codes We now provide details to the high-rate, parallel surgery techniques and constructions presented in Section V. First we show that, with a canonical LP code LPl(A, A∗) such that A consists of monomial entries, the LP intra-column/inter-column surgery gadgets present no additional logical operators o...

  11. [11]

    As an application, we will discuss the partial transversal, high-rate magic state injection using disjoint unions of surface codes that support | ¯T⟩

    Parallel magic-state injection on canonical LP codes We now give a detailed analysis on the parallel magic- state injection on canonical LP codes, presented in Sec- tion V. As an application, we will discuss the partial transversal, high-rate magic state injection using disjoint unions of surface codes that support | ¯T⟩ . As shown in Fig- ure 5, let Q′′,...

  12. [12]

    e(0) D1 ⊗R ID1 e(i) D1 ⊗R ID1 !# ; Φ (i) 0 =B

    (M ¯X ¯X partial transversal gadget between Q′′ and Q′). Let G(i) X (V (i) X ,E (i) X ,C (i) X ) be constructed such that V (i) X ∼= D1, EX ∼= D0, ∂1 = D, and CX = 0, ∂0 = 0. For any row indexi∈[r A], let Φ(i) 1 =B " e(0) D1 ⊗R ID1 e(i) D1 ⊗R ID1 !# ; Φ (i) 0 =B " e(0) D1 ⊗R ID0 e(i) D1 ⊗R ID0 !# , (D16) where e(i) D1 denotes the unit vector on D1 sup- po...

  13. [13]

    IA1 ⊗R e(0) D1 IA1 ⊗R e(j) A1 !# ; Φ (Z) 0 =B

    (M ¯Z ¯Z partial transversal gadget between Q′ and Q). Let GZ(VZ,E Z,C Z) be constructed such that VZ ∼= A1, EZ ∼= A0, ∂1 = A, and CZ = 0, ∂0 = 0. For any column indexj∈[r A], let Φ(Z) 1 =B " IA1 ⊗R e(0) D1 IA1 ⊗R e(j) A1 !# ; Φ (Z) 0 =B " IA0 ⊗R e(0) D1 IA0 ⊗R e(j) A1 !# , (D17) 61 where e(j) A1 denotes the unit vector on A1 sup- ported on the jth entry....

  14. [14]

    Gottesman, Stabilizer codes and quantum error cor- rection (1997), arXiv:quant-ph/9705052 [quant-ph]

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

    Pith/arXiv arXiv 1997

  15. [15]

    P. W. Shor, Physical Review A52, R2493 (1995)

    1995

  16. [16]

    A. Y. Kitaev, Russian Mathematical Surveys52, 1191 (1997)

    1997

  17. [17]

    S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary (1998), arXiv:quant-ph/9811052 [quant-ph]

    Pith/arXiv arXiv 1998

  18. [18]

    Knill and R

    E. Knill and R. Laflamme, Physical Review A55, 900 (1997)

    1997

  19. [19]

    A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, IEEE Transactions on Information Theory44, 1369 (1998)

    1998

  20. [20]

    A. M. Steane, Physical Review Letters77, 793 (1996)

    1996

  21. [21]

    Gottesman, arXiv preprint arXiv:1310.2984 (2013)

    D. Gottesman, arXiv preprint arXiv:1310.2984 (2013)

    Pith/arXiv arXiv 2013

  22. [22]

    N. P. Breuckmann and J. N. Eberhardt, PRX quantum 2, 040101 (2021)

    2021

  23. [23]

    Panteleev and G

    P. Panteleev and G. Kalachev, Asymptotically good quan- tum and locally testable classical ldpc codes (2022), arXiv:2111.03654 [cs.IT]

    Pith/arXiv arXiv 2022

  24. [24]

    Leverrier and G

    A. Leverrier and G. Z´ emor, Quantum tanner codes (2022), arXiv:2202.13641 [quant-ph]

    Pith/arXiv arXiv 2022

  25. [25]

    Panteleev and G

    P. Panteleev and G. Kalachev, Quantum5, 585 (2021)

    2021

  26. [26]

    Bravyi, A

    S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, Nature627, 778 (2024), pub- lished 27 March 2024

    2024

  27. [27]

    Q. Xu, J. P. Bonilla Ataides, C. A. Pattison, N. Raveen- dran, D. Bluvstein, J. Wurtz, B. Vasi´ c, M. D. Lukin, L. Jiang, and H. Zhou, Nature Physics20, 1084 (2024)

    2024

  28. [28]

    T. J. Yoder, E. Schoute, P. Rall, E. Pritchett, J. M. Gambetta, A. W. Cross, M. Carroll, and M. E. Beverland, arXiv preprint arXiv:2506.03094 (2025)

    Pith/arXiv arXiv 2025

  29. [29]

    E. Tham, M. L. Goldman, S. Debnath, A. N. Patel, J. Sar- aladevi, J. Nguyen, E. Nielsen, N. Pisenti, K. Wright, J. Gamble,et al., arXiv preprint arXiv:2606.06455 (2026)

    Pith/arXiv arXiv 2026

  30. [30]

    K. Wang, Z. Lu, C. Zhang, G. Liu, J. Chen, Y. Wang, Y. Wu, S. Xu, X. Zhu, F. Jin,et al., Nature Physics , 1 (2026)

    2026

  31. [31]

    L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Science Advances8, eabn1717 (2022), arXiv:2110.10794 [quant-ph]

    Pith/arXiv arXiv 2022

  32. [32]

    A. W. Cross, Z. He, P. J. Rall, and T. J. Yoder, Improved qldpc surgery: Logical measurements and bridging codes (2025), arXiv:2407.18393 [quant-ph]

    arXiv 2025

  33. [34]

    Z. He, A. Cowtan, D. J. Williamson, and T. J. Yoder, 62 Extractors: Qldpc architectures for efficient pauli-based computation (2025), arXiv:2503.10390 [quant-ph]

    arXiv 2025

  34. [35]

    B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphinais, Physical Review X15, 021088 (2025)

    2025

  35. [37]

    Q. T. Nguyen and C. A. Pattison, arXiv preprint arXiv:2411.03632 (2024)

    Pith/arXiv arXiv 2024

  36. [38]

    Q. Xu, H. Zhou, D. Bluvstein, M. Cain, M. Kalinowski, J. Preskill, M. D. Lukin, and N. Maskara, Batched high- rate logical operations for quantum LDPC codes, arXiv preprint (2025), arXiv:2510.06159 [quant-ph]

    arXiv 2025

  37. [39]

    D. J. Williamson and T. J. Yoder, Low-overhead fault- tolerant quantum computation by gauging logical opera- tors (2024), arXiv:2410.02213 [quant-ph]

    Pith/arXiv arXiv 2024

  38. [40]

    Sayginel, S

    H. Sayginel, S. Koutsioumpas, M. Webster, A. Rajput, and D. E. Browne, Fault-tolerant logical clifford gates from code automorphisms (2025), arXiv:2409.18175 [quant-ph]

    Pith/arXiv arXiv 2025

  39. [41]

    Tillich and G

    J.-P. Tillich and G. Z´ emor, IEEE Transactions on In- formation Theory60, 1193 (2014), originally appeared as preprint (2009) introducing the hypergraph-product construction

    2014

  40. [42]

    Bravyi and M

    S. Bravyi and M. B. Hastings, Homological product codes (2013), arXiv:1311.0885 [quant-ph]

    Pith/arXiv arXiv 2013

  41. [43]

    A. O. Quintavalle, P. Webster, and M. Vasmer, Quantum 7, 1153 (2023)

    2023

  42. [44]

    Q. Xu, H. Zhou, G. Zheng, D. Bluvstein, J. P. B. Ataides, M. D. Lukin, and L. Jiang, Physical Review X15, 021065 (2025)

    2025

  43. [45]

    Berthusen, M

    N. Berthusen, M. J. Gullans, Y. Hong, M. Mudassar, and S. J. S. Tan, Automorphism gadgets in homological product codes (2025), arXiv:2508.04794 [quant-ph]

    Pith/arXiv arXiv 2025

  44. [46]

    A. J. Malcolm, A. N. Glaudell, P. Fuentes, D. Chandra, A. Schotte, C. DeLisle, R. Haenel, A. Ebrahimi, J. Roffe, A. O. Quintavalle,et al., Nature Communications (2026)

    2026

  45. [47]

    Hong, arXiv preprint arXiv:2410.05171 (2024)

    Y. Hong, arXiv preprint arXiv:2410.05171 (2024)

    arXiv 2024

  46. [48]

    S. J. S. Tan, Y. Hong, T.-C. Lin, M. J. Gullans, and M.-H. Hsieh, Single-shot universality in quantum ldpc codes via code-switching (2025), arXiv:2510.08552 [quant-ph]

    arXiv 2025

  47. [49]

    Chang, Z

    K. Chang, Z. He, T. J. Yoder, G. Zhu, and T. Jochym- O’Connor, arXiv preprint arXiv:2603.02157 (2026)

    arXiv 2026

  48. [50]

    J. Blue, Z. He, H. Zhou, and I. L. Chuang, arXiv preprint arXiv:2606.03507 (2026)

    Pith/arXiv arXiv 2026

  49. [51]

    N. P. Breuckmann and J. N. Eberhardt, IEEE Transac- tions on Information Theory67, 6653 (2021)

    2021

  50. [52]

    Panteleev and G

    P. Panteleev and G. Kalachev, IEEE Transactions on Information Theory68, 213 (2022)

    2022

  51. [53]

    J. N. Eberhardt and V. Steffan, Logical operators and fold-transversal gates of bivariate bicycle codes (2024), arXiv:2407.03973 [quant-ph]

    Pith/arXiv arXiv 2024

  52. [54]

    M. Cain, Q. Xu, R. King, L. R. B. Picard, H. Levine, M. Endres, J. Preskill, H.-Y. Huang, and D. Bluvstein, Shor’s algorithm is possible with as few as 10,000 reconfig- urable atomic qubits (2026), arXiv:2603.28627 [quant-ph]

    Pith/arXiv arXiv 2026

  53. [55]

    N. P. Breuckmann and S. Burton, Quantum8, 1372 (2024)

    2024

  54. [56]

    Gidney, N

    C. Gidney, N. Shutty, and C. Jones, Magic state culti- vation: growing t states as cheap as cnot gates (2024), arXiv:2409.17595 [quant-ph]

    Pith/arXiv arXiv 2024

  55. [57]

    B. Gu, A. Z. Liu, A. O. Quintavalle, Q. Xu, J. Eisert, and J. Roffe, Qgpu: Parallel logic in quantum ldpc codes (2026), arXiv:2603.05398 [quant-ph]

    arXiv 2026

  56. [58]

    Bott and L

    R. Bott and L. W. Tu,Differential Forms in Alge- braic Topology, Graduate Texts in Mathematics, Vol. 82 (Springer-Verlag, New York, 1982)

    1982

  57. [59]

    Roman,Field Theory, Graduate Texts in Mathematics, Vol

    S. Roman,Field Theory, Graduate Texts in Mathematics, Vol. 158 (Springer, New York, 1995)

    1995

  58. [60]

    It also gives an explicit, constructive version of the re- marks in Appendix B of Ref. [39]

  59. [61]

    Bhardwaj, M

    A. Bhardwaj, M. Ma, N. Meister, R. King, D. Bluvstein, J. Preskill, M. Cain, Q. Xu, and H.-Y. Huang (2026), manuscript in preparation

    2026

  60. [62]

    Hong (2026), manuscript in preparation

    Y. Hong (2026), manuscript in preparation

    2026

  61. [63]

    Cowtan, Z

    A. Cowtan, Z. He, D. J. Williamson, and T. J. Yoder, Fast and fault-tolerant logical measurements: Auxiliary hyper- graphs and transversal surgery (2025), arXiv:2510.14895 [quant-ph]

    arXiv 2025

  62. [64]

    Horsman, A

    D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, New Journal of Physics14, 123011 (2012)

    2012

  63. [65]

    A. C. Yuan, A. Cowtan, Z. He, T.-C. Lin, and D. J. Williamson, arXiv preprint arXiv:2603.05082 (2026)

    arXiv 2026

  64. [66]

    B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphi- nais, Physical Review X15, 10.1103/physrevx.15.021088 (2025)

    doi:10.1103/physrevx.15.021088 2025

  65. [67]

    Dinur, T.-C

    I. Dinur, T.-C. Lin, and T. Vidick, Expansion of higher- dimensional cubical complexes with application to quan- tum locally testable codes (2025), arXiv:2402.07476 [quant-ph]

    Pith/arXiv arXiv 2025

  66. [68]

    Zheng, L

    G. Zheng, L. Jiang, and Q. Xu, High-rate surgery: towards constant-overhead logical operations (2025), arXiv:2510.08523 [quant-ph]

    arXiv 2025

  67. [69]

    Cowtan, Z

    A. Cowtan, Z. He, D. J. Williamson, and T. J. Yoder, Parallel logical measurements via quantum code surgery (2025), arXiv:2503.05003 [quant-ph]

    Pith/arXiv arXiv 2025

  68. [70]

    Baspin, L

    N. Baspin, L. Berent, and L. Z. Cohen, Fast surgery for quantum ldpc codes (2025), arXiv:2510.04521 [quant-ph]

    arXiv 2025

  69. [71]

    Swaroop, T

    E. Swaroop, T. Jochym-O’Connor, and T. J. Yoder, arXiv preprint arXiv:2410.03628 (2024)

    arXiv 2024

  70. [72]

    Webster, S

    P. Webster, S. C. Smith, and L. Z. Cohen, Explicit con- struction of low-overhead gadgets for gates on quantum ldpc codes (2025), arXiv:2511.15989 [quant-ph]

    arXiv 2025

  71. [73]

    This requirement could be relaxed by requiring only that S(Z) (resp

    Here, we require S(Z) and S(X) to form k conjugate pairs of logical operators, thereby specifying the k logical qubits. This requirement could be relaxed by requiring only that S(Z) (resp. S(X)) be a minimal generating set for all logicalZ-type (resp.X-type) operators

  72. [74]

    Bluvstein, S

    D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuleti´ c, and M. D. Lukin, Nature626, 58 (2024)

    2024

  73. [75]

    Litinski, Quantum3, 205 (2019)

    D. Litinski, Quantum3, 205 (2019)

    2019

  74. [76]

    Bravyi and A

    S. Bravyi and A. Kitaev, Physical Review A71, 022316 (2005), arXiv:quant-ph/0403025 [quant-ph]

    Pith/arXiv arXiv 2005

  75. [77]

    E. T. Campbell, Quantum Science and Technology4, 025006 (2019)

    2019

  76. [78]

    Golowich, K

    L. Golowich, K. Chang, and G. Zhu, Constant-overhead addressable gates via single-shot code switching (2025), arXiv:2510.06760 [quant-ph]

    arXiv 2025

  77. [79]

    M. F. Atiyah and I. G. Macdonald,Introduction to Com- mutative Algebra, Addison-Wesley Series in Mathemat- ics (Addison-Wesley Publishing Company, Reading, MA, 1969)

    1969

  78. [80]

    Kalachev and P

    G. Kalachev and P. Panteleev, Two-sided robustly testable codes (2023), arXiv:2206.09973 [cs.IT]. 63

    Pith/arXiv arXiv 2023

  79. [81]

    J. I. Hall, Notes on coding theory, https: //users.math.msu.edu/users/halljo/classes/ codenotes/coding-notes.html (2015), online notes. Last revised 7 January 2015. Accessed 2026-01-07

    2015

  80. [82]

    C. A. Weibel,An Introduction to Homological Algebra, Cambridge Studies in Advanced Mathematics, Vol. 38 (Cambridge University Press, 1994)

    1994

Showing first 80 references.