No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits

• URL: http://arxiv.org/abs/2602.13395v1
• Date: Fri, 13 Feb 2026 19:00:44 GMT
• Title: No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits
• Authors: Aranya Chakraborty, Daniel Gottesman,
• Abstract summary: We study classes of fault-tolerant gadget constructions consisting of Clifford gates acting on the physical qubits.<n>While stabilizer codes encoding a single logical qubit are known to admit implementations of the full logical Clifford group, no analogous examples are known for codes encoding multiple logical qubits.<n>Since the Clifford group is a core component of universal gate sets, our findings imply that quantum computing with codes encoding multiple logical qubits within a single code block necessarily entails more complex constructions for fault tolerance.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Identifying stabilizer codes that admit fault-tolerant implementations of the full logical Clifford group would significantly advance fault-tolerant quantum computation. Motivated by this goal, we study several classes of fault-tolerant gadget constructions consisting of Clifford gates acting on the physical qubits, including transversal gadgets, code automorphisms, and fold-transversal gadgets. While stabilizer codes encoding a single logical qubit, most notably the [[7,1,3]] Steane code, are known to admit transversal implementations of the full logical Clifford group, no analogous examples are known for codes encoding multiple logical qubits. In this work, we prove a no-go theorem establishing that no stabilizer code admits a fully transversal implementation of the Clifford group on more than one logical qubit. We further strengthen this result by showing that fold-transversal implementations of the full logical Clifford group are impossible for stabilizer codes encoding more than two logical qubits. More generally, we introduce the notion of k-fold transversal gadgets and prove that implementing the full Clifford group on k logical qubits requires at least k-fold transversal gadgets at the physical level. In addition, we analyze code-automorphism based constructions and demonstrate that they also fail to realize the full Clifford group on multiple logical qubits for any stabilizer code. Together, these results place fundamental constraints on fault-tolerant Clifford gadget design and show that stabilizer codes supporting the full logical Clifford group on multiple logical qubits via these architectures do not exist. Since the Clifford group is a core component of universal gate sets, our findings imply that quantum computing with codes encoding multiple logical qubits within a single code block necessarily entails more complex constructions for fault tolerance.

Related papers

• No-go theorems for logical gates on product quantum codes [2.7150615775511215]
  Homological products of codes offer a versatile framework for quantum error-correcting codes.<n>We show that non-Clifford logical gates cannot be implemented accessiblely on hypergraph product codes.
  arXiv  Detail & Related papers  (2025-07-22T17:46:45Z)
• Hardware-tailored logical Clifford circuits for stabilizer codes [1.2116854758481392]
  Quantum error correction is the art of protecting fragile quantum information.<n>It is notoriously difficult to manipulate encoded quantum data without introducing uncorrectable errors.<n>We introduce a mathematical framework for constructing hardware-tailored quantum circuits.
  arXiv  Detail & Related papers  (2025-05-26T17:40:52Z)
• Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes [51.205673783866146]
  We propose and simulate a set of fault-tolerant and constant-depth logical gates on 2D toric codes.<n>This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full Clifford group.
  arXiv  Detail & Related papers  (2024-11-27T12:17:56Z)
• 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)
• Transversal Clifford and T-gate codes of short length and high distance [0.6138671548064355]
  We construct three kinds of codes encoding a single logical qubit for distances up to $31$.<n>To our knowledge, these are the smallest known triorthogonal codes for their respective distances.
  arXiv  Detail & Related papers  (2024-08-22T22:45:47Z)
• Transversal Diagonal Logical Operators for Stabiliser Codes [0.0]
  Pauli group operators can be implemented on quantum error correction codes. We identify logical operators composed of single and multi-qubit diagonal Clifford hierarchy gates. We show a method for constructing CSS codes that have a desired diagonal logical Clifford hierarchy operator implemented using single qubit phase gates.
  arXiv  Detail & Related papers  (2023-03-27T21:49:37Z)
• 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)
• 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.