Fault-Tolerant Logical Clifford Gates from Code Automorphisms
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.
Cite
@article{arxiv.2409.18175,
title = {Fault-Tolerant Logical Clifford Gates from Code Automorphisms},
author = {Hasan Sayginel and Stergios Koutsioumpas and Mark Webster and Abhishek Rajput and Dan E Browne},
journal= {arXiv preprint arXiv:2409.18175},
year = {2025}
}
Comments
26 pages, 6 figures