Pith. sign in

REVIEW 1 major objections 5 minor 64 references

Two complementary 3D color codes make magic and most entanglement transversal, leaving only one Clifford entangling gate to pay for.

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-11 08:43 UTC pith:AX4TKWZF

load-bearing objection Clean hybrid color-code construction that keeps magic and most entanglement transversal; the only real soft spot is d=3-only verification of the pieceable CZ. the 1 major comments →

arxiv 2607.05107 v1 pith:AX4TKWZF submitted 2026-07-06 quant-ph

Complementary 3D color codes for transversal quantum logic

Friederike Butt , Luis Colmenarez , Erik Weilandt , Tom Peham , Robert Wille , Markus M\"uller This is my paper
classification quant-ph
keywords 3D color codestransversal gatesEastin-Knill theorempieceable fault toleranceround-robin CZSteane syndrome extractionmagic stateshybrid architecture
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.

A single quantum error-correcting code cannot have a universal set of transversal logical gates; that is the Eastin–Knill barrier. This paper builds a hybrid architecture from the tetrahedral 3D color code and its Hadamard-transformed twin (the H-tetrahedral code). Each code supplies a transversal non-Clifford rotation about a different axis, bitwise Hadamards switch encodings, and a one-way transversal CNOT runs between them. The resulting almost-universal transversal set already creates both entanglement and magic. The single missing operation—a controlled-Z between two H-tetrahedral codes—is supplied by a pieceably fault-tolerant round-robin circuit that inserts intermediate extraction of only the invariant stabilizers, performed cheaply with 2D color-code ancillas. Numerical checks for the smallest distance-3 instance confirm that every single fault remains correctable. The architecture therefore concentrates resource overhead into a few non-transversal Clifford entangling gates while leaving magic and most entangling operations transversal at any code distance.

Core claim

A hybrid tetrahedral / H-tetrahedral architecture, completed by a pieceably fault-tolerant round-robin CZ that uses intermediate invariant-stabilizer extraction with 2D color-code Steane ancillas, yields a universal fault-tolerant logical gate set in which magic and most entangling operations remain transversal for arbitrary distance.

What carries the argument

The complementary pair of tetrahedral and H-tetrahedral 3D color codes (related by bitwise Hadamard), which supply complementary transversal T and TX gates plus a one-way transversal CNOT, together with the round-robin CZ whose intermediate syndrome extraction measures only the invariant stabilizers via reduced-overhead 2D color-code ancillas.

Load-bearing premise

That measuring only the invariant stabilizers in the middle of the round-robin gate, plus one full syndrome round at the end, keeps every single fault correctable once the code distance grows beyond the smallest instance that was exhaustively checked.

What would settle it

For a higher-distance H-tetrahedral code (for example d=5), enumerate or sample single-fault locations through the full round-robin CZ plus intermediate invariant extraction and check whether any uncorrectable logical error appears after the final syndrome round.

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

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

1 major / 5 minor

Summary. The manuscript proposes a hybrid fault-tolerant architecture that pairs the tetrahedral 3D color code with its Hadamard-transformed counterpart (the H-tetrahedral code). The two encodings supply complementary transversal non-Clifford rotations (T and TX), bitwise Hadamard switches the encoding, and a one-way transversal CNOT from tetrahedral to H-tetrahedral is available; together these yield an almost-universal transversal gate set that can generate both entanglement and magic. Universality is completed by a pieceably fault-tolerant round-robin CZ between two H-tetrahedral blocks, interleaved with intermediate extraction of only the invariant stabilizers via reduced-overhead Steane-type measurements that use 2D color-code logical ancillas. Fault tolerance of the d=3 construction is verified by exhaustive single-fault enumeration and circuit-level Monte-Carlo simulations that exhibit the expected p^{2} scaling; the higher-distance extension is argued from the known d_Z ∝ d^{2} scaling and the standard pieceable-FT pattern.

Significance. If the constructions hold, the work supplies a concrete alternative route to universal FTQC in which magic and most entangling operations remain transversal for arbitrary distance while the non-transversal overhead is concentrated in a single orientation of Clifford entangling gate. The explicit stabilizer-preservation arguments, the one-way CNOT and 2D-Steane extraction circuits, the symmetric round-robin ordering, the d=3 lookup table (App. A), and the distance relation d_Z = (3d^{2}+1)/4 (App. F) are clean and reproducible. The architecture is especially well-matched to highly parallel platforms (e.g., neutral atoms) and to algorithms such as IQP circuits that can exploit large transversal blocks. These are genuine strengths relative to pure magic-state or pure code-switching approaches.

major comments (1)
  1. Sec. III.C–III.D and App. A: Exhaustive single-fault correctness and Monte-Carlo p^{2} scaling are demonstrated only for the [[15,1,3]]ᴴ instance. The claim that the same intermediate extraction of the invariant subset (three X-faces + four Z-cells) together with (d−1)/2 intermediate rounds remains sufficient at arbitrary distance rests on the standard pieceable-FT pattern plus d_Z ∝ d^{2}. While that pattern is well-established in the cited literature, the manuscript should either (i) supply a short inductive argument that every weight-1 fault remains correctable after the prescribed number of invariant rounds, or (ii) explicitly label the higher-distance FT statement as following from the general theory rather than as a fully verified claim of the present work. This is the only load-bearing gap for the central scalability assertion.
minor comments (5)
  1. Fig. 5 and surrounding text: the comparison curve 105p^{2} is a deliberately pessimistic estimate for a transversal CNOT; a brief sentence noting that a more refined counting of uncorrectable two-fault patterns would lower the prefactor would avoid overstating the overhead gap.
  2. Notation: the distinction between codespace-preserving O and non-preserving ˜O is introduced clearly, but a few later passages (e.g., the discussion of ˜CZ) mix the two; a consistent reminder in the figure captions would help.
  3. Sec. IV: the qualitative resource discussion is fair, yet a short table contrasting the O(d^{5}) CZ count of the round-robin gate against a single magic-state injection or a code-switch step (even order-of-magnitude) would make the claimed overhead concentration more concrete.
  4. App. B / Fig. 7: the FT preparation circuit for the [[7,1,3]] ancilla is standard; citing the precise verification operator used (Z_{2}Z_{3}Z_{7}) already in the main text would spare the reader an appendix dive.
  5. Typos / polish: “j=1 15” rendering in Fig. 1, occasional missing spaces around ˜H, and “pieceably” vs “pieceable” consistency.

Circularity Check

0 steps flagged

No significant circularity: explicit stabilizer-propagation constructions and pieceable-FT circuits, verified by single-fault enumeration and Monte-Carlo for d=3, with no fitted parameters or load-bearing self-citation chains.

full rationale

The paper's derivation chain is constructive and self-contained. The H-tetrahedral code is defined by bitwise Hadamard on the standard tetrahedral color code (Sec. II.B, Fig. 1); complementary transversal T / T_X and the one-way CNOT follow immediately from stabilizer support (cells vs faces) and are verified by direct propagation (Fig. 2). The missing CZ is realized by an explicit round-robin of physical CZ layers on the Z-support (qubits 1-7), with invariant stabilizers identified by commutation (Sec. III.A, Fig. 3) and intermediate extraction via 2D Steane ancillas that preserve the codespace by the same one-way argument (Fig. 4). Fault tolerance for the [[15,1,3]]_H instance is established by exhaustive single-fault placement plus Monte-Carlo p^{2} scaling (Sec. III.C, Fig. 5, App. A lookup table), not by fitting. Higher-distance scaling invokes only the known geometric relation d_Z = (3d^{2}+1)/4 (App. F) and the standard pieceable-FT pattern of Yoder et al. Self-citations (e.g., prior code-switching or decoding papers by overlapping authors) supply background or experimental context but are not used to force uniqueness or to define the present logical-gate claims by construction. No equation reduces to its own input; no parameter is fitted and then re-presented as a prediction. Score 0 is therefore the correct, proportionate finding.

Axiom & Free-Parameter Ledger

1 free parameters · 4 axioms · 2 invented entities

The paper rests on standard stabilizer-code and color-code facts, the Eastin-Knill theorem, the pieceable-FT framework of Yoder et al., and the known transversal gates of the tetrahedral color code. No free parameters are fitted to produce the central claim; the only numerical inputs are the uniform depolarizing probability p used for Monte-Carlo validation. The H-tetrahedral code is simply the image of a known code under a bitwise Hadamard and is not an independent physical entity.

free parameters (1)
  • uniform circuit-level depolarizing probability p
    Used only for Monte-Carlo validation of the d=3 round-robin CZ (Fig. 5); not fitted to any experimental data and not required for the existence claim of the gate set.
axioms (4)
  • domain assumption Eastin-Knill theorem: no single QEC code admits a universal transversal gate set
    Invoked in the abstract and Introduction to motivate the hybrid construction.
  • domain assumption Tetrahedral 3D color codes support transversal T (and therefore S, CS, CCZ) while their Hadamard images support transversal TX
    Standard fact for these codes (Bombin, Kubica et al.); used throughout Sec. II.
  • domain assumption Pieceable fault tolerance: inserting intermediate syndrome extraction between FT sub-circuits can render a non-transversal gate FT
    Framework of Yoder-Takagi-Chuang; applied in Sec. III.A to the round-robin CZ.
  • standard math A cell of the tetrahedral lattice is the union of two opposing faces, so a one-way transversal CNOT from tetrahedral to H-tetrahedral preserves the codespace
    Geometric fact used to prove the one-way CNOT (Fig. 2a).
invented entities (2)
  • H-tetrahedral code independent evidence
    purpose: Provide the complementary transversal TX gate and serve as the target of the one-way CNOT
    Defined simply as the image of the ordinary tetrahedral code under a bitwise Hadamard; not a new physical code family.
  • hybrid tetrahedral / H-tetrahedral architecture no independent evidence
    purpose: Realize an almost-universal transversal gate set that includes both magic and entanglement
    The pairing itself is the paper's central architectural proposal.

pith-pipeline@v1.1.0-grok45 · 23215 in / 2805 out tokens · 26179 ms · 2026-07-11T08:43:18.734367+00:00 · methodology

0 comments
read the original abstract

Transversal logical gates provide a direct route to fault-tolerant quantum computation, but the Eastin-Knill theorem forbids a universal transversal gate set within a single quantum error-correcting code. We propose a hybrid architecture based on the tetrahedral three-dimensional color code and its Hadamard-transformed counterpart, which we call the H-tetrahedral code. The two encodings support complementary transversal non-Clifford operations. Combined with bitwise Hadamard transformations that switch between the two encodings and a one-way transversal logical CNOT from the tetrahedral code to the H-tetrahedral code, these operations realize an almost-universal transversal logical gate set that enables both the creation of entanglement and logical states with magic. We complete a universal gate set through a pieceably fault-tolerant round-robin construction of a logical controlled-$Z$ gate between two H-tetrahedral codes. This logical entangling gate is interleaved with reduced-overhead Steane-type syndrome extraction using logical two-dimensional color-code auxiliary qubits. Our construction provides a new route toward implementing classically hard-to-simulate quantum algorithms where magic and most entangling operations are transversal while the resource overhead is concentrated in a small number of non-transversal Clifford entangling operations.

Figures

Figures reproduced from arXiv: 2607.05107 by Erik Weilandt, Friederike Butt, Luis Colmenarez, Markus M\"uller, Robert Wille, Tom Peham.

Figure 1
Figure 1. Figure 1: The [[15, 1, 3]] code and its Hadamard-transformed version. (a) The X-stabilizer generators of the [[15, 1, 3]] tetrahedral color code are supported on the red (R), blue (B), green (G) and yellow (Y) cell formed by eight qubits each. Ten independent Z-stabilizers are defined on weight-4 faces within the tetrahedron. (b) The support of X- and Z-stabilizers is interchanged on the Hadamard-transformed tetrahe… view at source ↗
Figure 2
Figure 2. Figure 2: Transversal operations in the hybrid architecture. (a) If the control qubit is encoded in the [[15, 1, 3]] code and the target in the Hadamard-transformed [[15, 1, 3]]H code, cell-like stabilizers propagate to face-like stabilizers. This operation preserves the codespace because both control and target are a +1-eigenstate of the X-cells. The transversal CNOT gate in the reverse direction (b) does not prese… view at source ↗
Figure 3
Figure 3. Figure 3: Round-robin CZ gate on the rotated tetrahedral [[15, 1, 3]]H code. The round-robin gate applies seven layers of permuted transversal CZ gates on qubits 1–7 of code blocks A and B. Since physical CZ gates commute, we can rearrange the gate ordering, as illustrated in App [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Fault-tolerant stabilizer extraction on tetrahedral 3D color codes. (a) A 3D tetrahedral color code can be viewed as layers of 2D color codes, similarly to stacked color codes [46]. (b) The red, green and blue X-stabilizers, S R X, SB X, SG X can be measured fault-tolerantly using a variant of Steane’s method for FT syndrome extraction [47]. We fault-tolerantly prepare a logical auxiliary qubit in |0⟩ of a… view at source ↗
Figure 5
Figure 5. Figure 5: Logical state fidelities for the fault-tolerant round-robin CZ gate. The CZ gate is run on two [[15, 1, 3]]H codes which do not admit a transversal imple￾mentation of this operation. The gate construction is fully symmetric between the two logical qubits. The logical state fidelities are determined as described in App. E for two logi￾cal qubit input states |0+⟩, |1+⟩, and |++⟩. The gray dashed line corresp… view at source ↗
Figure 6
Figure 6. Figure 6: summarizes the stabilizers and logical op￾erators of the [[7, 1, 3]] code. This code is the small￾est instance of an error-correcting two-dimensional color code [63] and it has been used in several experimental demonstrations [4, 19, 29, 30, 48, 64] [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Circuit for the fault-tolerant preparation of a logical state on the [[7, 1, 3]] code [48]. We first initialize |0⟩ on the [[7, 1, 3]] non-fault-tolerantly using the first eight CNOT gates. Then, we detect single faults that would otherwise cause a logical failure by measuring the logical operator ZL = Z2Z3Z7. Finally, a transversal application of HL may be used to prepare |+⟩L. The logical state fidelitie… view at source ↗
Figure 8
Figure 8. Figure 8: Ordering of physical CZ gates in the round-robin CZ gate. We change the ordering of physical CZ gates from the naive round-robin implementation (top). Specifically, we move all gates colored in blue to the second half of the protocol (bottom). As a consequence, the lookup tables taking into account the intermediate round of stabilizer extraction in the FT round-robin gate is the same for both logical-qubit… 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

64 extracted references · 11 linked inside Pith

  1. [1]

    Gottesman, Stabilizer codes and quantum error correction, PhD thesis, California Institute of Tech- nology (1997),https://thesis.library.caltech.edu/ 2900/2/THESIS.pdf

    D. Gottesman, Stabilizer codes and quantum error correction, PhD thesis, California Institute of Tech- nology (1997),https://thesis.library.caltech.edu/ 2900/2/THESIS.pdf

    1997

  2. [2]

    B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys.87, 307 (2015)

    2015

  3. [3]

    Google Quantum AI, Quantum error correction below the surface code threshold, Nature638, 920 (2025)

    2025

  4. [4]

    Lacroix, A

    N. Lacroix, A. Bourassa, F. J. H. Heras, L. M. Zhang, J. Bausch, A. W. Senior, T. Edlich, N. Shutty, V. Sivak, A. Bengtsson,et al., Scaling and logic in the color code on a superconducting quantum processor, Nature645, 614 (2025)

    2025

  5. [5]

    Caune, L

    L. Caune, L. Skoric, N. S. Blunt, A. Ruban, J. McDaniel, J. A. Valery, A. D. Patterson, A. V. Gramolin, J. Ma- janiemi, K. M. Barnes,et al., Demonstrating real-time and low-latency quantum error correction with supercon- ducting qubits, arXiv:2410.05202 (2024)

    Pith/arXiv arXiv 2024

  6. [6]

    Putterman, K

    H. Putterman, K. Noh, C. T. Hann, G. S. MacCabe, S. Aghaeimeibodi, R. N. Patel, M. Lee, W. M. Jones, H. Moradinejad, R. Rodriguez,et al., Hardware-efficient quantum error correction via concatenated bosonic qubits, Nature638, 927 (2025)

    2025

  7. [7]

    B. W. Reichardt, D. Aasen, R. Chao, A. Chernogu- zov, W. van Dam, J. P. Gaebler, D. Gresh, D. Luc- chetti, M. Mills, S. A. Moses, B. Neyenhuis, A. Paet- znick, A. Paz, P. E. Siegfried, M. P. da Silva, K. M. Svore, Z. Wang, and M. Zanner, Demonstration of quan- tum computation and error correction with a tesseract code, arXiv:2409.04628 (2024)

    Pith/arXiv arXiv 2024

  8. [8]

    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,et al., Logical quantum processor based on reconfigurable atom arrays, Nature626, 58 (2024)

    2024

  9. [9]

    B. W. Reichardt, A. Paetznick, D. Aasen, I. Basov, J. M. Bello-Rivas, P. Bonderson, R. Chao, W. van Dam, M. B. Hastings, R. V. Mishmash,et al., Fault-tolerant quantum computation with a neutral atom processor, arXiv:2411.11822 (2024)

    Pith/arXiv arXiv 2024

  10. [10]

    Bluvstein, A

    D. Bluvstein, A. A. Geim, S. H. Li, S. J. Evered, J. P. Bonilla Ataides, G. Baranes, A. Gu, T. Manovitz, M. Xu, M. Kalinowski,et al., A fault-tolerant neutral-atom ar- chitecture for universal quantum computation, Nature 649, 39 (2026)

    2026

  11. [11]

    Mathiot, E

    P. Mathiot, E. Garnaoui, A.-U. Leriche, E. Philip, B. Al- brecht, C. Briosne-Fr´ ejaville, L. Cardarelli, A. Cornil- lot, G. Cournez, L. Couturier,et al., Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor, arXiv:2605.21276 (2026)

    Pith/arXiv arXiv 2026

  12. [12]

    Eastin and E

    B. Eastin and E. Knill, Restrictions on transversal en- coded quantum gate sets, Phys. Rev. Lett.102, 110502 (2009)

    2009

  13. [14]

    Gottesman and I

    D. Gottesman and I. L. Chuang, Demonstrating the via- bility of universal quantum computation using teleporta- tion and single-qubit operations, Nature402, 390 (1999)

    1999

  14. [15]

    K. S. Chou, J. Z. Blumoff, C. S. Wang, P. C. Reinhold, C. J. Axline, Y. Y. Gao, L. Frunzio, M. H. Devoret, L. Jiang, and R. J. Schoelkopf, Deterministic teleporta- tion of a quantum gate between two logical qubits, Na- ture561, 368 (2018)

    2018

  15. [16]

    Yamamoto, Y

    K. Yamamoto, Y. Kikuchi, D. Amaro, B. Criger, S. Dilkes, C. Ryan-Anderson, A. Tranter, J. M. Dreil- ing, D. Gresh, C. Foltz, M. Mills, S. A. Moses, P. E. Siegfried, M. D. Urmey, J. J. Burau, A. Hankin, D. Luc- chetti, J. P. Gaebler, N. C. Brown, B. Neyenhuis, and D. M. Ramo, Quantum Error-Corrected Computation of Molecular Energies, PRX Quantum7, 020319 (2026)

    2026

  16. [17]

    F. Butt, I. Pogorelov, R. Freund, A. Steiner, M. Meyer, T. Monz, and M. M¨ uller, Demonstration of measurement- free universal logical quantum computation, Nat. Com- mun.17, 995 (2026)

    2026

  17. [18]

    Mayer, C

    K. Mayer, C. Ryan-Anderson, N. Brown, E. Durso- Sabina, C. H. Baldwin, D. Hayes, J. M. Dreiling, C. Foltz, J. P. Gaebler, T. M. Gatterman,et al., Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer, arXiv:2404.08616 (2024)

    Pith/arXiv arXiv 2024

  18. [19]

    Postler, S

    L. Postler, S. Heußen, I. Pogorelov, M. Rispler, T. Feld- ker, M. Meth, C. D. Marciniak, R. Stricker, M. Ring- bauer, R. Blatt,et al., Demonstration of fault-tolerant universal quantum gate operations, Nature605, 675 (2022)

    2022

  19. [20]

    P. S. Rodriguez, J. M. Robinson, P. N. Jepsen, Z. He, C. Duckering, C. Zhao, K.-H. Wu, J. Campo, K. Bagnall, M. Kwon,et al., Experimental demonstration of logical magic state distillation, Nature645, 620 (2025)

    2025

  20. [21]

    Bravyi and A

    S. Bravyi and A. Kitaev, Universal quantum computa- tion with ideal Clifford gates and noisy ancillas, Phys. Rev. A71, 022316 (2005)

    2005

  21. [22]

    Gidney, N

    C. Gidney, N. Shutty, and C. Jones, Magic state cul- tivation: Growing T states as cheap as CNOT gates, arXiv:2409.17595 (2024)

    Pith/arXiv arXiv 2024

  22. [23]

    Sahay, P.-K

    K. Sahay, P.-K. Tsai, K. Chang, Q. Su, T. B. Smith, S. Singh, and S. Puri, Fold-transversal surface code cul- tivation, arXiv:2509.05212 (2025)

    arXiv 2025

  23. [24]

    Rosenfeld, C

    E. Rosenfeld, C. Gidney, G. Roberts, A. Morvan, N. Lacroix, D. Kafri, J. Marshall, M. Li, V. Sivak, D. Abanin,et al., Magic state cultivation on a supercon- ducting quantum processor, arXiv:2512.13908 (2025)

    arXiv 2025

  24. [25]

    Bombin, Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes, New J

    H. Bombin, Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes, New J. Phys.17, 083002 (2015)

    2015

  25. [26]

    J. T. Anderson, G. Duclos-Cianci, and D. Poulin, Fault- tolerant conversion between the Steane and Reed-Muller quantum codes, Phys. Rev. Lett.113, 080501 (2014)

    2014

  26. [27]

    Kubica and M

    A. Kubica and M. E. Beverland, Universal transversal gates with color codes: A simplified approach, Phys. Rev. A91, 032330 (2015)

    2015

  27. [28]

    F. Butt, S. Heußen, M. Rispler, and M. M¨ uller, Fault- tolerant code-switching protocols for near-term quantum processors, PRX Quantum5, 020345 (2024)

    2024

  28. [29]

    Pogorelov, F

    I. Pogorelov, F. Butt, L. Postler, C. D. Marciniak, P. Schindler, M. M¨ uller, and T. Monz, Experimental fault-tolerant code switching, Nat. Phys.21, 298 (2025)

    2025

  29. [30]

    Daguerre, R

    L. Daguerre, R. Blume-Kohout, N. C. Brown, D. Hayes, and I. H. Kim, Experimental demonstration of high- fidelity logical magic states from code switching, Phys. Rev. X15, 041008 (2025). 14

    2025

  30. [31]

    A. Y. Kitaev, Quantum computations: algorithms and error correction, Russ. Math. Surv.52, 1191 (1997)

    1997

  31. [32]

    C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm, arXiv:quant-ph/0505030 (2005)

    Pith/arXiv arXiv 2005

  32. [33]

    Heußen and J

    S. Heußen and J. Hilder, Efficient fault-tolerant code switching via one-way transversal cnot gates, Quantum 9, 1846 (2025)

    2025

  33. [34]

    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, arXiv:2510.08552 (2025)

    arXiv 2025

  34. [35]

    Bombin and M.-A

    H. Bombin and M.-A. Martin-Delgado, Topological com- putation without braiding, Phys. Rev. Lett.98, 160502 (2007)

    2007

  35. [36]

    Bombin, R

    H. Bombin, R. W. Chhajlany, M. Horodecki, and M.- A. Martin-Delgado, Self-correcting quantum computers, New Journ. Phys.15, 055023 (2013)

    2013

  36. [37]

    Shepherd and M

    D. Shepherd and M. J. Bremner, Temporally unstruc- tured quantum computation, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sci- ences465, 1413 (2009)

    2009

  37. [38]

    Hangleiter, M

    D. Hangleiter, M. Kalinowski, D. Bluvstein, M. Cain, N. Maskara, X. Gao, A. Kubica, M. D. Lukin, and M. J. Gullans, Fault-tolerant compiling of classically hard in- stantaneous quantum polynomial circuits on hypercubes, PRX Quantum6, 020338 (2025)

    2025

  38. [39]

    Paletta, A

    L. Paletta, A. Leverrier, A. Sarlette, M. Mirrahimi, and C. Vuillot, Robust sparse iqp sampling in constant depth, Quantum8, 1337 (2024)

    2024

  39. [40]

    M. J. Bremner, A. Montanaro, and D. J. Shep- herd, Achieving quantum supremacy with sparse and noisy commuting quantum computations, Quantum1, 8 (2017)

    2017

  40. [41]

    S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara,et al., High-fidelity parallel entangling gates on a neutral-atom quantum computer, Nature622, 268 (2023)

    2023

  41. [42]

    T. J. Yoder, R. Takagi, and I. L. Chuang, Universal fault- tolerant gates on concatenated stabilizer codes, Phys. Rev. X6, 031039 (2016)

    2016

  42. [43]

    Ryan-Anderson, N

    C. Ryan-Anderson, N. Brown, M. Allman, B. Arkin, G. Asa-Attuah, C. Baldwin, J. Berg, J. Bohnet, S. Brax- ton, N. Burdick,et al., Implementing fault-tolerant en- tangling gates on the five-qubit code and the color code, arXiv:2208.01863 (2022)

    Pith/arXiv arXiv 2022

  43. [44]

    Kubica, B

    A. Kubica, B. Yoshida, and F. Pastawski, Unfolding the color code, New J. Phys.17, 083026 (2015)

    2015

  44. [45]

    F. Butt, L. Esser, and M. M¨ uller, Decoding three- dimensional color codes with boundaries, Phys. Rev. A 113, 042416 (2026)

    2026

  45. [46]

    Jochym-O’Connor and S

    T. Jochym-O’Connor and S. D. Bartlett, Stacked codes: Universal fault-tolerant quantum computation in a two- dimensional layout, Phys. Rev. A93, 022323 (2016)

    2016

  46. [47]

    A. M. Steane, Active stabilization, quantum computa- tion, and quantum state synthesis, Phys. Rev. Lett.78, 2252 (1997)

    1997

  47. [48]

    Goto, Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code, Sci

    H. Goto, Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code, Sci. Rep.6, 19578 (2016)

    2016

  48. [49]

    Chao and B

    R. Chao and B. W. Reichardt, Fault-tolerant quantum computation with few qubits, npj Quant. Inf.4, 42 (2018)

    2018

  49. [50]

    E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature549, 172 (2017)

    2017

  50. [51]

    Howard and E

    M. Howard and E. Campbell, Application of a resource theory for magic states to fault-tolerant quantum com- puting, Phys. Rev. Lett.118, 090501 (2017)

    2017

  51. [52]

    T. J. Yoder, Universal fault-tolerant quantum computa- tion with Bacon-Shor codes, arXiv:1705.01686 (2017)

    Pith/arXiv arXiv 2017

  52. [53]

    Lin and G

    C. Lin and G. Yang, Concatenated pieceable fault- tolerant scheme for universal quantum computation, Phys. Rev. A102, 052415 (2020)

    2020

  53. [54]

    Takagi, T

    R. Takagi, T. J. Yoder, and I. L. Chuang, Error rates and resource overheads of encoded three-qubit gates, Phys. Rev. A96, 042302 (2017)

    2017

  54. [55]

    Huang, K

    S. Huang, K. R. Brown, and M. Cetina, Comparing Shor and Steane error correction using the Bacon-Shor code, Sci. Adv.10, eadp2008 (2024)

    2024

  55. [56]

    Aliferis, D

    P. Aliferis, D. Gottesman, and J. Preskill, Quantum accu- racy threshold for concatenated distance-3 codes, arXiv quant-ph/0504218 (2005)

    Pith/arXiv arXiv 2005

  56. [57]

    A. W. Cross, D. P. Divincenzo, and B. M. Terhal, A com- parative code study for quantum fault tolerance, Quan- tum Info. Comput.9, 541–572 (2009)

    2009

  57. [58]

    Guti´ errez and K

    M. Guti´ errez and K. R. Brown, Comparison of a quan- tum error-correction threshold for exact and approximate errors, Phys. Rev. A91, 022335 (2015)

    2015

  58. [59]

    H. Zhou, C. Zhao, M. Cain, D. Bluvstein, N. Maskara, C. Duckering, H.-Y. Hu, S.-T. Wang, A. Kubica, and M. D. Lukin, Low-overhead transversal fault tolerance for universal quantum computation, Nature646, 303 (2025)

    2025

  59. [60]

    Serra-Peralta, M

    M. Serra-Peralta, M. H. Shaw, and B. M. Terhal, Decod- ing across transversal Clifford gates in the surface code, PRX Quantum7, 010335 (2026)

    2026

  60. [61]

    H¨ affner, C

    H. H¨ affner, C. F. Roos, and R. Blatt, Quantum comput- ing with trapped ions, Phys. Rep.469, 155 (2008)

    2008

  61. [62]

    Preskill, Reliable quantum computers, Proceedings of the Royal Society of London

    J. Preskill, Reliable quantum computers, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences454, 385 (1998)

    1998

  62. [63]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado, Topological quan- tum distillation, Phys. Rev. Lett.97, 180501 (2006)

    2006

  63. [64]

    Postler, F

    L. Postler, F. Butt, I. Pogorelov, C. D. Marciniak, S. Heußen, R. Blatt, P. Schindler, M. Rispler, M. M¨ uller, and T. Monz, Demonstration of fault-tolerant Steane quantum error correction, PRX Quantum5, 030326 (2024)

    2024

  64. [65]

    A. J. Landahl, J. T. Anderson, and P. R. Rice, Fault-tolerant quantum computing with color codes, arXiv:1108.5738 (2011)

    Pith/arXiv arXiv 2011