Simulation of rare events in quantum error correction

Abstract

We consider the problem of calculating the logical error probability for a stabilizer quantum code subject to random Pauli errors. To access the regime of large code distances where logical errors are extremely unlikely we adopt the splitting method widely used in Monte Carlo simulations of rare events and Bennett's acceptance ratio method for estimating the free energy difference between two canonical ensembles. To illustrate the power of these methods in the context of error correction, we calculate the logical error probability $P_L$ for the 2D surface code on a square lattice with a pair of holes for all code distances $d\le 20$ and all error rates $p$ below the fault-tolerance threshold. Our numerical results confirm the expected exponential decay $P_L\sim \exp [-\alpha (p)d]$ and provide a simple fitting formula for the decay rate $\alpha (p)$. Both noiseless and noisy syndrome readout circuits are considered.

16 pages, 11 figures. Version 3: added a new reference

References in corpus (9)

• Surface codes: Towards practical large-scale quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological Quantum Distillation
• Topological fault-tolerance in cluster state quantum computation
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Surface code with decoherence: An analysis of three superconducting architectures
• Fault-tolerant quantum computation versus Gaussian noise
• Proof of finite surface code threshold for matching

Cited by in corpus (38)

• The XZZX Surface Code
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Fault-tolerant quantum error detection
• Fault-tolerant thresholds for quantum error correction with the surface code
• Efficient Decoders for Qudit Topological Codes
• Error mitigation for universal gates on encoded qubits
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Logical blocks for fault-tolerant topological quantum computation
• Decoding non-Abelian topological quantum memories
• Improved error thresholds for measurement-free error correction
• Fault-tolerance thresholds for the surface code with fabrication errors
• Tractable Simulation of Error Correction with Honest Approximations to Realistic Fault Models
• Fault Tolerance with Bare Ancillae for a [[7,1,3]] Code
• Quantum Bootstrapping via Compressed Quantum Hamiltonian Learning
• Quantum computing by color-code lattice surgery
• Optimization of the surface code design for Majorana-based qubits
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction
• Handling Leakage with Subsystem Codes
• A decoder for the triangular color code by matching on a Möbius strip
• Logical Error Rate Scaling of the Toric Code
• General tensor network decoding of 2D Pauli codes
• A simple decoder for topological codes
• The role of entropy in topological quantum error correction
• Codesign of quantum error-correcting codes and modular chiplets in the presence of defects
• Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
• Mitigating errors in logical qubits
• Fault-tolerant hyperbolic Floquet quantum error correcting codes
• Error-rate-agnostic decoding of topological stabilizer codes
• Efficient diagnostics for quantum error correction
• Dynamical subset sampling of quantum error correcting protocols
• Quantum error correction for long chains of trapped ions
• Demonstrating quantum error mitigation on logical qubits
• Spatially parallel decoding for multi-qubit lattice surgery
• Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
• Magic State Injection with Erasure Qubits
• Minimising surface-code failures using a color-code decoder
• Qudit low-density parity-check codes
• Comparison of spin-qubit architectures for quantum error-correcting codes