Clifford gates with logical transversality for self-dual CSS codes
Abstract
Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical gate of a high-rate code can be fault-tolerantly implemented using transversal physical gates, but its logical operation may depend on the choice of a symplectic basis that defines logical Pauli operators of the code. In this work, we focus on [\![n,k,d]\!] self-dual Calderbank-Shor-Steane (CSS) codes with k ≥ 1 and prove necessary and sufficient conditions for the code to have a symplectic basis such that (1) transversal logical Hadamard gates j=1k Hj can be implemented by transversal physical Hadamard gates i=1n Hi, and (2) for any (a1,…,ak)∈\-1,1\k, transversal logical phase gates j=1k Sjaj can be implemented by transversal physical phase gates i=1n Sibi for some (b1,…,bn)∈\-1,1\n. Self-dual CSS codes satisfying the conditions include any codes with odd n. We also generalize the idea to concatenated self-dual CSS codes and show that certain logical Clifford gates have multiple transversal implementations, each by logical gates at a different level of concatenation. Several applications of our results for fault-tolerant quantum computation with low overhead are also provided.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.