Skip to content
Preprint

From Syndromes to Computation: A General Framework for Logical Operations in Quantum Error-Correcting Codes

Oct 2026 · 0 citations · 21 references
Physics

TL;DR

A general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design is developed, establishing stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.

Abstract

Fault-tolerant quantum computation requires error-correcting codes that not only protect quantum information but also support useful logical operations with practical physical realizations. Here we develop a general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design. We derive an exact codespace-preservation condition valid at arbitrary rotation angles, providing a common stabilizer-level description for CSS and non-CSS codes and for both Clifford and non-Clifford operations. A particularly useful equal-syndrome specialization reduces Clifford gate design to stabilizer factorization, yields a general generator weight bound of $\lceil d/2\rceil$ for distance-$d$ codes, and systematically extends to logical rotations higher in the Clifford hierarchy. Applied to bivariate-bicycle (BB) and non-CSS Mirror qLDPC codes, the framework gives explicit low-weight Clifford and controlled-phase gates. Our implementations yield new low-weight gates, including an addressed $T$ gate on the $[[16,4,4]]$ BB code, $T$-type rotations on the $[[64,8,8]]$ BB code, and CCZ-, CS-, and $T$-type operations on the $[[36,6,6]]$ Mirror code. We also develop analytic constructions using Clifford algebra bases, which turn the syndrome constraints into explicit algebraic relations and provide a systematic route to logical addressability. We use this approach to analytically construct addressed CNOT, SWAP, controlled, and CCZ-type gates on recursive hypercube codes. An independent construction on middle quantum Reed--Muller codes yields C${}^r$Z gates that saturate the equal-syndrome weight bound. These results establish stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.

View source

Similar papers

Preprint Sep 2026

Syndrome measurements enable deterministic fault-tolerant $T$ gates

Non-Clifford gates are essential for universal quantum computation, yet implementing them fault-tolerantly remains a central challenge for stabilizer codes. Here, we show how a syndrome degree of freedom can mediate a logical non-Clifford gate. Releasing one stabilizer check makes an additional logical qubit available...

Kishor Bharti, Tobias Haug, Andrew Tanggara · 0 citations
Preprint Sep 2026

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

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...

Takaya Matsuura, Yohji Chin, Shohei Kiryu et al. · 1 citation
Sep 2026

Towards Block-Level Fault-Tolerant Quantum Simulation on Small High-Rate Non-CSS Codes

The results demonstrate the potential of block-level logical constructions for non-CSS codes without rich native transversal gate sets and the joint protection of the parity network, analog rotation, and recovery required to preserve fault-tolerant distance.

Zhuang-Zhuang Chen, Narayanan Rengaswamy · 0 citations
Preprint Oct 2026

Fast computational primitives for La-cross qLDPC codes

Quantum LDPC codes promise to reduce the overhead of fault-tolerant quantum computation, but their practical use requires efficient logical gates, measurements, and access to non-Clifford resources. Here, we develop a complete set of computational primitives for La-cross hypergraph product codes. For a subclass of thes...

A. D. Difini, Tom Hartweg, Laura Pecorari et al. · 0 citations
Preprint Oct 2026

Designing Group-Valued Codes with Full Regular Low-Weight Bases

Efficient fault-tolerant quantum computing architectures benefit from low-weight logical operators. However, reported canonical bases for high-rate, high-distance codes can be several times heavier than the code distance, and fundamental obstructions can prevent minimum-weight logical operators from forming a complete...

Jong-Ye-On Lee · 1 citation
Preprint Oct 2026

Magic Quantum Code Surgery

Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and de...

Kathleen Chang, A. Lyons, Yuan-Jie Ren et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.