pith. sign in

arxiv: 2510.20728 · v3 · submitted 2025-10-23 · 🪐 quant-ph · cs.AI· cs.CL· math-ph· math.MP

Co-Designing Quantum Codes with Transversal Diagonal Gates via Multi-Agent Systems

Xi He , Sirui Lu , Bei Zeng This is my paper

Pith reviewed 2026-05-18 04:24 UTC · model grok-4.3

classification 🪐 quant-ph cs.AIcs.CLmath-phmath.MP
keywords nonadditive quantum codestransversal diagonal gatesformal verificationLean 4multi-agent systemssubset sum linear programmingquantum error correction
0
0 comments X

The pith

Platform with Lean verification yields 14116 exact nonadditive quantum codes and resolves transversal-T problem

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

The authors build a multi-agent platform that links symbolic synthesis, linear-programming search, candidate reconstruction, and formal verification in Lean 4. Applied to nonadditive codes with prescribed transversal diagonal gates, the system produces a certified list of 14116 codes for two to four logical qubits on up to six physical qubits at distance two, together with closed-form infinite families and one explicit code for the controlled-phase gate. At distance three it settles the question of which ((7,2,3)) codes admit a transversal T gate within a chosen symmetry setting, accepting ten constructions and ruling out two by no-go arguments. A reader would care because these machine-checked objects give concrete starting points for quantum error correction that can be used with higher confidence than unverified heuristics.

Core claim

The platform turns heuristic searches into exact, Lean-certified objects. In the distance-two regime it produces 14116 codes realizing cyclic logical orders 2 through 18 for K in {2,3,4} up to six qubits, from which infinite families are extracted, plus a residue-degenerate ((6,4,2)) code for the logical controlled-phase gate. In the distance-three regime for ((7,2,3)) codes in the complementary binary-dihedral setting, ten of the twelve surviving candidates admit exact transversal T realizations while two are excluded by no-go proofs.

What carries the argument

The subset-sum linear-programming (SSLP) framework together with Lean formal verification that independently checks the code parameters and the action of the transversal diagonal gates.

Load-bearing premise

The SSLP framework and the distance-2 residue-class plus complementary binary-dihedral settings together capture every relevant nonadditive code with the target transversal properties.

What would settle it

Finding a ((7,2,3)) code with transversal T that lies outside the twelve filtered candidates, or an error in one of the Lean proofs, would show that the method missed constructions or accepted invalid ones.

Figures

Figures reproduced from arXiv: 2510.20728 by Bei Zeng, Sirui Lu, Xi He.

Figure 1
Figure 1. Figure 1: Schematic diagram of the human-AI co-design workflow for quantum code discovery. The researcher [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Two types agent supported by TeXRA operating on a shared workspace (LA [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
read the original abstract

Exact scientific discovery requires more than heuristic search: candidate constructions must be turned into exact objects and checked independently. We address this gap by extending TeXRA with an independent Lean 4 verification layer, turning it into a human-guided multi-agent platform for exact scientific discovery. The platform couples symbolic synthesis, combinatorial and linear-programming search, exact reconstruction of numerical candidates, and formal verification in Lean. We apply this platform to nonadditive quantum error-correcting codes with prescribed transversal diagonal gates within the subset-sum linear-programming (SSLP) framework. In the distance-2 regime where logical states occupy distinct residue classes, the platform yields a Lean-certified catalogue of 14,116 codes for $K\in\{2,3,4\}$ and up to six physical qubits, realizing cyclic logical orders 2 through 18, from which we extract closed-form infinite families. We also construct a residue-degenerate $((6,4,2))$ code implementing the logical controlled-phase gate $\mathrm{diag}(1,1,1,i)$. At distance 3, we resolve the transversal-$T$ problem for $((7,2,3))$ codes within the complementary binary-dihedral $\mathrm{BD}_{16}$ setting: among the 12 candidates surviving the SSLP filters, 10 admit exact realizations and 2 are excluded by no-go proofs. All accepted constructions, families, and no-go results are formalized and checked in Lean, illustrating how AI-assisted workflows can bridge search, exact reconstruction, and formal proof in the physical sciences.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 2 minor

Summary. The manuscript introduces a multi-agent platform extending TeXRA with an independent Lean 4 verification layer for exact discovery of nonadditive quantum error-correcting codes supporting prescribed transversal diagonal gates. Using the subset-sum linear-programming (SSLP) framework in the distance-2 residue-class regime, it produces a Lean-certified catalogue of 14,116 codes for K in {2,3,4} with up to six physical qubits realizing cyclic logical orders 2-18, extracts closed-form infinite families, constructs a residue-degenerate ((6,4,2)) code for the logical controlled-phase gate, and within the complementary binary-dihedral BD16 setting resolves the transversal-T problem for ((7,2,3)) codes by realizing 10 of 12 SSLP-surviving candidates and proving no-go results for the remaining two; all constructions, families, and no-go results are formalized and machine-checked in Lean.

Significance. If the results hold, the work provides a rigorous template for AI-assisted exact discovery that couples combinatorial search with formal verification, yielding machine-checked guarantees rather than heuristic or numerical evidence. The Lean layer is a clear strength, directly supporting the catalogue size, infinite families, and the transversal-T resolution. The stress-test concern regarding potential incompleteness of the SSLP filters and BD16 setting does not land as a load-bearing issue, because the manuscript explicitly scopes all claims (including the ((7,2,3)) resolution) to the residue-class and complementary BD16 frameworks, with verification applying only to the objects that survive those filters.

minor comments (2)
  1. The notation for residue classes and the BD16 group could be introduced with a short self-contained paragraph or diagram in the methods section to aid readers outside the immediate subfield.
  2. Figure captions for the code constructions would benefit from explicit mention of which logical orders or gates are realized in each panel.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and thorough review. We are pleased that the manuscript's contributions—the Lean-certified catalogue of 14,116 codes, the extracted infinite families, the residue-degenerate ((6,4,2)) construction, and the resolution of the transversal-T problem for ((7,2,3)) codes within the BD16 setting—were recognized, along with the strength of the independent Lean 4 verification layer.

Circularity Check

0 steps flagged

No significant circularity; derivation relies on independent search and formal verification

full rationale

The paper constructs a Lean-certified catalogue of quantum codes via combinatorial and subset-sum linear-programming search inside the SSLP framework, followed by exact reconstruction and independent formal verification in Lean 4. The verification layer uses separate formal definitions of codes and gates that do not reference fitted parameters or self-referential quantities from the search results. No load-bearing step reduces by construction to a self-definition, a fitted input renamed as prediction, or a self-citation chain whose content is unverified. The central claims (catalogue size, closed-form families, and transversal-T resolution within the stated settings) are externally checkable via the published Lean proofs and therefore remain non-circular.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the modeling power of the SSLP framework for transversal diagonal gates and on the assumption that the chosen search regimes are representative; no free parameters or invented entities are explicitly introduced in the abstract.

axioms (1)
  • domain assumption The subset-sum linear-programming (SSLP) framework accurately encodes the constraints for nonadditive codes with prescribed transversal diagonal gates.
    Invoked when applying the platform to the quantum code search in both distance-2 and distance-3 regimes.

pith-pipeline@v0.9.0 · 5817 in / 1304 out tokens · 58003 ms · 2026-05-18T04:24:45.905987+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

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

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

Reference graph

Works this paper leans on

64 extracted references · 64 canonical work pages · 9 internal anchors

  1. [1]

    Scientific discovery in the age of artificial intelligence,

    H. Wang, T. Fu, Y. Du, W. Gao, K. Huang, Z. Liu, P. Chandak, S. Liu, P. Van Katwyk, A. Deac, A. Anandkumar, K. Bergen, C. P. Gomes, S. Ho, P. Kohli, J. Lasenby, J. Leskovec, T.-Y. Liu, A. Manrai, D. Marks, B. Ramsundar, L. Song, J. Sun, J. Tang, P. Veličković, M. Welling, L. Zhang, C. W. Coley, Y. Bengio, and M. Zitnik, “Scientific discovery in the age of...

    work page 2023

  2. [2]

    The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery

    C. Lu, C. Lu, R. T. Lange, J. Foerster, J. Clune, and D. Ha, “The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery,” (2024), arXiv:2408.06292 [cs.AI]

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  3. [3]

    How should the advancement of large language models affect the practice of science?

    M. Binz, S. Alaniz, A. Roskies, B. Aczel, C. T. Bergstrom, C. Allen, D. Schad, D. Wulff, J. D. West, Q. Zhang, R. M. Shiffrin, S. J. Gershman, V. Popov, E. M. Bender, M. Marelli, M. M. Botvinick, Z. Akata, and E. Schulz, “How should the advancement of large language models affect the practice of science?” Proc. Natl. Acad. Sci.122, e2401227121 (2025)

    work page 2025

  4. [4]

    FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI

    E. Glazer, E. Erdil, T. Besiroglu, D. Chicharro, E. Chen, A. Gunning, C. F. Olsson, J.-S. Denain, A. Ho, E. d. O. Santos, O. Järviniemi, M. Barnett, R. Sandler, M. Vrzala, J. Sevilla, Q. Ren, E. Pratt, L. Levine, G. Barkley, N. Stewart, B. Grechuk, T. Grechuk, and S. V. Enugandla, “FrontierMath: A benchmark for evaluating advanced mathematical reasoning i...

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  5. [5]

    arXiv preprint arXiv:2506.06214 , year=

    S. Lu, Z. Jin, T. J. Zhang, P. Kos, J. I. Cirac, and B. Schölkopf, “Can Theoretical Physics Research Benefit from Language Agents?” (2025), arXiv:2506.06214 [cs.CL]

    work page arXiv 2025

  6. [6]

    Mastering the game of Go with deep neural networks and tree search,

    D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. van den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot, S. Dieleman, D. Grewe, J. Nham, N. Kalchbrenner, I. Sutskever, T. Lillicrap, M. Leach, K. Kavukcuoglu, T. Graepel, and D. Hassabis, “Mastering the game of Go with deep neural networks and tree search,” Nature529, 484 (2016)

    work page 2016

  7. [7]

    Mastering the game of Go without human knowledge,

    D. Silver, J. Schrittwieser, K. Simonyan, I. Antonoglou, A. Huang, A. Guez, T. Hubert, L. Baker, M. Lai, A. Bolton, Y. Chen, T. Lillicrap, F. Hui, L. Sifre, G. van den Driessche, T. Graepel, and D. Hassabis, “Mastering the game of Go without human knowledge,” Nature550, 354 (2017)

    work page 2017

  8. [8]

    Highly accurate protein structure prediction with AlphaFold,

    J. Jumper, R. Evans, A. Pritzel, T. Green, M. Figurnov, O. Ronneberger, K. Tunyasuvunakool, R. Bates, A. Žídek, A. Potapenko, A. Bridgland, C. Meyer, S. A. A. Kohl, A. J. Ballard, A. Cowie, B. Romera-Paredes, S. Nikolov, R. Jain, J. Adler, T. Back, S. Petersen, D. Reiman, E. Clancy, M. Zielinski, M. Steinegger, M. Pacholska, T. Berghammer, S. Bodenstein, ...

    work page 2021

  9. [9]

    Mathematical discoveries from program search with large language models,

    B. Romera-Paredes, M. Barekatain, A. Novikov, M. Balog, M. P. Kumar, E. Dupont, F. J. R. Ruiz, J. S. Ellenberg, P. Wang, O. Fawzi, P. Kohli, and A. Fawzi, “Mathematical discoveries from program search with large language models,” Nature625, 468 (2024)

    work page 2024

  10. [10]

    Solving olympiad geometry without human demonstrations,

    T. H. Trinh, Y. Wu, Q. V. Le, H. He, and T. Luong, “Solving olympiad geometry without human demonstrations,” Nature625, 476 (2024). 26

    work page 2024

  11. [11]

    Language Models are Few-Shot Learners

    T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell, S. Agarwal, A. Herbert-Voss, G. Krueger, T. Henighan, R. Child, A. Ramesh, D. Ziegler, J. Wu, C. Winter, C. Hesse, M. Chen, E. Sigler, M. Litwin, S. Gray, B. Chess, J. Clark, C. Berner, S. McCandlish, A. Radford, I. Sutskever, and D. Amodei,...

    work page internal anchor Pith review Pith/arXiv arXiv 2020

  12. [12]

    Toolformer: Language Models Can Teach Themselves to Use Tools,

    T. Schick, J. Dwivedi-Yu, R. Dessi, R. Raileanu, M. Lomeli, E. Hambro, L. Zettlemoyer, N. Cancedda, and T. Scialom, “Toolformer: Language Models Can Teach Themselves to Use Tools,” inThirty- Seventh Conference on Neural Information Processing Systems(2023)

    work page 2023

  13. [13]

    Introducing the model context protocol,

    Anthropic, “Introducing the model context protocol,” (2024)

    work page 2024

  14. [14]

    Gorilla: Large language model connected with massive apis,

    S. G. Patil, T. Zhang, X. Wang, and J. E. Gonzalez, “Gorilla: Large language model connected with massive apis,” inAdvances in Neural Information Processing Systems, Vol. 37 (2024) pp. 126544–126565

    work page 2024

  15. [15]

    SciCode: A Research Coding Benchmark Curated by Scientists,

    M. Tian, L. Gao, D. Zhang, X. Chen, C. Fan, X. Guo, R. Haas, P. Ji, K. Krongchon, Y. Li, S. Liu, D. Luo, Y. Ma, H. Tong, K. Trinh, C. Tian, Z. Wang, B. Wu, S. Yin, M. Zhu, K. Lieret, Y. Lu, G. Liu, Y. Du, T. Tao, O. Press, J. Callan, E. A. Huerta, and H. Peng, “SciCode: A Research Coding Benchmark Curated by Scientists,” inThe Thirty-eight Conference on N...

    work page 2024

  16. [16]

    SWE-bench: Can language models resolve real-world github issues?

    C. E. Jimenez, J. Yang, A. Wettig, S. Yao, K. Pei, O. Press, and K. R. Narasimhan, “SWE-bench: Can language models resolve real-world github issues?” inThe Twelfth International Conference on Learning Representations(2024)

    work page 2024

  17. [17]

    OpenAI O1,

    OpenAI, “OpenAI O1,” (2024)

    work page 2024

  18. [18]

    DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning,

    D. Guo, D. Yang, H. Zhang, J. Song, P. Wang, Q. Zhu, R. Xu, R. Zhang, S. Ma, X. Bi, X. Zhang, X. Yu, Y. Wu, Z. F. Wu, Z. Gou, Z. Shao, Z. Li, Z. Gao, A. Liu, B. Xue, B. Wang, B. Wu, B. Feng, C. Lu, C. Zhao, C. Deng, C. Ruan, D. Dai, D. Chen, D. Ji, E. Li, F. Lin, F. Dai, F. Luo, G. Hao, G. Chen, G. Li, H. Zhang, H. Xu, H. Ding, H. Gao, H. Qu, H. Li, J. Gu...

    work page 2025

  19. [19]

    AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation

    Q. Wu, G. Bansal, J. Zhang, Y. Wu, B. Li, E. Zhu, L. Jiang, X. Zhang, S. Zhang, J. Liu, A. H. Awadallah, R. W. White, D. Burger, and C. Wang, “AutoGen: Enabling Next-Gen LLM Applications via Multi-Agent Conversation,” (2023), arXiv:2308.08155 [cs.AI]

    work page internal anchor Pith review Pith/arXiv arXiv 2023

  20. [20]

    Improving Factuality and Reasoning in Language Models through Multiagent Debate

    Y. Du, S. Li, A. Torralba, J. B. Tenenbaum, and I. Mordatch, “Improving Factuality and Reasoning in Language Models through Multiagent Debate,” (2023), arXiv:2305.14325 [cs.CL]

    work page internal anchor Pith review Pith/arXiv arXiv 2023

  21. [21]

    Cognitive Architectures for Language Agents,

    T. Sumers, S. Yao, K. Narasimhan, and T. Griffiths, “Cognitive Architectures for Language Agents,” Transactions on Machine Learning Research (2023)

    work page 2023

  22. [22]

    TeXRA: Your intelligent academic research assistant,

    TeXRA, “TeXRA: Your intelligent academic research assistant,” (2025)

    work page 2025

  23. [23]

    GPT-5 model (API documentation),

    OpenAI, “GPT-5 model (API documentation),” (2025). 27

    work page 2025

  24. [24]

    ReAct: Synergizing Reasoning and Acting in Language Models,

    S. Yao, J. Zhao, D. Yu, N. Du, I. Shafran, K. R. Narasimhan, and Y. Cao, “ReAct: Synergizing Reasoning and Acting in Language Models,” inThe Eleventh International Conference on Learning Representations(2023)

    work page 2023

  25. [25]

    M. A. Nielsen and I. L. Chuang,Quantum Computation and Quantum Information: 10th Anniversary Edition(Cambridge University Press, Cambridge, 2010)

    work page 2010

  26. [26]

    Quantum error correction via codes over GF (4),

    A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, “Quantum error correction via codes over GF (4),” IEEE Trans. Inf. Theory44, 1369 (1998)

    work page 1998

  27. [27]

    Error correcting codes in quantum theory,

    A. M. Steane, “Error correcting codes in quantum theory,” Physical Review Letters77, 793 (1996)

    work page 1996

  28. [28]

    Theory of quantum error-correcting codes,

    E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Phys. Rev. A55, 900 (1997)

    work page 1997

  29. [29]

    Transversality versus universality for additive quantum codes,

    B. Zeng, A. W. Cross, and I. L. Chuang, “Transversality versus universality for additive quantum codes,” IEEE Trans. Inf. Theory57, 6272 (2011)

    work page 2011

  30. [30]

    Restrictions on Transversal Encoded Quantum Gate Sets,

    B. Eastin and E. Knill, “Restrictions on Transversal Encoded Quantum Gate Sets,” Phys. Rev. Lett. 102, 110502 (2009)

    work page 2009

  31. [31]

    Approximate symmetries and quantum error correction,

    Z.-W. Liu and S. Zhou, “Approximate symmetries and quantum error correction,” npj Quantum Information9, 119 (2023)

    work page 2023

  32. [32]

    Classification of transversal gates in qubit stabilizer codes,

    J. T. Anderson and T. Jochym-O’Connor, “Classification of transversal gates in qubit stabilizer codes,” Quantum Information & Computation16, 771 (2016)

    work page 2016

  33. [33]

    Gottesman,Stabilizer Codes and Quantum Error Correction, Ph.D

    D. Gottesman,Stabilizer Codes and Quantum Error Correction, Ph.D. thesis, California Institute of Technology (1997)

    work page 1997

  34. [34]

    A Nonadditive Quantum Code,

    E. M. Rains, R. H. Hardin, P. W. Shor, and N. J. A. Sloane, “A Nonadditive Quantum Code,” Phys. Rev. Lett.79, 953 (1997)

    work page 1997

  35. [35]

    Codeword stabilized quantum codes,

    A. W. Cross, G. Smith, J. Smolin, and B. Zeng, “Codeword stabilized quantum codes,” IEEE Trans. Inf. Theory55, 433 (2009)

    work page 2009

  36. [36]

    Codeword stabilized quantum codes: Algorithm and structure,

    I. L. Chuang, A. W. Cross, G. Smith, J. Smolin, and B. Zeng, “Codeword stabilized quantum codes: Algorithm and structure,” J. Math. Phys.50, 42109 (2009)

    work page 2009

  37. [37]

    Graphical Quantum Error-Correcting Codes

    S. Yu, Q. Chen, and C. H. Oh, “Graphical Quantum Error-Correcting Codes,” (2007), arXiv:0709.1780 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2007

  38. [38]

    Nonadditive quantum error-correcting code,

    S. Yu, Q. Chen, C. Lai, and C. Oh, “Nonadditive quantum error-correcting code,” Physical review letters101, 090501 (2008)

    work page 2008

  39. [39]

    Non-additive quantum codes from goethals and preparata codes,

    M. Grassl and M. Rotteler, “Non-additive quantum codes from goethals and preparata codes,” in 2008 IEEE Information Theory Workshop(IEEE, 2008) pp. 396–400

    work page 2008

  40. [40]

    Permutationally invariant codes for quantum error correction,

    H. Pollatsek and M. B. Ruskai, “Permutationally invariant codes for quantum error correction,” Linear Algebra and its Applications392, 255 (2004)

    work page 2004

  41. [41]

    Permutation-invariant quantum codes,

    Y. Ouyang, “Permutation-invariant quantum codes,” Physical Review A90, 062317 (2014)

    work page 2014

  42. [42]

    Permutation-invariant quantum coding for quantum deletion channels,

    Y. Ouyang, “Permutation-invariant quantum coding for quantum deletion channels,” in2021 IEEE International Symposium on Information Theory (ISIT)(IEEE, 2021) pp. 1499–1503

    work page 2021

  43. [43]

    Measurement-free code-switching for low overhead quantum computation using permutation invariant codes,

    Y. Ouyang, Y. Jing, and G. K. Brennen, “Measurement-free code-switching for low overhead quantum computation using permutation invariant codes,” arXiv preprint arXiv:2411.13142 (2024), arXiv:2411.13142

    work page arXiv 2024

  44. [44]

    Characterizing quantum codes via the coefficients in knill-laflamme conditions,

    M. Du, C. Zhang, Y.-T. Poon, and B. Zeng, “Characterizing quantum codes via the coefficients in knill-laflamme conditions,” arXiv preprint arXiv:2410.07983 (2024), arXiv:2410.07983

    work page arXiv 2024

  45. [45]

    Cross and D

    A. Cross and D. Vandeth, “Small binary stabilizer subsystem codes,” arXiv preprint arXiv:2501.17447 (2025), arXiv:2501.17447 . 28

    work page arXiv 2025

  46. [46]

    Quantum codes of minimum distance two,

    E. M. Rains, “Quantum codes of minimum distance two,” IEEE Transactions on Information theory 45, 266 (2002)

    work page 2002

  47. [47]

    Family of quantum codes with exotic transversal gates,

    E. Kubischta and I. Teixeira, “Family of quantum codes with exotic transversal gates,” Physical Review Letters131, 240601 (2023)

    work page 2023

  48. [48]

    Permutation-invariant quantum codes with transversal generalized phase gates,

    E. Kubischta and I. Teixeira, “Permutation-invariant quantum codes with transversal generalized phase gates,” IEEE Transactions on Information Theory71, 485 (2024)

    work page 2024

  49. [49]

    Transversal gates in nonadditive quantum codes,

    C. Zhang, Z. Wu, S. Huang, and B. Zeng, “Transversal gates in nonadditive quantum codes,” arXiv preprint arXiv:2504.20847 (2025), arXiv:2504.20847

    work page arXiv 2025

  50. [50]

    Visual studio code,

    Microsoft Corporation, “Visual studio code,” (2024)

    work page 2024

  51. [51]

    Chain-of-thought prompting elicits reasoning in large language models,

    J. Wei, X. Wang, D. Schuurmans, M. Bosma, B. Ichter, F. Xia, E. H. Chi, Q. V. Le, and D. Zhou, “Chain-of-thought prompting elicits reasoning in large language models,” inAdvances in Neural Information Processing Systems 35 (NeurIPS 2022)(2022) pp. 24824–24837

    work page 2022

  52. [52]

    Reflexion: Language Agents with Verbal Reinforcement Learning

    N. Shinn, F. Cassano, E. Berman, A. Gopinath, K. Narasimhan, and S. Yao, “Reflexion: Language Agents with Verbal Reinforcement Learning,” (2023), arXiv:2303.11366 [cs.AI]

    work page internal anchor Pith review Pith/arXiv arXiv 2023

  53. [53]

    Let's Verify Step by Step

    H. Lightman, V. Kosaraju, Y. Burda, H. Edwards, B. Baker, T. Lee, J. Leike, J. Schulman, I. Sutskever, and K. Cobbe, “Let’s Verify Step by Step,” (2023), arXiv:2305.20050 [cs.LG]

    work page internal anchor Pith review Pith/arXiv arXiv 2023

  54. [54]

    Latexdiff: A Perl script for visual mark up and revision of significant differences between two LaTeX files,

    F. Tilmann and C. Topping, “Latexdiff: A Perl script for visual mark up and revision of significant differences between two LaTeX files,” (2024)

    work page 2024

  55. [55]

    Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen,

    C. Carathéodory, “Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen,” Mathematische Annalen64, 95 (1907)

    work page 1907

  56. [56]

    Sylvester’s identity and multistep integer-preserving gaussian elimination,

    E. H. Bareiss, “Sylvester’s identity and multistep integer-preserving gaussian elimination,” Mathe- matics of Computation22, 565 (1968)

    work page 1968

  57. [57]

    Bertsimas and J

    D. Bertsimas and J. N. Tsitsiklis,Introduction to Linear Optimization(Athena Scientific, 1997)

    work page 1997

  58. [58]

    Schrijver,Theory of Linear and Integer Programming(Wiley, 1986)

    A. Schrijver,Theory of Linear and Integer Programming(Wiley, 1986)

    work page 1986

  59. [59]

    von zur Gathen and J

    J. von zur Gathen and J. Gerhard,Modern Computer Algebra(Cambridge University Press, 2003)

    work page 2003

  60. [60]

    Factoring polynomials with rational coefficients,

    A. K. Lenstra, H. W. Lenstra, and L. Lovász, “Factoring polynomials with rational coefficients,” Mathematische Annalen261, 515 (1982)

    work page 1982

  61. [61]

    Analysis of PSLQ, an integer relation finding algorithm,

    H. R. P. Ferguson, D. H. Bailey, and S. Arno, “Analysis of PSLQ, an integer relation finding algorithm,” Mathematics of Computation68, 351 (1999)

    work page 1999

  62. [62]

    Symmetry protected topological orders and the group cohomology of their symmetry group,

    X. Chen, Z.-C. Gu, Z.-X. Liu, and X.-G. Wen, “Symmetry protected topological orders and the group cohomology of their symmetry group,” Phys. Rev. B87, 155114 (2013)

    work page 2013

  63. [63]

    B. Zeng, X. Chen, D. Zhou, and X.-G. Wen,Quantum Information Meets Quantum Matter – From Quantum Entanglement to Topological Phase in Many-Body Systems, 1st ed., Quantum Science and Technology (Springer-Verlag New York, 2019) arXiv:1508.02595 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  64. [64]

    Universal quantum computation with ideal Clifford gates and noisy ancillas,

    S. Bravyi and A. Kitaev, “Universal quantum computation with ideal Clifford gates and noisy ancillas,” Phys. Rev. A71, 022316 (2005). 29

    work page 2005