Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.09538

Twisted Compactification, Quotient Quantum Codes and Logical Gates

Po-Shen Hsin

Published Nov 6, 2026• 0 citations
arXivHTMLPDF

Abstract

Many quantum codes, including balanced-product, bivariate-bicycle and genon codes and the five-qubit code, are quotient codes: a larger code folded onto itself by identifying each check with its image under a deck transformation composed with a symmetry. We show that this is the lattice form of twisted compactification, in which a theory on $X\times F$ carries a symmetry background along $F$, and we use the correspondence in both directions. For monomial quotients of Pauli stabilizer codes, a transfer theorem gives the logical qudits, logical operators and distance bounds from those of the parent, with a Tate cohomology group counting the logical operators that are new. For higher-form and cup-product symmetries the twist is an entangling diagonal circuit; when a finite cover trivializes the background, the code is a dressed quotient, so abelian Pauli codes give non-abelian topological order such as $D(D_4)$. The dressings have Clifford level at most one less than the degree of the twist, and for cubic twists the code dimension is a count of solutions of quadratic equations in cup products, which certifies that the code is not a Pauli stabilizer code when it is not a power of two; on tori and slabs the distance is linear in the size. Twists also create logical gates: three toric codes on $S^3$ have no logical qubits, but on $\mathbb{RP}^3$ the same circuit is a logical $CCZ$. A quarter-turn twist of the 3D fermionic toric code gives codes of linear distance, from $[[768,2,9]]$ up, whose $p+ip$ pump is an explicit finite-time quasi-local evolution that preserves the code space exactly; using the spin-topological response formula of Barkeshli, Hsin and Kobayashi, we identify its logical action as $T$ up to Clifford factors. Finally, twisting abelian gauge theories reach only the quantum doubles $D(G)$ with $[G,G]$ central.

DOI
10.48550/arxiv.2611.09538

Related papers

Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic

Ryohei Kobayashi, Guanyu Zhu, Po-Shen Hsin

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for $n$-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of $n$-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the $(n+1)$D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted $\mathbb{Z}_2^3$ gauge theory (equivalent to $\mathbb{D}_4$ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in $O(d)$ rounds via code switching. In 3D, we construct a transversal logical $\sqrt{\text{T}}$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted $\mathbb{Z}_2^4$ gauge theory. Our constructions surpass the Bravyi-König bound by achieving the logical gates in the $(n+1)$-th level of Clifford hierarchy in $n$ spatial dimension.

quant-pharXiv:2511.02900•Physical Review Letters•Nov 6, 2025•27 citations

Cups and Gates II: Operads, twists, and addressable intra-code gates

Nikolas P. Breuckmann, Margarita Davydova, Jens Niklas Eberhardt +2 more

In Part I, we introduced a general framework for constructing logical gates in quantum CSS codes from cohomology invariants, focusing on cup products and their generalizations from topological to qLDPC codes. In particular, we produced a family of $C^{k-1}Z$ logical gates that we called copy-cup on $k$ copies of the same quantum code implemented by finite-depth circuits. Here, we vastly extend this framework by introducing twists incorporating code automorphisms, higher twisted cohomology operations, and folding operations in relative cohomology. The framework includes operations lifting coefficients from $\mathbb{Z}/2$ to $\mathbb{Z}/2^k$, enabling all diagonal logical gates such as single-qubit rotations $\operatorname{R}(2π/2^k)$. Composing these operations with maps that select cohomology classes yields addressable logical gates. Examples include addressable $T$ gates on three- and four-tori and gates in qLDPC codes beyond topological ones. We introduce cohomology operations, such as the higher twisted Pontryagin powers, that to our knowledge have not previously appeared in the mathematics literature. These operations arise from $E_\infty$-structures on cochains, with explicit constructions using cyclic resolutions and the surjection operad. We expect these results to be of independent interest in homotopy theory. Our formalism applies much more broadly to chain complexes carrying suitable operadic structures, and we expect this operadic perspective to uncover further connections between homotopy theory and fault-tolerant quantum gates.

quant-pharXiv:2610.05214•Oct 6, 2026•2 citations

Clifford-hierarchy stabilizer formalism with applications to twisted quantum doubles

Christopher Fechisin, Kieran Cooney, Mathi Raja +4 more

Recent work has shown that quantum double models can be used to circumvent the Bravyi-Koenig bound. In particular, this is achieved through code-switching protocols in which non-Pauli stabilizer phases appear as intermediate codes. We introduce the $X\mathcal C^{(k)}_d$ stabilizer formalism, which generalizes the Pauli stabilizer formalism by combining Pauli-$X$ operators with diagonal operators drawn from a fixed level $k$ of the Clifford hierarchy on prime-dimensional qudits. This yields a natural class of beyond-Pauli stabilizer models, including many twisted quantum double phases. We classify a large class of these $X\mathcal C^{(k)}_d$ stabilizer states, showing that they are uniform superpositions over affine-linear subspaces with diagonal phases. In particular, when the stabilizers of a state require operators from level $k$ of the Clifford hierarchy, we show that the diagonal gates required to produce the phases in the wavefunction sit one level higher. We further show that every 2D twisted quantum double ${\cal D}^ω(\mathbb{Z}_p^n)$ with $ω$ a product of type-III cocycles and $p$ an odd prime admits a realization using only Clifford ($k=2$) stabilizers, and we conjecture that phases where $ω$ contains a type-I or type-II cocycle require level-$p$ Clifford-hierarchy stabilizers for $p$-dimensional qudits. Finally, we demonstrate that a pair of qudit toric codes may be deterministically prepared in a logical magic state by measuring $X\mathcal C^{(k)}_d$ stabilizers. Together, these results provide a concrete stabilizer framework for topological codes beyond Pauli stabilizer models and their logical gates.

quant-pharXiv:2610.00464•Oct 2, 2026•3 citations

Qudit Twisted-Torus Codes in the Bivariate Bicycle Framework

Mourad Halla

We study finite-length qudit quantum low-density parity-check (LDPC) codes from translation-invariant CSS constructions on two-dimensional tori with twisted boundary conditions. Recent qubit work [PRX Quantum 6, 020357 (2025)] showed that, within the bivariate-bicycle viewpoint, twisting generalized toric patterns can significantly improve the finite-size distance of qubit codes. Building on this insight, we extend the construction and the search to qudit codes over finite fields. Using algebraic methods based on Laurent-polynomial ideals and Gröbner-basis computations over $\mathbb{F}_q$, we compute the number of logical qudits on any twisted torus and identify compact codes with favorable rate--distance tradeoffs. Overall, for the finite sizes explored, twisted-torus qudit constructions typically achieve larger estimated distances than their untwisted counterparts and, at the same number of physical and logical qudits, larger estimated distances than previously reported twisted qubit instances. The best new codes are tabulated.

quant-pharXiv:2602.04443•Feb 5, 2026•0 citations

Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry

Po-Shen Hsin, Ryohei Kobayashi, Guanyu Zhu

We systematically construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes using cohomology operations and symmetry. These logical gates are obtained from unitary operators given by symmetry-protected topological responses, which correspond to generators of group cohomology and can be expressed explicitly on the lattice using cohomology operations including cup product, Steenrod squares and new combinations of higher cup products called higher Pontryagin powers. Our study covers most types of the cohomology operations in the literature. This hence gives rise to logical $C^{n-1}Z$ gates in $n$ copies of quantum codes via the $n$-fold cup product in the usual color code paradigm, as well as several new classes of diagonal and non-diagonal logical gates in increasing Clifford hierarchies beyond the color code paradigm, including the logical $R_k$ and multi-controlled $C^m R_k$ gates for codes defined in projective spaces. Implementing these gates could make it more efficient to compile specific types of quantum algorithms such as Shor's algorithm. We further extend the construction to quantum codes with boundaries, which generalizes the folding approach in color codes. We also present a formalism for addressable and parallelizable logical gates in LDPC codes via higher-form symmetries. We further construct logical Clifford gates in expander-based codes including the asymptotically good LDPC codes and hypergraph-product codes. As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.

arXiv:2411.15848•Nov 24, 2024•29 citations

Constant-Depth Clifford-Hierarchy Gates via Non-Abelian Surface Codes

Alison Warman, Sakura Schafer-Nameki

We present an entirely 2D constant-depth realization of topologically protected phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian group $G$ on a triangular spatial patch. The logical gate is implemented by a constant-depth circuit constructed from stacking on the spatial region a symmetry-protected topological (SPT) phase specified by a group 2-cocycle and boundary counter-terms. The Bravyi-König theorem limits the unitary gates implementable by constant-depth quantum circuits on Pauli stabilizer codes in $D$ dimensions to the $D$-th level of the Clifford hierarchy. We bypass this limitation, by constructing constant-depth unitary gates at arbitrary levels of the Clifford hierarchy purely in 2D, without sacrificing locality or fault tolerance, at the cost of using the quantum double of a non-Abelian group $G$. Specifically, for $G = D_{4N}$, the dihedral group of order $8N$, we realize the phase gate $T^{1/N} = \mathrm{diag}(1, e^{iπ/(4N)})$ in the logical $\overline{Z}$ basis. In this context, we propose a non-abelian stabilizer group formalism, which we work out for dihedral groups. For $8N = 2^n$, the logical gate lies at the $n$-th level of the Clifford hierarchy and, importantly, has a qubit-only realization: we show that it can be constructed in terms of Clifford-hierarchy stabilizers for a code with $n$ physical qubits on each edge of the lattice. We also discuss code-switching to the double surface-code $D(\mathbb{Z}_2\times\mathbb{Z}_2)$, to complete a universal gate-set in this setup.

quant-pharXiv:2512.13777•PRX Quantum•Dec 17, 2025•22 citations
Many quantum codes, including balanced-product, bivariate-bicycle and genon codes and the five-qubit code, are quotient codes: a larger code folded onto itself by identifying each check with its image under a deck transformation composed with a symmetry. We show that this is the lattice form of twisted compactification, in which a theory on X×FX\times FX×F carries a symmetry background along FFF, and we use the correspondence in both directions. For monomial quotients of Pauli stabilizer codes, a transfer theorem gives the logical qudits, logical operators and distance bounds from those of the parent, with a Tate cohomology group counting the logical operators that are new. For higher-form and cup-product symmetries the twist is an entangling diagonal circuit; when a finite cover trivializes the background, the code is a dressed quotient, so abelian Pauli codes give non-abelian topological order such as D(D4)D(D_4)D(D4​). The dressings have Clifford level at most one less than the degree of the twist, and for cubic twists the code dimension is a count of solutions of quadratic equations in cup products, which certifies that the code is not a Pauli stabilizer code when it is not a power of two; on tori and slabs the distance is linear in the size. Twists also create logical gates: three toric codes on S3S^3S3 have no logical qubits, but on RP3\mathbb{RP}^3RP3 the same circuit is a logical CCZCCZCCZ. A quarter-turn twist of the 3D fermionic toric code gives codes of linear distance, from [[768,2,9]][[768,2,9]][[768,2,9]] up, whose p+ipp+ipp+ip pump is an explicit finite-time quasi-local evolution that preserves the code space exactly; using the spin-topological response formula of Barkeshli, Hsin and Kobayashi, we identify its logical action as TTT up to Clifford factors. Finally, twisting abelian gauge theories reach only the quantum doubles D(G)D(G)D(G) with [G,G][G,G][G,G] central.
A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for nnn-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of nnn-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the (n+1)(n+1)(n+1)D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted Z23\mathbb{Z}_2^3Z23​ gauge theory (equivalent to D4\mathbb{D}_4D4​ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in O(d)O(d)O(d) rounds via code switching. In 3D, we construct a transversal logical T\sqrt{\text{T}}T​ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted Z24\mathbb{Z}_2^4Z24​ gauge theory. Our constructions surpass the Bravyi-König bound by achieving the logical gates in the (n+1)(n+1)(n+1)-th level of Clifford hierarchy in nnn spatial dimension.
In Part I, we introduced a general framework for constructing logical gates in quantum CSS codes from cohomology invariants, focusing on cup products and their generalizations from topological to qLDPC codes. In particular, we produced a family of Ck−1ZC^{k-1}ZCk−1Z logical gates that we called copy-cup on kkk copies of the same quantum code implemented by finite-depth circuits. Here, we vastly extend this framework by introducing twists incorporating code automorphisms, higher twisted cohomology operations, and folding operations in relative cohomology. The framework includes operations lifting coefficients from Z/2\mathbb{Z}/2Z/2 to Z/2k\mathbb{Z}/2^kZ/2k, enabling all diagonal logical gates such as single-qubit rotations R⁡(2π/2k)\operatorname{R}(2π/2^k)R(2π/2k). Composing these operations with maps that select cohomology classes yields addressable logical gates. Examples include addressable TTT gates on three- and four-tori and gates in qLDPC codes beyond topological ones. We introduce cohomology operations, such as the higher twisted Pontryagin powers, that to our knowledge have not previously appeared in the mathematics literature. These operations arise from E∞E_\inftyE∞​-structures on cochains, with explicit constructions using cyclic resolutions and the surjection operad. We expect these results to be of independent interest in homotopy theory. Our formalism applies much more broadly to chain complexes carrying suitable operadic structures, and we expect this operadic perspective to uncover further connections between homotopy theory and fault-tolerant quantum gates.
Recent work has shown that quantum double models can be used to circumvent the Bravyi-Koenig bound. In particular, this is achieved through code-switching protocols in which non-Pauli stabilizer phases appear as intermediate codes. We introduce the XCd(k)X\mathcal C^{(k)}_dXCd(k)​ stabilizer formalism, which generalizes the Pauli stabilizer formalism by combining Pauli-XXX operators with diagonal operators drawn from a fixed level kkk of the Clifford hierarchy on prime-dimensional qudits. This yields a natural class of beyond-Pauli stabilizer models, including many twisted quantum double phases. We classify a large class of these XCd(k)X\mathcal C^{(k)}_dXCd(k)​ stabilizer states, showing that they are uniform superpositions over affine-linear subspaces with diagonal phases. In particular, when the stabilizers of a state require operators from level kkk of the Clifford hierarchy, we show that the diagonal gates required to produce the phases in the wavefunction sit one level higher. We further show that every 2D twisted quantum double Dω(Zpn){\cal D}^ω(\mathbb{Z}_p^n)Dω(Zpn​) with ωωω a product of type-III cocycles and ppp an odd prime admits a realization using only Clifford (k=2k=2k=2) stabilizers, and we conjecture that phases where ωωω contains a type-I or type-II cocycle require level-ppp Clifford-hierarchy stabilizers for ppp-dimensional qudits. Finally, we demonstrate that a pair of qudit toric codes may be deterministically prepared in a logical magic state by measuring XCd(k)X\mathcal C^{(k)}_dXCd(k)​ stabilizers. Together, these results provide a concrete stabilizer framework for topological codes beyond Pauli stabilizer models and their logical gates.
We study finite-length qudit quantum low-density parity-check (LDPC) codes from translation-invariant CSS constructions on two-dimensional tori with twisted boundary conditions. Recent qubit work [PRX Quantum 6, 020357 (2025)] showed that, within the bivariate-bicycle viewpoint, twisting generalized toric patterns can significantly improve the finite-size distance of qubit codes. Building on this insight, we extend the construction and the search to qudit codes over finite fields. Using algebraic methods based on Laurent-polynomial ideals and Gröbner-basis computations over Fq\mathbb{F}_qFq​, we compute the number of logical qudits on any twisted torus and identify compact codes with favorable rate--distance tradeoffs. Overall, for the finite sizes explored, twisted-torus qudit constructions typically achieve larger estimated distances than their untwisted counterparts and, at the same number of physical and logical qudits, larger estimated distances than previously reported twisted qubit instances. The best new codes are tabulated.
We systematically construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes using cohomology operations and symmetry. These logical gates are obtained from unitary operators given by symmetry-protected topological responses, which correspond to generators of group cohomology and can be expressed explicitly on the lattice using cohomology operations including cup product, Steenrod squares and new combinations of higher cup products called higher Pontryagin powers. Our study covers most types of the cohomology operations in the literature. This hence gives rise to logical Cn−1ZC^{n-1}ZCn−1Z gates in nnn copies of quantum codes via the nnn-fold cup product in the usual color code paradigm, as well as several new classes of diagonal and non-diagonal logical gates in increasing Clifford hierarchies beyond the color code paradigm, including the logical RkR_kRk​ and multi-controlled CmRkC^m R_kCmRk​ gates for codes defined in projective spaces. Implementing these gates could make it more efficient to compile specific types of quantum algorithms such as Shor's algorithm. We further extend the construction to quantum codes with boundaries, which generalizes the folding approach in color codes. We also present a formalism for addressable and parallelizable logical gates in LDPC codes via higher-form symmetries. We further construct logical Clifford gates in expander-based codes including the asymptotically good LDPC codes and hypergraph-product codes. As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.
We present an entirely 2D constant-depth realization of topologically protected phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double D(G)D(G)D(G) of a non-Abelian group GGG on a triangular spatial patch. The logical gate is implemented by a constant-depth circuit constructed from stacking on the spatial region a symmetry-protected topological (SPT) phase specified by a group 2-cocycle and boundary counter-terms. The Bravyi-König theorem limits the unitary gates implementable by constant-depth quantum circuits on Pauli stabilizer codes in DDD dimensions to the DDD-th level of the Clifford hierarchy. We bypass this limitation, by constructing constant-depth unitary gates at arbitrary levels of the Clifford hierarchy purely in 2D, without sacrificing locality or fault tolerance, at the cost of using the quantum double of a non-Abelian group GGG. Specifically, for G=D4NG = D_{4N}G=D4N​, the dihedral group of order 8N8N8N, we realize the phase gate T1/N=diag(1,eiπ/(4N))T^{1/N} = \mathrm{diag}(1, e^{iπ/(4N)})T1/N=diag(1,eiπ/(4N)) in the logical Z‾\overline{Z}Z basis. In this context, we propose a non-abelian stabilizer group formalism, which we work out for dihedral groups. For 8N=2n8N = 2^n8N=2n, the logical gate lies at the nnn-th level of the Clifford hierarchy and, importantly, has a qubit-only realization: we show that it can be constructed in terms of Clifford-hierarchy stabilizers for a code with nnn physical qubits on each edge of the lattice. We also discuss code-switching to the double surface-code D(Z2×Z2)D(\mathbb{Z}_2\times\mathbb{Z}_2)D(Z2​×Z2​), to complete a universal gate-set in this setup.