Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
By: Nicholas J. C. Papadopoulos, Ramin Ayanzadeh
Potential Business Impact:
Makes quantum computers work perfectly, no errors.
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.
Similar Papers
Moveless: Minimizing Overhead on QCCDs via Versatile Execution and Low Excess Shuttling
Quantum Physics
Makes quantum computers work better and faster.
Fault-Tolerant Quantum Error Correction for Constant-Excitation Stabilizer Codes under Coherent Noise
Quantum Physics
Protects quantum computers from tricky noise.
Fermion-to-Fermion Low-Density Parity-Check Codes
Quantum Physics
Makes quantum computers work better with tiny particles.