Pith. sign in

REVIEW 4 major objections 1 minor 5 cited by

Automorphism gadgets in homological product codes

T0 review · 4 major / 1 minor · reviewed 2026-08-05 · deepseek-v4-flash

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

Pith's one-line read An automorphism of an input code induces a logical operation on the homological product code, implementable by qubit permutations and, for Tanner-graph symmetries, by permutations alone.

desk verdict The abstract is promising, but the supplied full text is an unrelated astro-ph preprint, so the math is invisible; the fault-tolerance claim also has a gap worth probing. read the letter →

arxiv 2508.04794 v1 pith:N4KP5KKU submitted 2025-08-06 quant-ph

Noah Berthusen , Michael J. Gullans , Yifan Hong , Maryam Mudassar , Shi Jie Samuel Tan This is my paper
classification quant-ph MSC 81P70
keywords homologicalproductcodeshypergraphautomorphismgadgetslogicaloperationsqubitpermutationsTannergraphsymmetryfault-tolerantquantumerrorcorrection
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper tries to show that symmetries of the codes fed into the homological product can be harvested as logical operations on the resulting quantum code. If an input code's automorphism group matches a symmetry of its Tanner graph, the corresponding logical operation can be executed by physically permuting qubits alone; more generally, it needs qubit permutations plus a small subsystem circuit. The authors argue these automorphism gadgets preserve the code's effective distance when physical permutations are free, making them a useful complement to other fault-tolerant gadgets for product codes. A sympathetic reader would care because permutation-only operations avoid deep logical circuits and fit platforms with long-range connectivity, moving fault tolerance beyond topological codes.

What carries the argument

The central object is the automorphism gadget: a logical operation on the homological product code induced by an automorphism $\sigma$ of an input code. The homological product (the hypergraph product when the input is a classical linear code) creates a new codespace from the parity checks of its parents; an automorphism of a parent naturally permutes the qubits of the product. The main mechanism is the condition under which this permutation acts as a logical, rather than merely physical, operation: if $\sigma$ is an automorphism of the input code's Tanner graph, the induced map is a purely permutational logical operation; otherwise it must be supplemented by a subsystem circuit. The framewo

What would settle it

Compute the effective distance of a small hypergraph product code after applying its permutation-only automorphism gadget as a function of the physical swap error rate; if the logical error rate scales with the swap rate rather than remaining at the designed code distance, the free-permutation premise is falsified.

Watch

Extended reading notes

Core claim

The paper claims that permutation symmetries of the input codes to a homological product are not incidental but are a source of logical operations on the product code. Concretely, any automorphism of an input code induces a logical operation on the homological product code; in general that operation is implemented by physical qubit permutations together with a subsystem circuit, and when the automorphism respects the Tanner graph of the input code, the subsystem circuit drops out and the operation is implemented by qubit permutations alone. The paper further claims these automorphism gadgets preserve effective code distance, provided physical permutations are free, and backs this with a surv

Load-bearing premise

The fault-tolerance conclusion rests on physical qubit permutations being free—noiseless and costing nothing compared with the gates they replace; if swaps add comparable error, the effective-distance claim no longer follows.

Editorial extensions

If this is right

  • Classical code families with rich automorphism groups immediately supply quantum product codes with a menu of permutation-implementable logical operations.
  • In the Tanner-graph-symmetric case, logical gates require no two-qubit gates at all, only a fixed set of physical qubit swaps.
  • The effective-distance-preservation property means these gadgets can be composed or concatenated without reducing the code's designed distance, provided swaps remain noiseless.
  • The framework gives a design rule for choosing input codes by their automorphism structure when constructing hypergraph product codes for fault-tolerant computation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The algebraic component of the claim—that input-code automorphisms become logical operators—does not depend on the free-swap premise, so the framework identifies valid logical operations even on hardware where swaps are noisy; only the fault-tolerance guarantee would degrade.
  • A systematic search over classical code families with large automorphism groups (cyclic, quasi-cyclic, or algebraic-geometry codes) could turn the paper's survey into a concrete catalogue of permutation-only logical gate sets for hypergraph product codes.
  • The construction may extend to homological products of quantum input codes, where automorphisms of a quantum code's Tanner graph would similarly induce permutation-only logical operations—a direction the paper does not explicitly develop.
  • A numerical study of small product codes could quantify how swap error rates translate into logical failure probabilities, giving a hardware threshold for when the free-permutation assumption is approximately valid.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 1 minor

Summary. The abstract announces a theoretical framework for 'automorphism gadgets' in homological product codes: automorphisms of the input codes induce logical operations on the product code, implementable by physical qubit permutations plus, in general, a subsystem circuit, and by permutations alone when the input Tanner graphs have suitable symmetries. The abstract further claims inherent fault-tolerant properties, specifically effective distance preservation, assuming physical permutations are free, and states that a survey of classical linear codes with rich automorphism groups is included. However, the supplied full text is not the manuscript described in the abstract: it is an unrelated astro-ph preprint on TRAPPIST-1 stellar flares (arXiv:2508.04793). None of the claimed definitions, theorems, proofs, error models, or code-family survey appear in the text. Thus the central claims cannot be checked from the submitted material.

Significance. If the framework described in the abstract were correct and fully developed, it would be a potentially valuable contribution to fault-tolerant logical operations in homological product codes, complementing existing gadgets and extending the reach of permutation-based operations beyond topological codes. The proposed connection between input-code automorphisms and logical operations on product codes is plausible and worth exploring. However, the submitted manuscript does not contain the technical content needed to assess this significance: no equations, derivations, or simulation results are present. The claim about effective distance preservation is especially important because it concerns genuine fault tolerance, not just algebraic symmetry; the current text provides no basis for evaluating it. The paper's contribution therefore cannot be credited on the evidence provided.

major comments (4)
  1. [Full text (all sections)] The full text supplied is an unrelated astro-ph manuscript about flares on TRAPPIST-1, not a paper on homological product codes. None of the claimed content—definitions of automorphism gadgets, the subsystem circuit construction, theorems on logical operations, effective distance preservation, or the classical-code survey—is present. This is a load-bearing omission: the central claim of the abstract is completely unverifiable from the manuscript.
  2. [Abstract, fault-tolerance sentence] The abstract states that automorphism gadgets 'can possess inherent fault-tolerant properties such as effective distance preservation, assuming physical permutations are free.' The general implementation includes a subsystem circuit, but the fault-tolerance guarantee is conditioned only on permutations being free. No error model for the subsystem circuit is given, and no argument is provided that the circuit component preserves effective distance. In the permutation-only special case, the statement is near-tautological, so the nontrivial content lies in the circuit case, which is not addressed.
  3. [Abstract, Tanner-graph symmetries] The abstract promises a characterization of special cases where logical operations can be performed solely through qubit permutations, related to symmetries of the input Tanner graphs. No such characterization appears in the manuscript. Without a precise statement of which symmetries yield permutation-only operations, the practical relevance of the framework cannot be assessed.
  4. [Abstract, classical-code survey] The final claim is that the paper 'surveys the literature of classical linear codes with rich automorphism structures and shows how various classical code families fit into our framework.' No survey, no code families, and no fitting procedure are present in the supplied text. This is a central element of the paper's claimed contribution and is entirely missing.
minor comments (1)
  1. [General] The typesetting and references are those of an astronomy paper (AASTeX, stellar-activity references). This is consistent with the wrong full text having been attached. The abstract itself contains no references to prior work on homological products or fault-tolerant gadgets, which would normally be expected.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity identifiable: the abstract makes algebraically nontrivial claims, and no equations or derivations are available to exhibit any reduction to inputs.

full rationale

The supplied manuscript text is an unrelated astro-ph paper (TRAPPIST-1 flares), not the quant-ph paper referenced by the abstract. Consequently, the claimed derivation chain of the automorphism-gadget framework cannot be walked, and no specific equation, fitted parameter, or self-citation chain can be exhibited. The hard rule requires quoting the paper and showing a concrete reduction (e.g., Eq. X = Eq. Y by construction, or a fitted parameter renamed as a prediction); no such evidence exists in the available material. The abstract's condition 'assuming physical permutations are free' is an explicit modeling assumption, not a hidden fit or a definitional restatement of the distance-preservation claim. The general case requiring 'a combination of physical qubit permutations and a subsystem circuit' is presented as a nontrivial result, not as a tautology. While the skeptical concern about the cost of subsystem circuits is a legitimate correctness/fault-tolerance modeling question, it is not a circularity argument. Therefore the honest finding is no significant circularity: score 0.

Assumptions & free parameters 0 free parameters · 2 assumptions · 1 invented entities

Only the abstract could be reviewed: the full text pasted under this arXiv ID is the unrelated TRAPPIST-1 paper 2508.04793. Consequently the ledger records what is visible from the abstract: two domain assumptions and one new theoretical construct, with no free parameters identifiable. The absence of identifiable parameters is a statement about available information, not about the paper's actual content.

assumptions (2)
  • domain assumption The homological product (hypergraph product for classical inputs) construction and its error-correcting properties hold as established in prior literature.
    The abstract treats the homological product as a known general-purpose recipe that forges new codes; the framework is built on top of this construction without re-deriving it.
  • domain assumption Physical qubit permutations can be treated as free, i.e., noiseless and without fault-tolerance overhead.
    Stated explicitly in the abstract as the condition for the effective-distance-preservation claim: 'assuming physical permutations are free.' This is an input assumption about hardware, not a derived result.
invented entities (1)
  • Automorphism gadget
    purpose: A construction realizing logical operations on a homological product code from automorphisms of the input codes, via qubit permutations and optionally a subsystem circuit.
    This is a theoretical construction introduced by the paper rather than an empirical entity; it has no falsifiable handle outside the framework itself, and its validity depends on the (unavailable) derivations.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Automorphism gadgets in homological product codes." pith.science (2026). https://pith.science/paper/N4KP5KKU

@misc{pith2026250804794,
  author       = {Pith},
  title        = {Pith review of: Automorphism gadgets in homological product codes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/N4KP5KKU}},
  note         = {Machine review of arXiv:2508.04794}
}
read the original abstract

The homological product is a general-purpose recipe that forges new quantum codes from arbitrary classical or quantum input codes, often providing enhanced error-correcting properties. When the input codes are classical linear codes, it is also known as the hypergraph product. We investigate structured homological product codes that admit logical operations arising from permutation symmetries in their input codes. We present a broad theoretical framework that characterizes the logical operations resulting from these underlying automorphisms. In general, these logical operations can be performed by a combination of physical qubit permutations and a subsystem circuit. In special cases related to symmetries of the input Tanner graphs, logical operations can be performed solely through qubit permutations. We further demonstrate that these "automorphism gadgets" can possess inherent fault-tolerant properties such as effective distance preservation, assuming physical permutations are free. Finally, we survey the literature of classical linear codes with rich automorphism structures and show how various classical code families fit into our framework. Complementary to other fault-tolerant gadgets for homological product codes, our results further advance the search for practical fault tolerance beyond topological codes in platforms capable of long-range connectivity.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Logical computation with canonical lifted product codes

    quant-ph 2026-07 conditional novelty 7.0 of 10

    Canonical lifted-product qLDPC codes admit a row/column cyclic logical basis that enables constant-seed modular surgery, compact extractors, and parallel Clifford and magic primitives.

  2. Lifting Lifted Product Codes

    quant-ph 2026-07 conditional novelty 6.5 of 10

    Group-extension lifts systematically enlarge any LP code, transfer logical gadgets via chain maps (often with less surgery overhead), improve some code parameters, and give candidate thermodynamic families with cohere...

  3. No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits

    quant-ph 2026-02 reject novelty 6.0 of 10

    No stabilizer code can implement the full logical Clifford group on multiple logical qubits using transversal gates, fold-transversal gates beyond two qubits, or code automorphisms.

  4. Sequences of Bivariate Bicycle Codes from Covering Graphs

    quant-ph 2025-11 conditional novelty 6.0 of 10

    Bivariate bicycle quantum codes form infinite families via graph covers: the [[144,12,12]] gross code is a double cover of [[72,12,6]], with logical-operator lifting and parameter bounds.

  5. Transversal architecture for megaquop-scale quantum simulation with neutral atoms

    quant-ph 2025-09 conditional novelty 6.0 of 10

    A neutral-atom co-designed 'transversal STAR' architecture could reach megaquop-scale Hamiltonian simulation with about 10,000 physical qubits at 1e-3 error rates, corresponding to over 1e6 to 1e7 T gates.

Reference graph

Works this paper leans on

97 extracted references · 46 canonical work pages · cited by 5 Pith papers

  1. [1]

    Fault-tolerant quantum computation with constant error rate

    Dorit Aharonov and Michael Ben-Or. Fault-tolerant quantum computation with constant error rate. SIAM Journal on Computing , 38(4):1207--1282, 2008

    2008

  2. [2]

    The classification of reversible bit operations

    Scott Aaronson, Daniel Grier, and Luke Schaeffer. The classification of reversible bit operations. arXiv preprint arXiv:1504.05155 , 2015

    arXiv 2015

  3. [3]

    Reed-Muller Codes: Theory and Algorithms

    Emmanuel Abbe, Amir Shpilka, and Min Ye. Reed-muller codes: Theory and algorithms. arXiv preprint arXiv:2002.03317 , 2020

    work page Pith review arXiv 2002

  4. [4]

    Graph isomorphism in quasipolynomial time [extended abstract]

    L\' a szl\' o Babai. Graph isomorphism in quasipolynomial time [extended abstract]. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing , STOC '16, page 684–697, New York, NY, USA, 2016. Association for Computing Machinery

    2016

  5. [5]

    Breuckmann and Simon Burton

    Nikolas P. Breuckmann and Simon Burton. Fold-transversal clifford gates for quantum codes. Quantum , 8:1372, June 2024

    2024

  6. [6]

    Quantum error correcting subsystem codes from two classical linear codes

    Dave Bacon and Andrea Casaccino. Quantum error correcting subsystem codes from two classical linear codes. arXiv preprint arXiv/quant-ph:0610088 , 2006

    2006

  7. [7]

    Cross, Jay M

    Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J. Yoder. High-threshold and low-overhead fault-tolerant quantum memory. Nature , 627(8005):778–782, March 2024

    2024

  8. [8]

    Breuckmann, Margarita Davydova, Jens N

    Nikolas P. Breuckmann, Margarita Davydova, Jens N. Eberhardt, and Nathanan Tantivasadakarn. Cups and gates i: Cohomology invariants and logical quantum operations. arXiv preprint arXiv:2410.16250 , 2024

    arXiv 2024

Show all 97 references
  1. [9]

    Simon Burton, Elijah Durso-Sabina, and Natalie C. Brown. Genons, double covers and fault-tolerant clifford gates. arXiv preprint arXiv:2406.09951 , 2024

    2024 arXiv

  2. [10]

    Breuckmann and Jens N

    Nikolas P. Breuckmann and Jens N. Eberhardt. Balanced product quantum codes. IEEE Transactions on Information Theory , 67(10):6653–6674, October 2021

    2021

  3. [11]

    Breuckmann and Jens Niklas Eberhardt

    Nikolas P. Breuckmann and Jens Niklas Eberhardt. Quantum low-density parity-check codes. PRX Quantum , 2(4), October 2021

    2021

  4. [12]

    Hastings

    Sergey Bravyi and Matthew B. Hastings. Homological product codes. In Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing , STOC '14, pages 273--282, New York, NY, USA, 2014. Association for Computing Machinery

    2014

  5. [13]

    Hastings, and Spyridon Michalakis

    Sergey Bravyi, Matthew B. Hastings, and Spyridon Michalakis. Topological quantum order: Stability under local perturbations. Journal of Mathematical Physics , 51(9), September 2010

    2010

  6. [14]

    Algebraic Graph Theory

    Norman Biggs. Algebraic Graph Theory . Cambridge Mathematical Library. Cambridge University Press, 2 edition, 1974

    1974

  7. [15]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado. Topological quantum distillation. Physical Review Letters , 97(18), October 2006

    2006

  8. [16]

    Every equidistant linear code is a sequence of dual hamming codes

    Arrigo Bonisoli. Every equidistant linear code is a sequence of dual hamming codes. Ars Combinatoria , 18:181--186, 1984

    1984

  9. [17]

    Bose and D.K

    R.C. Bose and D.K. Ray-Chaudhuri. Further results on error correcting binary group codes. Information and Control , 3(3):279--290, 1960

    1960

  10. [18]

    Bose and D.K

    R.C. Bose and D.K. Ray-Chaudhuri. On a class of error correcting binary group codes. Information and Control , 3(1):68--79, 1960

    1960

  11. [19]

    A theory of single-shot error correction for adversarial noise

    Earl T Campbell. A theory of single-shot error correction for adversarial noise. Quantum Science and Technology , 4(2):025006, February 2019

    2019

  12. [20]

    Gullans, J

    Nathan Constantinides, Ali Fahimniya, Dhruv Devulapalli, Dolev Bluvstein, Michael J. Gullans, J. V. Porto, Andrew M. Childs, and Alexey V. Gorshkov. Optimal routing protocols for reconfigurable atom arrays. arXiv preprint arXiv:2411.05061 , 2024

    2024 arXiv

  13. [21]

    Improved qldpc surgery: Logical measurements and bridging codes

    Andrew Cross, Zhiyang He, Patrick Rall, and Theodore Yoder. Improved qldpc surgery: Logical measurements and bridging codes. arXiv preprint arXiv:2407.18393 , 2024

    2024

  14. [22]

    Reichardt

    Rui Chao and Ben W. Reichardt. Fault-tolerant quantum computation with few qubits. npj Quantum Information , 4(1), September 2018

    2018

  15. [23]

    Reichardt

    Rui Chao and Ben W. Reichardt. Quantum error correction with only two extra qubits. Physical Review Letters , 121(5), August 2018

    2018

  16. [24]

    Calderbank, E.M

    A.R. Calderbank, E.M. Rains, P.W. Shor, and N.J.A. Sloane. Quantum error correction via codes over gf(4). In Proceedings of IEEE International Symposium on Information Theory , pages 292--, 1997

    1997

  17. [25]

    A. R. Calderbank and Peter W. Shor. Good quantum error-correcting codes exist. Phys. Rev. A , 54:1098--1105, Aug 1996

    1996

  18. [26]

    Pablo Bonilla Ataides, Arthur Jaffe, Dolev Bluvstein, and Mikhail D

    Madelyn Cain, Chen Zhao, Hengyun Zhou, Nadine Meister, J. Pablo Bonilla Ataides, Arthur Jaffe, Dolev Bluvstein, and Mikhail D. Lukin. Correlated decoding of logical algorithms with transversal gates. Phys. Rev. Lett. , 133:240602, Dec 2024

    2024

  19. [27]

    Locally testable codes with constant rate, distance, and locality

    Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes. Locally testable codes with constant rate, distance, and locality. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , STOC 2022, page 357–374, New York, NY, USA, 2022. Associat...

    2022

  20. [28]

    Restrictions on transversal encoded quantum gate sets

    Bryan Eastin and Emanuel Knill. Restrictions on transversal encoded quantum gate sets. Physical Review Letters , 102(11), March 2009

    2009

  21. [29]

    Decodable quantum ldpc codes beyond the n distance barrier using high-dimensional expanders

    Shai Evra, Tali Kaufman, and Gilles Z \'e mor. Decodable quantum ldpc codes beyond the n distance barrier using high-dimensional expanders. SIAM Journal on Computing , 53(6):FOCS20--276, 2022

    2022

  22. [30]

    Foster and I.Z

    R.M. Foster and I.Z. Bouwer. The Foster Census: R.M. Foster's Census of Connected Symmetric Trivalent Graphs . Charles Babbage Research Centre, 1988

    1988

  23. [31]

    Freedman and Matthew B

    Michael H. Freedman and Matthew B. Hastings. Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs. Quantum Info. Comput. , 14(1–2):144–180, January 2014

    2014

  24. [32]

    Building manifolds from quantum codes

    Michael Freedman and Matthew Hastings. Building manifolds from quantum codes. Geometric and Functional Analysis , 31(4):855--894, Aug 2021

    2021

  25. [33]

    No-go theorems for logical gates on product quantum codes

    Xiaozhen Fu, Han Zheng, Zimu Li, and Zi-Wen Liu. No-go theorems for logical gates on product quantum codes. arXiv preprint arXiv:2507.16797 , 2025

    2025

  26. [34]

    Quantum ldpc codes of almost linear distance via homological products

    Louis Golowich and Venkatesan Guruswami. Quantum ldpc codes of almost linear distance via homological products. arXiv preprint arXiv:2411.03646 , 2024

    2024 arXiv

  27. [35]

    On the addressability problem on CSS codes

    Jérôme Guyot and Samuel Jaques. On the addressability problem on CSS codes. arXiv preprint arXiv:2502.13889 , 2025

    2025 arXiv

  28. [36]

    Kiani, and Alexander Zlokapa

    David Gamarnik, Bobak T. Kiani, and Alexander Zlokapa. Slow mixing of quantum gibbs samplers. arXiv preprint arXiv:2411.04300 , 2024

    2024 arXiv

  29. [37]

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

    Louis Golowich and Ting-Chun Lin. Quantum ldpc codes with transversal non-clifford gates via products of algebraic codes. arXiv preprint arXiv:2410.14662 , 2024

    2024 arXiv

  30. [38]

    Stabilizer codes and quantum error correction

    Daniel Gottesman. Stabilizer codes and quantum error correction. arXiv preprint arXiv:quant-ph/9705052 , 1997

    1997 arXiv

  31. [39]

    Fault-tolerant quantum computation with constant overhead

    Daniel Gottesman. Fault-tolerant quantum computation with constant overhead. Quantum Info. Comput. , 14(15–16):1338–1372, November 2014

    2014

  32. [40]

    Leveraging automorphisms of quantum codes for fault-tolerant quantum computation

    Markus Grassl and Martin Roetteler. Leveraging automorphisms of quantum codes for fault-tolerant quantum computation. In 2013 IEEE International Symposium on Information Theory , page 534–538. IEEE, 2013

    2013

  33. [41]

    Anqi Gong and Joseph M. Renes. Computation with quantum reed-muller codes and their mapping onto 2d atom arrays. arXiv preprint arXiv:2410.23263 , 2024

    2024 arXiv

  34. [42]

    Investigations on automorphism groups of quantum stabilizer codes

    Hanson Hao. Investigations on automorphism groups of quantum stabilizer codes. arXiv preprint arXiv:2109.12735 , 2021

    2021 arXiv

  35. [43]

    Hakimi and J

    S. Hakimi and J. Bredeson. Graph theoretic error-correcting codes. IEEE Transactions on Information Theory , 14(4):584--591, 1968

    1968

  36. [44]

    Graph isomorphisms in quasi-polynomial time

    Harald Andrés Helfgott, Jitendra Bajpai, and Daniele Dona. Graph isomorphisms in quasi-polynomial time. arXiv preprint arXiv:1710.04574 , 2017

    2017 arXiv

  37. [45]

    Williamson, and Theodore J

    Zhiyang He, Alexander Cowtan, Dominic J. Williamson, and Theodore J. Yoder. Extractors: Qldpc architectures for efficient pauli-based computation. arXiv preprint arXiv:2503.10390 , 2025

    2025

  38. [46]

    Entangling four logical qubits beyond break-even in a nonlocal code

    Yifan Hong, Elijah Durso-Sabina, David Hayes, and Andrew Lucas. Entangling four logical qubits beyond break-even in a nonlocal code. Phys. Rev. Lett. , 133:180601, 2024

    2024

  39. [47]

    Hill, Austin G

    Charles D. Hill, Austin G. Fowler, David S. Wang, and Lloyd C. L. Hollenberg. Fault-tolerant quantum error correction code conversion. Quantum Info. Comput. , 13(5–6):439–451, May 2013

    2013

  40. [48]

    Quantum memory at nonzero temperature in a thermodynamically trivial system

    Yifan Hong, Jinkang Guo, and Andrew Lucas. Quantum memory at nonzero temperature in a thermodynamically trivial system. Nature Communications , 16(1), January 2025

    2025

  41. [49]

    Classifying logical gates in quantum codes via cohomology operations and symmetry

    Po-Shen Hsin, Ryohei Kobayashi, and Guanyu Zhu. Classifying logical gates in quantum codes via cohomology operations and symmetry. arXiv preprint arXiv:2411.15848 , 2024

    2024 arXiv

  42. [50]

    Kaufman, and Andrew Lucas

    Yifan Hong, Matteo Marinelli, Adam M. Kaufman, and Andrew Lucas. Long-range-enhanced surface codes. Physical Review A , 110(2), 2024

    2024

  43. [51]

    Codes correcteurs d'erreurs

    Alexis Hocquenghem. Codes correcteurs d'erreurs. Chiffres (Paris) , 2:147--156, 1959

    1959

  44. [52]

    Guava: an error-correcting codes package

    David Joyner. Guava: an error-correcting codes package. SIGSAM Bull. , 39(2):65–68, June 2005

    2005

  45. [53]

    T. Kasami. A topological approach to construction of group codes. J. Inst. Elec. Commun. Engrs. , 44:1316--1321, 1961

    1961

  46. [54]

    A.Yu. Kitaev. Fault-tolerant quantum computation by anyons. Annals of Physics , 303(1):2–30, January 2003

    2003

  47. [55]

    Anyons in an exactly solved model and beyond

    Alexei Kitaev. Anyons in an exactly solved model and beyond. Annals of Physics , 321(1):2–111, January 2006

    2006

  48. [56]

    Emanuel Knill, Raymond Laflamme, and Wojciech H. Zurek. Resilient quantum computation. Science , 279(5349):342--345, 1998

    1998

  49. [57]

    Automorphism ensemble decoding of quantum ldpc codes

    Stergios Koutsioumpas, Hasan Sayginel, Mark Webster, and Dan E Browne. Automorphism ensemble decoding of quantum ldpc codes. arXiv preprint arXiv:2503.01738 , 2025

    2025 arXiv

  50. [58]

    Quantum state isomorphism

    Joshua Lockhart and Carlos E Gonz \'a lez Guill \'e n. Quantum state isomorphism. arXiv preprint arXiv:1709.09622 , 2017

    2017 arXiv

  51. [59]

    Gullans, Victor V

    Ali Lavasani, Michael J. Gullans, Victor V. Albert, and Maissam Barkeshli. On stability of k-local quantum phases of matter. arXiv preprint arXiv:2405.19412 , 2024

    2024 arXiv

  52. [60]

    A game of surface codes: Large-scale quantum computing with lattice surgery

    Daniel Litinski. A game of surface codes: Large-scale quantum computing with lattice surgery. Quantum , 3:128, March 2019

    2019

  53. [61]

    Hsiang-Ku Lin and Leonid P. Pryadko. Quantum two-block group algebra codes. Phys. Rev. A , 109:022407, 2024

    2024

  54. [62]

    Lubotzky, R

    A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica , 8(3):261--277, September 1988

    1988

  55. [63]

    Permutation decoding of systematic codes

    Jessie Macwilliams. Permutation decoding of systematic codes. The Bell System Technical Journal , 43(1):485--505, 1964

    1964

  56. [64]

    Distance-preserving stabilizer measurements in hypergraph product codes

    Argyris Giannisis Manes and Jahan Claes. Distance-preserving stabilizer measurements in hypergraph product codes. Quantum , 9:1618, 2025

    2025

  57. [65]

    Malcolm, Andrew N

    Alexander J. Malcolm, Andrew N. Glaudell, Patricio Fuentes, Daryus Chandra, Alexis Schotte, Colby DeLisle, Rafael Haenel, Amir Ebrahimi, Joschka Roffe, Armanda O. Quintavalle, Stefanie J. Beale, Nicholas R. Lee-Hone, and Stephanie Simmons. Computing efficiently in q LDPC codes...

    2025

  58. [66]

    MacWilliams and N.J.A

    F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-correcting Codes . Mathematical Library. North-Holland Publishing Company, 1977

    1977

  59. [67]

    D. E. Muller. Application of boolean algebra to switching circuit design and to error detection. Transactions of the I.R.E. Professional Group on Electronic Computers , EC-3(3):6--12, 1954

    1954

  60. [68]

    Nguyen and Christopher A

    Quynh T. Nguyen and Christopher A. Pattison. Quantum fault tolerance with constant-space and logarithmic-time overheads. arXiv preprint arXiv:2411.03632 , 2024

    2024 arXiv

  61. [69]

    Construction and decoding of quantum margulis codes

    Michele Pacenti, Dimitris Chytas, and Bane Vasic. Construction and decoding of quantum margulis codes. arXiv preprint arXiv:2503.03936 , 2025

    2025 arXiv

  62. [70]

    Degenerate quantum LDPC codes with good finite length performance

    Pavel Panteleev and Gleb Kalachev. Degenerate quantum LDPC codes with good finite length performance. Quantum , 5:585, 2021

    2021

  63. [71]

    Quantum LDPC codes with almost linear minimum distance

    Pavel Panteleev and Gleb Kalachev. Quantum LDPC codes with almost linear minimum distance. IEEE Transactions on Information Theory , 68(1):213--229, 2021

    2021

  64. [72]

    Asymptotically good quantum and locally testable classical LDPC codes

    Pavel Panteleev and Gleb Kalachev. Asymptotically good quantum and locally testable classical LDPC codes. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , STOC 2022, page 375–388, New York, NY, USA, 2022. Association for Computing Machinery

    2022

  65. [73]

    Petrank and R.M

    E. Petrank and R.M. Roth. Is code equivalence easy to decide? IEEE Transactions on Information Theory , 43(5):1602--1604, 1997

    1997

  66. [74]

    Breuckmann, and Vedika Khemani

    Benedikt Placke, Tibor Rakovszky, Nikolas P. Breuckmann, and Vedika Khemani. Topological quantum spin glass order and its realization in qldpc codes. arXiv preprint arXiv:2412.13248 , 2024

    2024 arXiv

  67. [75]

    Quintavalle and Earl T

    Armanda O. Quintavalle and Earl T. Campbell. Reshape: A decoder for hypergraph product codes. IEEE Transactions on Information Theory , 68(10):6569--6584, 2022

    2022

  68. [76]

    Quintavalle, Paul Webster, and Michael Vasmer

    Armanda O. Quintavalle, Paul Webster, and Michael Vasmer. Partitioning qubits in hypergraph product codes to implement logical gates. Quantum , 7:1153, 2023

    2023

  69. [77]

    Reichardt, David Aasen, Rui Chao, Alex Chernoguzov, Wim van Dam, John P

    Ben W. Reichardt, David Aasen, Rui Chao, Alex Chernoguzov, Wim van Dam, John P. Gaebler, Dan Gresh, Dominic Lucchetti, Michael Mills, Steven A. Moses, Brian Neyenhuis, Adam Paetznick, Andres Paz, Peter E. Siegfried, Marcus P. da Silva, Krysta M. Svore, Zhenghan Wang, and Matt ...

    2024 arXiv

  70. [78]

    The physics of (good) ldpc codes i

    Tibor Rakovszky and Vedika Khemani. The physics of (good) ldpc codes i. gauging and dualities. arXiv preprint arXiv:2310.16032 , 2023

    2023 arXiv

  71. [79]

    The physics of (good) ldpc codes ii

    Tibor Rakovszky and Vedika Khemani. The physics of (good) ldpc codes ii. product constructions. arXiv preprint arXiv:2402.16831 , 2024

    2024 arXiv

  72. [80]

    Ldpc stabilizer codes as gapped quantum phases: stability under graph-local perturbations

    Wojciech De Roeck, Vedika Khemani, Yaodong Li, Nicholas O'Dea, and Tibor Rakovszky. Ldpc stabilizer codes as gapped quantum phases: stability under graph-local perturbations. arXiv preprint arXiv:2411.02384 , 2024

    2024

  73. [81]

    Esha Swaroop, Tomas Jochym-O'Connor, and Theodore J. Yoder. Universal adapters between quantum ldpc codes. arXiv preprint arXiv:2410.03628 , 2025

    2025

  74. [82]

    Fault-tolerant logical clifford gates from code automorphisms

    Hasan Sayginel, Stergios Koutsioumpas, Mark Webster, Abhishek Rajput, and Dan E Browne. Fault-tolerant logical clifford gates from code automorphisms. arXiv preprint arXiv:2409.18175 , 2025

    2025 arXiv

  75. [83]

    A. M. Steane. Error correcting codes in quantum theory. Phys. Rev. Lett. , 77:793--797, Jul 1996

    1996

  76. [84]

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

    Shiro Tamiya, Masato Koashi, and Hayata Yamasaki. Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes. arXiv preprint arXiv:2411.03683 , 2024

    2024 arXiv

  77. [85]

    Effective distance of higher dimensional HGP s and weight-reduced quantum LDPC codes

    Shi Jie Samuel Tan and Lev Stambler. Effective distance of higher dimensional HGP s and weight-reduced quantum LDPC codes. arXiv preprint arXiv:2409.02193 , 2024

    2024

  78. [86]

    W. T. Tutte. A family of cubical graphs. Mathematical Proceedings of the Cambridge Philosophical Society , 43(4):459–474, 1947

    1947

  79. [87]

    Connectivity in graphs

    William Thomas Tutte. Connectivity in graphs. In Connectivity in Graphs . University of Toronto press, 1966

    1966

  80. [88]

    Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength

    Jean-Pierre Tillich and Gilles Zemor. Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength. IEEE Transactions on Information Theory , 60(2):1193--1202, 2014

    2014

  81. [89]

    Michael Vasmer and Dan E. Browne. Three-dimensional surface codes: Transversal gates and fault-tolerant architectures. Phys. Rev. A , 100:012312, Jul 2019

    2019

  82. [90]

    Scruby, and Stephen D

    Paul Webster, Michael Vasmer, Thomas R. Scruby, and Stephen D. Bartlett. Universal fault-tolerant quantum computing with stabilizer codes. Phys. Rev. Res. , 4:013092, Feb 2022

    2022

  83. [91]

    Pablo Bonilla Ataides, Christopher A

    Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pattison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasi \' c , Mikhail D. Lukin, Liang Jiang, and Hengyun Zhou. Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays. Nature Physic...

    2024

  84. [92]

    Pablo Bonilla Ataides, Mikhail D

    Qian Xu, Hengyun Zhou, Guo Zheng, Dolev Bluvstein, J. Pablo Bonilla Ataides, Mikhail D. Lukin, and Liang Jiang. Fast and parallelizable logical computation with homological product codes. arXiv preprint arXiv:2407.18490 , 2024

    2024 arXiv

  85. [93]

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

    Chao Yin and Andrew Lucas. Low-density parity-check codes as stable phases of quantum matter. arXiv preprint arXiv:2411.01002 , 2024

    2024 arXiv

  86. [94]

    Yoder, Ryuji Takagi, and Isaac L

    Theodore J. Yoder, Ryuji Takagi, and Isaac L. Chuang. Universal fault-tolerant gates on concatenated stabilizer codes. Phys. Rev. X , 6:031039, Sep 2016

    2016

  87. [95]

    Weilei Zeng and Leonid P. Pryadko. Higher-dimensional quantum hypergraph-product codes with finite rates. Phys. Rev. Lett. , 122:230501, Jun 2019

    2019

  88. [96]

    Weilei Zeng and Leonid P. Pryadko. Minimal distances for certain quantum product codes and tensor products of chain complexes. Physical Review A , 102(6), December 2020

    2020

  89. [97]

    Cross, and Benjamin J

    Guanyu Zhu, Shehryar Sikander, Elia Portnoy, Andrew W. Cross, and Benjamin J. Brown. Non-clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum ldpc codes via higher symmetries. arXiv preprint arXiv:2310.16982 , 2024

    2024

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.