Efficient diagnostics for quantum error correction

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.

5 pages + 11 page appendix, 6 figures

References in corpus (11)

• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Low-distance Surface Codes under Realistic Quantum Noise
• Fault-tolerant quantum computation against biased noise
• Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
• Effective fault-tolerant quantum computation with slow measurements
• Preserving qubit coherence by dynamical decoupling
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• The Fibonacci scheme for fault-tolerant quantum computation
• Comparison of a quantum error correction threshold for exact and approximate errors
• QVECTOR: an algorithm for device-tailored quantum error correction

Cited by in corpus (5)

• Improved quantum error correction with randomized compiling
• Learning logical Pauli noise in quantum error correction
• High-fidelity Rydberg controlled-Z gates with optimal pulses
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Logical Noise Bias in Magic State Injection