[论文解读] Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes

Junichi Haruna|arXiv (Cornell University)|Feb 16, 2026

Quantum Computing Algorithms and Architecture被引用 0

一句话总结

本文提供一个同调（Bockstein）阻塞框架，能精确刻画在CSS码中横向Pauli Z旋转何时可 refinement 到更细的角度，并指出保证对所有逻辑Z旋转实现横向可行性的条件。

ABSTRACT

Transversal Pauli Z rotations provide a natural route to fault-tolerant logical diagonal gates in quantum CSS codes, yet their capability is fundamentally constrained. In this work, we formulate the refinement problem of realizing a logical diagonal gate by a transversal implementation with a finer discrete rotation angle and show that its solvability is completely characterized by the Bockstein homomorphism in homology theory. Furthermore, we prove that the linear independence of the X-stabilizer generators together with the commutativity condition modulo a power of two ensures the existence of transversal implementations of all logical Pauli Z rotations with discrete angles in general CSS codes. Our results identify a canonical homological obstruction governing transversal implementability and provide a conceptual foundation for a formal theory of transversal structures in quantum error correction.

研究动机与目标

• Motivate fault-tolerant logical diagonal gates and understand their fundamental limitations in CSS codes.
• Formulate a coefficient lifting problem to refine transversal Z rotations across discretized angles.
• Relate refinements to the Bockstein homomorphism and establish necessary and sufficient conditions for lift existence.
• Provide practical criteria (linearly independent X-stabilizers and modulo-2^{m+1} commutativity) guaranteeing transversal implementability for all logical Z rotations.
• Discuss extensions to chain-complex lifting and relation to existing algebraic criteria.

提出的方法

• Model CSS codes as a two-length chain complex with maps ∂1 and ∂2 tied to H_X and H_Z.
• Classify transversal Z rotations at level m by H1(C; Z_{2^m}) under the commutativity modulo 2^m+1 constraint.
• Define the coefficient lifting problem to lift a level-m angle to level m+1 and derive an obstruction via the Bockstein β_m: H1(C; Z_{2^m}) → H0(C; Z_2).
• Prove that a lift exists if and only if β_m([θ]) = 0 (Theorem 1).
• Show that linear independence of X-stabilizers (and modulo-2^{m+1} commutativity) implies β_m([θ]) = 0 for all θ, yielding universal transversal implementability (Corollary 2).
• Discuss non-uniqueness of parity-check matrices and introduce the chain-complex lifting problem as a broader framework.

实验结果

研究问题

• RQ1 When can a transversal Z-rotation at angle π/2^{m-1} be refined to π/2^{m}?
• RQ2 How does the Bockstein homomorphism β_m govern the coefficient lifting problem in CSS codes?
• RQ3 Under what conditions (on X-stabilizers and commutativity) is transversal implementability guaranteed for all logical Z rotations?
• RQ4 How does non-uniqueness of parity-check matrices affect transversal refinement, and can chain-complex lifting provide a broader perspective?
• RQ5 How do existing algebraic criteria relate to the Bockstein obstruction in the refinement problem?

主要发现

• The refinement problem is governed by the Bockstein homomorphism β_m: H1(C; Z_{2^m}) → H0(C; Z_2].
• A lift (refinement) exists iff β_m([θ]) = 0, providing a necessary and sufficient condition.
• If X-stabilizer generators are linearly independent and H_X H_Z^T = 0 mod 2^{m+1}, then β_m([θ]) = 0 for all [θ], ensuring transversal implementability of all π/2^{m} rotations.
• Transversal Z-rotations at level m classify logical diagonal gates by H1(C; Z_{2^m}) under a modulo-2^{m+1} commutativity constraint.
• 2^{m+1}-divisible codes (divisibility conditions on stabilizers) imply β_m([θ]) = 0 for certain θ, aligning with known criteria as special cases.
• The work emphasizes a canonical homological obstruction governing transversal implementability and connects to a broader chain-complex lifting viewpoint.