The role of entropy in topological quantum error correction

Abstract

The performance of a quantum error-correction process is determined by the likelihood that a random configuration of errors introduced to the system will lead to the corruption of encoded logical information. In this work we compare two different variants of the surface code with a comparable number of qubits: the surface code defined on a square lattice and the same model on a lattice that is rotated by $\pi /4$. This seemingly innocuous change increases the distance of the code by a factor of $\sqrt{2}$.However, as we show, this gain can come at the expense of significantly increasing the number of different failure mechanisms that are likely to occur. We use a number of different methods to explore this tradeoff over a large range of parameter space under an independent and identically distributed noise model. We rigorously analyze the leading order performance for low error rates, where the larger distance code performs best for all system sizes. Using an analytical model and Monte Carlo sampling, we find that this improvement persists for fixed sub-threshold error rates for large system size, but that the improvement vanishes close to threshold. Remarkably, intensive numerics uncover a region of system sizes and sub-threshold error rates where the square lattice surface code marginally outperforms the rotated model.

arXiv comment20 pages, 19 figures, comments welcome

References in corpus (43)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Topological quantum memory
• Quantum Error Correction for Quantum Memories
• Topological Quantum Distillation
• Realization of Three-Qubit Quantum Error Correction with Superconducting Circuits
• Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• High threshold universal quantum computation on the surface code
• Quantum orders in an exact soluble model
• Experimental Quantum Computations on a Topologically Encoded Qubit
• A symmetry principle for Topological Quantum Order
• Fast Decoders for Topological Quantum Codes
• Quantum memories at finite temperature
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Quantum error correction with only two extra qubits
• Demonstration of weight-four parity measurements in the surface code architecture
• Fault-tolerant quantum error detection
• Strong Resilience of Topological Codes to Depolarization
• Flag fault-tolerant error correction with arbitrary distance codes
• Fault-tolerant quantum computation with few qubits
• Constructions and Noise Threshold of Hyperbolic Surface Codes
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Fault-tolerant error correction with the gauge color code
• High threshold error correction for the surface code
• Error Correction and Degeneracy in Surface Codes Suffering Loss
• Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
• Efficient Decoders for Qudit Topological Codes
• A fast fault-tolerant decoder for qubit and qudit surface codes
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• Three-dimensional color code thresholds via statistical-mechanical mapping
• Proof of finite surface code threshold for matching
• Simulation of rare events in quantum error correction
• Tricolored Lattice Gauge Theory with Randomness: Fault-Tolerance in Topological Color Codes
• Tradeoffs for reliable quantum information storage in surface codes and color codes
• Multi-path Summation for Decoding 2D Topological Codes
• Topological Quantum Error Correction with Optimal Encoding Rate
• Error Thresholds for Abelian Quantum Double Models: Increasing the bit-flip Stability of Topological Quantum Memory
• Topological color codes on Union Jack lattices: A stable implementation of the whole Clifford group
• Optimal error correction in topological subsystem codes
• Error tolerance of topological codes with independent bit-flip and measurement errors
• Stability of topologically-protected quantum computing proposals as seen through spin glasses

Cited by in corpus (17)

• The XZZX Surface Code
• Tailoring surface codes for highly biased noise
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
• Parallelized quantum error correction with fracton topological codes
• Logical blocks for fault-tolerant topological quantum computation
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction
• A decoder for the triangular color code by matching on a Möbius strip
• Codesign of quantum error-correcting codes and modular chiplets in the presence of defects
• Tangling schedules eases hardware connectivity requirements for quantum error correction
• Correcting spanning errors with a fractal code
• Mitigating errors in logical qubits
• Linear-optical quantum computation with arbitrary error-correcting codes
• Spatially parallel decoding for multi-qubit lattice surgery
• Practical quantum error correction with the XZZX code and Kerr-cat qubits
• Minimising surface-code failures using a color-code decoder
• Mitigating Temporal Fragility in the XY Surface Code