Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation

2026-01-16

AI Summary

Current stabilizer codes alone cannot achieve universal fault-tolerant quantum computation and typically rely on high-overhead techniques such as magic state distillation or code switching. This work proposes a universal protocol based on ancilla qubits and mid-circuit measurements that, for the first time, enables deterministic fault-tolerant implementation of both Clifford and T gates on arbitrary stabilizer codes—without altering the encoding structure, consuming additional registers, or performing code conversion. The approach endows any single stabilizer code with full universality under fault tolerance and further supports direct communication between heterogeneous error-correcting codes, thereby establishing a foundation for scalable, hybrid-architecture fault-tolerant quantum computing.

Technology Category

• Machine Learning: Quantum Machine Learning
• Reasoning under Uncertainty: Stochastic Optimization
• Multiagent Systems: Multiagent Systems under Uncertainty

Application Category

• Security and Privacy: Large-scale security measurements
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Responsible Web: Measurement, analysis, and circumvention of Web censorship

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 universal quantum computation. This universality is highly desired and often achieved using additional techniques such as code concatenation, code switching, or magic state distillation, which can be costly and only work for specific codes. This work implements logical Clifford and T gates through novel ancilla-mediated protocols to construct a universal fault-tolerant quantum gate set. Unlike traditional techniques, our implementation is deterministic, does not consume ancilla registers, does not modify the underlying data codes or registers, and is generic over all 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. These features collectively open the door to countless possibilities for existing and undiscovered codes as well as their scalable, heterogeneous coexistence.

Problem

• fault-tolerant quantum computation
• stabilizer codes
• universal quantum computation
• error correction
• quantum gates

Innovation

• stabilizer code-generic
• universal fault-tolerant quantum computation
• ancilla-mediated gates
• heterogeneous code communication
• deterministic logical gates