Fault-Tolerant Logical Clifford Gates from Code Automorphisms

• URL: http://arxiv.org/abs/2409.18175v1
• Date: Thu, 26 Sep 2024 18:00:00 GMT
• Title: Fault-Tolerant Logical Clifford Gates from Code Automorphisms
• Abstract summary: We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose constraints based on the Clifford operators permitted.
• Score: 2.7262923206583136
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose constraints based on the Clifford operators permitted. We provide a rigorous formulation of the method for finding automorphisms of stabilizer codes and generalize ZX-dualities to non-CSS codes. We provide a Python package implementing our algorithms which uses the computational algebra system MAGMA. Our algorithms map automorphism group generators to physical circuits, calculate Pauli corrections based on the destabilizers of the code, and determine their logical action. We discuss the fault tolerance of the circuits and include examples of gates through automorphisms for the [[4,2,2]] and perfect [[5,1,3]] codes, bivariate bicycle codes, and the best known distance codes.

Related papers

• Theory of approximate quantum error correction and the error-set model [53.73800998389749]
  We develop a theory of approximate quantum error correction based on the error-set model.<n>Code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span.<n>This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory ofally good codes.
  arXiv  Detail & Related papers  (2026-07-25T02:15:33Z)
• Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure [0.0]
  We develop a framework for analyzing and engineering automorphisms in Generalized Bicycle (GB) codes.<n>We connect these conditions to the fold-transversal gate framework, providing explicit criteria for the existence of $H CX-, $S$-, and $ CX$-type fold-transversal gates.<n>This serves as a first demonstration of inverse design: using these methods to build codes around a rich automorphism structure from the ground up.
  arXiv  Detail & Related papers  (2026-06-03T16:05:40Z)
• Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus [37.09090127609627]
  We use the ZX-calculus language to handle dynamical stabilizer codes.<n>We combine gauge-fixing steps to implement a closed loop in the space of stabilizer codes.<n>This yields a machine-interpretable method for constructing dynamical automorphisms.
  arXiv  Detail & Related papers  (2026-06-01T17:46:09Z)
• No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits [0.0]
  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.
  arXiv  Detail & Related papers  (2026-02-13T19:00:44Z)
• Fault-tolerant transformations of spacetime codes [0.0]
  We introduce a framework based on chain complexes and chain maps to model spacetime codes and transformations.<n>We show that stabilizer codes, quantum circuits, and decoding problems can all be described using chain complexes.<n>We extend the foliated cluster state construction from stabilizer codes to any spacetime code, showing that any Clifford circuit can be transformed into a measurement-based protocol.
  arXiv  Detail & Related papers  (2025-09-11T16:42:47Z)
• Automorphism gadgets in homological product codes [0.0]
  We investigate structured homological product codes that admit logical operations arising from permutation symmetries in their input codes.<n>In general, these logical operations can be performed by a combination of physical qubit permutations and a subsystem circuit.<n>Our results further advance the search for practical fault tolerance beyond topological codes in platforms capable of long-range connectivity.
  arXiv  Detail & Related papers  (2025-08-06T18:10:37Z)
• A Classification of Transversal Clifford Gates for Qubit Stabilizer Codes [2.784326023586333]
  We show that for any stabilizer code, its group of diagonal Clifford gates on $ell$ code blocks must be one of six distinct families of matrix groups.<n>We further develop the theory of classifying stabilizer codes by via matrix algebras of endomorphisms first introduced by Rains.
  arXiv  Detail & Related papers  (2025-07-14T17:43:30Z)
• Classical and quantum Coxeter codes: Extending the Reed-Muller family [59.90381090395222]
  We introduce a class of binary linear codes that generalizes the Reed-Muller family by replacing the group $mathbbZm$ with an arbitrary finite Coxeter group. We also construct quantum CSS codes arising from the Coxeter codes, which admit logical operators outside of the Clifford group.
  arXiv  Detail & Related papers  (2025-02-20T17:16:28Z)
• 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. 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 [61.269295538188636]
  We construct explicit targeted logical gates for hypergraph product codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
  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)
• Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes [1.8416014644193066]
  Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of surface codes even with near-term hardware.
  arXiv  Detail & Related papers  (2024-07-04T14:49:35Z)
• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• 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 [51.9157257936691]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. 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)
• Implementing Logical Operators using Code Rewiring [0.0]
  We describe a method to use measurements and correction operations in order to implement the Clifford group in a stabilizer code. In particular this provides a method to implement a logical Hadamard-type gate within the 15-qubit Reed-Muller quantum code.
  arXiv  Detail & Related papers  (2022-10-25T14:56:31Z)
• 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)
• Fault-tolerant logical gates in holographic stabilizer codes are severely restricted [0.0]
  We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We show that the set of stabilizerly implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems.
  arXiv  Detail & Related papers  (2021-03-24T18:00:05Z)

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.