Pith. sign in

REVIEW 2 major objections 5 minor 3 cited by

Almost-good quantum LDPC and locally testable codes can carry nontrivial transversal multi-controlled-Z gates while keeping near-optimal parameters.

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-13 14:09 UTC pith:L3DPHDFE

load-bearing objection First simultaneous near-optimal qLDPC/qLTC parameters plus transversal multi-controlled-Z, via covering lifts of cup products and a new two-way product-expanding punctured-RS lemma; existence holds, practical caveats remain. the 2 major comments →

arxiv 2604.01874 v2 pith:L3DPHDFE submitted 2026-04-02 quant-ph cs.ITmath-phmath.ITmath.MP

Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes

Yiming Li , Zimu Li , Zi-Wen Liu This is my paper
classification quant-ph cs.ITmath-phmath.ITmath.MP
keywords quantum LDPC codesquantum locally testable codestransversal non-Clifford gatesmulti-controlled-Zsheaf codescup productsproduct-expanding codescovering spaces
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.

The paper shows that quantum low-density parity-check codes and quantum locally testable codes with nearly optimal size, rate, and distance can support fault-tolerant non-Clifford gates implemented by constant-depth transversal multi-controlled-Z circuits. The construction works by lifting cohomological invariants (built from cup products on sheaf codes) from simpler hypergraph-product codes via covering-space maps, so that the same logical action appears on the almost-good codes. To keep both the gate nontrivial and the code parameters intact, the authors prove that certain carefully punctured Reed–Solomon codes are two-way product-expanding; those local codes serve as the coefficients of the sheaves. The result is the first simultaneous achievement of near-optimal parameters, LDPC structure, and transversal non-Clifford gates. A sympathetic reader cares because non-Clifford gates dominate the cost of universal fault-tolerant computation, and the algebraic method is general enough to apply to future sheaf-code constructions as well.

Core claim

For every integer r greater than or equal to 2 there exist families of quantum LDPC codes with parameters [[N, Θ(N), Θ(N/(log N)^{r-1})]] and quantum locally testable codes with parameters [[N, Θ(N), Θ(N/(log N)^{2r-1})]] and soundness Θ(1/(log N)^{2r-1}) that admit nontrivial transversal logical C^{r-1}Z gates. The gates are induced by sparse cohomological invariant forms obtained from cup products on the sheaves; nontriviality of those forms is certified by the existence of two-way product-expanding punctured Reed–Solomon local codes.

What carries the argument

Covering-space lift of cup-product cohomological invariant forms on sheaf codes, made nontrivial and parameter-preserving by two-way product-expanding punctured Reed–Solomon local codes.

Load-bearing premise

The proof that randomly punctured Reed–Solomon codes over large enough fields are two-way product-expanding at constant rate, which is needed both to keep the global codes almost-good and to guarantee a nonzero top-degree cup product.

What would settle it

Exhibit an explicit family of evaluation sets for which the associated punctured Reed–Solomon codes fail to be two-way product-expanding, or show that every such family yields a vanishing cup product on the lifted sheaf complex, collapsing the nontriviality claim of Theorem 1.1.

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

If this is right

  • Nearly optimal qLDPC codes can now host the non-Clifford gates that dominate the cost of universal fault-tolerant computation.
  • The same covering-space and cup-product method applies immediately to any future sheaf-code construction of good quantum LTCs.
  • Constant-depth multi-controlled-Z circuits become available on codes whose distance and soundness are only polylogarithmically below optimal.
  • The two-way product-expansion property of punctured Reed–Solomon codes can be reused as a black-box ingredient in other high-dimensional coding arguments.

Where Pith is reading between the lines

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

  • Once good (rather than almost-good) quantum LTCs are built from cell complexes and sheaves, the same algebraic lift should give them transversal multi-controlled-Z gates with no extra loss of parameters.
  • The constant-rate bottleneck that currently forces one of the code blocks to have only constantly many logical qubits may be removable by importing recent low-local-rate Tanner constructions into the sheaf setting.
  • Addressability and parallelizability of the logical gates remain open; sharper lower bounds on the number of independent logical C^{r-1}Z factors would turn the existence proof into a concrete resource estimate for fault-tolerant architectures.

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

2 major / 5 minor

Summary. The paper proves that for any integer r≥2 there exist almost-good qLDPC codes [[N,Θ(N),Θ(N/(log N)^{r-1})]] and qLTCs [[N,Θ(N),Θ(N/(log N)^{2r-1})]] with soundness Θ(1/(log N)^{2r-1}) that support nontrivial transversal logical C^{r-1}Z gates (Theorem 1.1). The argument lifts cup-product cohomological invariants from sheaved hypergraph-product codes to the almost-good sheaf codes of Dinur–Lin–Vidick via covering maps (Sec. 5), after establishing the existence of two-way product-expanding punctured Reed–Solomon local codes (Theorem 1.2, Sec. 4) that both preserve the almost-good parameters and guarantee a nonzero top-degree pairing. Cup and cap products are defined on general cell complexes via barycentric subdivision (Sec. 3), and the prior erroneous cap-product construction is removed.

Significance. If correct, this is the first simultaneous realization of nearly optimal qLDPC/qLTC parameters with fault-tolerant non-Clifford gates, resolving a long-standing obstruction noted in the introduction. The covering-space framework and the two-way product-expansion result for punctured RS codes are of independent interest and are developed with substantial algebraic detail (Leibniz rules after subdivision, extendability of ϵ-closed sets in 2D/3D, compatibility of transfer maps with cup products). The correction of the v1 gap and the explicit nonzero pairing (Eqs. 5.65–5.67) strengthen the contribution. The enormous field-size lower bound and the constant-logical-qubit blocks are practical limitations but do not negate the asymptotic existence claim.

major comments (2)
  1. Theorem 1.1 and Sec. 5.3: the stated [[N,Θ(N),…]] parameters for codes supporting C^{r-1}Z are realized by a multi-block system in which one (or more) of the CSS blocks has only k=Ω(1) logical qubits while another has k=Θ(N). The combined rate remains Θ(1), which is consistent with the theorem’s wording, but the manuscript should state the per-block parameters explicitly in Theorem 1.1 (or a corollary) so that the multi-block nature of the gate is unambiguous and the claim of “nontrivial” action is not misread as a single-block transversal gate with full rate.
  2. Sec. 4.2, Lemma 4.7 and the degree bound (4.75): the 3D peeling/interpolation argument is load-bearing for product expansion when t≥3 and is combinatorially dense (dense/sparse lines, high-order peeling, cross terms). While the inequalities appear to close for sufficiently small ϵ(ν), a short high-level roadmap that isolates the critical degree comparisons (e.g., (4.99)–(4.104) versus (4.75)) would make independent verification substantially easier and reduce the risk of an overlooked degree overflow.
minor comments (5)
  1. Abstract and Theorem 1.1: the tilde-Θ notation for distance/soundness is used inconsistently with the explicit polylog factors appearing later; align the abstract statement with the precise exponents of Theorem 1.1.
  2. Sec. 2.2: the restriction to characteristic 2 is justified for product expansion, but a one-sentence reminder that the final qubit realization proceeds by restriction of scalars (citing [43,61]) would help readers outside coding theory.
  3. Sec. 5.1: the assumption that the covering degree ℓ is odd (so that transfer maps remain injective over F_q of char 2) is used crucially; note briefly that the constructions of [18] admit odd-order groups H.
  4. Discussion (Sec. 6): the open problem of lower-bounding the subrank k_{C^{r-1}Z} is well posed; a pointer to the constant-k bottleneck as the immediate obstacle would make the outlook more actionable.
  5. Typographical: occasional missing spaces after punctuation and a few long displayed equations that break across pages (e.g., the interpolation formula (4.84)) could be tightened for readability.

Circularity Check

1 steps flagged

Minor non-load-bearing self-citation of concurrent cohomological framework; central existence of product-expanding RS codes and lifted cup-product gates are independently proved via Schwartz–Zippel and explicit pairings.

specific steps
  1. self citation load bearing [Abstract and §1 (Introduction and main results)]
    "Building on insights from [Li et al., arXiv:2603.25831], we develop a general covering space framework for constructing and computing a rich family of cohomological invariant forms on sheaf codes that induce transversal logical multi-controlled-Z. ... Our results establish Conjecture 1.2 in Ref. [9]."

    The cohomological-invariant and covering-space methodology is justified by citation to concurrent/prior work by the same authors (arXiv:2603.25831 and [9]). While the present paper re-derives the needed cup-product and covering compatibility statements (Secs. 3 and 5.1) and supplies the new product-expansion ingredient, the central premise that such forms exist and lift nontrivially rests in part on that self-citation rather than a fully external foundation. The citation is not load-bearing for the final existence claim (which is independently verified by the RS construction and explicit pairing), so the circularity is minor.

full rationale

The derivation chain for Theorem 1.1 is self-contained: almost-good base codes are taken from independent work [18]; two-way product expansion (Theorem 1.2) is proved from first principles via ϵ-closed extendability (Lemmas 4.1–4.8, Corollaries 4.3/4.8/4.10–4.11) and Schwartz–Zippel on Vandermonde minors over large fields, with no fitted parameters; covering-map compatibility of cup products (Props. 5.2–5.5) and the nonzero top-degree pairing (Eqs. 5.65–5.67) are derived explicitly in this manuscript. The sole self-citation of the concurrent arXiv:2603.25831 (and related [9]) supplies the cohomological-invariant methodology and a conjecture that is resolved here, but is not used as an unverified uniqueness theorem or definitional premise that forces the result. No self-definitional loop, fitted-as-prediction, or renaming occurs. Score 2 reflects only the normal self-citation of concurrent structural tools.

Axiom & Free-Parameter Ledger

3 free parameters · 6 axioms · 2 invented entities

The paper rests on standard algebraic topology and coding theory plus the existence of almost-good sheaf codes from prior literature. The only ad-hoc ingredients are the rate bounds ν_i and the ϵ thresholds needed for product expansion; these are free parameters of the construction, not fitted to data. No new physical entities are postulated.

free parameters (3)
  • local rates ν_i ∈ (0,1)
    Chosen by hand (with ν_i ≤ 1/2 or ≤ 1/(2r) for dual/Schur-product cases) to make product expansion and Schur-product dimension constraints hold; they determine the final distance and soundness polylog factors.
  • product-expansion ϵ(ν,t)
    Solved from inequalities such as (4.21) and (4.75) so that ϵ-closed sets remain extendable; enters the lower bound ρ ≥ ϵ^t / (t(2^t+1)^t).
  • field-size lower bound q > 2^{t n^t}
    Required for the Schwartz–Zippel argument that random evaluation sets make all relevant minors nonzero; asymptotic existence only.
axioms (6)
  • domain assumption Existence of almost-good qLDPC and qLTC sheaf codes on high-dimensional cubical complexes (Dinur–Lin–Vidick and related constructions).
    Invoked throughout Sec. 5 as the base codes to which covering maps and cup products are applied; parameters of Theorem 1.1 inherit their polylog losses from these constructions.
  • standard math Leibniz rule for cup products on sheaved cell complexes after barycentric subdivision, independent of choice of approximate inverse on cohomology.
    Proved in Sec. 3 following standard algebraic topology (cf. Curry, Spanier); used to guarantee that the multi-linear form is a cohomological invariant.
  • standard math Covering maps of cell posets induce chain maps compatible with cup products and transfer maps (Propositions 5.2–5.5).
    Standard covering-space algebra adapted to Alexandrov topology; lifts nontrivial pairings from HGP codes to almost-good codes.
  • domain assumption ϵ-closed sets that are inner-generated for dual tensor products yield constant product-expansion factor (Kalachev–Panteleev).
    Lemma 2.22 cited from [54]; converts the extendability proofs of Sec. 4 into the ρ lower bounds of Theorem 1.2.
  • domain assumption Characteristic-2 finite fields and restriction of scalars to F_2 for CSS parameters.
    Stated in Sec. 2.2; needed for product-expansion literature and for realizing multi-qubit gates on qubits.
  • ad hoc to paper Odd-sheeted covering (ℓ odd) so that transfer maps remain injective over F_q of char 2.
    Used in Sec. 5.2–5.3 to keep lifted (co)homology classes nontrivial; a modeling choice of the geometric construction.
invented entities (2)
  • Two-way product-expanding punctured Reed–Solomon codes no independent evidence
    purpose: Serve as local codes that simultaneously expand under dual tensor products and admit nontrivial Schur-product multi-orthogonality, preserving almost-good parameters while making cup products nonzero.
    Existence is proved probabilistically in Sec. 4; no independent experimental handle, but the statement is a pure mathematical existence claim with explicit ϵ bounds.
  • Cohomological invariant forms inducing transversal C^{r-1}Z on sheaf codes via covering lifts no independent evidence
    purpose: Systematically produce sparse multi-linear forms on code spaces that are constant on cohomology classes and therefore define logical multi-controlled-Z circuits.
    Builds on the authors’ prior cohomological framework; the covering-space formulation and the explicit nonzero pairings for almost-good codes are new applications.

pith-pipeline@v1.1.0-grok45 · 52592 in / 4080 out tokens · 36819 ms · 2026-07-13T14:09:23.250089+00:00 · methodology

0 comments
read the original abstract

We exhibit nontrivial transversal logical multi-controlled-$Z$ gates on $[\![N,\Theta(N),\tilde\Theta(N)]\!]$ quantum low-density parity-check (qLDPC) codes with soundness $\tilde\Theta(1)$, combining nearly optimal code parameters with fault-tolerant non-Clifford gates on qLDPC and quantum locally testable codes for the first time. Remarkably, our proofs proceed through highly general algebraic arguments. Building on insights from [Li et al.,~arXiv:2603.25831], we develop a general covering space framework for constructing and computing a rich family of cohomological invariant forms on sheaf codes that induce transversal logical multi-controlled-$Z$. To certify their nontriviality, we further demonstrate the existence of two-way product-expanding punctured Reed--Solomon codes, which is striking in light of the many negative examples for the product expansion behavior of ordinary Reed--Solomon codes. This approach directly overcomes the previous obstruction to realizing nontrivial logical operations while simultaneously preserving the code parameters. The claimed almost-good code results follow immediately as examples.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. Finding diagonal logical gates in CSS codes and circuits

    quant-ph 2026-07 conditional novelty 7.0

    Diagonal logical gates of a CSS code or circuit are exactly the kernel of a pullback map on phase functions, and that kernel can be computed in cubic time.

  2. Quantum Codes with Transversal $CCZ$ Gates and Sublinear $Z$-Stabilizers

    cs.IT 2026-06 unverdicted novelty 6.0

    Explicit CSS quantum codes with transversal CCZ, [[N, Θ(N), Ω(N^{1/m})]] parameters for m≥3, sublinear Z-stabilizer generators, extended to fixed prime fields with near-linear dimension and n^{1/m} distance up to poly...

  3. Quantum Codes with Transversal $CCZ$ Gates and Sublinear $Z$-Stabilizers

    cs.IT 2026-06 accept novelty 6.0

    Algebraic expander codes plus a refined puncturing theorem yield CSS codes with transversal CCZ, linear dimension, polynomial distance, and explicit sublinear-weight Z-stabilizer generators.

Reference graph

Works this paper leans on

75 extracted references · 19 canonical work pages · cited by 2 Pith papers · 1 internal anchor

  1. [1]

    Fault-Tolerant Quantum Computation with Constant Overhead,

    D. Gottesman, “Fault-Tolerant Quantum Computation with Constant Overhead,” Oct. 2013. arXiv:1310.2984 [quant-ph]

    Pith/arXiv arXiv 2013

  2. [2]

    Constant overhead quantum fault-tolerance with quantum expander codes,

    O. Fawzi, A. Grospellier, and A. Leverrier, “Constant overhead quantum fault-tolerance with quantum expander codes,” in2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, pp. 743–754.DOI:10.1109/FOCS.2018.00076

    work page doi:10.1109/focs.2018.00076 2018

  3. [3]

    Time-efficient constant-space-overhead fault-tolerant quantum computation,

    H. Yamasaki and M. Koashi, “Time-efficient constant-space-overhead fault-tolerant quantum computation,”Nature Physics, vol. 20, no. 2, pp. 247–253, Jan. 2024,ISSN: 1745-2481.DOI: 10. 1038 / s41567 - 023 - 02325 - 8[Online]. Available: http : / / dx . doi . org / 10 . 1038 / s41567-023-02325-8

    2024

  4. [4]

    Polylog-time- and constant-space-overhead fault- tolerant quantum computation with quantum low-density parity-check codes,

    S. Tamiya, M. Koashi, and H. Yamasaki, “Polylog-time- and constant-space-overhead fault- tolerant quantum computation with quantum low-density parity-check codes,”Nature Physics, vol. 22, no. 1, pp. 27–32, Nov. 2025,ISSN: 1745-2481.DOI: 10.1038/s41567-025-03102-5 [Online]. Available:https://doi.org/10.1038/s41567-025-03102-5

    work page doi:10.1038/s41567-025-03102-5 2025

  5. [5]

    Quantum fault tolerance with constant-space and logarithmic- time overheads,

    Q. T. Nguyen and C. A. Pattison, “Quantum fault tolerance with constant-space and logarithmic- time overheads,” inProceedings of the 57th Annual ACM Symposium on Theory of Computing, ser. STOC ’25, Prague, Czechia: Association for Computing Machinery, 2025, pp. 730–737,ISBN: 9798400715105.DOI: 10.1145/3717823.3718318 [Online]. Available: https://doi.org/ ...

    doi:10.1145/3717823.3718318 2025

  6. [6]

    Z2-systolic freedom and quantum codes,

    M. H. Freedman, D. A. Meyer, and F. Luo, “Z2-systolic freedom and quantum codes,” in Mathematics of Quantum Computation, Chapman and Hall/CRC, Feb. 2002, pp. 303–338.DOI: 10.1201/9781420035377-13 [Online]. Available: https://www.taylorfrancis.com/ chapters/edit/10.1201/9781420035377- 13/z2- systolic- freedom- quantum- codes-michael-freedman-david-meyer-feng-luo

    work page doi:10.1201/9781420035377-13 2002

  7. [7]

    Bravyi and M

    S. Bravyi and M. B. Hastings,Homological product codes, 2013. arXiv: 1311.0885 [quant-ph]. [Online]. Available:https://arxiv.org/abs/1311.0885

    Pith/arXiv arXiv 2013

  8. [8]

    Freedman and M

    M. Freedman and M. B. Hastings,Building manifolds from quantum codes, 2021.DOI: 10.1007/ s00039-021-00567-3 [Online]. Available: https://doi.org/10.1007/s00039-021- 00567-3

    work page doi:10.1007/s00039-021- 2021

  9. [9]

    Y. Li, Z. Li, Z.-W. Liu, and Q. T. Nguyen,Poincaré duality and multiplicative structures on quantum codes, 2025. arXiv: 2512.21922 [quant-ph] . [Online]. Available: https://arxiv.org/ abs/2512.21922

    arXiv 2025

  10. [10]

    Z. Li, Y. Shao, F. Wei, Y. Li, and Z.-W. Liu,Theory of (co)homological invariants on quantum ldpc codes, 2026. arXiv: 2603.25831 [quant-ph] . [Online]. Available: https://arxiv.org/ abs/2603.25831

    arXiv 2026

  11. [11]

    The physics of (good) LDPC codes i. gauging and dualities,

    T. Rakovszky and V . Khemani, “The physics of (good) LDPC codes i. gauging and dualities,” arXiv preprint arXiv:2310.16032, 2023. arXiv:2310.16032 [quant-ph]

    Pith/arXiv arXiv 2023

  12. [12]

    Low-density parity-check stabilizer codes as gapped quantum phases: Stability under graph-local perturbations,

    W. De Roeck, V . Khemani, Y. Li, N. O’Dea, and T. Rakovszky, “Low-density parity-check stabilizer codes as gapped quantum phases: Stability under graph-local perturbations,”PRX Quantum, vol. 6, p. 030 330, 3 Aug. 2025.DOI: 10 . 1103 / 7x71 - 8j7k[Online]. Available: https://link.aps.org/doi/10.1103/7x71-8j7k

    work page doi:10.1103/7x71-8j7k 2025

  13. [13]

    Low-density parity-check codes as stable phases of quantum matter,

    C. Yin and A. Lucas, “Low-density parity-check codes as stable phases of quantum matter,” PRX Quantum, vol. 6, p. 030 329, 3 Aug. 2025.DOI: 10.1103/361k-nj4b [Online]. Available: https://link.aps.org/doi/10.1103/361k-nj4b

    work page doi:10.1103/361k-nj4b 2025

  14. [14]

    The quantum PCP conjecture,

    D. Aharonov, I. Arad, and T. Vidick, “The quantum PCP conjecture,”SIGACT News, vol. 44, no. 2, pp. 47–79, 2013.DOI: 10.1145/2491533.2491549 [Online]. Available: https://doi. org/10.1145/2491533.2491549

    doi:10.1145/2491533.2491549 2013

  15. [15]

    Eldar and A

    L. Eldar and A. W. Harrow,Local hamiltonians whose ground states are hard to approximate, 2016.DOI: https://doi.org/10.1109/FOCS.2017.46 arXiv: 1510.02082 [quant-ph]. [Online]. Available:https://arxiv.org/abs/1510.02082

    Pith/arXiv arXiv doi:10.1109/focs.2017.46 2016

  16. [16]

    Nlts hamiltonians from good quantum codes,

    A. Anshu, N. P . Breuckmann, and C. Nirkhe, “Nlts hamiltonians from good quantum codes,” inProceedings of the 55th Annual ACM Symposium on Theory of Computing, ser. STOC ’23, ACM, Jun. 2023, pp. 1090–1096.DOI: 10 . 1145 / 3564246 . 3585114 [Online]. Available: http : //dx.doi.org/10.1145/3564246.3585114

    doi:10.1145/3564246.3585114 2023

  17. [17]

    Quantum Locally Testable Codes

    D. Aharonov and L. Eldar, “Quantum locally testable codes,”SIAM Journal on Computing, vol. 44, no. 5, pp. 1230–1262, 2015.DOI:10.1137/140975498arXiv:1310.5664 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1137/140975498arxiv:1310.5664 2015

  18. [18]

    Expansion of high-dimensional cubical complexes: With ap- plication to quantum locally testable codes,

    I. Dinur, T.-C. Lin, and T. Vidick, “Expansion of high-dimensional cubical complexes: With ap- plication to quantum locally testable codes,” in2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, pp. 379–385.DOI:10.1109/FOCS61266.2024.00031

    doi:10.1109/focs61266.2024.00031 2024

  19. [19]

    Asymptotically good quantum and locally testable classical ldpc codes,

    P . Panteleev and G. Kalachev, “Asymptotically good quantum and locally testable classical ldpc codes,” inProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, ser. STOC 2022, Rome, Italy: Association for Computing Machinery, 2022, pp. 375–388,ISBN: 9781450392648.DOI: 10.1145/3519935.3520017 [Online]. Available: https://doi.org/ 10.1...

    doi:10.1145/3519935.3520017 2022

  20. [20]

    Quantum tanner codes,

    A. Leverrier and G. Zémor, “Quantum tanner codes,” in2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, pp. 872–883.DOI: 10.1109/FOCS54457.2022. 00117 44

    doi:10.1109/focs54457.2022 2022

  21. [21]

    Good quantum ldpc codes with linear time de- coders,

    I. Dinur, M.-H. Hsieh, T.-C. Lin, and T. Vidick, “Good quantum ldpc codes with linear time de- coders,” inProceedings of the 55th Annual ACM Symposium on Theory of Computing, ser. STOC 2023, Orlando, FL, USA: Association for Computing Machinery, 2023, pp. 905–918,ISBN: 9781450399135. DOI: 10 . 1145 / 3564246 . 3585101[Online]. Available: https : / / doi ....

    arXiv 2023

  22. [22]

    Lin and M.-H

    T.-C. Lin and M.-H. Hsieh,Good quantum ldpc codes with linear time decoder from lossless expanders,

  23. [23]

    [Online]

    arXiv: 2203.03581 [quant-ph] . [Online]. Available: https://arxiv.org/abs/ 2203.03581

    Pith/arXiv arXiv

  24. [24]

    Limitations on transversal gates for hypergraph product codes,

    S. Burton and D. Browne, “Limitations on transversal gates for hypergraph product codes,”IEEE Transactions on Information Theory, vol. 68, no. 3, pp. 1772–1781, 2022.DOI: 10.1109/TIT.2021. 3131043

    doi:10.1109/tit.2021 2022

  25. [25]

    E. X. Fu, H. Zheng, Z. Li, and Z.-W. Liu,No-go theorems for logical gates on product quantum codes,

  26. [26]

    [Online]

    arXiv: 2507.16797 [quant-ph] . [Online]. Available: https://arxiv.org/abs/ 2507.16797

    arXiv

  27. [27]

    Topological computation without braiding,

    H. Bombin and M. A. Martin-Delgado, “Topological computation without braiding,”Physical Review Letters, vol. 98, no. 16, Apr. 2007,ISSN: 1079-7114.DOI: 10.1103/physrevlett.98. 160502[Online]. Available:http://dx.doi.org/10.1103/PhysRevLett.98.160502

    doi:10.1103/physrevlett.98 2007

  28. [28]

    Structure of 2d topological stabilizer codes,

    H. Bombín, “Structure of 2d topological stabilizer codes,”Communications in Mathematical Physics, vol. 327, no. 2, pp. 387–432, Mar. 2014,ISSN: 1432-0916.DOI: 10.1007/s00220-014-1893-4 [Online]. Available:http://dx.doi.org/10.1007/s00220-014-1893-4

    doi:10.1007/s00220-014-1893-4 2014

  29. [29]

    Bombín,Gauge color codes: Optimal transversal gates and gauge fixing in topological stabilizer codes, 2015

    H. Bombín,Gauge color codes: Optimal transversal gates and gauge fixing in topological stabilizer codes, 2015. arXiv: 1311.0879 [quant-ph]. [Online]. Available: https://arxiv.org/abs/ 1311.0879

    Pith/arXiv arXiv 2015

  30. [30]

    Universal transversal gates with color codes: A simplified ap- proach,

    A. Kubica and M. E. Beverland, “Universal transversal gates with color codes: A simplified ap- proach,”Physical Review A, vol. 91, no. 3, Mar. 2015,ISSN: 1094-1622.DOI: 10.1103/physreva. 91.032330[Online]. Available:http://dx.doi.org/10.1103/PhysRevA.91.032330

    doi:10.1103/physreva 2015

  31. [31]

    T. R. Scruby, A. Pesah, and M. Webster,Quantum rainbow codes: Achieving linear rate, growing distance and transversal non-clifford gates with generalised colour codes, 2025. arXiv: 2408.13130 [quant-ph]. [Online]. Available:https://arxiv.org/abs/2408.13130

    arXiv 2025

  32. [32]

    Codimension- 2 defects and higher symmetries in (3+1)D topological phases,

    M. Barkeshli, Y.-A. Chen, S.-J. Huang, R. Kobayashi, N. Tantivasadakarn, and G. Zhu, “Codimension- 2 defects and higher symmetries in (3+1)D topological phases,”SciPost Phys., vol. 14, p. 065, 2023. DOI: 10.21468/SciPostPhys.14.4.065 [Online]. Available: https://scipost.org/ 10.21468/SciPostPhys.14.4.065

    doi:10.21468/scipostphys.14.4.065 2023

  33. [33]

    Higher cup products on hypercubic lattices: Application to lattice models of topological phases,

    Y.-A. Chen and S. Tata, “Higher cup products on hypercubic lattices: Application to lattice models of topological phases,”Journal of Mathematical Physics, vol. 64, no. 9, Sep. 2023,ISSN: 1089-7658.DOI: 10.1063/5.0095189 [Online]. Available: http://dx.doi.org/10.1063/ 5.0095189

    doi:10.1063/5.0095189 2023

  34. [34]

    Non-clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum low- density parity-check codes via higher symmetries,

    G. Zhu, S. Sikander, E. Portnoy, A. W. Cross, and B. J. Brown, “Non-clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum low- density parity-check codes via higher symmetries,”PRX Quantum, vol. 6, p. 040 361, 4 Dec. 2025. DOI: 10.1103/wcxs-w69t [Online]. Available: https://link.aps.org/doi/10.11...

    work page doi:10.1103/wcxs-w69t 2025

  35. [35]

    Lin,Transversal non-clifford gates for quantum ldpc codes on sheaves, 2024

    T.-C. Lin,Transversal non-clifford gates for quantum ldpc codes on sheaves, 2024. arXiv: 2410.14631 [quant-ph]. [Online]. Available:https://arxiv.org/abs/2410.14631

    Pith/arXiv arXiv 2024

  36. [36]

    N. P . Breuckmann, M. Davydova, J. N. Eberhardt, and N. Tantivasadakarn,Cups and gates i: Cohomology invariants and logical quantum operations, 2024. arXiv: 2410.16250 [quant-ph] . [Online]. Available:https://arxiv.org/abs/2410.16250

    Pith/arXiv arXiv 2024

  37. [37]

    Tiew and N

    R. Tiew and N. P . Breuckmann,Copy-cup gates in tensor products of group algebra codes, 2026. arXiv: 2602.23307 [quant-ph]. [Online]. Available:https://arxiv.org/abs/2602.23307 45

    arXiv 2026

  38. [38]

    Zhu,A topological theory for qldpc: Non-clifford gates and magic state fountain on homological product codes with constant rate and beyond the N 1/3 distance barrier, 2025

    G. Zhu,A topological theory for qldpc: Non-clifford gates and magic state fountain on homological product codes with constant rate and beyond the N 1/3 distance barrier, 2025. arXiv: 2501.19375 [quant-ph]. [Online]. Available:https://arxiv.org/abs/2501.19375

    arXiv 2025

  39. [39]

    Zhu,Transversal non-clifford gates on qldpc codes breaking the √ N distance barrier and quantum- inspired geometry with Z2 systolic freedom, 2025

    G. Zhu,Transversal non-clifford gates on qldpc codes breaking the √ N distance barrier and quantum- inspired geometry with Z2 systolic freedom, 2025. arXiv: 2507 . 15056 [quant-ph]. [Online]. Available:https://arxiv.org/abs/2507.15056

    Pith/arXiv arXiv 2025

  40. [40]

    Geometric structure and transversal logic of quantum reed–muller codes,

    A. Barg, N. J. Coble, D. Hangleiter, and C. Kang, “Geometric structure and transversal logic of quantum reed–muller codes,”IEEE Transactions on Information Theory, vol. 72, no. 1, pp. 415– 436, Jan. 2026,ISSN: 1557-9654.DOI: 10 . 1109 / tit . 2025 . 3592631[Online]. Available: http://dx.doi.org/10.1109/TIT.2025.3592631

    work page doi:10.1109/tit.2025.3592631 2026

  41. [41]

    Coxeter codes: Extending the reed–muller family,

    N. J. Coble and A. Barg, “Coxeter codes: Extending the reed–muller family,”Designs, Codes and Cryptography, vol. 94, no. 2, Feb. 2026,ISSN: 1573-7586.DOI: 10.1007/s10623-025-01749-y [Online]. Available:http://dx.doi.org/10.1007/s10623-025-01749-y

    work page doi:10.1007/s10623-025-01749-y 2026

  42. [42]

    Gulshen and T

    K. Gulshen and T. Kaufman,Symmetric self-dual quantum codes on high dimensional expanders, 2026. arXiv: 2510.07864 [quant-ph] . [Online]. Available: https://arxiv.org/abs/2510. 07864

    arXiv 2026

  43. [43]

    Good binary quantum codes with transversal ccz gate,

    Q. T. Nguyen, “Good binary quantum codes with transversal ccz gate,” inProceedings of the 57th Annual ACM Symposium on Theory of Computing, ser. STOC ’25, Prague, Czechia: Association for Computing Machinery, 2025, pp. 697–706,ISBN: 9798400715105.DOI: 10.1145/3717823. 3718186[Online]. Available:https://doi.org/10.1145/3717823.3718186

    doi:10.1145/3717823 2025

  44. [44]

    Constant-overhead magic state distillation,

    A. Wills, M.-H. Hsieh, and H. Yamasaki, “Constant-overhead magic state distillation,”Nature Physics, Sep. 2025,ISSN: 1745-2481.DOI: 10.1038/s41567-025-03026-0 [Online]. Available: https://doi.org/10.1038/s41567-025-03026-0

    work page doi:10.1038/s41567-025-03026-0 2025

  45. [45]

    Z. He, V . Vaikuntanathan, A. Wills, and R. Y. Zhang,Quantum codes with addressable and transversal non-clifford gates, 2025. arXiv:2502.01864 [quant-ph]. [Online]. Available:https://arxiv. org/abs/2502.01864

    Pith/arXiv arXiv 2025

  46. [46]

    Quantum ldpc codes with transversal non-clifford gates via products of algebraic codes,

    L. Golowich and T.-C. Lin, “Quantum ldpc codes with transversal non-clifford gates via products of algebraic codes,” ser. STOC ’25, Prague, Czechia: Association for Computing Machinery, 2025, pp. 689–696,ISBN: 9798400715105.DOI: 10 . 1145 / 3717823 . 3718139[Online]. Available: https://doi.org/10.1145/3717823.3718139

    doi:10.1145/3717823.3718139 2025

  47. [47]

    Asymptotically good quantum codes with transversal non- clifford gates,

    L. Golowich and V . Guruswami, “Asymptotically good quantum codes with transversal non- clifford gates,” inProceedings of the 57th Annual ACM Symposium on Theory of Computing, ser. STOC ’25, Prague, Czechia: Association for Computing Machinery, 2025, pp. 707–717,ISBN: 9798400715105. DOI: 10 . 1145 / 3717823 . 3718234[Online]. Available: https : / / doi . ...

    arXiv 2025

  48. [48]

    Near-asymptotically-good quantum codes with transversal ccz gates and sublinear-weight parity-checks,

    L. Golowich and V . Guruswami, “Near-asymptotically-good quantum codes with transversal ccz gates and sublinear-weight parity-checks,” in2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), 2025, pp. 1561–1569.DOI:10.1109/FOCS63196.2025.00082

    doi:10.1109/focs63196.2025.00082 2025

  49. [49]

    Guémard,Good quantum codes with addressable and parallelizable transversal non-clifford gates,

    V . Guémard,Good quantum codes with addressable and parallelizable transversal non-clifford gates,

  50. [50]

    [Online]

    arXiv: 2510.19809 [quant-ph] . [Online]. Available: https://arxiv.org/abs/ 2510.19809

    arXiv

  51. [51]

    Ramanujan complexes and bounded degree topolog- ical expanders,

    T. Kaufman, D. Kazhdan, and A. Lubotzky, “Ramanujan complexes and bounded degree topolog- ical expanders,” inProceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, ser. FOCS ’14, USA: IEEE Computer Society, 2014, pp. 484–493,ISBN: 9781479965175.DOI: 10.1109/FOCS.2014.58 [Online]. Available: https://doi.org/10.1109/FOCS.2014. 58

    work page doi:10.1109/focs.2014.58 2014

  52. [52]

    Guemard,Lifting a css code via its handlebody realization, 2025

    V . Guemard,Lifting a css code via its handlebody realization, 2025. arXiv:2505.14327 [quant-ph]. [Online]. Available:https://arxiv.org/abs/2505.14327

    Pith/arXiv arXiv 2025

  53. [53]

    Guémard and G

    V . Guémard and G. Zémor,Moderate-length lifted quantum tanner codes, 2025. arXiv: 2502.20297 [quant-ph]. [Online]. Available:https://arxiv.org/abs/2502.20297 46

    arXiv 2025

  54. [54]

    Lifts of quantum css codes,

    V . Guemard, “Lifts of quantum css codes,”IEEE Transactions on Information Theory, vol. 71, no. 7, pp. 5418–5442, 2025.DOI:10.1109/TIT.2025.3552211

    work page doi:10.1109/tit.2025.3552211 2025

  55. [55]

    Cosystolic expansion of sheaves on posets with applications to good 2-query locally testable codes and lifted codes,

    U. A. First and T. Kaufman, “Cosystolic expansion of sheaves on posets with applications to good 2-query locally testable codes and lifted codes,” ser. STOC 2024, Vancouver, BC, Canada: Association for Computing Machinery, 2024, pp. 1446–1457,ISBN: 9798400703836.DOI: 10 . 1145/3618260.3649625 [Online]. Available: https://doi.org/10.1145/3618260. 3649625

    doi:10.1145/3618260 2024

  56. [56]

    Panteleev and G

    P . Panteleev and G. Kalachev,Maximally extendable sheaf codes, 2024. arXiv: 2403 . 03651 [cs.IT]. [Online]. Available:https://arxiv.org/abs/2403.03651

    Pith/arXiv arXiv 2024

  57. [57]

    Kalachev and P

    G. Kalachev and P . Panteleev,Maximally extendable product codes are good coboundary expanders,

  58. [58]

    [Online]

    arXiv: 2501.01411 [cs.IT]. [Online]. Available: https://arxiv.org/abs/2501. 01411

    arXiv

  59. [59]

    Kalachev and P

    G. Kalachev and P . Panteleev,Two-sided robustly testable codes, 2023. arXiv:2206.09973 [cs.IT]. [Online]. Available:https://arxiv.org/abs/2206.09973

    Pith/arXiv arXiv 2023

  60. [60]

    Magic-state distillation with low overhead,

    S. Bravyi and J. Haah, “Magic-state distillation with low overhead,”Physical Review A, vol. 86, no. 5, Nov. 2012,ISSN: 1094-1622.DOI: 10.1103/physreva.86.052329 [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.86.052329

    doi:10.1103/physreva.86.052329 2012

  61. [61]

    Universal fault-tolerant quantum computation with only transversal gates and error correction,

    A. Paetznick and B. W. Reichardt, “Universal fault-tolerant quantum computation with only transversal gates and error correction,”Phys. Rev. Lett., vol. 111, p. 090 505, 9 Aug. 2013.DOI: 10.1103/PhysRevLett.111.090505 [Online]. Available: https://link.aps.org/doi/ 10.1103/PhysRevLett.111.090505

    doi:10.1103/physrevlett.111.090505 2013

  62. [62]

    On optimality of css codes for transversal t,

    N. Rengaswamy, R. Calderbank, M. Newman, and H. D. Pfister, “On optimality of css codes for transversal t,”IEEE Journal on Selected Areas in Information Theory, vol. 1, no. 2, pp. 499–514, 2020. DOI:10.1109/JSAIT.2020.3012914

    work page doi:10.1109/jsait.2020.3012914 2020

  63. [63]

    Kalachev,High-dimensional expansion of product codes is stronger than robust and agreement testability, 2023

    G. Kalachev,High-dimensional expansion of product codes is stronger than robust and agreement testability, 2023. arXiv: 2308.02889 [cs.IT] . [Online]. Available: https://arxiv.org/ abs/2308.02889

    Pith/arXiv arXiv 2023

  64. [64]

    Robust local testability of tensor products of ldpc codes,

    I. Dinur, M. Sudan, and A. Wigderson, “Robust local testability of tensor products of ldpc codes,” inProceedings of the 9th International Conference on Approximation Algorithms for Combina- torial Optimization Problems, and 10th International Conference on Randomization and Computation, ser. APPROX’06/RANDOM’06, Barcelona, Spain: Springer-Verlag, 2006, pp...

    2006

  65. [65]

    Diagonal gates in the Clifford hierarchy,

    S. X. Cui, D. Gottesman, and A. Krishna, “Diagonal gates in the Clifford hierarchy,”Phys. Rev. A, vol. 95, p. 012 329, 1 Jan. 2017.DOI: 10.1103/PhysRevA.95.012329 [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.95.012329

    doi:10.1103/physreva.95.012329 2017

  66. [66]

    Randriambololona,On products and powers of linear codes under componentwise multiplication,

    H. Randriambololona,On products and powers of linear codes under componentwise multiplication,

  67. [67]

    [Online]

    arXiv: 1312.0022 [cs.IT] . [Online]. Available: https://arxiv.org/abs/1312. 0022

    Pith/arXiv arXiv

  68. [68]

    Curry,Sheaves, cosheaves and applications, 2014

    J. Curry,Sheaves, cosheaves and applications, 2014. arXiv: 1303 . 3255 [math.AT]. [Online]. Available:https://arxiv.org/abs/1303.3255

    Pith/arXiv arXiv 2014

  69. [69]

    On the rectangle method in proofs of robustness of tensor products,

    O. Meir, “On the rectangle method in proofs of robustness of tensor products,”Inf. Process. Lett., vol. 112, no. 6, pp. 257–260, Mar. 2012,ISSN: 0020-0190.DOI: 10.1016/j.ipl.2011.11.007 [Online]. Available:https://doi.org/10.1016/j.ipl.2011.11.007

    work page doi:10.1016/j.ipl.2011.11.007 2012

  70. [70]

    Interlacing families i: Bipartite Ramanujan graphs of all degrees,

    A. Marcus, D. A. Spielman, and N. Srivastava, “Interlacing families i: Bipartite Ramanujan graphs of all degrees,”Annals of Mathematics, vol. 182, pp. 307–325, 2015.DOI: 10.4007/annals.2015. 182.1.7[Online]. Available:https://doi.org/10.4007/annals.2015.182.1.7

    work page doi:10.4007/annals.2015 2015

  71. [71]

    Ramanujan coverings of graphs,

    C. Hall, D. Puder, and W. F. Sawin, “Ramanujan coverings of graphs,”Advances in Mathematics, vol. 323, pp. 367–410, Jan. 2018,ISSN: 0001-8708.DOI: 10.1016/j.aim.2017.10.042 [Online]. Available:http://dx.doi.org/10.1016/j.aim.2017.10.042 47

    work page doi:10.1016/j.aim.2017.10.042 2018

  72. [72]

    On the expansion of group-based lifts,

    N. Agarwal, K. Chandrasekaran, A. Kolla, and V . Madan, “On the expansion of group-based lifts,”SIAM Journal on Discrete Mathematics, vol. 33, no. 3, pp. 1338–1373, 2019.DOI: 10.1137/ 17M1141047 eprint: https : / / doi . org / 10 . 1137 / 17M1141047. [Online]. Available: https://doi.org/10.1137/17M1141047

    work page doi:10.1137/17m1141047 2019

  73. [73]

    Explicit Abelian Lifts and Quantum LDPC Codes,

    F. G. Jeronimo, T. Mittal, R. O’Donnell, P . Paredes, and M. Tulsiani, “Explicit Abelian Lifts and Quantum LDPC Codes,” in13th Innovations in Theoretical Computer Science Conference (ITCS 2022), M. Braverman, Ed., ser. Leibniz International Proceedings in Informatics (LIPIcs), vol. 215, Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik,...

    work page doi:10.4230/lipics.itcs.2022.88 2022

  74. [74]

    Huang, T

    J. Huang, T. McKenzie, and H.-T. Yau,Ramanujan property and edge universality of random regular graphs, 2025. arXiv: 2412.20263 [math.PR] . [Online]. Available: https://arxiv.org/ abs/2412.20263

    Pith/arXiv arXiv 2025

  75. [75]

    Kopparty and I

    S. Kopparty and I. Tamo,Algebraic expander codes, 2026. arXiv: 2603.24788 [cs.IT]. [Online]. Available:https://arxiv.org/abs/2603.24788 48

    arXiv 2026