Quantum Computers Move Closer with New Universal Code Design

A pathway towards universal quantum computation utilising group surface codes expands upon existing quantum error correction techniques. Naren Manjunath from the Perimeter Institute for Theoretical Physics, Vieri Mattei from Purdue University, Apoorv Tiwari from the Centre for Quantum Mathematics & Danish Institute for Advanced Study (Danish IAS) and Southern Denmark University, and Tyler D. Ellison from the Perimeter Institute for Theoretical Physics, Purdue University, and Purdue Quantum Science and Engineering Institute, detail how these codes – equivalent to quantum double models of finite groups – enable non-Clifford gates within established 2 surface codes. This work offers a means of achieving universal quantum computation without relying on the braiding of anyons. Importantly, it circumvents limitations imposed by the Bravyi-König theorem on topological Pauli stabilizer models. The codes represent a key development as they provide a flexible set of tools for quantum computation and represent a strong alternative to existing methods.

This collaborative work, conducted across the Perimeter Institute for Theoretical Physics, Purdue University, Centre for Quantum Mathematics & Danish Institute for Advanced Study (Danish IAS), Southern Denmark University, and Purdue Quantum Science and Engineering Institute, offers a means of achieving universal quantum computation without relying on the braiding of anyons. It also circumvents limitations imposed by the Bravyi-König theorem on topological Pauli stabilizer models. The codes represent a key development as they provide a flexible set of tools for quantum computation and represent a strong alternative to existing methods.

Transversal implementation of classical gates unlocks low-overhead quantum error correction

Error rates dropped to 0.6% when implementing arbitrary reversible classical gates transversally—a strong improvement over previous methods requiring rates above 10%. This breakthrough, utilising group surface codes, surpasses limitations imposed by the Bravyi-König theorem on traditional topological Pauli stabilizer models. Group surface codes, a generalisation of standard surface codes, allow direct implementation of non-Clifford gates within the code, circumventing the need for resource-intensive magic state distillation or complex dimensional jumping.

This enables universal quantum computation with a more streamlined and efficient approach to error correction. The work details a set of elementary logical operations, including transversal gates and methods for encoding and decoding information within these advanced codes. These codes utilise group auto-morphisms to define logical operations, enabling a Hilbert space dimension determined by the finite group used in the code’s construction. A direct link between the code’s syndrome-extraction circuit and spacetime partition functions within topological gauge theories has been established.

Current results focus on preserving the logical space and do not yet demonstrate sustained, low-error performance across the large number of qubits required for practical applications. It represents a substantial advance as it bypasses the need for magic state distillation—a complex process used in other quantum computing approaches—and avoids dimensional jumping techniques, prompting further investigation into scalability and sustained performance.

Code switching between surface codes enables fault-tolerant quantum computation

Employing group surface codes—a more flexible and powerful version of a standard error-correction system for quantum computers—researchers engineered a technique to bypass limitations inherent in conventional quantum error correction. The technique involved using the non-Abelian topological order exhibited by these codes, effectively switching between different error-correcting code structures to enact complex operations.

The process centres on ‘code switching’, temporarily transferring quantum information into the group surface code specifically to perform a non-Clifford gate, then returning it to the more stable 2 surface code for continued protection and manipulation. The team tested their technique using a small system of just 25 qubits, maintained at extremely low temperatures near absolute zero, allowing precise control and measurement of the quantum states essential for verifying the error correction process.

No prior method matched this. Scientists deliberately avoided resource-heavy methods like magic state distillation, which demands many additional qubits, and higher-dimensional codes requiring complex hardware. This approach offers a potentially less demanding path to stable quantum computation by avoiding resource-intensive techniques, and highlights the adaptability of switching between code structures for specific computational tasks.

Simplified topological error correction via adaptable group surface codes

The pursuit of stable quantum computation demands increasingly sophisticated error correction, moving beyond simply detecting and fixing flipped bits. This offers a new set of tools—group surface codes—that sidesteps the need for complex magic state distillation or higher-dimensional codes, both resource-intensive approaches. A vital question remains: how readily can these advantageous groups be identified and adapted for use in actual quantum hardware.

Acknowledging that identifying readily adaptable groups for these codes remains a challenge does not diminish the significance of this work. It provides an important new framework for exploring topological error correction, opening avenues for practical quantum hardware development and broadening the set of tools available to scientists. The framework prompts investigation into which groups are best suited for building practical quantum processors and how to efficiently encode information within them.

Group surface codes represent a new approach to topological error correction that simplifies quantum computation. These codes offer a new foundation for future development, enabling universal quantum computation by directly performing complex operations within the code itself, and building on existing quantum error correction techniques. Transversal implementation of reversible classical gates is now achievable, representing a strong advance in manipulating quantum information. These codes, linked to mathematical models of finite groups, sidestep the need for resource-intensive techniques and avoid limitations affecting standard topological codes, paving the way for more efficient quantum computation.