Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation

TL;DR

This paper introduces a universal fault-tolerant quantum computation method using ancilla-mediated protocols that are stabilizer code-generic, deterministic, and do not require code modifications or ancilla consumption.

Contribution

It presents a novel, code-agnostic approach to implement logical Clifford and T gates, enabling universal quantum computation across all stabilizer codes without costly techniques.

Findings

Deterministic implementation of logical gates without ancilla consumption.

Universal quantum computation achieved with any stabilizer code.

Enables communication between heterogeneous stabilizer codes.

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, magic state distillation, or pieceable fault tolerance, which can be costly and only work for specific codes. This work proposes a new direction by implementing 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 yet undiscovered codes as well as their scalable, heterogeneous coexistence.