Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks

Abstract

We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or states in a modular fashion. Using a set of local moves known as operator pushing, one can derive properties of the more complex codes, such as transversal non-Clifford gates, by tracing the flow of operators in the network. The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes as well as non-stabilizer codes over qubits and qudits. For a contractible tensor network, the sequence of contractions also constructs a decoding/encoding circuit. To highlight the framework's range of capabilities and to provide a tutorial, we lay out some examples where we glue together simple stabilizer codes to construct non-trivial codes. These examples include the toric code and its variants, a holographic code with transversal non-Clifford operators, a 3d stabilizer code, and other stabilizer codes with interesting properties. Surprisingly, we find that the surface code is equivalent to the 2d Bacon-Shor code after "dualizing" its tensor network encoding map.

Updated text to match published version: corrected errors in appendix D1, added theorems for stabilizer code tracing and theorems for expressivity of atomic legos

References in corpus (15)

• A class of quantum many-body states that can be efficiently simulated
• Fault-tolerant quantum computation with high threshold in two dimensions
• Local stabilizer codes in three dimensions without string logical operators
• Topological Quantum Distillation
• Criticality, the area law, and the computational power of PEPS
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Magic state distillation with low overhead
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• Entanglement renormalization and topological order
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Holographic tensor network models and quantum error correction: A topical review
• Fiber Bundle Codes: Breaking the $N^{1/2}\mathrm{polylog}(N)$ Barrier for Quantum LDPC Codes
• Magic State Distillation from Entangled States
• Fault-tolerant logical gates in holographic stabilizer codes are severely restricted
• Local tensor-network codes

Cited by in corpus (20)

• Constant-depth preparation of matrix product states with adaptive quantum circuits
• Artificial Intelligence for Quantum Computing
• Holographic measurement and bulk teleportation
• Crystalline Quantum Circuits
• Tensor networks for quantum computing
• Simultaneous Discovery of Quantum Error Correction Codes and Encoders with a Noise-Aware Reinforcement Learning Agent
• Local tensor-network codes
• Extracting topological orders of generalized Pauli stabilizer codes in two dimensions
• XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
• Tensor network decompositions for absolutely maximally entangled states
• Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning
• Classical product code constructions for quantum Calderbank-Shor-Steane codes
• Engineering holography with stabilizer graph codes
• No invariant perfect qubit codes
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
• Quantum Lego and XP Stabilizer Codes
• Dynamically generated concatenated codes and their phase diagrams
• Constructing k-local parent Lindbladians for matrix product density operators
• A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra
• Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding