Hard decoding algorithm for optimizing thresholds under general Markovian noise
arXiv:1612.02830 · doi:10.1103/PhysRevA.95.042332
Abstract
Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of error-correcting codes have been obtained. However, realistic quantum systems can undergo noise processes that differ significantly from Pauli noise. In this paper, we present an efficient hard decoding algorithm for optimizing thresholds and lowering failure rates of an error-correcting code under general completely positive and trace-preserving (i.e., Markovian) noise. We use our hard decoding algorithm to study the performance of several error-correcting codes under various non-Pauli noise models by computing threshold values and failure rates for these codes. We compare the performance of our hard decoding algorithm to decoders optimized for depolarizing noise and show improvements in thresholds and reductions in failure rates by several orders of magnitude. Our hard decoding algorithm can also be adapted to take advantage of a code's non-Pauli transversal gates to further suppress noise. For example, we show that using the transversal gates of the 5-qubit code allows arbitrary rotations around certain axes to be perfectly corrected. Furthermore, we show that Pauli twirling can increase or decrease the threshold depending upon the code properties. Lastly, we show that even if the physical noise model differs slightly from the hypothesized noise model used to determine an optimized decoder, failure rates can still be reduced by applying our hard decoding algorithm.
arXiv comment17 pages, 7 figures. v2 updated following journal specifications. Comments welcome!
References in corpus (18)
- Improved Simulation of Stabilizer Circuits
- Multiple Particle Interference and Quantum Error Correction
- Reliable Quantum Computers
- Efficient Simulation of Quantum Systems by Quantum Computers
- Low-distance Surface Codes under Realistic Quantum Noise
- Symmetrised Characterisation of Noisy Quantum Processes
- Comparing Experiments to the Fault-Tolerance Threshold
- Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
- Optimal and Efficient Decoding of Concatenated Quantum Block Codes
- Robust Extraction of Tomographic Information via Randomized Benchmarking
- Exact Performance of Concatenated Quantum Codes
- Errors and pseudo-thresholds for incoherent and coherent noise
- Overhead analysis of universal concatenated quantum codes
- Approximate quantum error correction for generalized amplitude damping errors
- Thresholds for universal concatenated quantum codes
- Comparison of a quantum error correction threshold for exact and approximate errors
- Correctable noise of Quantum Error Correcting Codes under adaptive concatenation
- Appearance of causality in process matrices when performing fixed-basis measurements for two parties
Cited by in corpus (23)
- Correcting coherent errors with surface codes
- Deep neural decoders for near term fault-tolerant experiments
- Performance of quantum error correction with coherent errors
- Coherence in quantum error-correcting codes
- Modeling coherent errors in quantum error correction
- Coherence in logical quantum channels
- Mitigating Coherent Noise Using Pauli Conjugation
- Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
- Linear-time general decoding algorithm for the surface code
- Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
- Stabilizer Slicing: Coherent Error Cancellations in LDPC Codes
- Stabilizer subsystem decompositions for single- and multi-mode Gottesman-Kitaev-Preskill codes
- Efficient simulation of quantum error correction under coherent error based on non-unitary free-fermionic formalism
- Learning logical Pauli noise in quantum error correction
- Error-correction and noise-decoherence thresholds for coherent errors in planar-graph surface codes
- Error suppression via complementary gauge choices in Reed-Muller codes
- Realistic simulation of quantum computation using unitary and measurement channels
- Efficient diagnostics for quantum error correction
- Reliable channel-adapted error correction: Bacon-Shor code recovery from amplitude damping
- Robustness of the concatenated quantum error-correction protocol against noise for channels affected by fluctuation
- Non-Pauli Errors in the Three-Dimensional Surface Code
- Robustness-optimized quantum error correction
- Efficiently computing logical noise in quantum error correcting codes