Fault-Tolerant Logical Clifford Gates from Code Automorphisms
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913827734421504 |
|---|---|
| author | Sayginel, Hasan Koutsioumpas, Stergios Webster, Mark Rajput, Abhishek Browne, Dan E |
| author_facet | Sayginel, Hasan Koutsioumpas, Stergios Webster, Mark Rajput, Abhishek Browne, Dan E |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_18175 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fault-Tolerant Logical Clifford Gates from Code Automorphisms Sayginel, Hasan Koutsioumpas, Stergios Webster, Mark Rajput, Abhishek Browne, Dan E Quantum Physics 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. |
| title | Fault-Tolerant Logical Clifford Gates from Code Automorphisms |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2409.18175 |