XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
arXiv:2407.08566 · doi:10.1103/PRXQuantum.6.010360
Abstract
Analyzing and developing new quantum error-correcting schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ ruby codes. Based on the projective symmetries of the building blocks of the tensor network we develop a framework of Pauli flows. Pauli flows allow for a graphical understanding of all quantities entering an error correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement- and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes which are in the same topological phase as the 2+1d color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z3 automorphism to the logical Pauli group every three timesteps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of 0.18%, comparable with other Floquet codes and 2+1d color codes.
59 pages, 26 figures; v2: updated after journal publication
References in corpus (58)
- Quantum Error Correction for Quantum Memories
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Local stabilizer codes in three dimensions without string logical operators
- Topological Quantum Distillation
- Surface code quantum computing by lattice surgery
- Stim: a fast stabilizer circuit simulator
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Demonstration of fault-tolerant universal quantum gate operations
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- Protected edge modes without symmetry
- Topological boundary conditions in abelian Chern-Simons theory
- Experimental demonstration of fault-tolerant state preparation with superconducting qubits
- A short proof of stability of topological order under local perturbations
- Dynamically Generated Logical Qubits
- Single-shot fault-tolerant quantum error correction
- Unfolding the color code
- Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Low-overhead fault-tolerant quantum computing using long-range connectivity
- Universal topological phase of 2D stabilizer codes
- A computationally universal phase of quantum matter
- Triangular color codes on trivalent graphs with flag qubits
- A Fault-Tolerant Honeycomb Memory
- Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
- Parallel window decoding enables scalable fault tolerant quantum computation
- Structure of 2D Topological Stabilizer Codes
- Symmetry protected topological order at nonzero temperature
- Floquet codes without parent subsystem codes
- In and around Abelian anyon models
- Coherence in logical quantum channels
- Anyon condensation and the color code
- Demonstration of fault-tolerant Steane quantum error correction
- Parallelized quantum error correction with fracton topological codes
- Logical blocks for fault-tolerant topological quantum computation
- The boundaries and twist defects of the color code and their applications to topological quantum computation
- Code Deformation and Lattice Surgery Are Gauge Fixing
- Boundaries for the Honeycomb Code
- Tricolored Lattice Gauge Theory with Randomness: Fault-Tolerance in Topological Color Codes
- Pauli topological subsystem codes from Abelian anyon theories
- Benchmarking the Planar Honeycomb Code
- Improved single-shot decoding of higher dimensional hypergraph product codes
- Unifying flavors of fault tolerance with the ZX calculus
- Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
- Local Commuting Projector Hamiltonians and the Quantum Hall Effect
- Classification of translation invariant topological Pauli stabilizer codes for prime dimensional qudits on two-dimensional lattices
- Engineering 3D Floquet codes by rewinding
- Quantum computation from dynamic automorphism codes
- Floquetifying the Colour Code
- Modeling noise and error correction for Majorana-based quantum computing
- Topological Color Codes and Two-Body Quantum Lattice Hamiltonians
- Conservation laws and quantum error correction: towards a generalised matching decoder
- Topological error correcting processes from fixed-point path integrals
- Color code decoder with improved scaling for correcting circuit-level noise
- 3-Fermion topological quantum computation
- Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
- Low-overhead quantum computing with the color code
- Trichromatic Open Digraphs for Understanding Qubits
Cited by in corpus (8)
- Designing fault-tolerant circuits using detector error models
- Fault-tolerant hyperbolic Floquet quantum error correcting codes
- Tailoring Dynamical Codes for Biased Noise: The XZ Floquet Code
- Multiqubit Rydberg Gates for Quantum Error Correction
- Competing automorphisms and disordered Floquet codes
- Phases of Floquet code under local decoherence
- Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
- A dynamic circuit for the honeycomb Floquet code