Renormalization group decoder for a four-dimensional toric code

Abstract

We describe a computationally-efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding minimal surface given its boundary (curve) in any hypercubic lattice of dimension $D>2$. We use this algorithm to correct errors occurring in a four-dimensional variant of the toric code, having open as opposed to periodic boundaries. For a phenomenological error model which includes measurement errors we use a five-dimensional version of our algorithm, achieving a threshold of $4.35\pm 0.1\%$. For this error model, this is the highest known threshold of any topological code. Without measurement errors, a four-dimensional version of our algorithm can be used and we find a threshold of $7.3\pm 0.1\%$. For the gate-based depolarizing error model we find a threshold of $0.31\pm 0.01\%$ which is below the threshold found for the two-dimensional toric code.

18 pages, 12 figures, 3 tables. Comments are welcome

References in corpus (7)

• Surface codes: Towards practical large-scale quantum computation
• An Elementary Quantum Network of Single Atoms in Optical Cavities
• Fault-tolerant quantum computation with high threshold in two dimensions
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Fault-tolerant logical gates in quantum error-correcting codes
• A statistical mechanics view on Kitaev's proposal for quantum memories
• Scalable Neural Network Decoders for Higher Dimensional Quantum Codes

Cited by in corpus (22)

• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• Advantages of versatile neural-network decoding for topological codes
• Single-shot error correction of three-dimensional homological product codes
• Decoding algorithms for surface codes
• Universal fault-tolerant measurement-based quantum computation
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
• Universality Classes of Stabilizer Code Hamiltonians
• Efficient color code decoders in $d\ge 2$ dimensions from toric code decoders
• Generating Fault-Tolerant Cluster States from Crystal Structures
• Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
• Tailoring three-dimensional topological codes for biased noise
• Tensor Network Decoding Beyond 2D
• Achieving fault tolerance on capped color codes with few ancillas
• Experiments with the 4D Surface Code on a QCCD Quantum Computer
• Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
• Extracting topological orders of generalized Pauli stabilizer codes in two dimensions
• Rescaling decoder for 2D topological quantum color codes on 4.8.8 lattices
• Efficiently decoding the 3D toric codes and welded codes on cubic lattices
• Single-shot and measurement-based quantum error correction via fault complexes
• Single-shot quantum error correction with the three-dimensional subsystem toric code
• Loops in 4+1d Topological Phases