Search arXiv⌕ Search

arXiv · 2609.37699

Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates

Abstract

Low-space-overhead fault-tolerant quantum computation requires not only high-rate quantum error-correcting codes but also space-efficient implementations of logical operations. Transversal and fold-transversal gates are promising since they limit error propagation and require no additional qubits. However, the logical operations they enable are typically restricted, and a central challenge is to construct codes that combine a complete set of logical Clifford gates with favorable code parameters. In this work, we introduce a family of quantum codes with an asymptotically constant encoding rate and sublogarithmically growing stabilizer weight, while supporting the entire logical Clifford group using only transversal and fold-transversal gates. Our construction is based on classical codes whose code spaces are absolutely irreducible Steinberg modules of their Tanner-graph automorphism groups. Taking hypergraph products of these classical codes yields quantum codes for which all logical Clifford operations can be synthesized from a fixed set of transversal and fold-transversal gates. Moreover, the slow growth of the stabilizer weight enables a high error-correcting performance in small instances. These results provide a path toward fault-tolerant quantum computation with low space overhead using transversal and fold-transversal gates.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Takaya Matsuura, Yohji Chin, Shohei Kiryu, Kosuke Fukui. 2026-09-29. Constant-rate quantum codes with low-weight stabilizers and full logical Clifford actions via transversal and fold-transversal gates. https://arxiv.org/abs/2609.37699

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Modeling Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits

The Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. However, there is a disconnect between the noise model that GKP qubits are in theory designed to correct - uniform random displacement errors - and the conditions that affect GKP qubits in superconducting devices in practice: realistic noise channels, logical gates, and inefficient measurements. In this work we bridge this gap in three ways. First, we approximate the effect loss and dephasing on approximate GKP codestates using a random displacement channel, and show that this approximation matches well with numerics. Second, we analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder following the implementation of each gate can reduce the gate infidelity by multiple orders of magnitude. Finally, we consider the effect of homodyne measurement inefficiencies on logical state read-out and analyze a scheme to improve the measurement efficiency using the theory of quantum trajectories.

quant-ph↗

Testing nonstabilizerness only with stabilizer states

The stabilizer formalism plays a central role in quantum information processing and quantum computing. Since stabilizer states and operations can be efficiently simulated classically and fault-tolerantly implemented in quantum error-correcting codes, quantum states and operations beyond the stabilizer framework, characterized by nonstabilizerness or magic, naturally emerge as resources for quantum computation. Here, we demonstrate that a quantum-information task involving only stabilizer states can reveal a fundamental limitation of stabilizer operations. Specifically, we construct a set of mutually orthogonal stabilizer states that cannot be perfectly distinguished using stabilizer operations and extend this construction to an arbitrary number of qubits. Our results provide an efficient test of nonstabilizerness without requiring the direct use of resourceful states or operations nor relying on computational-hardness assumptions. This nonstabilizerness test could serve as a resource-efficient benchmark for fault-tolerant quantum computers powered by magic-state injection, by providing quantitative bounds on the robustness of magic. More fundamentally, the resulting asymmetry between the preparation and discrimination of free states parallels "nonlocality without entanglement" in entanglement theory, revealing an unexpected connection between these two distinct quantum resource theories.

quant-ph↗

Quantum Homotopy Algorithm for Solving Nonlinear PDEs and Flow Problems

Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number $Re_{\textrm{H}}$, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.

quant-ph↗