Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates

• URL: http://arxiv.org/abs/2602.09788v2
• Date: Tue, 17 Feb 2026 11:58:47 GMT
• Title: Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates
• Authors: Theerapat Tansuwannont, Tim Chan, Ryuji Takagi,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: To build large-scale quantum computers while minimizing resource requirements, one may want to use high-rate quantum error-correcting codes that can efficiently encode information. However, realizing an addressable gate$\unicode{x2014}$a logical gate on a subset of logical qubits within a high-rate code$\unicode{x2014}$in a fault-tolerant manner can be challenging and may require ancilla qubits. Transversal and fold-transversal gates could provide a means to fault-tolerantly implement logical gates using a constant-depth circuit without ancilla qubits, but available gates of these types could be limited depending on the code and might not be addressable. In this work, we study a family of $[\![n=2^m,k={m \choose m/2}\approx n/\sqrt{π\log_2(n)/2},d=2^{m/2}=\sqrt{n}]\!]$ self-dual quantum Reed$\unicode{x2013}$Muller codes, where $m$ is a positive even number. For any code in this family, we construct a generating set of the full logical Clifford group comprising only transversal and fold-transversal gates, thus enabling the implementation of any addressable Clifford gate. To our knowledge, this is the first known construction of the full logical Clifford group using only transversal and fold-transversal gates without requiring ancilla qubits for a family of codes in which $k$ grows near-linearly in $n$ up to a $1/\sqrt{\log n}$ factor.

Related papers

• Quantum Lego Power-up: Designing Transversal Gates with Tensor Networks [6.445605125467573]
  Transversal gates are the simplest form of fault-tolerant gates and are relatively easy to implement in practice.<n>We show that designing codes that support useful operations -- especially non-Clifford or addressable gates -- remains difficult within the stabilizer formalism or CSS constructions alone.<n>Within the quantum lego formalism, small codes carrying desirable symmetries can be "glued" into larger ones, with operator-flow rules guiding how logical symmetries are preserved.
  arXiv  Detail & Related papers  (2026-03-03T21:56:34Z)
• 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)
• Asymptotically Good Quantum Codes with Addressable and Transversal Non-Clifford Gates [8.194994143531677]
  This paper builds a family of over qubits of good quantum codes supporting addressable non-Clifford gates.<n>More precisely, given any three logical qubits across one, two, or three code, the logical $mathsfCCZ$ gate can be executed on those three logical qubits via a depth-one physical circuit.
  arXiv  Detail & Related papers  (2025-07-07T18:24:40Z)
• Clifford gates with logical transversality for self-dual CSS codes [0.8009842832476994]
  Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers.<n>Some logical gates of a high-rate code can be fault-tolerantly implemented using physical gates.<n>We show that certain logical Clifford gates have multiple implementations, each by logical gates at a different level of concatenation.
  arXiv  Detail & Related papers  (2025-03-25T15:55:12Z)
• Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the RM family by replacing the domain $mathbbZm$ with an arbitrary finite Coxeter group.<n> Coxeter codes also give rise to a family of quantum codes for which closed diagonal $Z$ rotations can perform non-trivial logic.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• 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)
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• 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.