Related papers: Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes

Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes

URL: http://arxiv.org/abs/2601.06736v1
Date: Sun, 11 Jan 2026 01:20:36 GMT
Title: Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes
Authors: Guanyu Zhu, Ryohei Kobayashi, Po-Shen Hsin,
Abstract summary: We show that native non-Clifford logical gates can be realized using constant-rate 2D hypergraph-product codes and their Clifford-stabilizer variants.<n>This is achieved by a spacetime path integral effectively implementing the addressable gauging measurement of a new type of 0-form subcomplex symmetries.
Score: 1.1087735229999818
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical non-Clifford gates, one needs to resort to 3D product-code constructions. In this work, we extend Kitaev's framework of non-Abelian topological codes on manifolds to non-Abelian qLDPC codes (realized as Clifford-stabilizer codes) and the corresponding combinatorial topological quantum field theories (TQFT) defined on Poincaré CW complexes and certain types of general chain complexes. We also construct the spacetime path integrals as topological invariants on these complexes. Remarkably, we show that native non-Clifford logical gates can be realized using constant-rate 2D hypergraph-product codes and their Clifford-stabilizer variants. This is achieved by a spacetime path integral effectively implementing the addressable gauging measurement of a new type of 0-form subcomplex symmetries, which correspond to addressable transversal Clifford gates and become higher-form symmetries when lifted to higher-dimensional CW complexes or manifolds. Building on this structure, we apply the gauging protocol to the magic state fountain scheme for parallel preparation of $O(\sqrt{n})$ disjoint CZ magic states with code distance of $O(\sqrt{n})$, using a total number of $n$ qubits.

Related papers

Quantum error correction beyond $SU(2)$: spin, bosonic, and permutation-invariant codes from convex geometry [48.254879700836376]
We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces.<n>We prove that many codes and their gates in $SU(q)$ can be inter-converted between the three state spaces.<n>We present explicit constructions of codes with shorter length or lower total spin/excitation than known codes with similar parameters.
arXiv Detail & Related papers (2025-09-24T20:21:30Z)
Universal fault tolerant quantum computation in 2D without getting tied in knots [1.796950496605906]
We show how to perform fault-tolerant non-Clifford gates in two dimensions.<n>We formulate a path framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits.
arXiv Detail & Related papers (2025-03-19T23:59:46Z)
A topological theory for qLDPC: non-Clifford gates and magic state fountain on homological product codes with constant rate and beyond the $N^{1/3}$ distance barrier [1.472161528588343]
topological theory for fault-tolerant quantum computation in quantum low-density parity-check (qLDPC) codes.<n>We show that there exist hidden simplicial or CW complex structures encoding the topological data for all qLDPC and CSS codes.
arXiv Detail & Related papers (2025-01-31T18:25:24Z)
Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
arXiv Detail & Related papers (2024-12-19T18:55:44Z)
Targeted Clifford logical gates for hypergraph product codes [54.57204856880369]
We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group.<n>This enables us to design explicit transformations that result in targeted logical gates for arbitrary codes in this family.
arXiv Detail & Related papers (2024-11-26T02:32:44Z)
Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry [0.0]
We construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes.<n>We present a formalism for addressable and parallel logical gates in LDPC codes viasymmetries.<n>As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.
arXiv Detail & Related papers (2024-11-24T14:01:37Z)
Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
arXiv Detail & Related papers (2024-10-10T04:07:24Z)
Transform Arbitrary Good Quantum LDPC Codes into Good Geometrically Local Codes in Any Dimension [11.695180823001566]
A key challenge is identifying the optimal code construction that maximizes both dimension and distance. Recent advancements have produced several constructions, but these either depend on specific good quantum low-density parity-check (qLDPC) codes or are limited to three dimensions. We introduce a construction that can transform any good qLDPC code into an optimal geometrically local quantum code.
arXiv Detail & Related papers (2024-08-03T12:46:05Z)
Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries [1.643885885988614]
We study fault-tolerant quantum computing for families of homological quantum low-density parity-check codes defined on 3-manifolds with constant or almost-constant encoding rate.<n>We have developed a generic formalism to compute the triple intersection invariants for 3-manifolds.
arXiv Detail & Related papers (2023-10-25T20:33:59Z)
Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z)
Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z)
Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.