The ZX calculus is a language for surface code lattice surgery
arXiv:1704.08670 · doi:10.22331/q-2020-01-09-218
Abstract
A leading choice of error correction for scalable quantum computing is the surface code with lattice surgery. The basic lattice surgery operations, the merging and splitting of logical qubits, act non-unitarily on the logical states and are not easily captured by standard circuit notation. This raises the question of how best to design, verify, and optimise protocols that use lattice surgery, in particular in architectures with complex resource management issues. In this paper we demonstrate that the operations of the ZX calculus -- a form of quantum diagrammatic reasoning based on bialgebras -- match exactly the operations of lattice surgery. Red and green "spider" nodes match rough and smooth merges and splits, and follow the axioms of a dagger special associative Frobenius algebra. Some lattice surgery operations require non-trivial correction operations, which are captured natively in the use of the ZX calculus in the form of ensembles of diagrams. We give a first taste of the power of the calculus as a language for lattice surgery by considering two operations (T gates and producing a CNOT ) and show how ZX diagram re-write rules give lattice surgery procedures for these operations that are novel, efficient, and highly configurable.
20 pages, many figures. Minor revisions. Accepted to Quantum Journal
References in corpus (15)
- Fault-tolerant quantum computation with high threshold in two dimensions
- Roads towards fault-tolerant universal quantum computation
- Restrictions on Transversal Encoded Quantum Gate Sets
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- PyZX: Large Scale Automated Diagrammatic Reasoning
- On the qubit routing problem
- Low overhead quantum computation using lattice surgery
- Quantum computing by color-code lattice surgery
- Optimising Clifford Circuits with Quantomatic
- Lattice Surgery Translation for Quantum Computation
- Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
Cited by in corpus (52)
- PyZX: Large Scale Automated Diagrammatic Reasoning
- Phase Gadget Synthesis for Shallow Circuits
- Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
- Logical blocks for fault-tolerant topological quantum computation
- Unifying flavors of fault tolerance with the ZX calculus
- Reconstructing quantum theory from diagrammatic postulates
- ZX-calculus for the working quantum computer scientist
- Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
- A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond
- Quantum Picturalism: Learning Quantum Theory in High School
- A Pair Measurement Surface Code on Pentagons
- Completeness of the ZX-Calculus
- Data-driven decoding of quantum error correcting codes using graph neural networks
- Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
- Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
- CSS code surgery as a universal construction
- Hybrid quantum-classical circuit simplification with the ZX-calculus
- Graphical Fourier Theory and the Cost of Quantum Addition
- A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
- ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification
- Low-overhead quantum computing with the color code
- TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- Quantum Linear Optics via String Diagrams
- Formal Methods for Quantum Programs: A Survey
- AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
- Completeness of the ZH-calculus
- Flexible layout of surface code computations using AutoCCZ states
- Completeness of the Phase-free ZH-calculus
- Picturing Counting Reductions with the ZH-Calculus
- Well-tempered ZX and ZH Calculi
- Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning
- Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
- Quantum Algorithms and Oracles with the Scalable ZX-calculus
- On a recipe for quantum graphical languages
- Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)
- ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
- Low-density parity-check representation of fault-tolerant quantum circuits
- Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks
- Non-stabilizerness and entanglement from cat-state injection
- Finite Verification of Infinite Families of Diagram Equations
- Universal graph representation of stabilizer codes
- Graphical Calculi and their Conjecture Synthesis
- ZX Graphical Calculus for Continuous-Variable Quantum Processes
- ZX-Rules for 2-qubit Clifford+T Quantum Circuits
- The ZX-calculus as a Language for Topological Quantum Computation
- A dataflow programming framework for linear optical distributed quantum computing
- String Diagrams for Defect-Based Surface Code Computing
- Quantum Multiple-Valued Decision Diagrams in Graphical Calculi
- Hopf-Frobenius Algebras and a Simpler Drinfeld Double
- Lattice Surgery for Dummies
- Encoding High-level Quantum Programs as SZX-diagrams