Efficient diagnostics for quantum error correction
arXiv:2108.10830 · doi:10.1103/PhysRevResearch.4.043218
Abstract
Fault-tolerant quantum computing will require accurate estimates of the resource overhead, but standard metrics such as gate fidelity and diamond distance have been shown to be poor predictors of logical performance. We present a scalable experimental approach based on Pauli error reconstruction to predict the performance of concatenated codes. Numerical evidence demonstrates that our method significantly outperforms predictions based on standard error metrics for various error models, even with limited data. We illustrate how this method assists in the selection of error correction schemes.
arXiv comment5 pages + 11 page appendix, 6 figures
References in corpus (46)
- Randomized Benchmarking of Quantum Gates
- Robust randomized benchmarking of quantum processes
- Distance measures to compare real and ideal quantum processes
- Roads towards fault-tolerant universal quantum computation
- Noise tailoring for scalable quantum computation via randomized compiling
- Characterizing Quantum Gates via Randomized Benchmarking
- Low-distance Surface Codes under Realistic Quantum Noise
- The XZZX Surface Code
- Characterizing large-scale quantum computers via cycle benchmarking
- Quantum Error Correction
- Ultrahigh Error Threshold for Surface Codes with Biased Noise
- Fault-tolerant quantum computation against biased noise
- Estimating the Coherence of Noise
- Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
- Repetition Cat Qubits for Fault-Tolerant Quantum Computation
- Optimizing Quantum Error Correction Codes with Reinforcement Learning
- Effective fault-tolerant quantum computation with slow measurements
- Correcting coherent errors with surface codes
- Preserving qubit coherence by dynamical decoupling
- Efficient estimation of Pauli channels
- Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
- Optimal and Efficient Decoding of Concatenated Quantum Block Codes
- Using concatenated quantum codes for universal fault-tolerant quantum gates
- Deep neural decoders for near term fault-tolerant experiments
- A fidelity measure for quantum channels
- Performance of quantum error correction with coherent errors
- Simulating the performance of a distance-3 surface code in a linear ion trap
- NP-hardness of decoding quantum error-correction codes
- Modeling coherent errors in quantum error correction
- Exact Performance of Concatenated Quantum Codes
- Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
- Simulation of rare events in quantum error correction
- The Fibonacci scheme for fault-tolerant quantum computation
- Comparison of a quantum error correction threshold for exact and approximate errors
- On a measure of distance for quantum strategies
- Fast Estimation of Sparse Quantum Noise
- Optimally combining dynamical decoupling and quantum error correction
- Real-time calibration with spectator qubits
- Hard decoding algorithm for optimizing thresholds under general Markovian noise
- Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
- Tailored codes for small quantum memories
- QVECTOR: an algorithm for device-tailored quantum error correction
- Neural ensemble decoding for topological quantum error-correcting codes
- The entanglement fidelity and quantum error correction
- Experimentally efficient methods for estimating the performance of quantum measurements
- Entropy, Stochastic Matrices, and Quantum Operations