Year: 2026
Type: preprint
Abstract: Non-Clifford operations required for universal quantum computation can be implemented by measuring logical Clifford operators. We present a generalized framework to fault-tolerantly measure transversal Clifford logical operators in quantum low-density parity check (QLDPC) codes. Our protocol takes any QLDPC code and deforms the code across additional ancillary qubits such that a product of stabilizers measures the desired logical Clifford operator. We prove that the deformed, Clifford-stabilized code remains LDPC and that its distance is preserved up to a constant factor independent of the number of physical qubits. We further prove that the Clifford measurement has a fault distance against data qubit and measurement errors that grows linearly with the distance of the original code. We apply our methods to implement logical non-Clifford gates in algorithmically relevant subroutines and to prepare magic states in quantum stabilizer codes.
Source: arXiv (Cornell University)
Institutions: Yale University, Harvard University, Massachusetts Institute of Technology, Stony Brook University, National Institute of Standards and Technology, Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, IBM Research - Thomas J. Watson Research Center, IBM (Denmark), The University of Sydney
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7220720773
