Hybrid Lattice Surgery: Non-Clifford Gates via Non-Abelian Surface Codes
quant-ph, cond-mat.str-el, hep-th
Submitted: 2025-10-23
Updated: 2026-09-16
Comments: 33 pages; v3 accepted for publication in Quantum
License: http://creativecommons.org/licenses/by/4.0/
The gist: In universal fault-tolerant quantum computing, implementing logical non-Clifford gates often demands substantial spacetime resources for many error-correcting codes, including the high-threshold
Terminology
Abstract
In universal fault-tolerant quantum computing, implementing logical non-Clifford gates often demands substantial spacetime resources for many error-correcting codes, including the high-threshold surface code. A critical mission for realizing large-scale quantum computing is to develop simple and resource-efficient implementations of logical non-Clifford gates. We propose a novel way of implementing non-Clifford operations in the standard surface code based on hybrid lattice surgery. First we generalize the standard lattice surgery to hybrid lattice surgery, where operations of rough merge and rough split happen across different topological codes. Then we apply such procedures between Abelian and non-Abelian codes and show that this can provide non-Clifford operations in the standard surface code, in the form of a magic state or a non-Clifford gate teleportation. Complementing this, we provide a continuum topological field theory description of this hybrid lattice surgery utilizing interfaces between (2+1)d topological orders. From these considerations, we can generalize our protocol to non-Clifford gates and magic states at all finite levels of the Clifford hierarchy, as well as gates beyond the hierarchy. We also discuss protocols extending this framework to qutrits.
Sources
- Encoding a qubit in an oscillator
- Restrictions on Transversal Encoded Quantum Gate Sets
- Universal fault-tolerant gates on concatenated stabilizer codes
- Good Quantum Error-Correcting Codes Exist
- Locality-Preserving Logical Operators in Topological Stabiliser Codes
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum computation with realistic magic state factories
- A bridge to lower overhead quantum computation
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Higher-group symmetry of (3+1)D fermionic $\mathbb{Z}_2$ gauge theory: logical CCZ, CS, and T gates from higher symmetry
- Topological quantum order: stability under local perturbations
- Kitaev's quantum double model as an error correcting code
- Ground Subspaces of Topological Phases of Matter as Error Correcting Codes
- Fast Decoders for Topological Quantum Codes
- Almost-linear time decoding algorithm for topological codes
- Quantum codes on a lattice with boundary
- Topological quantum memory
- Surface code quantum computing by lattice surgery
- Low overhead quantum computation using lattice surgery
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity