Theory of quantum error mitigation for non-Clifford gates (2403.18793v2)
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.
- K. Temme, S. Bravyi, and J. M. Gambetta, Error mitigation for short-depth quantum circuits, Phys. Rev. Lett. 119, 180509 (2017).
- Y. Li and S. C. Benjamin, Efficient variational quantum simulator incorporating active error minimization, Phys. Rev. X 7, 021050 (2017).
- S. Lloyd, Universal quantum simulators, Science 273, 1073 (1996).
- L. Clinton, J. Bausch, and T. Cubitt, Hamiltonian simulation algorithms for near-term quantum hardware, Nature communications 12, 4989 (2021).
- N. Earnest, C. Tornow, and D. J. Egger, Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware, Phys. Rev. Res. 3, 043088 (2021).
- Many of our results apply more broadly to completely positive trace-non-increasing maps (which can describe leakage), but we will focus on CPTP maps here to simplify the presentation.
- D. Greenbaum, Introduction to quantum gate set tomography, arXiv:1509.02921 (2015).
- S. T. Flammia and J. J. Wallman, Efficient estimation of Pauli channels, ACM Transactions on Quantum Computing 1, 1 (2020).
- E. Knill, Fault-tolerant postselected quantum computation: Threshold analysis, arXiv:quant-ph/0404104 (2004).
- J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Phys. Rev. A 94, 052325 (2016).
- G. Casella and R. Berger, Statistical Inference, Duxbury advanced series in statistics and decision sciences (Thomson Learning, 2002).
- See Supplemental Material for additional mathematical details.
- R. Harper, W. Yu, and S. T. Flammia, Fast estimation of sparse quantum noise, PRX Quantum 2, 010322 (2021).
- E. van den Berg, Z. K. Minev, and K. Temme, Model-free readout-error mitigation for quantum expectation values, Phys. Rev. A 105, 032620 (2022).
- J. J. Wallman and S. T. Flammia, Randomized benchmarking with confidence, New Journal of Physics 16, 103032 (2014).
- We use the term “Bernoulli” loosely here since this distribution is supported on {1,−1}11\{1,-1\}{ 1 , - 1 } rather than {0,1}01\{0,1\}{ 0 , 1 }.
- S. T. Flammia, Averaged circuit eigenvalue sampling, arXiv:2108.05803 (2021).
- J. Helsen, F. Battistel, and B. M. Terhal, Spectral quantum tomography, npj Quantum Information 5, 74 (2019b).
- This can be a useful initial guess for curve fitting.
- One can interleave single-qubit Cliffords between the noisy gates [34].
- There are 16 diagonal elements, but the top-left PTM element of a CPTP map always equals 1.
- For instance, modified CB followed by correlated-twirl benchmarking.
- E. Campbell, Random compiler for fast Hamiltonian simulation, Phys. Rev. Lett. 123, 070503 (2019).
- B. Koczor, J. Morton, and S. Benjamin, Probabilistic interpolation of quantum rotation angles, arXiv:2305.19881 (2023).
- E. Granet and H. Dreyer, Continuous Hamiltonian dynamics on noisy digital quantum computers without Trotter error, arXiv:2308.03694 (2023).