Theory of quantum error mitigation for non-Clifford gates

Abstract

Quantum error mitigation techniques mimic noiseless quantum circuits by running several related noisy circuits and combining their outputs in particular ways. How well such techniques work is thought to depend strongly on how noisy the underlying gates are. Weakly-entangling gates, like $R_{ZZ}(\theta )$ for small angles $\theta$, can be much less noisy than entangling Clifford gates, like CNOT and CZ, and they arise naturally in circuits used to simulate quantum dynamics. However, such weakly-entangling gates are non-Clifford, and are therefore incompatible with two of the most prominent error mitigation techniques to date: probabilistic error cancellation (PEC) and the related form of zero-noise extrapolation (ZNE). This paper generalizes these techniques to non-Clifford gates, and comprises two complementary parts. The first part shows how to effectively transform any given quantum channel into (almost) any desired channel, at the cost of a sampling overhead, by adding random Pauli gates and processing the measurement outcomes. This enables us to cancel or properly amplify noise in non-Clifford gates, provided we can first characterize such gates in detail. The second part therefore introduces techniques to do so for noisy $R_{ZZ}(\theta )$ gates. These techniques are robust to state preparation and measurement (SPAM) errors, and exhibit concentration and sensitivity--crucial statistical properties for many experiments. They are related to randomized benchmarking, and may also be of interest beyond the context of error mitigation. We find that while non-Clifford gates can be less noisy than related Cliffords, their noise is fundamentally more complex, which can lead to surprising and sometimes unwanted effects in error mitigation. Whether this trade-off can be broadly advantageous remains to be seen.

References in corpus (35)

• A Quantum Engineer's Guide to Superconducting Qubits
• Error mitigation for short-depth quantum circuits
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Efficient variational quantum simulator incorporating active error minimisation
• Quantum Error Mitigation
• Toward the first quantum simulation with quantum speedup
• Noise tailoring for scalable quantum computation via randomized compiling
• Practical Quantum Error Mitigation for Near-Future Applications
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• A Theory of Trotter Error
• A random compiler for fast Hamiltonian simulation
• Mitigating measurement errors in multi-qubit experiments
• The Future of Quantum Computing with Superconducting Qubits
• A Race Track Trapped-Ion Quantum Processor
• Self-Consistent Quantum Process Tomography
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Characterizing large-scale quantum computers via cycle benchmarking
• Gate Set Tomography
• Estimating the Coherence of Noise
• Model-free readout-error mitigation for quantum expectation values
• Randomized Benchmarking with Confidence
• Efficient estimation of Pauli channels
• Robust Extraction of Tomographic Information via Randomized Benchmarking
• Standard forms of noisy quantum operations via depolarization
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
• Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer
• Quantum advantages for Pauli channel estimation
• The learnability of Pauli noise
• Fast Estimation of Sparse Quantum Noise
• Probabilistic Interpolation of Quantum Rotation Angles
• Triply efficient shadow tomography
• Spectral Quantum Tomography
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Sparse Probabilistic Synthesis of Quantum Operations