Efficient simulation of quantum error correction under coherent error based on non-unitary free-fermionic formalism

Abstract

In order to realize fault-tolerant quantum computation, tight evaluation of error threshold under practical noise models is essential. While non-Clifford noise is ubiquitous in experiments, the error threshold under non-Clifford noise cannot be efficiently treated with known approaches. We construct an efficient scheme for estimating the error threshold of one-dimensional quantum repetition code under non-Clifford noise. To this end, we employ non-unitary free-fermionic formalism for efficient simulation of the one-dimensional repetition code under coherent noise. This allows us to evaluate the effect of coherence in noise on the error threshold without any approximation. The result shows that the error threshold becomes one third when noise is fully coherent. Our scheme is also applicable to the surface code undergoing a specific coherent noise model. The dependence of the error threshold on noise coherence can be explained with a leading-order analysis with respect to coherence terms in the noise map. We expect that this analysis is also valid for the surface code since it is a two-dimensional extension of the one-dimensional repetition code. Moreover, since the obtained threshold is accurate, our results can be used as a benchmark for approximation or heuristic schemes for non-Clifford noise.

11 pages, 6 figures. v2: extension to the surface code is added

References in corpus (17)

• Surface codes: Towards practical large-scale quantum computation
• Randomized Benchmarking of Quantum Gates
• Topological fault-tolerance in cluster state quantum computation
• Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Low-distance Surface Codes under Realistic Quantum Noise
• Detecting bit-flip errors in a logical qubit using stabilizer measurements
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Matchgates and classical simulation of quantum circuits
• Surface code with decoherence: An analysis of three superconducting architectures
• Tensor-Network Simulations of the Surface Code under Realistic Noise
• Efficient classical simulation of matchgate circuits with generalized inputs and measurements
• Errors and pseudo-thresholds for incoherent and coherent noise
• Approximation of real error channels by Clifford channels and Pauli measurements
• Comparison of a quantum error correction threshold for exact and approximate errors
• Hard decoding algorithm for optimizing thresholds under general Markovian noise
• Generalized Performance of Concatenated Quantum Codes -- A Dynamical Systems Approach

Cited by in corpus (14)

• Correcting coherent errors with surface codes
• Deep neural decoders for near term fault-tolerant experiments
• Performance of quantum error correction with coherent errors
• Computational power of one- and two-dimensional dual-unitary quantum circuits
• Coherence in logical quantum channels
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Quantum circuits for exact unitary $t$-designs and applications to higher-order randomized benchmarking
• Stabilizer Slicing: Coherent Error Cancellations in LDPC Codes
• Self-Consistent Calibration of Quantum Gate Sets
• Simulation and performance analysis of quantum error correction with a rotated surface code under a realistic noise model
• Quantum cellular automata for quantum error correction and density classification
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements
• Characterization of coherent errors in gate layers with robustness to Pauli noise
• Sampling-based quasiprobability simulation for fault-tolerant quantum error correction on the surface codes under coherent noise