Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases

Abstract

We propose a family of explicit geometrically local circuits on a 2-dimensional planar grid of qudits, realizing any abelian non-chiral topological phase as an actively error-corrected fault-tolerant memory. These circuits are constructed from measuring 1-form symmetries in discrete fixed-point path integrals, which we express through cellular cohomology and higher-order cup products. The specific path integral we use is the abelian Dijkgraaf-Witten state sum on a 3-dimensional cellulation, which is a spacetime representation of the twisted quantum double model. The resulting circuits are based on a syndrome extraction circuit of the (qudit) stabilizer toric code, into which we insert non-Clifford phase gates that implement the ``twist''. The overhead compared to the toric code is moderate, in contrast to known constructions for twisted abelian phases. We also show that other architectures for the (qudit) toric code phase, like measurement-based topological quantum computation or Floquet codes, can be enriched with phase gates to implement twisted quantum doubles instead of their untwisted versions. As a further result, we prove fault tolerance under arbitrary local (including non-Pauli) noise for a very general class of topological circuits that we call 1-form symmetric fixed-point circuits. This notion unifies the circuits in this paper as well as the stabilizer toric code, subsystem toric code, measurement-based topological quantum computation, or the (CSS) honeycomb Floquet code. We also demonstrate how our method can be adapted to construct fault-tolerant circuits for specific non-Abelian phases. In the appendix we present an explicit combinatorial procedure to define formulas for higher cup products on arbitrary cellulations, which might be interesting in its own right to the TQFT and topological-phases community.

v3: Version accepted for publication in Quantum

References in corpus (25)

• Non-Abelian Anyons and Topological Quantum Computation
• Suppressing quantum errors by scaling a surface code logical qubit
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Magic state distillation with low overhead
• Twisted Quantum Double Model of Topological Phases in Two--Dimension
• Topological Computation without Braiding
• Dynamically Generated Logical Qubits
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Floquet codes without parent subsystem codes
• Anyon condensation and the color code
• Pauli stabilizer models of twisted quantum doubles
• Pauli topological subsystem codes from Abelian anyon theories
• Unifying flavors of fault tolerance with the ZX calculus
• Higher cup products on hypercubic lattices: application to lattice models of topological phases
• Engineering 3D Floquet codes by rewinding
• Floquetifying the Colour Code
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• Topological error correcting processes from fixed-point path integrals
• 3-Fermion topological quantum computation
• A unified diagrammatic approach to topological fixed point models
• Bulk-to-boundary anyon fusion from microscopic models
• Disentangling modular Walker-Wang models via fermionic invertible boundaries
• Classification of ${\mathfrak{sl}}_3$ relations in the Witt group of nondegenerate braided fusion categories

Cited by in corpus (3)

• Competing automorphisms and disordered Floquet codes
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
• Universal fault tolerant quantum computation in 2D without getting tied in knots