REVIEW 2 major objections 4 minor 135 references
Beyond transversality: structure of Clifford circuits for CSS codes
T0 review · 2 major / 4 minor · reviewed 2026-08-08 · deepseek-v4-flash
Pith's one-line read A CSS code with nonzero X- and Z-stabilizer spaces has its entire code-preserving Clifford group generated by Z-diagonal circuits (phase and controlled-Z gates) and their X-basis mirrors; the same generators, joined by CNOT layers…
desk verdict The core generation theorem for code-preserving Clifford circuits is a real, self-contained result; the two-fold transversal extension is plausible but leans on a finite enumeration you cannot check from the paper. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The object that carries the argument is the label-space stabilizer $N=\mathrm{Stab}_{\mathrm{Sp}(2n)}(C)$, where $C=(C_X|0)\oplus(0|C_Z)$ is the $\mathbb{F}_2$-subspace of the $2n$-qubit phase space recording all stabilizer labels of the CSS code. In an adapted symplectic basis that separates stabilizers, logicals, and destabilizers, $N$ takes a rigid block form $U\rtimes(\mathrm{GL}(r)\times\mathrm{Sp}(2k))$, with $U$ a unipotent radical of padding moves. The proof of Theorem C.1 shows that the two diagonal families $S_Z=\{U_Z(S)=(\begin{smallmatrix}I&S\\0&I\end{smallmatrix}): S=S^T,\ C_XS\subseteq C_Z\}$ and $S_X=\{U_X(T)=(\begin{smallmatrix}I&0\\T&I\end{smallmatrix}): T=T^T,\ C_ZT\subseteq C_X\}$ realize both the block-diagonal factor and the radical, hence generate all of $N$. For the fixed-matching theorem, Lemma D.3 manufactures valid diagonal movements directly from the blocks $AB^T$, $D^TB$, $B+B^T$, $CD^T$, $C^TA$, and $C+C^T$ of any valid layer, and Lemma D.4 is a finite exhaustive check on the 6 one-qubit and 720 two-qubit symplectic blocks showing every block reaches a terminal form in at most three moves. Terminal blocks factor as CNOT gates or as $U_Z(B)U_X(C)U_Z(B)$.
What would settle it
Re-run the finite enumeration behind Lemma D.4: list all 6 elements of Sp(2) and all 720 elements of Sp(4), and for each block apply the six moves generated by $AB^T$, $D^TB$, $B+B^T$, $CD^T$, $C^TA$, and $C+C^T$ on both left and right, recording distance to a block with $B=B^T$, $C=C^T$, $AB=BD=CD^T=CA=0$ and $AD^T+BC=I$. If any block takes more than three moves or the terminal set differs from the claimed sixteen, the fixed-matching generation theorem is false.
Extended reading notes
Core claim
The paper's central claim is Theorem C.1: for a CSS code whose label space $C=(C_X|0)\oplus(0|C_Z)$ is split with both $C_X$ and $C_Z$ nonzero, the stabilizer $N=\mathrm{Stab}_{\mathrm{Sp}(2n)}(C)$ of the label space inside the symplectic group is exactly the group generated by Z-diagonal and X-diagonal circuits, $N=\langle S_Z,S_X\rangle$. Since every code-preserving circuit corresponds to such a symplectic map modulo Pauli corrections, this means every code-preserving Clifford circuit is a product of those two diagonal families. Applying the logical-action homomorphism gives the corollary that the two families realize the full logical Clifford group $\mathrm{Sp}(2k)$. The paper extends the argument to the depth-one two-local setting: for any fixed matching $M$, every code-preserving layer is generated by $M$-compatible diagonal circuits and CNOT networks (Theorem D.1), so the two-fold transversal group $N_{2\mathrm{fold}}$ is generated by all depth-one Z-diagonal, X-diagonal, and CNOT layers over all matchings. It also gives a three-layer decomposition of transversal gates and a normal form for automorphisms.
Load-bearing premise
The load-bearing premise is the finite check, cited but not reproduced, that every one- and two-qubit symplectic block reaches a terminal form in at most three moves, which the two-fold transversal theorem needs on top of the mild assumption that the code has both X- and Z-type stabilizers.
Editorial extensions
If this is right
- The full group of code-preserving Clifford circuits of any nontrivial CSS code is explicitly parameterizable by two linear spaces, so membership and generation questions become Gaussian elimination rather than search.
- Every code-preserving depth-one two-local layer on a fixed matching is a word in diagonal circuits and CNOT networks on that matching; hence any stack of such layers over varying matchings lies in the group generated by the depth-one families.
- Transversal gates admit a normal form using at most three diagonal layers, and two layers for connected non-self-dual codes, giving a direct formula for the size of the transversal group from two parameter codes.
- Automorphisms of a CSS code factor into a Hadamard-plus-permutation layer followed by two diagonal transversal circuits, reducing automorphism computations to a permutation problem plus linear algebra.
- The numerical census identifies 78 codes whose full logical Clifford group is generated by two-fold transversal circuits, including distance 12 codes, and the cut-complement and bipartite-grid families are conjectured to be full at every size.
Reading between the lines
- Because the Z- and X-diagonal parameter spaces are linear, the same Gaussian-elimination pipeline could be applied directly to any CSS code, not just the listed databases, to certify whether the two-fold transversal group reaches the full logical Clifford group.
- The paper's two-fold automorphism group construction suggests that in architectures where qubit permutations are cheap, code-preserving two-local layers plus compensating permutations may provide a larger gate set than either mechanism alone; systematically classifying that group is a natural next step.
- The finite check behind Lemma D.4 is independent of the rest of the proof; re-running the enumeration with a different implementation would independently verify the two-fold theorem without changing Theorem C.1.
- The freedom counted in Eq. (15) for a fixed logical action invites explicit circuit-optimization heuristics that search over stabilizer relabeling and padding to shorten physical depth; the paper notes this as an open direction.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper characterizes the group of Clifford circuits that preserve a CSS code, working modulo Pauli operators in the binary symplectic formalism. Its main structural theorem (Theorem C.1) states that for a CSS code with nonzero X- and Z-stabilizer spaces, every code-preserving Clifford circuit is a product of Z-diagonal and X-diagonal circuits, i.e., N = <S_Z, S_X>. The proof is carried out in Appendix C via an adapted symplectic basis, a parabolic block decomposition, and generation of Sp(2k) and GL(r) from the two diagonal families. The paper then defines the two-fold transversal group N_2fold, generated by depth-one two-local code-preserving layers over all matchings, and proves (Theorem D.1 and Corollary D.2) that each fixed-matching layer group N_M is generated by depth-one Z-diagonal, X-diagonal, and CNOT circuits, with the analogous statement for N_2fold in Eq. (28). It also gives normal forms for transversal gates and for the automorphism group Aut(C), and reports numerical experiments on 136 CSS codes, finding 78 codes whose full logical Clifford group is generated by two-fold transversal circuits, plus lower bounds for 58 further codes.
Significance. If the results are correct, the paper makes a substantial contribution: Theorem C.1 reduces computation of the full code-preserving Clifford group of a CSS code to linear algebra on the two classical codes, and its logical-completeness corollary is strong and cleanly stated. The normal forms for transversal gates and for Aut(C) are elegant and appear to be proved in detail. The fixed-matching generation theorem, if fully verified, would give a structural characterization of depth-one two-local layers that is of independent interest for fault-tolerant gate design. The numerical census is useful but is explicitly advertised as relying on external databases and certificates. The main caveat is that the proof of Theorem D.1 depends on a finite enumeration (Lemma D.4) whose certificate is not reproduced in the manuscript.
major comments (2)
- [Appendix D, Lemma D.4 and Theorem D.1] The proof of the fixed-matching generation theorem D.1, Eq. (D3), rests on Lemma D.4, which asserts that every element of Sp(4) reaches a terminal block in at most three moves and every element of Sp(2) in at most one move. This is presented as an exhaustive finite verification, but the certificate is not reproduced in the manuscript; the paper only states that a certificate exists at Ref. [94]. Since this lemma is the sole non-algebraic step in the proof of Theorem D.1, and since Corollary D.2 and Eq. (28) inherit that reliance, the central two-fold-transversal claims cannot be fully verified from the manuscript alone. I recommend that the authors include the certificate, the distance table, or a machine-checkable proof script as supplementary material in the revised version.
- [Section VI, Tables I and II; Appendix A.2] The numerical claims of 78 full codes and the lower bounds in Table II depend on unreleased databases and on machine-readable JSON files that are said to be available only in the certificate repository of Ref. [94]. The paper does not provide the generators, the matching search data, or the exact group-order certificates in the manuscript itself. While this does not affect the group-theoretic theorems, it blocks reproducibility of the census claims. Please make the data and verification scripts available with the submission or describe a concrete public repository and checksum protocol in the revised version.
minor comments (4)
- [Section V, Eq. (27)] The definition of the two-fold transversal group is slightly informal: it is generated by all depth-one two-local layers, but the term 'depth-one two-local' could be misread as requiring two-qubit gates on every qubit. Section V then correctly clarifies that singletons are also allowed; I suggest moving that clarification into the definition itself.
- [Section IV, Eq. (17)] The parameter codes A_Z and A_X are defined with the pointwise product (a⊙C_X), but the notation a⊙C_X is not explained before Eq. (17) in the main text; the master symbol list in Appendix B defines it later. A one-sentence parenthetical in Section IV would make the definition immediately readable.
- [Section VI, Table I caption] The table lists 'Wt' and 'Deg' but the caption does not state whether these are check weights and qubit degrees of a specific generating set or invariants of the code; Appendix A.2 suggests they come from a chosen generating set. This should be stated in the caption.
- [Section VIII A, Eq. (41)] The normal form Aut(C)=W·S_Z^∅·S_X^∅ is stated in the main text and proved in Appendix F, but the main-text paragraph around Eq. (42) writes the formula (H(a);π)U_Z(q)U_X(p) without saying whether the support-disjointness condition on q and p is a uniqueness requirement or an additional restriction. Adding one sentence clarifying that the factorization is unique under q⊙p=0 would help.
Circularity Check
No circular derivation found; only an unreproduced finite certificate in Appendix D is a verifiability note.
full rationale
Walked the full derivation chain. Theorem C.1 is proved from the parabolic block form (Lemma C.2), standard generation of Sp(2k) by symplectic transvections, and generation of GL(r) by elementary transvections; no parameter is fitted from the statement being proved. Theorem D.1's only non-algebraic input is Lemma D.4, a finite exhaustive check over Sp(2) and Sp(4); the paper reports the exact distance distribution (D25) and points to a replayable certificate at Ref. [94]. This is an unreproduced verification step, but it is not circular: the terminal set is defined independently of the conclusion and the check is in principle machine-verifiable. Equation (28) is assembled from the definition of N_2fold as the group generated by all N_M and Theorem D.1, not assumed as an input. The full-code and logical-image claims are lower bounds computed by Schreier-Sims/MeatAxe and are not used to set any parameter of the generation theorems; no fitted input is later relabeled as a prediction. The only self-reference of note is the certificate repository, which is load-bearing for the two-fold-transversal census but is a reproducibility concern rather than a circular reduction.
Assumptions & free parameters
assumptions (5)
- domain assumption CSS label space is split isotropic: C = (C_X|0) + (0|C_Z) and C_X is orthogonal to C_Z.
- domain assumption The hypotheses r_X >= 1 and r_Z >= 1 for Theorem C.1.
- standard math Standard results on binary symplectic groups: Sp(2k) is generated by symplectic transvections and has the stated parabolic subgroup structure.
- ad hoc to paper Lemma D.4: every element of Sp(2) reaches a terminal block in at most one move and every element of Sp(4) in at most three moves.
- domain assumption The cited code databases and certificate repository are correct and complete for the numerical tables.
Cite this review
Pith. "Pith review of Beyond transversality: structure of Clifford circuits for CSS codes." pith.science (2026). https://pith.science/paper/EVNZXPZV
@misc{pith2026260805688,
author = {Pith},
title = {Pith review of: Beyond transversality: structure of Clifford circuits for CSS codes},
year = {2026},
howpublished = {\url{https://pith.science/paper/EVNZXPZV}},
note = {Machine review of arXiv:2608.05688}
}
abstract
We characterize four groups of Clifford circuits for Calderbank--Shor--Steane (CSS) codes that are relevant to fault-tolerant logical operations. First, we show that every code-preserving Clifford circuit is a product of Z-diagonal circuits, composed of S and CZ gates, and their X-basis analogues. Second, we define the two-fold transversal group, generated by depth-one two-local code-preserving circuits, and show that each of its elements can be expressed as a product of layers consisting of either Z-diagonal, X-diagonal, or CNOT gates. As a corollary, every transversal gate is a product of three transversal diagonal circuits; for connected non-self-dual codes, two such circuits suffice. We further show that every code-preserving automorphism circuit, consisting of single-qubit Clifford gates and permutations, has a normal form comprising a Hadamard layer, a permutation, and two diagonal circuits. We also define a two-fold automorphism group, in which a depth-one two-local circuit may be code-preserving up to a permutation, and show that its logical image can be larger than that of the two-fold transversal group. For 136 CSS codes, we provide explicit generators and determine the logical image of the two-fold transversal group. We find 78 codes whose full logical Clifford group is generated by two-fold-transversal circuits, including codes of distances 3, 4, 5, 6, 8, and 12, with respective rates $2/5$, $3/4$, $1/9$, $1/5$, $2/5$, and $3/56$. We construct three families of CSS codes from bipartite grids, cut-complements, and quadrics, many of which realize the full logical Clifford group in this way. More generally, the induced logical group can be large even when it is not full logical Clifford group: it has order at least $460\,800$ for the gross code and roughly $10^{26}$ for a clustered-cyclic code.
Figures
Reference graph
Works this paper leans on
-
[94]
E. Hostens, J. Dehaene, and B. De Moor, Stabilizer states and clifford operations for systems of arbitrary dimensions and modular arithmetic, Physical Review A 71, 10.1103/physreva.71.042315 (2005)
-
[1]
The group is an exact three-fold product of two diagonal families and one family of Hadamard-plus- permutation elements
-
[2]
The factorization of a given element is unique, and a closed formula reads it off the local blocks of that element
-
[3]
We identify that ingredient
One ingredient of the group is the only irreducible cost in computing it. We identify that ingredient. We write Aut(C) = Sp(2)≀S n ∩Stab(C),(F1) which is the same as (Sp(2)≀S n)∩N, and we adopt throughout the convention that the pair (g;π) withg∈ Sp(2)n andπ∈S n denotes the matrix productP π g. The matrixP π acts in the same way on the two halves of the p...
-
[4]
Hence N ∅ ={H(a) :a∈ A Z ∩ AX } ·SZ ∅ ·S X ∅ (F23) as a product of sets. The factorization(F22)is the unique one with disjoint diagonal-circuit supports, and consequently |N ∅|= # (a, q, p)∈(AZ ∩ AX )× AZ × AX such thatq⊙p= 0 .(F24) Proof.Apply Lemma F.2 withC 1 =C 0 =C, which is legitimate becauseg∈N ∅ means preciselyCg=C. It gives (F22) together withq∈ ...
-
[5]
The permutation part now follows from the same lemma, applied with the two spaces distinct
This is consistent withN ∅ =⟨S Z ∅ ,S X ∅ ⟩being the diagonal copy of Sp(2), of order six. The permutation part now follows from the same lemma, applied with the two spaces distinct. Lemma F.4(Pure-Hadamard lift).Let(g;π)∈Aut(C) and leta=B⊙Cbe read off the blocks ofg. Then (H(a);π)∈W. In particular everyπ∈ρ(Aut(C))ad- mits a lift whose local part consists...
-
[6]
A. R. Calderbank and P. W. Shor, Good quantum error- correcting codes exist, Physical Review A54, 1098–1105 (1996)
1996
-
[7]
A. M. Steane, Error correcting codes in quantum theory, Physical Review Letters77, 793–797 (1996)
1996
Show all 135 references
-
[8]
Bluvstein, S
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Ro- driguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuleti´ c, and M. D. Lu...
2023
-
[9]
Paetznick, M
A. Paetznick, M. P. da Silva, C. Ryan-Anderson, J. M. Bello-Rivas, J. P. C. III, A. Chernoguzov, J. M. Dreiling, C. Foltz, F. Frachon, J. P. Gaebler, T. M. Gatterman, L. Grans-Samuelsson, D. Gresh, D. Hayes, N. Hewitt, C. Holliman, C. V. Horst, J. Johansen, D. Lucchetti, Y. Ma...
2024 arXiv
-
[10]
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–782 (2024)
2024
-
[11]
G. H. Low, W. J. Huggins, D. W. Berry, T. Khattar, A. F. White, N. C. Rubin, and R. Babbush, A denser planar surface code (2026), arXiv:2605.30455 [quant- ph]
2026 arXiv
-
[12]
M. Cain, Q. Xu, R. King, L. R. B. Picard, H. Levine, M. Endres, J. Preskill, H.-Y. Huang, and D. Blu- vstein, Shor’s algorithm is possible with as few as 10,000 reconfigurable atomic qubits (2026), arXiv:2603.28627 [quant-ph]
2026 arXiv
-
[13]
D. E. Gottesman,Stabilizer Codes and Quantum Error Correction, Ph.D. thesis (1997)
1997
-
[14]
B. Zeng, A. Cross, and I. L. Chuang, Transversality versus universality for additive quantum codes, IEEE Transactions on Information Theory57, 6272–6284 (2011)
2011
-
[15]
J. T. Anderson and T. Jochym-O’Connor, Classification of transversal gates in qubit stabilizer codes, Quantum Information and Computation16, 771–802 (2016). 52
2016
-
[16]
Dasu and S
S. Dasu and S. Burton, A classification of transver- sal clifford gates for qubit stabilizer codes (2025), arXiv:2507.10519 [quant-ph]
2025 arXiv
-
[17]
Tansuwannont, Y
T. Tansuwannont, Y. Takada, and K. Fujii, Clifford gates with logical transversality for self-dual css codes (2025), arXiv:2503.19790 [quant-ph]
2025 arXiv
-
[18]
S. P. Jain and V. V. Albert, Transversal clifford and t - gate codes of short length and high distance, IEEE Jour- nal on Selected Areas in Information Theory6, 127–137 (2025)
2025
-
[19]
A. Barg, N. J. Coble, D. Hangleiter, and C. Kang, Geometric structure and transversal logic of quantum reed–muller codes, IEEE Transactions on Information Theory72, 415–436 (2026)
2026
-
[20]
Camps-Moreno, H
E. Camps-Moreno, H. H. L´ opez, G. L. Matthews, N. Rengaswamy, and R. San-Jos´ e, Transversal gates for quantum css codes (2026), arXiv:2601.21514 [cs.IT]
2026
-
[21]
J. Haruna, Homological origin of transversal imple- mentability of logical diagonal gates in quantum css codes, Progress of Theoretical and Experimental Physics 10.1093/ptep/ptag133 (2026)
2026 doi
-
[22]
Eastin and E
B. Eastin and E. Knill, Restrictions on transversal en- coded quantum gate sets, Physical Review Letters102, 10.1103/physrevlett.102.110502 (2009)
2009 doi
-
[24]
A. O. Quintavalle, P. Webster, and M. Vasmer, Parti- tioning qubits in hypergraph product codes to imple- ment logical gates, Quantum7, 1153 (2023)
2023
-
[25]
N. P. Breuckmann and S. Burton, Fold-transversal clif- ford gates for quantum codes, Quantum8, 1372 (2024)
2024
-
[26]
J. N. Eberhardt and V. Steffan, Logical operators and fold-transversal gates of bivariate bicycle codes, IEEE Transactions on Information Theory71, 1140–1152 (2025)
2025
-
[27]
Y. Li, Z. Li, Z.-W. Liu, and Q. T. Nguyen, Poincar´ e duality and multiplicative structures on quantum codes (2025), arXiv:2512.21922 [quant-ph]
2025
-
[28]
Berthusen and E
N. Berthusen and E. Durso-Sabina, Simple logical quan- tum computation with concatenated symplectic double codes (2025), arXiv:2510.18753 [quant-ph]
2025
-
[29]
Cao and B
C. Cao and B. Lackey, Quantum lego power-up: De- signing transversal gates with tensor networks (2026), arXiv:2603.03542 [quant-ph]
2026
-
[30]
Zheng, G
H. Zheng, G. Zheng, L. Jiang, and Q. Xu, Logical com- putation with canonical lifted product codes (2026), arXiv:2607.28605 [quant-ph]
2026 arXiv
-
[31]
Hong, Quantum ldpc codes with design rate 1/5 and good performance below 1000 physical qubits (2026), arXiv:2607.27644 [quant-ph]
Y. Hong, Quantum ldpc codes with design rate 1/5 and good performance below 1000 physical qubits (2026), arXiv:2607.27644 [quant-ph]
2026 arXiv
-
[32]
Anonymous, No-go theorem on fault tolerant gadgets for multiple logical qubits, PRX Quantum 10.1103/y14y- 7kp3 (2026)
2026 doi
-
[33]
Tiew and N
R. Tiew and N. P. Breuckmann, Low-overhead entan- gling gates from generalised dehn twists, IEEE Trans- actions on Information Theory71, 5452–5468 (2025)
2025
-
[34]
G. Zhu, S. Sikander, E. Portnoy, A. W. Cross, and B. J. Brown, Non-clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate ho- mological quantum low-density parity-check codes via higher symmetries, PRX Quantum6, 10.1103/wcxs- w69t (2025)
2025 doi
-
[35]
N. P. Breuckmann, M. Davydova, J. N. Eberhardt, and N. Tantivasadakarn, Cups and gates i: Cohomology invariants and logical quantum operations, Communi- cations in Mathematical Physics407, 10.1007/s00220- 026-05570-z (2026)
2026 doi
-
[36]
Gulshen and T
K. Gulshen and T. Kaufman, Symmetric self-dual quantum codes on high dimensional expanders (2026), arXiv:2510.07864 [quant-ph]
2026
-
[37]
Holmes, Quantum logic codes: Complete transver- sal logical clifford instruction sets for high-rate stabilizer quantum error correcting codes (2026), arXiv:2606.13521 [quant-ph]
A. Holmes, Quantum logic codes: Complete transver- sal logical clifford instruction sets for high-rate stabilizer quantum error correcting codes (2026), arXiv:2606.13521 [quant-ph]
2026 arXiv
-
[38]
Benhemou and N
A. Benhemou and N. Berthusen, Automated logical clif- ford gadgets for heterogeneous architectures via chain maps (2026), arXiv:2607.02482 [quant-ph]
2026 arXiv
-
[39]
N. Alon, F. R. K. Chung, and R. L. Graham, Routing permutations on graphs via matchings, SIAM Journal on Discrete Mathematics7, 513–530 (1994)
1994
-
[40]
Grassl and M
M. Grassl and M. Roetteler, Leveraging automorphisms of quantum codes for fault-tolerant quantum computa- tion, in2013 IEEE International Symposium on Infor- mation Theory(IEEE, 2013) p. 534–538
2013
-
[41]
Sayginel,autqec: Logical Clifford gates from code automorphisms, Software,https://github.com/ hsayginel/autqec(2024), Python library with a MAGMA interface; GPL-3.0
H. Sayginel,autqec: Logical Clifford gates from code automorphisms, Software,https://github.com/ hsayginel/autqec(2024), Python library with a MAGMA interface; GPL-3.0
2024
-
[42]
Sayginel, S
H. Sayginel, S. Koutsioumpas, M. Webster, A. Ra- jput, and D. E. Browne, Fault-tolerant logical clif- ford gates from code automorphisms, PRX Quantum 6, 10.1103/vf7v-cpq9 (2025)
2025 doi
-
[43]
Berthusen, M
N. Berthusen, M. J. Gullans, Y. Hong, M. Mudassar, and S. J. S. Tan, Automorphism gadgets in homological product codes (2025), arXiv:2508.04794 [quant-ph]
2025 arXiv
-
[44]
J. M. Koh, A. Gong, A. C. Diaconu, D. B. Tan, A. A. Geim, M. J. Gullans, N. Y. Yao, M. D. Lukin, and S. Majidy, Entangling logical qubits without physical operations (2026), arXiv:2601.20927 [quant-ph]
2026
-
[45]
Chen, M.-C
Z.-H. Chen, M.-C. Chen, C.-Y. Lu, and J.-W. Pan, Transversal logical clifford gates on the rotated surface code with reconfigurable neutral atom arrays, Physical Review Letters136, 10.1103/m7tq-9v3g (2026)
2026 doi
-
[46]
Dehaene and B
J. Dehaene and B. De Moor, Clifford group, stabilizer states, and linear and quadratic operations over gf(2), Physical Review A68, 10.1103/physreva.68.042318 (2003)
2003 doi
-
[47]
Rengaswamy, R
N. Rengaswamy, R. Calderbank, H. D. Pfister, and S. Kadhe, Synthesis of logical clifford operators via sym- plectic geometry, in2018 IEEE International Sympo- sium on Information Theory (ISIT)(IEEE, 2018) p. 791–795
2018
-
[48]
Rengaswamy, R
N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister, Logical clifford synthesis for stabilizer codes, IEEE Transactions on Quantum Engineering1, 1–17 (2020)
2020
-
[49]
Liu, Y.-X
S.-C. Liu, Y.-X. Lin, Y.-X. Wang, and L.-Y. Peng, Sys- tematic algebraic method to identify clifford operations for quantum error-correction codes, Chinese Physics Letters43, 040603 (2026)
2026
-
[50]
M. A. Webster, A. O. Quintavalle, and S. D. Bartlett, Transversal diagonal logical operators for stabiliser codes, New Journal of Physics25, 103018 (2023)
2023
-
[51]
Bauer, Finding diagonal logical gates in css codes and circuits (2026), arXiv:2607.26477 [quant-ph]
A. Bauer, Finding diagonal logical gates in css codes and circuits (2026), arXiv:2607.26477 [quant-ph]
2026 arXiv
-
[52]
Artin,Geometric Algebra(Wiley, 1988)
E. Artin,Geometric Algebra(Wiley, 1988)
1988
-
[53]
R. W. Carter,Simple Groups of Lie Type, Pure and 53 Applied Mathematics, Vol. 28 (Wiley-Interscience, Lon- don, 1972)
1972
-
[54]
D. E. Taylor,The Geometry of the Classical Groups, Sigma Series in Pure Mathematics, Vol. 9 (Heldermann Verlag, Berlin, 1992)
1992
-
[55]
Grove,Classical Groups and Geometric Algebra (American Mathematical Society, 2001)
L. Grove,Classical Groups and Geometric Algebra (American Mathematical Society, 2001)
2001
-
[56]
Malle and D
G. Malle and D. Testerman,Linear Algebraic Groups and Finite Groups of Lie Type(Cambridge University Press, 2011)
2011
-
[57]
Bombin and M
H. Bombin and M. A. Martin-Delgado, Topologi- cal quantum distillation, Physical Review Letters97, 10.1103/physrevlett.97.180501 (2006)
2006 doi
-
[58]
Bombin and M
H. Bombin and M. A. Martin-Delgado, Exact topo- logical quantum order ind=3and beyond: Branyons and brane-net condensates, Physical Review B75, 10.1103/physrevb.75.075103 (2007)
2007 doi
-
[59]
Tansuwannont, T
T. Tansuwannont, T. Chan, and R. Takagi, Construc- tion of the full logical clifford group for high-rate quan- tum reed-muller codes using only transversal and fold- transversal gates (2026), arXiv:2602.09788 [quant-ph]
2026 arXiv
-
[60]
Lai, P.-H
C.-Y. Lai, P.-H. Liou, and Y. Ouyang, Fault- tolerant quantum error correction for constant- excitation stabilizer codes under coherent noise (2025), arXiv:2507.10395 [quant-ph]
2025 arXiv
-
[61]
V. V. Albert and P. Faist, Handbook of error-correcting codes (2026), arXiv:2606.11484 [quant-ph]
2026 arXiv
-
[63]
B. Gu, T. Noszko, V. Steffan, J. N. Eberhardt, J. Roffe, J. Eisert, and S. Koutsioumpas, Nearest- neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid (2026), arXiv:2606.19482 [quant-ph]
2026 arXiv
-
[64]
Tiew and N
R. Tiew and N. P. Breuckmann, Copy-cup gates in tensor products of group algebra codes (2026), arXiv:2602.23307 [quant-ph]
2026
-
[65]
B. Gu, A. Z. Liu, A. O. Quintavalle, Q. Xu, J. Eisert, and J. Roffe, Qgpu: Parallel logic in quantum ldpc codes (2026), arXiv:2603.05398 [quant-ph]
2026
-
[67]
Patel, I
K. Patel, I. Markov, and J. Hayes, Optimal synthesis of linear reversible circuits, Quantum Information and Computation8, 282–294 (2008)
2008
-
[68]
Guyot and S
J. Guyot and S. Jaques, On the addressability problem on css codes, Quantum10, 2145 (2026)
2026
-
[69]
K. Su, Z. Yang, and C.-M. Jian, Tapestry of dualities in decohered quantum error correction codes, Physical Review B110, 10.1103/physrevb.110.085158 (2024)
2024 doi
-
[70]
L. H. English, H. Luo, Y. Wang, B. Srivastava, S. D. Bartlett, and D. J. Williamson, Duality constrains op- timal thresholds in quantum error correction (2026), arXiv:2607.21160 [quant-ph]
2026 arXiv
-
[71]
Bravyi and D
S. Bravyi and D. Maslov, Hadamard-free circuits expose the structure of the clifford group, IEEE Transactions on Information Theory67, 4546–4563 (2021)
2021
-
[72]
Popov, N
A. Popov, N. Meyer, D. D. Scherer, and G. Dietl, Op- timized compilation of logical clifford circuits (2026), arXiv:2602.12831 [quant-ph]
2026 arXiv
-
[73]
Cross and D
A. Cross and D. Vandeth, Small binary stabilizer sub- system codes (2025), arXiv:2501.17447 [quant-ph]
2025 arXiv
-
[74]
Cross, G
A. Cross, G. Harper, B. Het´ enyi, I. Sit- dikov, D. Vandeth, J. Wootton, and H. Zhang, The Qiskit QEC software framework,https: //github.com/qiskit-community/qiskit-qec/tree/ 0dff1fd32da4a9a0e3c6cff8a0d00bb0445c6e25(2025), pinned at commit0dff1fd3, which added then= 9 base co...
2025
-
[75]
Gottesman, Quantum fault tolerance in small exper- iments (2016), arXiv:1610.03507 [quant-ph]
D. Gottesman, Quantum fault tolerance in small exper- iments (2016), arXiv:1610.03507 [quant-ph]
2016 arXiv
-
[76]
Vasmer and A
M. Vasmer and A. Kubica, Morphing quantum codes, PRX Quantum3, 10.1103/prxquantum.3.030319 (2022)
2022 doi
-
[77]
Bravyi, B
S. Bravyi, B. M. Terhal, and B. Leemhuis, Majorana fermion codes, New Journal of Physics12, 083039 (2010)
2010
-
[78]
A. A. Kovalev and L. P. Pryadko, Quantum kro- necker sum-product low-density parity-check codes with finite rate, Physical Review A88, 10.1103/phys- reva.88.012311 (2013)
2013 doi
-
[79]
M. L. Liu, N. Tantivasadakarn, and V. V. Albert, Sub- system css codes, a tighter stabilizer-to-css mapping, and goursat’s lemma, Quantum8, 1403 (2024)
2024
-
[80]
Burton, E
S. Burton, E. Durso-Sabina, and N. C. Brown, Genons, double covers and fault-tolerant clifford gates (2024), arXiv:2406.09951 [quant-ph]
2024 arXiv
-
[81]
Arf, Untersuchungen ¨ uber quadratische formen in k¨ orpern der charakteristik 2
C. Arf, Untersuchungen ¨ uber quadratische formen in k¨ orpern der charakteristik 2. (teil i.)., crll1941, 148–167 (1941)
1941
-
[82]
B. N. Cooperstein, Minimal degree for a permutation representation of a classical group, Israel Journal of Mathematics30, 213–235 (1978)
1978
-
[83]
A. S. Morris and D. Malz, Constraints on phan- tom codes from automorphism group bounds (2026), arXiv:2604.15111 [quant-ph]
2026 arXiv
-
[84]
Bluvstein, H
D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuleti´ c, and M. D. Lukin, A quantum processor based on coherent transport of entangled atom arrays, Nature604, 451–456 (2022)
2022
-
[85]
Patra and A
A. Patra and A. Barg, Targeted clifford logical gates for hypergraph product codes, Quantum9, 1842 (2025)
2025
-
[86]
Bravyi, R
S. Bravyi, R. Shaydulin, S. Hu, and D. Maslov, Clifford circuit optimization with templates and symbolic pauli gates, Quantum5, 580 (2021)
2021
-
[87]
Bravyi, J
S. Bravyi, J. A. Latone, and D. Maslov, 6-qubit op- timal clifford circuits, npj Quantum Information8, 10.1038/s41534-022-00583-7 (2022)
2022 doi
-
[88]
A. Y. Kitaev, Quantum computations: algorithms and error correction, Russian Mathematical Surveys52, 1191–1249 (1997)
1997
-
[89]
Bombin and M
H. Bombin and M. A. Martin-Delgado, Homological er- ror correction: Classical and quantum codes, Journal of Mathematical Physics48, 10.1063/1.2731356 (2007)
2007 doi
-
[90]
Bravyi and M
S. Bravyi and M. B. Hastings, Homological product codes, inProceedings of the forty-sixth annual ACM symposium on Theory of computing, STOC ’14 (ACM,
-
[91]
N. P. Breuckmann,Homological quantum codes beyond the toric code, Ph.D. thesis (2018)
2018
-
[92]
Zou and H.-K
X. Zou and H.-K. Lo, Algebraic topology principles behind topological quantum error correction (2026), arXiv:2505.06082 [quant-ph]
2026
-
[93]
Bauer and S
A. Bauer and S. Lloyd, Quadratic tensors as a uni- 54 fication of clifford, gaussian, and free-fermion physics (2026), arXiv:2601.15396 [quant-ph]
2026
-
[95]
Van den Nest, Efficient classical simulations of quan- tum fourier transforms and normalizer circuits over abelian groups, Quantum Information and Computa- tion13, 1007–1037 (2013)
M. Van den Nest, Efficient classical simulations of quan- tum fourier transforms and normalizer circuits over abelian groups, Quantum Information and Computa- tion13, 1007–1037 (2013)
2013
-
[96]
Bermejo-Vega and M
J. Bermejo-Vega and M. Van den Nest, Classical simula- tions of abelian-group normalizer circuits with interme- diate measurements, Quantum Information and Com- putation14, 181–216 (2014)
2014
-
[97]
Bermejo-Vega, C
J. Bermejo-Vega, C. Y.-Y. Lin, and M. Van den Nest, Normalizer circuits and a gottesman-knill theorem for infinite-dimensional systems, Quantum Information and Computation16, 361–422 (2016)
2016
-
[98]
Moses, J
M. Moses, J. Horecki, K. Deka, and J. Tu lowiecki, Clif- ford circuits on qudits of mixed dimension, Quantum Information & Computation26, 180–191 (2026)
2026
-
[99]
V. V. Albert, Reduction certificate and code data for depth-one two-local Clifford circuits, Soft- ware and data,https://github.com/valbert4/ two-fold-transversal(2026)
2026
-
[100]
M. B. Hastings, Small majorana fermion codes, Quan- tum Information and Computation17, 1191–1205 (2017)
2017
-
[101]
J. Haah, M. B. Hastings, D. Poulin, and D. Wecker, Magic state distillation with low space overhead and optimal asymptotic input count, Quantum1, 31 (2017)
2017
-
[102]
Delfosse and B
N. Delfosse and B. W. Reichardt, Short shor-style syn- drome sequences (2020), arXiv:2008.05051 [quant-ph]
2020 arXiv
-
[103]
Prabhu and B
P. Prabhu and B. W. Reichardt, Distance-four quantum codes with combined postselection and error correction, Physical Review A110, 10.1103/physreva.110.012419 (2024)
2024 doi
-
[104]
M. B. Hastings, A class of cyclic quantum codes (2025), arXiv:2509.06865 [quant-ph]
2025
-
[105]
B. W. Reichardt, D. Aasen, and R. Chao, Fire and ice: Partially fault-tolerant quantum computing with selec- tive state filtering (2026), arXiv:2605.15344 [quant-ph]
2026 arXiv
-
[106]
A. A. Kovalev and L. P. Pryadko, Improved quantum hypergraph-product ldpc codes, in2012 IEEE Interna- tional Symposium on Information Theory Proceedings (IEEE, 2012) p. 348–352
2012
-
[107]
QEC database,https://qecdb.org/(2026), online database of quantum error-correcting codes; accessed 2026
2026
-
[108]
Goto, High-performance fault-tolerant quantum computing with many-hypercube codes, Science Ad- vances10, 10.1126/sciadv.adp6388 (2024)
H. Goto, High-performance fault-tolerant quantum computing with many-hypercube codes, Science Ad- vances10, 10.1126/sciadv.adp6388 (2024)
2024 doi
-
[109]
Liang and Y.-A
Z. Liang and Y.-A. Chen, Self-dual bivariate bicycle codes with transversal clifford gates, npj Quantum In- formation 10.1038/s41534-026-01303-1 (2026)
2026 doi
-
[110]
Aydin, I
A. Aydin, I. Tamo, and A. Barg, Breaking the bicy- cle frame: Coset-based quantum ldpc codes (2026), arXiv:2606.17268 [quant-ph]
2026 arXiv
-
[111]
Kasai, Breaking the orthogonality barrier in quan- tum ldpc codes (2026), arXiv:2601.08824 [quant-ph]
K. Kasai, Breaking the orthogonality barrier in quan- tum ldpc codes (2026), arXiv:2601.08824 [quant-ph]
2026
-
[112]
F. A. Mian, O. Gwilliam, and S. Krastanov, Multivari- ate multicycle codes for complete single-shot decoding (2026), arXiv:2601.18879 [quant-ph]
2026 arXiv
-
[113]
Krastanov, F
S. Krastanov, F. A. Mian, S. K. bot, Z. Ni, K. Ying, P. Viswanathan, S. Pardis, S. Pal, brohan byte, J. Lapeyre, H.A., A. Micciche, Y. Yan, T. Hofmann, Q. Preiß, gsommers, A. Bhatt, IsaacP1234, L. G¨ ottgens, R. Bhirud, ismoldayev, adrianariton, T. Dang, T. Holy, C. Zhao, Benz...
2026
-
[114]
Zimmermann,Integral Hecke modules, integral generalized Reed–Muller codes, and linear codes, Tech
K.-H. Zimmermann,Integral Hecke modules, integral generalized Reed–Muller codes, and linear codes, Tech. Rep. 3-96 (Technische Universit¨ at Hamburg-Harburg, 1996)
1996
-
[115]
Grassl, Searching for linear codes with large mini- mum distance, inDiscovering Mathematics with Magma (Springer Berlin Heidelberg) p
M. Grassl, Searching for linear codes with large mini- mum distance, inDiscovering Mathematics with Magma (Springer Berlin Heidelberg) p. 287–313
-
[116]
Leon, Computing automorphism groups of error- correcting codes, IEEE Transactions on Information Theory28, 496–511 (1982)
J. Leon, Computing automorphism groups of error- correcting codes, IEEE Transactions on Information Theory28, 496–511 (1982)
1982
-
[117]
Junttila and P
T. Junttila and P. Kaski, Engineering an efficient canon- ical labeling tool for large and sparse graphs, in2007 Proceedings of the Ninth Workshop on Algorithm En- gineering and Experiments (ALENEX)(Society for In- dustrial and Applied Mathematics, 2007) p. 135–149
2007
-
[118]
B. D. McKay and A. Piperno, Practical graph isomor- phism, ii, Journal of Symbolic Computation60, 94–112 (2014)
2014
-
[119]
Cordella, P
L. Cordella, P. Foggia, C. Sansone, and M. Vento, A (sub)graph isomorphism algorithm for matching large graphs, IEEE Transactions on Pattern Analysis and Ma- chine Intelligence26, 1367–1372 (2004)
2004
-
[120]
C. C. SIMS, Computational methods in the study of permutation groups††this research was supported in part by the national science foundation., inComputa- tional Problems in Abstract Algebra(Elsevier, 1970) p. 169–183
1970
-
[121]
Neunh¨ offer, F
M. Neunh¨ offer, F. Noeske, and M. Horn,genss, generic Schreier–Sims, Version 1.6.8(2022), deposited GAP package
2022
-
[122]
R. A. Parker, The computer calculation of modular characters (the meat-axe), inComputational Group Theory, edited by M. D. Atkinson (Academic Press, London, 1984) pp. 267–274
1984
-
[123]
D. F. Holt and S. Rees, Testing modules for irreducibil- ity, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics57, 1–16 (1994)
1994
-
[124]
McLaughlin, Some subgroups ofsl n(F2), Illinois Journal of Mathematics13, 10.1215/ijm/1256053741 (1969)
J. McLaughlin, Some subgroups ofsl n(F2), Illinois Journal of Mathematics13, 10.1215/ijm/1256053741 (1969)
1969
-
[125]
Hering, Transitive linear groups and linear groups which contain irreducible subgroups of prime order, Ge- ometriae Dedicata2, 10.1007/bf00147570 (1974)
C. Hering, Transitive linear groups and linear groups which contain irreducible subgroups of prime order, Ge- ometriae Dedicata2, 10.1007/bf00147570 (1974)
1974 doi
-
[126]
Guralnick, T
R. Guralnick, T. Penttila, C. E. Praeger, and J. Saxl, Linear groups with orders having certain large prime di- visors, Proceedings of the London Mathematical Society 78, 167–214 (1999)
1999
-
[127]
Niemeyer and C
A. Niemeyer and C. Praeger, A recognition algorithm for classical groups over finite fields, Proceedings of the London Mathematical Society77, 117–169 (1998)
1998
-
[128]
Neunh¨ offer, A
M. Neunh¨ offer, A. Seress, N. Werner,et al.,recog, a collection of group recognition methods, Version 1.4.2 (2024), refereed GAP package
2024
-
[129]
The GAP Group,GAP – Groups, Algorithms, and Pro- gramming, Version 4.13.1(2024)
2024
-
[130]
Whitney, On the abstract properties of linear de- pendence, American Journal of Mathematics57, 509 55 (1935)
H. Whitney, On the abstract properties of linear de- pendence, American Journal of Mathematics57, 509 55 (1935)
1935
-
[131]
Rado, Note on independence functions, Proceed- ings of the London Mathematical Societys3-7, 300–320 (1957)
R. Rado, Note on independence functions, Proceed- ings of the London Mathematical Societys3-7, 300–320 (1957)
1957
-
[132]
Edmonds, Matroids and the greedy algorithm, Math- ematical Programming1, 127–136 (1971)
J. Edmonds, Matroids and the greedy algorithm, Math- ematical Programming1, 127–136 (1971)
1971
-
[133]
Kirkpatrick, C
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Opti- mization by simulated annealing, Science220, 671–680 (1983)
1983
-
[134]
Metropolis, A
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of state calcu- lations by fast computing machines, The Journal of Chemical Physics21, 1087–1092 (1953)
1953
-
[135]
Kubischta and I
E. Kubischta and I. Teixeira, Classification of the sub- groups of the two-qubit clifford group, Journal of Math- ematical Physics66, 10.1063/5.0258273 (2025)
2025 doi
-
[136]
Chen and N
Z. Chen and N. Rengaswamy, Tailoring fault-tolerance to trotter circuits, in2024 IEEE International Confer- ence on Quantum Computing and Engineering (QCE) (IEEE, 2024) p. 134–140
2024
-
[137]
J. D. Dixon and B. Mortimer,Permutation Groups (Springer New York, 1996)
1996
-
[138]
Hao, Investigations on automorphism groups of quantum stabilizer codes (2021), arXiv:2109.12735 [cs.IT]
H. Hao, Investigations on automorphism groups of quantum stabilizer codes (2021), arXiv:2109.12735 [cs.IT]
2021 arXiv
Reviewed August 8, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.