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
- Authors: Hasan Sayginel, Stergios Koutsioumpas, Mark Webster, Abhishek Rajput, Dan E Browne,
- 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
- 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) - 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) - Implementing Clifford Gates on Stabilizer Codes via Measurement [0.0]
We describe a method to use measurements and correction operations in order to implement the Clifford group in a stabilizer code.
In subsystem stabilizer codes of distance at least $3$ the process can be implemented fault-tolerantly.
This is an alternative to the method proposed by [Paetznick and Reichardt, 2013] to generate a set of gates which is universal for quantum computing for this 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.