pith. sign in

arxiv: 2605.19471 · v1 · pith:RLFNFFVSnew · submitted 2026-05-19 · 🪐 quant-ph

Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry

Kohei Yamamoto , Keisuke Fujii This is my paper

Pith reviewed 2026-05-20 05:53 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum error correctionBCH codesfault toleranceancilla preparationentanglement distillationcyclic codesquantum computing
0
0 comments X p. Extension
pith:RLFNFFVS Add to your LaTeX paper What is a Pith Number? 
\usepackage{pith}
\pithnumber{RLFNFFVS}

Prints a linked pith:RLFNFFVS badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

The pith

Quantum BCH codes allow fault-tolerant ancilla preparation with reduced overhead by selecting distillation circuits via cyclic symmetry.

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

The paper introduces a two-stage method for preparing ancilla states in quantum BCH codes, starting with non-fault-tolerant circuits followed by entanglement distillation. It develops a framework that uses the codes' cyclic symmetry to pick out which initial circuits will successfully yield fault-tolerant states after distillation. Simulations on high-performance BCH codes with up to 127 qubits show this yields lower spatial overhead and better logical error rates than standard distillation approaches. The work also provides benchmarks under realistic circuit-level noise, pointing toward practical use in fault-tolerant quantum computing on connected platforms like neutral atoms.

Core claim

The authors establish that the cyclic symmetry of quantum BCH codes enables a systematic way to design low-overhead distillation methods for ancilla preparation, by identifying non-fault-tolerant preparation circuits whose outputs can be distilled into fault-tolerant ancillas, with numerical evidence of improved performance over conventional circuits.

What carries the argument

Cyclic symmetry of quantum BCH codes, which identifies viable non-fault-tolerant preparation circuits for successful entanglement distillation into fault-tolerant ancillas.

If this is right

  • Lower spatial overhead for preparing ancillas in quantum BCH codes.
  • Improved logical error rates compared to conventional distillation circuits.
  • Validated performance under circuit-level noise models for codes up to 127 qubits.
  • Potential contribution to realizing practical fault-tolerant quantum computers on highly connected platforms.

Where Pith is reading between the lines

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

  • Similar symmetry exploitation might apply to ancilla preparation in other families of quantum codes that possess cyclic properties.
  • The two-stage preparation could be combined with other fault-tolerance techniques to reduce overall resource costs in quantum algorithms.
  • Hardware experiments on neutral atom systems could test whether the simulated advantages translate to real devices with specific connectivity.

Load-bearing premise

The cyclic symmetry of quantum BCH codes can be used to systematically identify which non-fault-tolerant preparation circuits produce states that distill successfully into fault-tolerant ancillas.

What would settle it

Numerical simulation or experiment on a quantum BCH code up to 127 qubits where the proposed symmetry-based selection fails to produce lower spatial overhead or logical error rates than a conventional distillation circuit under the same noise model.

Figures

Figures reproduced from arXiv: 2605.19471 by Keisuke Fujii, Kohei Yamamoto.

Figure 1
Figure 1. Figure 1: FIG. 1. Schematic overview of the proposed method. An [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Example of the strict-FT check for the quantum [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Success probability per distillation round for the con [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Circuit configuration for the threshold analysis using [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. Threshold analysis results for quantum BCH codes. Multiple points are plotted for each code, where the threshold [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. Effective error model for the entanglement distillation [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗
Figure 10
Figure 10. Figure 10: FIG. 10. Error decomposition result from Fig. 6. [PITH_FULL_IMAGE:figures/full_fig_p012_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: FIG. 11. The relationship between each error and error event. [PITH_FULL_IMAGE:figures/full_fig_p012_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: FIG. 12. Ancilla preparation circuit and error detection pat [PITH_FULL_IMAGE:figures/full_fig_p014_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: FIG. 13. Non-fault-tolerant circuit layout for the quantum BCH code [PITH_FULL_IMAGE:figures/full_fig_p015_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: FIG. 14. Non-fault-tolerant circuit layout for the quantum BCH code [PITH_FULL_IMAGE:figures/full_fig_p016_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: FIG. 15. Non-fault-tolerant circuit layout for the quantum BCH code [PITH_FULL_IMAGE:figures/full_fig_p017_15.png] view at source ↗
read the original abstract

One of the major challenges in realizing fault-tolerant quantum computers (FTQCs) is the requirement for a large number of physical qubits. To address this issue, high-rate quantum error correcting codes, which efficiently embed logical qubits into physical qubits, have recently attracted considerable attention. Among such codes, quantum BCH codes, which offer both high rates and large code distances, are promising yet underexplored candidates. However, no fault-tolerant ancilla preparation method specialized for this class had been established. We employ a two-stage approach (non-fault-tolerant preparation + entanglement distillation) for ancilla preparation. We then propose a framework for designing low-overhead distillation method that strategically leverages the cyclic symmetry of quantum BCH codes to determine which non-fault-tolerant circuits can successfully produce a fault-tolerant state. Numerical simulations on several high-performance quantum BCH codes up to 127 qubits demonstrate that our method achieves lower spatial overhead and logical error rates than conventional distillation circuits. Furthermore, we evaluated the logical error rates under a circuit-level noise model, and obtained performance benchmarks in realistic settings. This efficient state preparation technique is expected to contribute to the early realization of practical FTQCs, particularly on highly connected quantum platforms such as neutral atom systems.

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

2 major / 2 minor

Summary. The paper proposes a two-stage ancilla preparation method (non-fault-tolerant circuit followed by entanglement distillation) for quantum BCH codes and introduces a framework that uses the codes' cyclic symmetry to select which preparation circuits yield states suitable for successful distillation into fault-tolerant ancillas. Numerical simulations on multiple high-performance quantum BCH codes with up to 127 qubits are reported to show lower spatial overhead and logical error rates than conventional distillation circuits, with additional benchmarks under a circuit-level noise model.

Significance. If the performance claims hold, the work would offer a practical, lower-overhead route to ancilla preparation for high-rate, large-distance quantum BCH codes, which remain underexplored despite their potential. The symmetry-based selection rule is presented as a reusable design principle that could generalize beyond the simulated instances and is particularly relevant for highly connected hardware such as neutral-atom arrays. The provision of circuit-level noise simulations supplies concrete, falsifiable benchmarks that strengthen the practical relevance of the results.

major comments (2)
  1. [Framework description (around the symmetry selection rule)] The central claim that cyclic symmetry can be used to systematically identify non-FT preparation circuits whose outputs distill successfully to FT ancillas is load-bearing for the reported overhead and error-rate advantages, yet the manuscript supplies only numerical evidence on codes up to 127 qubits without a derivation showing that the symmetry operation maps to a provable condition on the stabilizer or logical operators that guarantees distillability independent of specific noise realizations. This leaves the framework's reliability open to question.
  2. [Numerical results section] § on numerical simulations: the exact circuit implementations, noise-model parameters (e.g., depolarizing rates per gate, measurement error rates), and statistical error bars on the reported logical error rates and spatial-overhead figures are not fully specified, making it difficult to reproduce or assess the quantitative advantage over conventional distillation circuits.
minor comments (2)
  1. [Framework description] Notation for the cyclic symmetry operators and the precise mapping from symmetry-selected circuits to distillation success criteria should be defined more explicitly, perhaps with a small illustrative example for the smallest BCH code considered.
  2. [Figures] Figure captions for the overhead and error-rate plots should include the precise code parameters (n,k,d) and the number of Monte Carlo shots used for each data point.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thorough review and valuable feedback on our manuscript. We address each of the major comments in detail below and outline the changes we intend to make in the revised version.

read point-by-point responses

  1. Referee: [Framework description (around the symmetry selection rule)] The central claim that cyclic symmetry can be used to systematically identify non-FT preparation circuits whose outputs distill successfully to FT ancillas is load-bearing for the reported overhead and error-rate advantages, yet the manuscript supplies only numerical evidence on codes up to 127 qubits without a derivation showing that the symmetry operation maps to a provable condition on the stabilizer or logical operators that guarantees distillability independent of specific noise realizations. This leaves the framework's reliability open to question.

    Authors: We appreciate the referee pointing out the need for stronger theoretical grounding. Our framework relies on the cyclic symmetry of BCH codes to select preparation circuits, and while the primary support is numerical, this symmetry ensures that the prepared states satisfy the necessary conditions for successful distillation by preserving the commutation relations with the logical operators. We will revise the manuscript to include an expanded explanation and a sketch of how the symmetry maps to stabilizer conditions, providing more insight into why the selection rule works. However, a fully general proof independent of noise realizations is beyond the current scope and would be a valuable direction for future research. revision: partial

  2. Referee: [Numerical results section] § on numerical simulations: the exact circuit implementations, noise-model parameters (e.g., depolarizing rates per gate, measurement error rates), and statistical error bars on the reported logical error rates and spatial-overhead figures are not fully specified, making it difficult to reproduce or assess the quantitative advantage over conventional distillation circuits.

    Authors: We agree that additional details are necessary for reproducibility. In the revised manuscript, we will add a dedicated subsection or appendix detailing the exact circuit implementations used, the specific noise-model parameters (including depolarizing rates and measurement error rates), and the statistical error bars derived from our Monte Carlo simulations. revision: yes

Circularity Check

0 steps flagged

Derivation chain is self-contained; symmetry-based selection rule is independent of fitted inputs or self-citation chains

full rationale

The paper presents a two-stage ancilla preparation method (non-FT prep followed by distillation) and a framework that uses the cyclic symmetry of quantum BCH codes to select suitable prep circuits. This selection rule is introduced as a design principle derived from the algebraic structure of the codes themselves, with performance validated through numerical simulations on codes up to 127 qubits and comparisons to conventional distillation circuits. No load-bearing step reduces by construction to a fitted parameter, a renamed empirical pattern, or a self-citation whose validity depends on the present work. The central claims rest on explicit code properties and external benchmarking rather than tautological redefinition or unverified prior results by the same authors.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the domain assumption that cyclic symmetry provides a reliable filter for distillation success and on the validity of the two-stage non-FT-plus-distillation pipeline; no explicit free parameters or invented entities are described in the abstract.

axioms (1)
  • domain assumption Cyclic symmetry of quantum BCH codes can be leveraged to determine which non-fault-tolerant circuits produce distillable fault-tolerant states.
    This assumption underpins the entire proposed design framework for low-overhead distillation.

pith-pipeline@v0.9.0 · 5746 in / 1193 out tokens · 47797 ms · 2026-05-20T05:53:16.545830+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

45 extracted references · 45 canonical work pages · 5 internal anchors

  1. [1]

    Definition 1(Cyclic codes [33]).LetCbe a binary linear code with parameters[n, k]

    Cyclic Codes A cyclic code is defined as follows. Definition 1(Cyclic codes [33]).LetCbe a binary linear code with parameters[n, k]. If, for every code- wordc= (c n−1, . . . , c1, c0)∈C, its cyclic shiftc ′ = (cn−2, . . . , c0, cn−1)also belongs toC, thenCis called a cyclic code. For algebraic convenience, codewords are represented as polynomials in the q...

    work page

  2. [2]

    best codes known

    Classical BCH Codes We begin by defining classical BCH codes. Definition 2(BCH codes [33]).Letαbe a primitive element of the finite fieldF 2m, namely, a generator of the multiplicative groupF × 2m. For eachβ∈F 2m, letm β(x)∈ F2[x]denote the minimal polynomial ofβoverF 2, i.e., the monic polynomial of smallest degree havingβas a root. Define g(x) = LCM mα(...

    work page

  3. [3]

    cyclic symmetry

    Quantum BCH Codes Quantum BCH codes are CSS codes constructed based on classical BCH codes. Definition 3(Quantum BCH codes [22]).LetCbe a classical BCH code with parameters[n c, kc, dc]and parity check matrixH c. If the classical codeCsatisfies the dual- containing constraint (i.e.,C ⊥ ⊂C), a CSS code can be constructed usingCand its dual codeC ⊥. The sta...

    work page

  4. [4]

    Shor, Fault-tolerant quantum computation, inPro- ceedings of 37th Conference on Foundations of Computer Science(1996) pp

    P. Shor, Fault-tolerant quantum computation, inPro- ceedings of 37th Conference on Foundations of Computer Science(1996) pp. 56–65

    work page 1996

  5. [5]

    Gottesman, Theory of fault-tolerant quantum compu- tation, Phys

    D. Gottesman, Theory of fault-tolerant quantum compu- tation, Phys. Rev. A57, 127 (1998)

    work page 1998

  6. [6]

    M. A. Nielsen and I. L. Chuang,Quantum Computation and Quantum Information(Cambridge University Press, 2000)

    work page 2000

  7. [7]

    A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Physical Review A—Atomic, Molecular, and Optical Physics86, 032324 (2012)

    work page 2012

  8. [8]

    A. G. Fowler and C. Gidney, Low overhead quan- tum computation using lattice surgery, arXiv preprint arXiv:1808.06709 (2018)

    work page arXiv 2018

  9. [9]

    Magic state cultivation: growing T states as cheap as CNOT gates

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

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  10. [10]

    Quantum error correction below the surface code thresh- old, Nature638, 920 (2025)

    work page 2025

  11. [11]

    Rosenfeld, C

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

    work page arXiv 2025

  12. [12]

    How to factor 2048 bit RSA integers with less than a million noisy qubits

    C. Gidney, How to factor 2048 bit rsa integers with less than a million noisy qubits, arXiv preprint arXiv:2505.15917 (2025)

    work page internal anchor Pith review Pith/arXiv arXiv 2048

  13. [13]

    H. Zhou, C. Duckering, C. Zhao, D. Bluvstein, M. Cain, A. Kubica, S.-T. Wang, and M. D. Lukin, Resource anal- ysis of low-overhead transversal architectures for recon- figurable atom arrays, inProceedings of the 52nd An- nual International Symposium on Computer Architecture (2025) pp. 1432–1448. 10

    work page 2025

  14. [14]

    N. P. Breuckmann and J. N. Eberhardt, Quantum low- density parity-check codes, PRX quantum2, 040101 (2021)

    work page 2021

  15. [15]

    Bravyi, A

    S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low- overhead fault-tolerant quantum memory, Nature627, 778 (2024)

    work page 2024

  16. [16]

    Bluvstein, H

    D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner,et al., A quantum processor based on coherent transport of entangled atom arrays, Nature 604, 451 (2022)

    work page 2022

  17. [17]

    Bluvstein, S

    D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter,et al., Logical quantum processor based on reconfigurable atom arrays, Nature626, 58 (2024)

    work page 2024

  18. [18]

    Ryan-Anderson, J

    C. Ryan-Anderson, J. G. Bohnet, K. Lee, D. Gresh, A. Hankin, J. P. Gaebler, D. Francois, A. Chernoguzov, D. Lucchetti, N. C. Brown, T. M. Gatterman, S. K. Halit, K. Gilmore, J. A. Gerber, B. Neyenhuis, D. Hayes, and R. P. Stutz, Realization of real-time fault-tolerant quan- tum error correction, Phys. Rev. X11, 041058 (2021)

    work page 2021

  19. [19]

    Ryan-Anderson, N

    C. Ryan-Anderson, N. Brown, C. Baldwin, J. Dreiling, C. Foltz, J. Gaebler, T. Gatterman, N. Hewitt, C. Hol- liman, C. Horst,et al., High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery, Science385, 1327 (2024)

    work page 2024

  20. [20]

    Postler, F

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

    work page 2024

  21. [21]

    Pecorari, S

    L. Pecorari, S. Jandura, G. K. Brennen, and G. Pupillo, High-rate quantum ldpc codes for long-range-connected neutral atom registers, Nature Communications16, 1111 (2025)

    work page 2025

  22. [22]

    Liang, K

    Z. Liang, K. Liu, H. Song, and Y.-A. Chen, Generalized toric codes on twisted tori for quantum error correction, PRX Quantum6, 020357 (2025)

    work page 2025

  23. [23]

    Nakai and H

    R. Nakai and H. Goto, Subsystem many-hypercube codes: High-rate concatenated codes with low-weight syndrome measurements, Phys. Rev. Appl.25, 014032 (2026)

    work page 2026

  24. [24]

    Yoshida, S

    S. Yoshida, S. Tamiya, and H. Yamasaki, Concatenate codes, save qubits, npj Quantum Information11, 88 (2025)

    work page 2025

  25. [25]

    Quantum BCH Codes

    M. Grassl and T. Beth, Quantum bch codes, arXiv preprint quant-ph/9910060 (1999)

    work page internal anchor Pith review Pith/arXiv arXiv 1999

  26. [26]

    MacWilliams and N

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

    work page 1977

  27. [27]

    L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Low-overhead fault-tolerant quantum computing using long-range connectivity, Science Advances8, eabn1717 (2022)

    work page 2022

  28. [28]

    Goto, Minimizing resource overheads for fault-tolerant preparation of encoded states of the steane code, Scien- tific Reports6, 19578 (2016)

    H. Goto, Minimizing resource overheads for fault-tolerant preparation of encoded states of the steane code, Scien- tific Reports6, 19578 (2016)

    work page 2016

  29. [29]

    Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code

    A. Paetznick and B. W. Reichardt, Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23- qubit golay code, arXiv preprint arXiv:1106.2190 (2011)

    work page internal anchor Pith review Pith/arXiv arXiv 2011

  30. [30]

    Gong and J

    A. Gong and J. M. Renes, Computation with quantum reed-muller codes and their mapping onto 2d atom ar- rays, arXiv preprint arXiv:2410.23263 (2024)

    work page arXiv 2024

  31. [31]

    Gottesman, Surviving as a quantum computer in a classical world, Textbook manuscript preprint8, 8 (2024)

    D. Gottesman, Surviving as a quantum computer in a classical world, Textbook manuscript preprint8, 8 (2024)

    work page 2024

  32. [32]

    Knill, Quantum computing with realistically noisy de- vices, Nature434, 39 (2005)

    E. Knill, Quantum computing with realistically noisy de- vices, Nature434, 39 (2005)

    work page 2005

  33. [33]

    A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett.77, 793 (1996)

    work page 1996

  34. [34]

    Steane, Multiple-particle interference and quantum er- ror correction, Proceedings of the Royal Society of Lon- don

    A. Steane, Multiple-particle interference and quantum er- ror correction, Proceedings of the Royal Society of Lon- don. Series A: Mathematical, Physical and Engineering Sciences452, 2551 (1996)

    work page 1996

  35. [35]

    A. R. Calderbank and P. W. Shor, Good quantum error- correcting codes exist, Phys. Rev. A54, 1098 (1996)

    work page 1996

  36. [36]

    Uematsu,Algebraic Systems and Coding Theory (translated by author), Tokyo tech be-text (Ohmsha, 2010)

    T. Uematsu,Algebraic Systems and Coding Theory (translated by author), Tokyo tech be-text (Ohmsha, 2010)

    work page 2010

  37. [37]

    Peham, L

    T. Peham, L. Schmid, L. Berent, M. M¨ uller, and R. Wille, Automated synthesis of fault-tolerant state prepara- tion circuits for quantum error correction codes (2024), arXiv:2408.11894 [quant-ph]

    work page arXiv 2024

  38. [38]

    T. P. Berger and P. Charpin, The permutation group of affine-invariant extended cyclic codes, IEEE transactions on Information theory42, 2194 (2002)

    work page 2002

  39. [39]

    Quantum computing with Qiskit

    A. Javadi-Abhari, M. Treinish, K. Krsulich, C. J. Wood, J. Lishman, J. Gacon, S. Martiel, P. D. Nation, L. S. Bishop, A. W. Cross, B. R. Johnson, and J. M. Gambetta, Quantum computing with Qiskit (2024), arXiv:2405.08810 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  40. [40]

    Sivarajah, S

    S. Sivarajah, S. Dilkes, A. Cowtan, W. Simmons, A. Edg- ington, and R. Duncan, t—ket〉: a retargetable compiler for nisq devices, Quantum Science and Technology6, 014003 (2020)

    work page 2020

  41. [41]

    Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum5, 497 (2021)

    C. Gidney, Stim: a fast stabilizer circuit simulator, Quan- tum5, 497 (2021)

    work page 2021

  42. [42]

    Webster, S

    M. Webster, S. Koutsioumpas, and D. E. Browne, Heuris- tic and optimal synthesis of cnot and clifford circuits, arXiv preprint arXiv:2503.14660 (2025)

    work page arXiv 2025

  43. [43]

    Kissinger and J

    A. Kissinger and J. Van De Wetering, Pyzx: Large scale automated diagrammatic reasoning, arXiv preprint arXiv:1904.04735 (2019)

    work page arXiv 1904

  44. [44]

    Poltyrev, Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Transactions on Information Theory40, 1284 (1994)

    G. Poltyrev, Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Transactions on Information Theory40, 1284 (1994)

    work page 1994

  45. [45]

    The OEIS Foundation Inc., List of weight distri- butions,https://oeis.org/wiki/List_of_weight_ distributions(2013), accessed: 2025-12-22. Appendix A: Effective Error Model of the Entanglement Distillation Circuit In this appendix, we analyze the errors appearing at the output of the encoding circuits using aneffective er- ror model, as illustrated in Fig....

    work page 2013