Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes

• URL: http://arxiv.org/abs/2606.13521v1
• Date: Thu, 11 Jun 2026 16:12:02 GMT
• Title: Quantum Logic Codes: Complete Transversal Logical Clifford Instruction Sets for High-Rate Stabilizer Quantum Error Correcting Codes
• Abstract summary: We study the structure and logical capabilities of stabilizer quantum error correcting.<n>We identify lower bounds on circuit depth to generate a full logical Clifford algebra codes.<n>We develop novel constructions of universal design gates.
• Score: 0.1160324357508053
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the structure and transversal logical capabilities of stabilizer quantum error correcting codes. Among our results, we identify universal lower bounds on circuit depth to generate a full logical Clifford algebra, and develop novel constructions of logical transversal gates including a new depth-one transversal phase $\mathrm{\overline{S}}$ gate in the rotated surface code and a depth-one intra-block $\mathrm{\overline{CZ}}$ gate in the 2D-toric code that generalizes to all odd distances and all lengths $L\ge3$, respectively. Finally, we construct a high-rate non-LDPC CSS code family with parameters $[[n,\sqrt{n},Θ({n^β})]]$ where $β\approx 0.2823$ in one demonstrated case, that provably possesses a constant-depth complete 2-local transversal logical Clifford basis instruction set architecture (ISA) composed of all individually targeted $\mathrm{\overline{S}}$, $\mathrm{\overline{SHS}} = \sqrt{X}$, and $\mathrm{\overline{CZ}}$ gates. This ISA is depth-one for certain subfamilies that we design and generally constant-depth under certain conditions. The code family is built from a small code with parameters $[[n_0, 2, d_0]]$, and is tunable in the standard way: it tiles out to form utility-scale logical qubit counts, and it scales up through concatenation to achieve higher distances and error suppression. We show that this construction preserves the depth-one complete transversal logical Clifford basis ISA when composed with these commuting construction actions, inheriting structure from the core codes so that at scale the complete logical Clifford basis ISA remains depth-one up to depth-two addressable operations between tiled cores. We call these Quantum Logic Codes.

Related papers

• Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates [0.0]
  We present a full logical group using only and foldbits for a family of Clifford gates in which $k$ grows near $linearly in $n$ up to a $1/sqrtt$ factor.<n>This is the first group using only and foldbits for a family of Clifford gates in which $k$ grows near $linearly in $n$ up to a $1/sqrtt$ factor.
  arXiv  Detail & Related papers  (2026-02-10T13:49:00Z)
• Transversal Clifford-Hierarchy Gates via Non-Abelian Surface Codes [0.0]
  We present a purely 2D realization of phase gates at any level of the Clifford hierarchy.<n>Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian group $G$ on a triangular spatial patch.
  arXiv  Detail & Related papers  (2025-12-15T19:00:00Z)
• Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic [1.1087735229999818]
  We extend the Bravyi-K"onig bound for $n-dimensional topological stabilizer codes to a broad class of $n$-dimensional hierarchy stabilizer codes.<n>We construct non-Clifford gates through automorphism symmetries represented by spatial products.<n>In 3D, we construct a logical $sqrttextT$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy.
  arXiv  Detail & Related papers  (2025-11-04T19:00:00Z)
• Universal Fault Tolerance with Non-Transversal Clifford Gates [0.4870012761464388]
  We extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit.<n>This framework allows implementation of $T$ gates alongside fault-tolerant realization of selected non-transversal Clifford gates using flags.<n>We also apply our construction to magic-state preparation, general state preparation using Clifford circuits, and data-syndrome codes.
  arXiv  Detail & Related papers  (2025-10-09T16:21:40Z)
• Quantum Codes with Addressable and Transversal Non-Clifford Gates [8.194994143531677]
  We study codes that support gates which induce $textitaddressable$ logical gates.<n>We develop a formalism for constructing quantum codes with $textitaddressable and $ell neq 2$ gates.
  arXiv  Detail & Related papers  (2025-02-03T22:24:34Z)
• 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)
• 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)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• A T-depth two Toffoli gate for 2D square lattice architectures [49.88310438099143]
  We present a novel Clifford+T decomposition of a Toffoli gate. Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits. This decomposition enables shallower, more fault-tolerant quantum computations on both NISQ and error-corrected architectures.
  arXiv  Detail & Related papers  (2023-11-21T10:33:51Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• 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)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.