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:2609.26691

Parallelizable and addressable transversal non-Clifford gates on good quantum LDPC codes

Yiming Li, Zimu Li, Zhengyi Han, Zi-Wen Liu

quant-phcs.ITmath-phSubmitted Sep 22, 2026• Announced Sep 23, 2026• 8 citations• Revised Oct 6, 2026 (v3)
v1 · Sep 22, 2026v2 · Sep 23, 2026v3 · Oct 6, 2026
arXivHTMLPDF

Abstract

We achieve linearly many parallelizable and addressable transversal logical multi-controlled-Z gates with asymptotically optimal parameters simultaneously on good quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to good qLTC constructions. To establish the nontriviality of the logical operation, we express the cup product pairing as a coefficient in a product of Moore determinants and prove that this coefficient is nonzero. Moreover, we use the symmetries of the covering spaces to construct large spaces of cocycles. By multiplying the initial cocycles by suitable elements of these spaces, we obtain linearly many independent pairings, each selected by a corresponding cycle constructed using Poincaré duality. This yields linearly many parallelizable and addressable multi-controlled-Z gates and enables asymptotically constant-overhead magic state distillation with good qLDPC codes.

AI Summary

The paper asks whether asymptotically good qLDPC codes can support linearly many individually addressable, parallelizable transversal non-Clifford gates while also retaining constant local-testability soundness. It claims that, for every fixed integer $r\geq3$, there are binary qLDPC and qLTC families with parameters $[\![N,\Theta(N),\Theta(N)]\!]$, qLTC soundness $\Theta(1)$, and $\Theta(N)$ logical $r$-qubit controlled-$Z$ gates selectable in arbitrary subsets. This removes the polylogarithmic distance and soundness losses of the preceding almost-good construction. The construction applies a cup-product gate framework to recent good-qLTC constructions using arithmetic quotients of products of trees and projective Reed–Solomon local codes. For $\mathrm{CCZ}$, three degree-two sheaf-code blocks live on a six-dimensional cubical complex. Moore-determinant cocycles yield a seed cup-product pairing, whose nonvanishing is reduced to a polynomial-coefficient calculation. Auxiliary zero-cocycles, covering symmetries, and Poincaré-dual selector cycles produce a diagonal pairing of linear size, simultaneously establishing constant rate in all three blocks. Distance and soundness are inherited from existing construction theorems. A fixed constant-overhead repetition encoding converts bounded-incidence physical circuits into disjoint transversal gates. The detailed proof treats $\mathrm{CCZ}$; higher controlled-$Z$ gates are stated to follow by generalization. The selected logical action assumes unused field components and complementary logical coordinates are initialized to zero. The distillation application assumes ideal Clifford operations: it gives $\gamma=o(1)$ and, after choosing and concatenating a sufficiently large code, $O(\log^{\eta}(1/\epsilon))$ raw states per output for any fixed $\eta>0$, at sufficiently low input noise.

Likely largely AI-generatedAI use disclosedOverclaims
Generative AI tools substantially assisted in developing and completing the proof details and drafting the manuscript under extensive instructions from the authors.

Central claim may not hold: The theorem covers every fixed r≥3, but the supplied construction and nonvanishing proof establish only the CCZ case and leave the higher-order extension unsupported. The magic-state-distillation application establishes arbitrarily small positive polylogarithmic overhead exponents, not the constant overhead claimed in the abstract. The seed construction identifies an ordinary Moore determinant with a different split determinant without specifying a valid coordinate identification, leaving the determinant identities used to prove the seed cocycles and their pairing unjustified.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes

Yiming Li, Zimu Li, Zi-Wen Liu

We exhibit nontrivial transversal logical multi-controlled-$Z$ gates on $[\![N,Θ(N),\tildeΘ(N)]\!]$ quantum low-density parity-check (qLDPC) codes with soundness $\tildeΘ(1)$, combining nearly optimal code parameters with fault-tolerant non-Clifford gates on qLDPC and quantum locally testable codes for the first time. Remarkably, our proofs proceed through highly general algebraic arguments. Building on insights from [Li et al.,~arXiv:2603.25831], we develop a general covering space framework for constructing and computing a rich family of cohomological invariant forms on sheaf codes that induce transversal logical multi-controlled-$Z$. To certify their nontriviality, we further demonstrate the existence of two-way product-expanding punctured Reed--Solomon codes, which is striking in light of the many negative examples for the product expansion behavior of ordinary Reed--Solomon codes. This approach directly overcomes the previous obstruction to realizing nontrivial logical operations while simultaneously preserving the code parameters. The claimed almost-good code results follow immediately as examples.

quant-pharXiv:2604.01874•Apr 3, 2026•15 citations

Transversal non-Clifford gates on good quantum locally testable codes — E8 Intelligence Research

Andrew Stewart Caldin

We achieve nontrivial transversal logical multi-controlled-$Z$ gates with asymptotically optimal parameters simultaneously on quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to the recent good qLTC construction of [arXiv:2609.20780]. To this end, we use the covering space method to construct a nonzero cup product pairing on a finite arithmetic cubical complex. This differs from the previous construction of almost-good codes, whose base space is a hypergraph product. We express the pairing as a coefficient in a product of Moore determinants and prove polynomial nonvanishing by a bipartite multigraph specialization. We then construct covering spaces to obtain an asymptotic family of good qLTCs on which the pulled-back pairing induces the desired nontrivial transversal logical action. Source: http://arxiv.org/abs/2609.26691v1 (arXiv:2609.26691v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 10, 2026•0 citations

Quantum group codes for non-Clifford logic: enhanced decoding, addressability and parallelizability

Jean Gasnier, Virgile Guémard

We introduce a framework based on classical quasi group codes to define a class of quantum CSS codes, called quantum group codes, supporting transversal multi-control-$Z$ gates which are both addressable and parallelizable, thus allowing to efficiently implement circuits composed of non-Clifford gates at the logical level. Building on this, we use a lifting procedure of classical AG codes established from class field theory to construct good quantum group codes with improved decoding complexity and logical multi-control-$Z$ gate parallelizability. More precisely, on input a good quantum AG code over the alphabet $\mathbb F_q$ with transversal $\mathsf{C}^m\mathsf Z$ gate, we apply this lifting procedure to its underlying classical AG code and obtain a quantum group code over the alphabet $\mathbb F_{q^2}$ supporting a transversal $\mathsf{C}^m\mathsf Z$ gate as well as addressable and parallelizable $\mathsf{C}^{m-1}\mathsf Z$ gates. In addition, this quantum code admits a quasi-quadratic time decoder with a linear decoding radius. This is to be compared with the previous quantum AG codes which have a cubic-time decoder. Hence, our work implies a decrease of the time complexity of state-of-the-art magic-state distillation protocols by an almost linear factor.

quant-pharXiv:2606.27211•Jun 26, 2026•1 citation

Improved Transversal Non-Clifford Gates from Cup Products

Louis Golowich, Itzhak Tamo, Guanyu Zhu

It is a major challenge in quantum fault-tolerance to obtain low-overhead protocols for performing non-Clifford gates. In this vein, we construct quantum codes with low-weight stabilizers that support transversal (i.e. low-depth) implementations of the non-Clifford $C^{r-1}Z$ gate, for every constant $r\geq 3$. In particular, we obtain length-$n$ quantum LDPC codes (with constant-weight stabilizers) of polynomial distance $d\geq n^{(1-ε)/r}$ supporting transversal $C^{r-1}Z$ gates on a close-to-linear number $k\geq n^{1-ε}$ of disjoint tuples of logical qubits, for arbitrarily small $ε>0$. Our construction is the first with constant-weight stabilizers that obtains $dk\gg n$, and as a consequence achieves arbitrarily small magic state overhead exponent $γ=\log(n/k)/\log(d)>0$. Comparable prior constructions instead required at least polylogarithmic stabilizer weight. We also show how to obtain linearly many $k=Ω(n)$ logical $C^{r-1}Z$ gates, though with stabilizer weight and physical circuit depth $n^ε$. We show that our transversal gates also support addressing (i.e. targeting) of specific logical qubits. To obtain our codes, we develop a general transformation based on cup products that maps classical codes satisfying a multiplication property to quantum codes with transversal $C^{r-1}Z$. We apply this transformation to a new family of classical Tanner codes that we construct from punctured tensor products of algebraic codes.

quant-pharXiv:2609.27801•Aug 19, 2026•2 citations

Non-Clifford and Parallelizable Fault-Tolerant Logical Gates on Constant and Almost-Constant Rate Homological Quantum Low-Density Parity-Check Codes via Higher Symmetries

Guanyu Zhu, Shehryar Sikander, Elia Portnoy +2 more

We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive a generic formula for a transversal T gate on color codes defined on general 3-manifolds, which acts as collective non-Clifford logical gates on any triplet of logical qubits with their logical- X membranes having a Z 2 triple intersection at a single point. The triple-intersection number is a topological invariant, which also arises in the path integral of the emergent higher symmetry operator in a topological quantum field theory (TQFT): the Z 2 3 gauge theory. Moreover, the transversal S gate of the color code corresponds to a higher-form symmetry in TQFT supported on a codimension-1 submanifold, giving rise to exponentially many addressable and parallelizable logical gates. A construction of constant-depth circuits of the above logical gates via cup-product cohomology operation is also presented for three copies of identical toric codes on arbitrary 3-manifolds. We have developed a generic formalism to compute the triple-intersection invariants for 3-manifolds, with the structure encoded into an interaction hypergraph which determines the logical gate property and also corresponds to the hypergraph magic state that can be injected into the code without distillation (“”). We also study the scaling of the Betti number and systoles with volume for various 3-manifolds, which translates to the encoding rate and distance. We further develop three types of LDPC codes supporting such logical gates: (1) A quasi-hyperbolic code from the product of 2D hyperbolic surface and a circle, with almost-constant rate k / n = O ( 1 / log  ( n ) ) and O ( log  ( n ) ) distance; (2) A homological fiber-bundle code from twisting the product by an isometry of the surface based on the construction by Freedman-Meyer-Luo, with O ( 1 / log 1 2  ( n ) ) rate and O ( log 1 2  ( n ) ) distance; (3) A specific family of 3D hyperbolic codes: the Torelli mapping-torus code, constructed from mapping tori of a pseudo-Anosov element in the Torelli subgroup, which has constant rate while the distance scaling is currently unknown. We then show a generic constant-overhead scheme for applying a parallelizable universal gate set with the aid of logical- X measurements.

arXiv:2310.16982•PRX Quantum•Nov 6, 2025•72 citations

Theory of (Co)homological Invariants on Quantum LDPC Codes

Zimu Li, Yuguo Shao, Fuchuan Wei +2 more

We establish a systematic mathematical framework for constructing and computing (co)homological invariants that induce logical gates on quantum low-density parity-check (qLDPC) codes. By synthesizing tools from graph theory, algebraic topology, and number theory, we study constructions ranging from hypergraph product (HGP) codes to sheaf codes. Using commutative algebra, we generalize the notion of canonical logical representatives from HGP codes to the sheaf code setting, resolving a longstanding challenge in explicitly characterizing sheaf codewords. Building on this foundation, we present the first comprehensive computation of cup products within the intricate framework of sheaf codes. Given Artin's primitive root conjecture which holds under the generalized Riemann hypothesis, {we establish a nearly linear family of independent cup product cochains on almost-good qLDPC codes. Under a separate nonvanishing pairing condition, they are expected to yield parallel logical multi-controlled-Z gates. Moreover, by interpreting sheaf codes as covering spaces of HGP codes, we construct interlaced families through odd-degree lifts that preserve compatible invariant pairings, allowing nontrivial, constant-depth logical gates throughout an infinite family to be certified on a constant-size HGP seed. Treating local code constructions and expansion bounds as external inputs, our framework identifies the compatibility conditions for combining large dimension and distance, local testability, and constant-depth non-Clifford gates, thereby provides a mathematical foundation for separate constructions that realize these properties simultaneously.

quant-pharXiv:2603.25831•Mar 30, 2026•10 citations
We achieve linearly many parallelizable and addressable transversal logical multi-controlled-Z gates with asymptotically optimal parameters simultaneously on good quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to good qLTC constructions. To establish the nontriviality of the logical operation, we express the cup product pairing as a coefficient in a product of Moore determinants and prove that this coefficient is nonzero. Moreover, we use the symmetries of the covering spaces to construct large spaces of cocycles. By multiplying the initial cocycles by suitable elements of these spaces, we obtain linearly many independent pairings, each selected by a corresponding cycle constructed using Poincaré duality. This yields linearly many parallelizable and addressable multi-controlled-Z gates and enables asymptotically constant-overhead magic state distillation with good qLDPC codes.
The paper asks whether asymptotically good qLDPC codes can support linearly many individually addressable, parallelizable transversal non-Clifford gates while also retaining constant local-testability soundness. It claims that, for every fixed integer r≥3r\geq3r≥3, there are binary qLDPC and qLTC families with parameters [ ⁣[N,Θ(N),Θ(N)] ⁣][\![N,\Theta(N),\Theta(N)]\!][[N,Θ(N),Θ(N)]], qLTC soundness Θ(1)\Theta(1)Θ(1), and Θ(N)\Theta(N)Θ(N) logical rrr-qubit controlled-ZZZ gates selectable in arbitrary subsets. This removes the polylogarithmic distance and soundness losses of the preceding almost-good construction.
The construction applies a cup-product gate framework to recent good-qLTC constructions using arithmetic quotients of products of trees and projective Reed–Solomon local codes. For CCZ\mathrm{CCZ}CCZ, three degree-two sheaf-code blocks live on a six-dimensional cubical complex. Moore-determinant cocycles yield a seed cup-product pairing, whose nonvanishing is reduced to a polynomial-coefficient calculation. Auxiliary zero-cocycles, covering symmetries, and Poincaré-dual selector cycles produce a diagonal pairing of linear size, simultaneously establishing constant rate in all three blocks. Distance and soundness are inherited from existing construction theorems. A fixed constant-overhead repetition encoding converts bounded-incidence physical circuits into disjoint transversal gates.
The detailed proof treats CCZ\mathrm{CCZ}CCZ; higher controlled-ZZZ gates are stated to follow by generalization. The selected logical action assumes unused field components and complementary logical coordinates are initialized to zero. The distillation application assumes ideal Clifford operations: it gives γ=o(1)\gamma=o(1)γ=o(1) and, after choosing and concatenating a sufficiently large code, O(log⁡η(1/ϵ))O(\log^{\eta}(1/\epsilon))O(logη(1/ϵ)) raw states per output for any fixed η>0\eta>0η>0, at sufficiently low input noise.
We exhibit nontrivial transversal logical multi-controlled-ZZZ gates on [ ⁣[N,Θ(N),Θ~(N)] ⁣][\![N,Θ(N),\tildeΘ(N)]\!][[N,Θ(N),Θ~(N)]] quantum low-density parity-check (qLDPC) codes with soundness Θ~(1)\tildeΘ(1)Θ~(1), combining nearly optimal code parameters with fault-tolerant non-Clifford gates on qLDPC and quantum locally testable codes for the first time. Remarkably, our proofs proceed through highly general algebraic arguments. Building on insights from [Li et al.,~arXiv:2603.25831], we develop a general covering space framework for constructing and computing a rich family of cohomological invariant forms on sheaf codes that induce transversal logical multi-controlled-ZZZ. To certify their nontriviality, we further demonstrate the existence of two-way product-expanding punctured Reed--Solomon codes, which is striking in light of the many negative examples for the product expansion behavior of ordinary Reed--Solomon codes. This approach directly overcomes the previous obstruction to realizing nontrivial logical operations while simultaneously preserving the code parameters. The claimed almost-good code results follow immediately as examples.
We achieve nontrivial transversal logical multi-controlled-ZZZ gates with asymptotically optimal parameters simultaneously on quantum low-density parity check codes and quantum locally testable codes, by applying the gate framework of [arXiv:2604.01874] to the recent good qLTC construction of [arXiv:2609.20780]. To this end, we use the covering space method to construct a nonzero cup product pairing on a finite arithmetic cubical complex. This differs from the previous construction of almost-good codes, whose base space is a hypergraph product. We express the pairing as a coefficient in a product of Moore determinants and prove polynomial nonvanishing by a bipartite multigraph specialization. We then construct covering spaces to obtain an asymptotic family of good qLTCs on which the pulled-back pairing induces the desired nontrivial transversal logical action. Source: http://arxiv.org/abs/2609.26691v1 (arXiv:2609.26691v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We introduce a framework based on classical quasi group codes to define a class of quantum CSS codes, called quantum group codes, supporting transversal multi-control-ZZZ gates which are both addressable and parallelizable, thus allowing to efficiently implement circuits composed of non-Clifford gates at the logical level. Building on this, we use a lifting procedure of classical AG codes established from class field theory to construct good quantum group codes with improved decoding complexity and logical multi-control-ZZZ gate parallelizability. More precisely, on input a good quantum AG code over the alphabet Fq\mathbb F_qFq​ with transversal CmZ\mathsf{C}^m\mathsf ZCmZ gate, we apply this lifting procedure to its underlying classical AG code and obtain a quantum group code over the alphabet Fq2\mathbb F_{q^2}Fq2​ supporting a transversal CmZ\mathsf{C}^m\mathsf ZCmZ gate as well as addressable and parallelizable Cm−1Z\mathsf{C}^{m-1}\mathsf ZCm−1Z gates. In addition, this quantum code admits a quasi-quadratic time decoder with a linear decoding radius. This is to be compared with the previous quantum AG codes which have a cubic-time decoder. Hence, our work implies a decrease of the time complexity of state-of-the-art magic-state distillation protocols by an almost linear factor.
It is a major challenge in quantum fault-tolerance to obtain low-overhead protocols for performing non-Clifford gates. In this vein, we construct quantum codes with low-weight stabilizers that support transversal (i.e. low-depth) implementations of the non-Clifford Cr−1ZC^{r-1}ZCr−1Z gate, for every constant r≥3r\geq 3r≥3. In particular, we obtain length-nnn quantum LDPC codes (with constant-weight stabilizers) of polynomial distance d≥n(1−ε)/rd\geq n^{(1-ε)/r}d≥n(1−ε)/r supporting transversal Cr−1ZC^{r-1}ZCr−1Z gates on a close-to-linear number k≥n1−εk\geq n^{1-ε}k≥n1−ε of disjoint tuples of logical qubits, for arbitrarily small ε>0ε>0ε>0. Our construction is the first with constant-weight stabilizers that obtains dk≫ndk\gg ndk≫n, and as a consequence achieves arbitrarily small magic state overhead exponent γ=log⁡(n/k)/log⁡(d)>0γ=\log(n/k)/\log(d)>0γ=log(n/k)/log(d)>0. Comparable prior constructions instead required at least polylogarithmic stabilizer weight. We also show how to obtain linearly many k=Ω(n)k=Ω(n)k=Ω(n) logical Cr−1ZC^{r-1}ZCr−1Z gates, though with stabilizer weight and physical circuit depth nεn^εnε. We show that our transversal gates also support addressing (i.e. targeting) of specific logical qubits. To obtain our codes, we develop a general transformation based on cup products that maps classical codes satisfying a multiplication property to quantum codes with transversal Cr−1ZC^{r-1}ZCr−1Z. We apply this transformation to a new family of classical Tanner codes that we construct from punctured tensor products of algebraic codes.
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive a generic formula for a transversal T gate on color codes defined on general 3-manifolds, which acts as collective non-Clifford logical gates on any triplet of logical qubits with their logical- X membranes having a Z 2 triple intersection at a single point. The triple-intersection number is a topological invariant, which also arises in the path integral of the emergent higher symmetry operator in a topological quantum field theory (TQFT): the Z 2 3 gauge theory. Moreover, the transversal S gate of the color code corresponds to a higher-form symmetry in TQFT supported on a codimension-1 submanifold, giving rise to exponentially many addressable and parallelizable logical gates. A construction of constant-depth circuits of the above logical gates via cup-product cohomology operation is also presented for three copies of identical toric codes on arbitrary 3-manifolds. We have developed a generic formalism to compute the triple-intersection invariants for 3-manifolds, with the structure encoded into an interaction hypergraph which determines the logical gate property and also corresponds to the hypergraph magic state that can be injected into the code without distillation (“”). We also study the scaling of the Betti number and systoles with volume for various 3-manifolds, which translates to the encoding rate and distance. We further develop three types of LDPC codes supporting such logical gates: (1) A quasi-hyperbolic code from the product of 2D hyperbolic surface and a circle, with almost-constant rate k / n = O ( 1 / log  ( n ) ) and O ( log  ( n ) ) distance; (2) A homological fiber-bundle code from twisting the product by an isometry of the surface based on the construction by Freedman-Meyer-Luo, with O ( 1 / log 1 2  ( n ) ) rate and O ( log 1 2  ( n ) ) distance; (3) A specific family of 3D hyperbolic codes: the Torelli mapping-torus code, constructed from mapping tori of a pseudo-Anosov element in the Torelli subgroup, which has constant rate while the distance scaling is currently unknown. We then show a generic constant-overhead scheme for applying a parallelizable universal gate set with the aid of logical- X measurements.
We establish a systematic mathematical framework for constructing and computing (co)homological invariants that induce logical gates on quantum low-density parity-check (qLDPC) codes. By synthesizing tools from graph theory, algebraic topology, and number theory, we study constructions ranging from hypergraph product (HGP) codes to sheaf codes. Using commutative algebra, we generalize the notion of canonical logical representatives from HGP codes to the sheaf code setting, resolving a longstanding challenge in explicitly characterizing sheaf codewords. Building on this foundation, we present the first comprehensive computation of cup products within the intricate framework of sheaf codes. Given Artin's primitive root conjecture which holds under the generalized Riemann hypothesis, {we establish a nearly linear family of independent cup product cochains on almost-good qLDPC codes. Under a separate nonvanishing pairing condition, they are expected to yield parallel logical multi-controlled-Z gates. Moreover, by interpreting sheaf codes as covering spaces of HGP codes, we construct interlaced families through odd-degree lifts that preserve compatible invariant pairings, allowing nontrivial, constant-depth logical gates throughout an infinite family to be certified on a constant-size HGP seed. Treating local code constructions and expansion bounds as external inputs, our framework identifies the compatibility conditions for combining large dimension and distance, local testability, and constant-depth non-Clifford gates, thereby provides a mathematical foundation for separate constructions that realize these properties simultaneously.