Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation

Read full text
Authors: Nicholas J. C. Papadopoulos, Ramin Ayanzadeh
Cited by: 0

Abstract

Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of transversal universal quantum computation. This universality is highly desired and often achieved using techniques such as code concatenation, code switching, magic state distillation, or pieceable fault tolerance. Existing constructions can incur substantial overhead or rely on properties specific to particular codes. This work proposes implementing logical Clifford and T gates through novel, ancilla-mediated, pieceable interactions to construct a universal fault-tolerant quantum gate set. Our construction is deterministic, does not modify the underlying data codes or registers, and is generic over all data stabilizer codes. Thus, any single code becomes capable of universal quantum computation by leveraging helper codes in ancilla registers and mid-circuit measurements. Furthermore, since these logical gates are stabilizer code-generic, these implementations enable communication between heterogeneous stabilizer codes.

Fields of Study & Subjects

Quantum Computing Algorithms and Architecture Quantum Information and Cryptography Quantum many-body systems

Publication details

Journal / source
arXiv (Cornell University)
Publication date
16 January 2026
Document type
Preprint