arxiv: 2602.14499 · v2 · submitted 2026-02-16 · 🪐 quant-ph · cond-mat.str-el· hep-th· math-ph· math.MP

Recognition: 2 theorem links

· Lean Theorem

Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes

Junichi Haruna

Authors on Pith no claims yet

Pith reviewed 2026-05-15 22:05 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.str-elhep-thmath-phmath.MP

keywords transversal gatesCSS codeshomological classificationBockstein obstructionslogical diagonal gatesquantum error correctionfault-tolerant implementation

0 comments

The pith

The vanishing of two Bockstein-type obstruction maps is necessary and sufficient for the existence of a transversal logical diagonal gate at the next level in quantum CSS codes.

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

The paper develops a homological framework that classifies the logical action of transversal diagonal gates in CSS codes according to data from the underlying chain complex. It then recasts the problem of refining these gates to smaller rotation angles as a lifting problem in that framework. Two obstruction maps of Bockstein type appear in the lifting sequence, and their simultaneous vanishing is shown to be exactly the condition needed for a transversal logical diagonal gate at the next level to exist. The same maps reinterpret standard algebraic requirements such as divisibility and triorthogonality as necessary conditions when the rotation angles are required to be uniform across qubits.

Core claim

In the homological framework that organizes transversal diagonal gates by logical action and physical implementation, the logical action itself is classified by homological data of the chain complex. Refinement to finer angles is formulated as a lifting problem, and the vanishing of two Bockstein-type obstruction maps is a necessary and sufficient condition for the existence of a transversal logical diagonal gate at the next level.

What carries the argument

Two Bockstein-type obstruction maps that control the lifting of transversal diagonal gates in the homological classification of logical operators.

If this is right

The logical action of transversal diagonal gates admits a classification in terms of homological data of the chain complex.
Divisibility and triorthogonality become necessary conditions for transversal logical diagonal gates that use uniform rotation angles.
Homological obstructions govern whether a given CSS code supports transversal implementation of logical diagonal gates.
The framework supplies the conceptual basis for a formal theory of transversal structures in quantum error correction.

Where Pith is reading between the lines

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

Designers could screen candidate CSS codes by computing these two maps before attempting to realize non-Clifford transversal gates.
The same lifting analysis may apply to other families of stabilizer codes once their chain complexes are suitably defined.
Computational checks of the obstruction maps could serve as a practical filter in the search for codes supporting higher-level transversal gates.

Load-bearing premise

The chain complex of the CSS code admits a homological classification of logical operators that extends directly to diagonal gates.

What would settle it

A CSS code in which the two obstruction maps both vanish but no transversal logical diagonal gate at the next refinement level exists, or in which the maps fail to vanish yet such a gate can still be implemented.

read the original abstract

Transversal Pauli $Z$ rotations provide a natural route to fault-tolerant logical diagonal gates in quantum CSS codes, but their capability is inherently constrained. We develop a homological framework that organizes transversal diagonal gates in terms of their logical action and physical implementation, revealing two layers of structure that govern their behavior. At a fixed level, we establish that their logical action admits a classification in terms of homological data of the underlying chain complex, extending the standard description of logical operators. We then formulate the refinement to finer angles as a lifting problem and derive two Bockstein-type obstruction maps, whose vanishing is a necessary and sufficient condition for the existence of a transversal logical diagonal gate at the next level. Within this framework, known algebraic conditions such as divisibility and triorthogonality are reinterpreted as necessary conditions for the existence of transversal logical diagonal gates with uniform rotation angles. Our results identify homological obstructions governing transversal implementability and provide a conceptual foundation for a formal theory of transversal structures in quantum error correction.

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.

Desk Editor's Note private letter to a colleague

This paper recasts transversal diagonal gates in CSS codes as a homological lifting problem with two Bockstein obstructions, which neatly organizes known conditions like triorthogonality but leaves the coefficient ring handling open to question.

read the letter

The key takeaway is that this paper frames the implementability of transversal logical diagonal gates in CSS codes as a homological lifting problem, where two Bockstein obstruction maps determine whether you can go to finer rotation angles. What stands out as new is the way it extends the standard homological description of logical operators to diagonal gates at a fixed level, and then treats the refinement to higher levels as a lifting problem with explicit obstruction maps. This gives a clean way to see why certain divisibility conditions appear, by reinterpreting triorthogonality and similar algebraic requirements as cases where those obstructions vanish. The paper does a good job of connecting the dots between the chain complex data and the physical constraints on transversal implementations. On the soft spots, the main one is that the abstract claims the vanishing of these maps is necessary and sufficient, but without seeing the full chain complex calculations or concrete examples in the text, it's difficult to confirm that the maps are derived without hidden assumptions about the coefficient ring. The stress-test note raises a fair point here: standard CSS codes use F2 coefficients for Pauli operators, but diagonal gates involve phases that might require lifting to Z or Z/2^k coefficients for the obstructions to capture the right divisibility. If the paper doesn't explicitly show how the complex changes or proves the obstructions work independently of that, then the sufficiency part could be weaker than stated. That said, the circularity burden is low since it builds on standard homological algebra. This paper is aimed at researchers in quantum error correction who are trying to build better transversal gate sets for fault tolerance. A reader who already knows the basics of CSS codes and homological algebra will get the most out of it, as it organizes existing results into a new structure rather than providing immediate constructions. It deserves a serious referee because the framework is novel enough to warrant checking the derivations carefully, even if some details might need tightening. I would recommend sending it out for peer review after a quick look at the explicit calculations to make sure the Bockstein maps are set up correctly for the quantum setting.

Referee Report

1 major / 1 minor

Summary. The manuscript develops a homological framework for transversal diagonal gates in quantum CSS codes. It classifies the logical action of such gates at a fixed level using homological data from the underlying chain complex, extending the standard description of logical operators. Refinement to finer rotation angles is formulated as a lifting problem, from which two Bockstein-type obstruction maps are derived; their vanishing is claimed to be necessary and sufficient for the existence of a transversal logical diagonal gate at the next level. Known algebraic conditions such as divisibility and triorthogonality are reinterpreted as special cases of these homological obstructions.

Significance. If the derivations hold, the work supplies a unified homological perspective on the constraints governing transversal implementability of logical diagonal gates. It extends the standard homological classification of Pauli logical operators to diagonal gates and recasts algebraic conditions (divisibility, triorthogonality) as vanishing of explicit obstruction maps, thereby providing a conceptual foundation that could inform systematic searches for transversal structures in CSS codes.

major comments (1)

[lifting problem and obstruction maps] The necessity and sufficiency claim for the two Bockstein-type obstruction maps (abstract and the lifting-problem section) rests on extending the standard F_2-linear CSS chain complex to coefficients appropriate for U(1) phases. The manuscript does not exhibit the explicit change-of-rings functor, the short exact sequence used to define the Bockstein maps, or a verification that the resulting obstructions remain independent of code parameters and capture all integral divisibility conditions; without this, the maps may fail to detect the full set of constraints that arise when moving from Pauli to diagonal gates.

minor comments (1)

[abstract] Notation for the two obstruction maps could be introduced with explicit reference to the relevant exact sequence or coefficient ring in the first appearance, to aid readers unfamiliar with the homological setup.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and for highlighting the need for greater explicitness in the derivation of the obstruction maps. We address the major comment below and will revise the manuscript accordingly to strengthen the presentation.

read point-by-point responses

Referee: [lifting problem and obstruction maps] The necessity and sufficiency claim for the two Bockstein-type obstruction maps (abstract and the lifting-problem section) rests on extending the standard F_2-linear CSS chain complex to coefficients appropriate for U(1) phases. The manuscript does not exhibit the explicit change-of-rings functor, the short exact sequence used to define the Bockstein maps, or a verification that the resulting obstructions remain independent of code parameters and capture all integral divisibility conditions; without this, the maps may fail to detect the full set of constraints that arise when moving from Pauli to diagonal gates.

Authors: We agree that the current exposition would benefit from a more explicit treatment of the coefficient extension. In the revised manuscript we will add a dedicated subsection that (i) defines the change-of-rings functor from the F_2-chain complex to the appropriate U(1)-module coefficients, (ii) writes down the short exact sequence of coefficients inducing the two Bockstein maps, and (iii) verifies that the resulting obstructions are functorial, independent of the particular code parameters, and recover the full set of integral divisibility conditions. With these additions the necessity and sufficiency claim will rest on a fully spelled-out homological construction. revision: yes

Circularity Check

0 steps flagged

No significant circularity: homological classification and Bockstein obstructions derived from standard chain complex data

full rationale

The paper develops a homological framework classifying logical actions of transversal diagonal gates at fixed level via the underlying chain complex of the CSS code, then formulates refinement to finer angles as a lifting problem yielding two Bockstein-type obstruction maps whose vanishing is claimed nec+suff. No quoted equations reduce these obstructions to fitted parameters, self-definitions, or predictions forced by construction. Known conditions (divisibility, triorthogonality) are reinterpreted as special cases of the obstructions rather than serving as load-bearing inputs. No self-citation chains, imported uniqueness theorems, or ansatzes smuggled via prior work by the same authors are exhibited in the provided text. The derivation remains self-contained against external homological algebra, with the central claim extending standard logical operator descriptions without reducing to its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based on abstract only; the paper relies on standard homological algebra of chain complexes for CSS codes but introduces no explicit free parameters, new axioms, or invented entities in the provided text.

pith-pipeline@v0.9.0 · 5478 in / 962 out tokens · 18792 ms · 2026-05-15T22:05:11.420408+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

Theorem I.2: ... β^{(ν)}_1([θ^{(ν)}])=0, β^{(ν)}_2([θ^{(ν)}])=0 ... Bockstein homomorphism associated with 0→Z_2→Z_{2^{m+1}}→Z_{2^m}→0
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean embed_injective unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

V^{(m)}_{LD} ≅ H^1(C;Z_2) ⊗_H S_m with S_m = ⊕_{ν=1}^m 2^{ν-1} (ker H_Z)⊗_H^{(ν-1)}

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

32 extracted references · 32 canonical work pages · 13 internal anchors

[1]

B. Zeng, A. Cross, and I. L. Chuang, Transversality ver- sus Universality for Additive Quantum Codes (2007), arXiv:0706.1382 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2007
[2]

Classification of topologically protected gates for local stabilizer codes

S. Bravyi and R. Koenig, Physical Review Letters110, 170503 (2013), arXiv:1206.1609 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2013
[3]

Restrictions on Transversal Encoded Quantum Gate Sets

B. Eastin and E. Knill, Physical Review Letters102, 110502 (2009), arXiv:0811.4262 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2009
[4]

H. N. Ward, Archiv der Mathematik36, 485 (1981)

work page 1981
[5]

Rengaswamy, R

N. Rengaswamy, R. Calderbank, M. Newman, and H. D. Pfister, IEEE Journal on Selected Areas in Information Theory1, 499 (2020), arXiv:1910.09333 [quant-ph]

work page arXiv 2020
[6]

J. Hu, Q. Liang, and R. Calderbank, Designing the Quan- tum Channels Induced by Diagonal Gates (2021)

work page 2021
[7]

Towers of generalized divisible quantum codes

J. Haah, Physical Review A97, 042327 (2018), arXiv:1709.08658 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2018
[8]

Magic state distillation with low overhead

S. Bravyi and J. Haah, Physical Review A86, 052329 (2012), arXiv:1209.2426 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2012
[9]

M. Shi, H. Lu, J.-L. Kim, and P. Sole, Triorthogonal Codes and Self-dual Codes (2024), arXiv:2408.09685 [cs]

work page arXiv 2024
[10]

S. P. Jain and V. V. Albert, Transversal Clifford and T-gate codes of short length and high distance (2024)

work page 2024
[11]

E. T. Campbell, H. Anwar, and D. E. Browne, Physical Review X2, 041021 (2012), arXiv:1205.3104 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2012
[12]

J. T. Anderson, G. Duclos-Cianci, and D. Poulin, Physi- cal Review Letters113, 080501 (2014), arXiv:1403.2734 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2014
[13]

J. T. Anderson and T. Jochym-O’Connor, Classifica- tion of transversal gates in qubit stabilizer codes (2014), arXiv:1409.8320 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2014
[14]

The disjointness of stabilizer codes and limitations on fault-tolerant logical gates

T. Jochym-O’Connor, A. Kubica, and T. J. Yoder, Physi- cal Review X8, 021047 (2018), arXiv:1710.07256 [quant- ph]

work page internal anchor Pith review Pith/arXiv arXiv 2018
[15]

Camps-Moreno, H

E. Camps-Moreno, H. H. L´ opez, G. L. Matthews, N. Ren- gaswamy, and R. San-Jos´ e, Transversal gates for quan- tum CSS codes (2026), arXiv:2601.21514 [cs]

work page arXiv 2026
[16]

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]

work page arXiv 2025
[17]

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]

work page arXiv 2026
[18]

M. A. Webster, A. O. Quintavalle, and S. D. Bartlett, Transversal Diagonal Logical Operators for Stabiliser Codes (2023)

work page 2023
[19]

M. A. Webster, B. J. Brown, and S. D. Bartlett, The XP Stabiliser Formalism: A Generalisation of the Pauli Stabiliser Formalism with Arbitrary Phases (2022)

work page 2022
[20]

A. R. Calderbank and P. W. Shor, Physical Review A: Atomic, Molecular, and Optical Physics54, 1098 (1996), arXiv:quant-ph/9512032

work page internal anchor Pith review Pith/arXiv arXiv 1996
[21]

A. M. Steane, Physical Review Letters77, 793 (1996)

work page 1996
[22]

B. M. Terhal, Reviews of Modern Physics87, 307 (2015), arXiv:1302.3428 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2015
[23]

Bombin and M

H. Bombin and M. A. Martin-Delgado, Journal of Mathematical Physics48, 052105 (2007), arXiv:quant- ph/0605094

work page arXiv 2007
[24]

Kitaev, Russian Mathematical Surveys52, 1191 (1997)

A. Kitaev, Russian Mathematical Surveys52, 1191 (1997)

work page 1997
[25]

Haruna, Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction (2025), arXiv:2511.15224 [hep-th]

J. Haruna, Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction (2025), arXiv:2511.15224 [hep-th]. 15

work page arXiv 2025
[26]

Quantum Teleportation is a Universal Computational Primitive

D. Gottesman and I. L. Chuang, Nature402, 390 (1999), arXiv:quant-ph/9908010

work page internal anchor Pith review Pith/arXiv arXiv 1999
[27]

Y. Feng, H. Xue, R. Kobayashi, P.-S. Hsin, and Y.-A. Chen, Pauli stabilizer formalism for topological quan- tum field theories and generalized statistics (2026), arXiv:2601.00064 [quant-ph]

work page arXiv 2026
[28]

Barkeshli, Y.-A

M. Barkeshli, Y.-A. Chen, P.-S. Hsin, and R. Kobayashi, SciPost Physics16, 089 (2024), arXiv:2211.11764 [cond- mat]

work page arXiv 2024
[29]

N. P. Breuckmann, M. Davydova, J. N. Eberhardt, and N. Tantivasadakarn, Cups and Gates I: Cohomol- ogy invariants and logical quantum operations (2024), arXiv:2410.16250 [quant-ph]

work page internal anchor Pith review Pith/arXiv arXiv 2024
[30]

Bauer, Quantum9, 1673 (2025), arXiv:2403.12119 [quant-ph]

A. Bauer, Quantum9, 1673 (2025), arXiv:2403.12119 [quant-ph]. Appendix A: Properties of the Hadamard product of free modules LetV,W,Ube submodules ofR n for a commutative ringR. Recall thatV⊗ H W := spanR{v◦w:v∈V, w∈ W}, where (v◦w) i =v iwi. Proposition A.1.The Hadamard product module sat- isfies: (i)V⊗ H Wis a submodule ofR n; (ii)V⊗ H W=W⊗ H V; (iii)V⊗...

work page arXiv 2025
[31]

(73) forθ ′

= (eH (m) ⊙K)(θ+ eG(m)α0) (C8) = 0 (mod 2 m),(C9) soα ′ 0 is a valid solution to Eq. (73) forθ ′. Using this choice, 1 2m eH (m)(θ′ + eG(m)α′

work page
[32]

Therefore,β (m) 2 is a well-defined map onV (m) LD

= 1 2m eH (m)(θ+ eG(m)α0),(C10) soβ (m) 2 ([θ′]) =β (m) 2 ([θ]) in the quotient. Therefore,β (m) 2 is a well-defined map onV (m) LD

work page