Local tensor-network codes

Abstract

Tensor-network codes enable the construction of large stabilizer codes out of tensors describing smaller stabilizer codes. An application of tensor-network codes was an efficient and exact decoder for holographic codes. Here, we show how to write some topological codes, including the surface code and colour code, as simple tensor-network codes. We also show how to calculate distances of stabilizer codes by contracting a tensor network. The algorithm actually gives more information, including a histogram of all logical coset weights. We prove that this method is efficient in the case of holographic codes. Using our tensor-network distance calculator, we find a modification of the rotated surface code that has the same distance but fewer minimum-weight logical operators by injecting the non-CSS five-qubit code tensor into the tensor network. This corresponds to an improvement in successful error correction of up to 2% against depolarizing noise (in the perfect-measurement setting), but comes at the cost of introducing four higher-weight stabilizers. Our general construction lets us pick a network geometry (e.g., a Euclidean lattice in the case of the surface code), and, using only a small set of seed codes (constituent tensors), build extensive codes with the potential for optimisation.

arXiv comment6+5 pages, 6 figures

References in corpus (36)

• The ITensor Software Library for Tensor Network Calculations
• Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
• Resource-efficient linear optical quantum computation
• Stabilizer Codes and Quantum Error Correction
• Holographic duality from random tensor networks
• Simulating quantum computation by contracting tensor networks
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Quantum Error Correction: An Introductory Guide
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
• Optimizing Quantum Error Correction Codes with Reinforcement Learning
• Tailoring surface codes for highly biased noise
• Holographic tensor network models and quantum error correction: A topical review
• Statistical mechanical models for quantum codes with correlated noise
• Tensor-Network Simulations of the Surface Code under Realistic Noise
• Tensor Networks and Quantum Error Correction
• NP-hardness of decoding quantum error-correction codes
• Quantum coding with low-depth random circuits
• Fusion-based quantum computation
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• Hyper-invariant tensor networks and holography
• Calderbank-Steane-Shor Holographic Quantum Error Correcting Codes
• Generalized Concatenated Quantum Codes
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• Linear-time general decoding algorithm for the surface code
• Toy Models of Holographic Duality between local Hamiltonians
• Connectivity constrains quantum codes
• Majorana dimers and holographic quantum error-correcting codes
• Quantum error correction codes and absolutely maximally entangled states
• Tensor-network codes
• General tensor network decoding of 2D Pauli codes
• Holographic codes
• Dynamics for holographic codes
• Perfect tangles
• Parallel decoding of multiple logical qubits in tensor-network codes

Cited by in corpus (7)

• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• Tensor networks for quantum computing
• Tensor network decompositions for absolutely maximally entangled states
• Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning
• Quantum Lego and XP Stabilizer Codes
• Dynamically generated concatenated codes and their phase diagrams
• Distributed Realization of Color Codes for Quantum Error Correction