General tensor network decoding of 2D Pauli codes
arXiv:2101.04125
Abstract
In this work we develop a general tensor network decoder for 2D codes. Specifically, we propose a decoder that approximates maximally likelihood decoding for 2D stabiliser and subsystem codes subject to Pauli noise. For a code consisting of qubits our decoder has a runtime of , where is an approximation parameter. We numerically demonstrate the power of this decoder by studying four classes of codes under three noise models, namely regular surface codes, irregular surface codes, subsystem surface codes and colour codes, under bit-flip, phase-flip and depolarising noise. We show that the thresholds yielded by our decoder are state-of-the-art, and numerically consistent with optimal thresholds where available, suggesting that the tensor network decoder well approximates optimal decoding in all these cases. Novel to our decoder is an efficient and effective approximate contraction scheme for arbitrary 2D tensor networks, which may be of independent interest. We have also released an implementation of this algorithm as a stand-alone Julia package: SweepContractor.jl.
arXiv commentDedicated to Prof David Poulin. Comments very welcome. 12 pages, 7 figures. Julia package available at https://github.com/chubbc/SweepContractor.jl
References in corpus (43)
- Fault-tolerant quantum computation by anyons
- Mixed State Entanglement and Quantum Error Correction
- Surface codes: Towards practical large-scale quantum computation
- Quantum Error Correction for Quantum Memories
- Topological Quantum Distillation
- Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions
- Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
- Stabilizer Formalism for Operator Quantum Error Correction
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
- Variational study of hard-core bosons in a 2-D optical lattice using Projected Entangled Pair States (PEPS)
- Fast Decoders for Topological Quantum Codes
- Quantum memories at finite temperature
- Almost-linear time decoding algorithm for topological codes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Ultrahigh Error Threshold for Surface Codes with Biased Noise
- Topological Computation without Braiding
- A Neural Decoder for Topological Codes
- Machine-learning-assisted correction of correlated qubit errors in a topological code
- Error Threshold for Color Codes and Random 3-Body Ising Models
- Decoding Small Surface Codes with Feedforward Neural Networks
- Deep Neural Network Probabilistic Decoder for Stabilizer Codes
- High threshold error correction for the surface code
- Tensor-Network Simulations of the Surface Code under Realistic Noise
- Tensor Networks and Quantum Error Correction
- Efficient Decoders for Qudit Topological Codes
- An efficient Markov chain Monte Carlo algorithm for the surface code
- Advantages of versatile neural-network decoding for topological codes
- Cellular-automaton decoders with provable thresholds for topological codes
- Cellular-automaton decoders for topological quantum memories
- Locations of multicritical points for spin glasses on regular lattices
- A fast fault-tolerant decoder for qubit and qudit surface codes
- Analysing correlated noise on the surface code using adaptive decoding algorithms
- Simulation of rare events in quantum error correction
- Multi-path Summation for Decoding 2D Topological Codes
- Error- and Loss-Tolerances of Surface Codes with General Lattice Structures
- Cellular automaton decoders of topological quantum memories in the fault tolerant setting
- Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
- Multicritical Point Relations in Three Dual Pairs of Hierarchical-Lattice Ising Spin-Glasses
- An Introduction to Topological Quantum Codes
- Hierarchical decoding to reduce hardware requirements for quantum computing
- Duality analysis on random planar lattice
- The Complexity of Contracting Planar Tensor Network
Cited by in corpus (11)
- Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
- Scalable Neural Decoder for Topological Surface Codes
- Decoding algorithms for surface codes
- Gauging tensor networks with belief propagation
- Morphing quantum codes
- Pauli channels can be estimated from syndrome measurements in quantum error correction
- Decoding quantum color codes with MaxSAT
- Local tensor-network codes
- The resource theory of tensor networks
- Quantum Lego and XP Stabilizer Codes
- Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm