Abstract
Noise in quantum hardware remains the biggest roadblock for the implementation of quantum computers. To fight the noise in the practical application of nearterm quantum computers, instead of relying on quantum error correction which requires large qubit overhead, we turn to quantum error mitigation, in which we make use of extra measurements. Error extrapolation is an error mitigation technique that has been successfully implemented experimentally. Numerical simulation and heuristic arguments have indicated that exponential curves are effective for extrapolation in the large circuit limit with an expected circuit error count around unity. In this Article, we extend this to multiexponential error extrapolation and provide more rigorous proof for its effectiveness under Pauli noise. This is further validated via our numerical simulations, showing orders of magnitude improvements in the estimation accuracy over singleexponential extrapolation. Moreover, we develop methods to combine error extrapolation with two other error mitigation techniques: quasiprobability and symmetry verification, through exploiting features of these individual techniques. As shown in our simulation, our combined method can achieve low estimation bias with a sampling cost multiple times smaller than quasiprobability while without needing to be able to adjust the hardware error rate as required in canonical error extrapolation.
Similar content being viewed by others
Introduction
While faulttolerant quantum computers promise huge speedup over classical computers in areas like chemistry simulations, optimisation and decryption, their implementations remain a long term goal due to the large qubit overhead required for quantum error correction. With the recent rapid advance of quantum computer hardware in terms of both qubit quantity and quality, culminating with the “quantum supremacy” experiment^{1}, one must wonder is it possible for us to perform classically intractable computations on such Noisy IntermediateScale Quantum (NISQ) hardware without quantum error correction^{2}. Resource estimation has been performed for one of the most promising applications on NISQ hardware: the Fermi–Hubbard model simulation^{3,4}, realising that even with an optimistic local gate error rate of 10^{−4}, the large number of gates needed for a classically intractable calculation will lead to an expected circuit error count of the order of unity. To obtain any meaningful results under such an expected circuit error count, it is essential to employ error mitigation techniques, which relies on making extra measurements, as opposed to employing extra qubits in the case of quantum error correction, to estimate the noisefree expectation values from the noisy measurement results. Three of the most wellstudied error mitigation techniques are symmetry verification^{5,6}, quasiprobability and error extrapolation^{7,8,9}.
Previously all of these error mitigation techniques have been discussed separately. They make use of different information about the hardware and the computation problems to perform different sets of extra circuit runs for error mitigation. Symmetry verification makes use of the symmetry in the simulated system and performs circuit runs with additional measurements. Quasiprobability makes use of the error models of the circuit components and performs circuit runs with different additional gates in the circuit. Error extrapolation makes use of the knowledge about tuning the noise strength via physical control of the hardware and performs additional circuit runs at different noise levels. Consequently, the three error mitigation techniques are equipped to combat different types of noise with different additional sampling costs (number of additional circuit runs required). Hence, it is natural to wonder how these techniques might complement each other. For NISQ application, it may be essential to understand and develop ways for these error mitigation techniques to work in unison, to achieve better performance than the individual techniques in terms of lower bias in the noisefree expectation values estimates and/or lower sampling costs. Thus one key focus of our Article is on the methods for combining these error mitigation techniques and trying to gauge their performance under different scenarios through analytical arguments and numerical simulations.
To achieve efficient combinations of these mitigation techniques, we will need to exploit certain features of these constituent techniques. As we will see later, we will show that quasiprobability can be used for error transformation instead of error removal and the circuit runs that fail the symmetry verification can actually be utilised instead of being discarded. It is also essential to understand the mechanism behind error extrapolation, especially in the NISQ limit in which the number of errors in the circuit will follow a Poisson distribution. Heuristic arguments and numerical validations have been made by Endo et al.^{9} on error extrapolation using exponential decay curves in this NISQ limit. However, it cannot be applied to certain situations arising in practice, for example when the data points have an increasing trend. Our Article will take this further and provide a more rigorous argument showing that singleexponential error extrapolation is just a special case of the more general multiexponential error extrapolation framework, using which we can achieve a much lower estimation bias.
Results
Symmetry verification
Suppose we want to perform a state preparation and we know that the correct state must follow a certain symmetry S, i.e., we expect our end state to be the eigenstate of S with the correct eigenvalue s (or within a set of eigenvalues {s}). In such a case, we can perform S measurement on our output state and discard the circuit runs that produce states that violate our symmetry. This was first proposed and studied by McArdle et al.^{5} and BonetMonroig et al.^{6}. Discarding erroneous circuit runs results in an effective density matrix that is the original density matrix ρ projected into the S = s subspace via the projection operator Π_{s}
Here, we have used Π_{s}Π_{s} = Π_{s}.
Now let us suppose we want to measure an observable O, which commutes with our symmetry S. Thus they can both be measured in the same run and we will discard the measurement results in the runs that failed the symmetry verification. The symmetryverified expectation value of the observable O is then
in which we have used [S, O] = 0 ⇒ [Π_{s}, O] = 0. Note that Π_{s} measurement takes the value 1 if the symmetry verification is passed and 0 otherwise and hence \(\left\langle {{{\Pi }}}_{s}\right\rangle ={\rm{Tr}}({{{\Pi }}}_{s}\rho )\) is just the fraction of circuit runs that fulfil the symmetry condition. We will use P_{d} to denote the fraction of circuit runs that fail the symmetry verification, which gives
Recall that ρ_{s} is the effective density matrix of the nondiscarded runs, which as mentioned is a \({\rm{Tr}}({{{\Pi }}}_{s}\rho )\) fraction of the total number of runs. Therefore to obtain statistics from ρ_{s}, we need a factor of
more circuit runs than obtaining directly from ρ.
In the method discussed above, OΠ_{s} is usually obtained through measuring O and S in the same run. However, sometimes this cannot be done due to, for example, the inability to perform nondemolishing measurements. In such a case we need to break OΠ_{s} into its Pauli basis^{6} and reconstruct it via postprocessing, this is discussed in Supplementary Note 1. In this article, we will mainly be focusing on direct symmetry verification instead of postprocessing verification, but most of the arguments are valid for both methods besides discussions about costs.
Now let us move on to see what errors are detectable by symmetry verification. We want to produce the state \(\left{\psi }_{f}\right\rangle \) which is known to fall within the S = s symmetry subspace
To produce the state, we usually start with a state \(\left{\psi }_{0}\right\rangle \) that follows the same symmetry and uses a circuit U that consists of components that conserve the symmetry
Suppose that some error E occurs during the circuit in between the symmetrypreserving components and it satisfies
in which \(s,s^{\prime} \) are some eigenvalues of the symmetry operator S. We then have
Π_{s}EΠ_{s} = EΠ_{s} means that E is a transformation within the S = s subspace, hence E is undetectable by the symmetry verification using S. Π_{s}EΠ_{s} = 0 means that E contains no components that map states in the S = s subspace back into the same subspace, hence E is (completely) detectable by the symmetry verification using S. A general error will be a combination of detectable and undetectable error components.
In this Article, we will be focusing on Pauli errors and Pauli symmetries, for which Eq. (4) is reduced to
Quasiprobability
To describe the quasiprobability method, we will make use of the Pauli transfer matrix (PTM) formalism^{10}. Using \({\mathbb{G}}\) to denote the set of Pauli operators, any density operators can be written in the vector form by decomposing into the Pauli basis \(G\in {\mathbb{G}}\)
where we have defined the inner product as
Note that we need to add a normalisation factor \(\frac{1}{\sqrt{{2}^{N}}}\) when we use the Pauli operators as a basis, with N being the number of qubits.
The quasiprobability method was first introduced by Temme et al.^{8}, and the implementation details were later studied by Endo et al.^{9}. Let us suppose we are trying to perform the operation \({\mathcal{U}}\), but in practice, we can only implement its noisy version
In addition to \({{\mathcal{U}}}_{\epsilon }\), we can also implement a set of basis operation \(\{{{\mathcal{B}}}_{n}\}\). We can decompose the ideal operation \({\mathcal{U}}\) that we want to implement into a set of gates \(\{{{\mathcal{B}}}_{n}{{\mathcal{U}}}_{\epsilon }\}\) that we can implement
In this way, we are essentially trying to simulate the behaviour of the inverse noise channel \({{\mathcal{E}}}^{1}\) using the set of basis operations \(\{{{\mathcal{B}}}_{n}\}\), which can undo the noise \({\mathcal{E}}\).
If we have a state \(\left.\left\rho \right\rangle \right\rangle \) passing through the circuit \({\mathcal{U}}\) and we perform measurement O, then the observable we obtain during the experiment will be:
in which \(Q={\sum }_{n}\left{q}_{n}\right\) and s_{n} = sgn(q_{n}). This is implemented by sampling from the set of basis operations \(\{{{\mathcal{B}}}_{n}\}\) with the probability distribution \(\{\frac{\left{q}_{n}\right}{Q}\}\). We will weight each measurement outcome by the sign factor s_{n} and rescale the final expectation value by the factor Q.
Now if we break down our computation into many components \({\mathcal{U}}=\mathop{\prod }\nolimits_{m = 1}^{M}{{\mathcal{U}}}_{m}\), with noise associated with each component, then the observable that we want to measure is
but in reality, we can only implement the noisy version
Each noise element can be removed by simulating the inverse channels using the set of basis operations \(\{{{\mathcal{B}}}_{n}\}\)
with \({R}_{m}={\sum }_{n}\left{q}_{mn}\right\).
Hence, we can get back the noiseless observable using
in which we have used \(\vec{n}\) to denote the set of number {n_{1}, n_{2}, ... , n_{M}} and we have defined \({q}_{\vec{n}}=\mathop{\prod }\nolimits_{m = 1}^{M}{q}_{m{n}_{m}}\), \({s}_{\vec{n}}=\mathop{\prod }\nolimits_{m = 1}^{M}{s}_{m{n}_{m}}=\,{\text{sgn}}\,({q}_{\vec{n}})\) and
To implement this, we simply sample the set of basis operations \(\{{{\mathcal{B}}}_{{n}_{1}},{{\mathcal{B}}}_{{n}_{2}},\ldots \ ,{{\mathcal{B}}}_{{n}_{M}}\}\) that we want to implement with the probability \(\frac{{q}_{\vec{n}}}{Q}\) and weight each measurement outcome by a sign factor \({s}_{\vec{n}}=\,{\text{sgn}}\,({q}_{\vec{n}})\), so that the outcome we get is an effective Pauli observable O_{Q}. And the errorfree observable expectation value can be obtained via
Hence, to estimate \(\left\langle O\right\rangle \) by sampling O_{Q}, we need C_{Q} times more samples than sampling O directly, where the sampling cost factor C_{Q} is
In this article, we will be mainly focusing on Pauli error channels, which can be inverted using quasiprobability by employing Pauli gates as the basis operations.
Using to denote a superoperator
any Pauli channel can be written in the form
with ∑_{G}α_{G} = 1. We use p_{ϵ} to denote the total probability of all the nonidentity components. This channel can be approximately inverted using the quasiprobability channel \({{\mathcal{G}}}_{{p}_{\epsilon }}\) since
Hence, to the firstorder approximation, the cost of inverting \({{\mathcal{G}}}_{{p}_{\epsilon }}\) will be the cost of implementing \({{\mathcal{G}}}_{{p}_{\epsilon }}\), which using Eq. (8) is
Here, we have only discussed approximately inverting a Pauli channel because the exact inverse channel can be hard to express in a compact analytical form. However, it can be obtained numerically by first obtaining the PTM of the noise channel and then performing matrix inversion.
Instead of removing the error channel completely, quasiprobability can also be used to transform the form of an error channel. In the case of Pauli channels, suppose we want to transform a channel of the form in Eq. (9) to
we can approximately achieve this transformation up to first order in q_{ϵ} and p_{ϵ} by applying the quasiprobability channel
This will incur the implementation cost
In the limit of small p_{ϵ} and q_{ϵ}, we have
In the last step we have used \({\sum }_{G}\left({p}_{\epsilon }{\alpha }_{G}{q}_{\epsilon }{\beta }_{G}\right)={p}_{\epsilon }{q}_{\epsilon }\) from ∑_{G}α_{G} = ∑_{G}β_{G} = 1.
If we are suppressing all error components evenly, or if we are simply removing certain error components, we will have \({p}_{\epsilon }{\alpha }_{G}\ge {q}_{\epsilon }{\beta }_{G}\quad \forall G\in {\mathbb{G}}I\). In this case, the cost of implementing the transformation using quasiprobability will simply be
Group errors
Here, we will introduce a special kind of error channel: group error channels, which enable us to make more analytical predictions about the error mitigation techniques that we have already discussed and also will help our understanding about error extrapolation later.
The group error \({{\mathcal{J}}}_{p,{\mathbb{E}}}\) of the group \({\mathbb{E}}\) is defined to be
By groups we mean the subgroups of the Pauli group with a composition rule that ignores all the irrelevant phase factors. For the case of p = 1, we will call \({{\mathcal{J}}}_{1,{\mathbb{E}}}\) the pure group errors.
Many physically interesting noise models like depolarising channels, dephasing channels, Paulitwirled swap errors and dipole–dipole errors are all group errors.
Now let us consider the effect of applying a set of Pauli symmetry checks \({\mathbb{S}}\) to the group error in Eq. (12). Using Eq. (5), \({\mathbb{S}}\) can remove and detect components in \({{\mathcal{J}}}_{p,{\mathbb{E}}}\) that anticommute with any elements in \(S\in {\mathbb{S}}\). We look at the action of \({\mathbb{S}}\) on the subset of qubits affected by \({{\mathcal{J}}}_{p,{\mathbb{E}}}\), and denote the set of these operators on the subset of qubits as \({{\mathbb{S}}}_{\rm{sub}}\). The commutation relationship between \({\mathbb{S}}\) and \({\mathbb{E}}\) is equivalent to that of \({{\mathbb{S}}}_{\rm{sub}}\) and \({\mathbb{E}}\). We denote their generators as \({\widetilde{{\mathbb{S}}}}_{\rm{sub}}\) and \(\widetilde{{\mathbb{E}}}\). Note that here \({{\mathbb{S}}}_{\rm{sub}}\) is not a group, by \({\widetilde{{\mathbb{S}}}}_{\rm{sub}}\) we just mean the set of independent elements in \({{\mathbb{S}}}_{\rm{sub}}\). For Pauli generators, we can choose \(\widetilde{{\mathbb{E}}}\) in such a way that for every \({\widetilde{S}}_{\rm{sub}}\in {\widetilde{{\mathbb{S}}}}_{\rm{sub}}\), there will at most be only one element in \(\widetilde{{\mathbb{E}}}\) that anticommutes with it. We will denote the elements in \(\widetilde{{\mathbb{E}}}\) that commute with all elements in \({\widetilde{{\mathbb{S}}}}_{\rm{sub}}\) as \(\widetilde{{\mathbb{Q}}}\)
and it will generate the remaining error components in \({\mathbb{E}}\) that are not detectable, which we denote as \({\mathbb{Q}}\). Hence the detectable error components are just \({\mathbb{E}}{\mathbb{Q}}\)
Going back to our error channel in Eq. (12), the probability that the error gets detected is just the total probability of the detectable error components
Removing the detected errors in \({{\mathcal{J}}}_{p,{\mathbb{E}}}\) and renormalising the error channel by the factor 1 − p_{d} gives the effective channel after verification, which is just another group error channel
with
An example of removing detectable errors for depolarising channels will be worked out later in Section “Numerical simulation for multiexponential extrapolation”.
For a given general Pauli channel, we have only discussed its approximate inverse channel in Section “Quasiprobability”. This is because its exact inverse channel can be hard to express in a compact analytical form. However, for any group channel, we can easily write down the explicit form of its inverse channel.
As shown in Supplementary Note 2, it is easy to verify that the inverse of a group channel \({{\mathcal{J}}}_{p,{\mathbb{E}}}\) is just
with \(\alpha =\frac{p}{1p}\).
Using Eq. (15) and (8), the cost of using quasiprobability to invert \({{\mathcal{J}}}_{p,{\mathbb{E}}}\) is thus
which is the same as Eq. (10) with
As shown in Eq. (14), for a given group error \({{\mathcal{J}}}_{p,{\mathbb{E}}}\), the resultant error channel after symmetry verification is another group channel \({{\mathcal{J}}}_{r,{\mathbb{Q}}}\) where \({\mathbb{Q}}\) is a subgroup of \({\mathbb{E}}\) and \(r=\frac{\left{\mathbb{Q}}\right}{\left{\mathbb{E}}\right}p\). The remaining errors can then be completely removed by implementing \({{\mathcal{J}}}_{r,{\mathbb{Q}}}^{1}\) using quasiprobability.
Similarly, if we implement the quasiprobability inverse channel \({{\mathcal{J}}}_{r,{\mathbb{Q}}}^{1}\) first and then perform symmetry verification, we can still completely remove the group error \({{\mathcal{J}}}_{p,{\mathbb{E}}}\). The gates we need to implement in the inverse channel \({{\mathcal{J}}}_{r,{\mathbb{Q}}}^{1}\) will not be detected and thus will not be affected by the symmetry verification. As shown in Supplementary Note 3, the resultant error channel after applying \({{\mathcal{J}}}_{r,{\mathbb{Q}}}^{1}\) is
This is a channel that only contains the error components that are detectable by the symmetry verification with the error rate p_{d}.
As discussed in Section “Quasiprobability” and explicitly shown in Supplementary Note 3, we can implement additional quasiprobability operations to further reduce the error rate of the resultant channel to q ≤ p_{d}. The resultant detectable error channel will be
NISQ limit
The number of possible error locations in the circuit, which is usually the number of gates in the circuit, will be denoted as M. These error locations might experience different noise with different error rates. From here on, instead of building our discussions around local gate error rates, we will see that the more natural quantity to consider in the context of NISQ error mitigation is the expected number of errors occurring in each circuit run, which is called the mean circuit error count and denoted as μ. In order to achieve quantum advantage using NISQ machine, we would generally expect the circuit size to be large enough to be classically intractable while the mean circuit error count should not be too far beyond unity
This is also called the Poisson limit since using Le Cam’s theorem, the number of errors occurring in each circuit run will follow the Poisson distribution—i.e. the probability that l errors occur will be
If we assume that every local error channel in the circuit can be approximated as the composition of an undetectable error channel and a detectable error channel, then symmetry verification will have no effects on the undetectable error channels and we can focus only on the detectable error channels. Alternatively, as we have seen in Section “Group errors”, we can use quasiprobability to remove all the local undetectable errors in the circuit, leaving us with only detectable error channels. The expected number of detectable errors occurring in each circuit run is denoted as μ_{d}. Taking the NISQ limit and using Eq. (20), the probability that l detectable errors occur in the circuit is
Using Eq. (5), an odd number of detectable errors will anticommute with the symmetry and get detected while an even number of detectable errors will commute with the symmetry and pass the verification. Therefore, the total probability that the errors in the circuit will be detected by the verification of one Pauli symmetry is thus
Note that this is upperbounded by \(\frac{1}{2}\), i.e. at most we can catch errors in half of the circuit runs.
Hence, using Eq. (2), the cost of implementing symmetry verification for one Pauli symmetry is
which is upperbounded by 2.
After symmetry verification, the fraction of circuit runs that still have errors inside is
In Eq. (11) we have only been focusing on applying quasiprobability to one error channel. Assuming there are M such channels in the circuit, then using Eq. (11) and taking the NISQ limit (Eq. (20)), the sampling cost factor of transforming all M error channels with error probability p_{ϵ} into new error channels with error probability q_{ϵ} ≤ p_{ϵ} using quasiprobability is
At q_{ϵ} = 0, we will obtain the sampling cost of removing all the noise using quasiprobability
Remember that we are focusing on Pauli errors and p_{ϵ} is defined to be the total probability of all nonidentity components. This is not equivalent to the error probability p because sometimes there are some identity components in our definition of error probability such as the group errors that we discussed in Section “Group errors”. Similar to the definition of p_{ϵ}, we can denote the expected number of nonidentity errors in each circuit run as μ_{ϵ}. In the above cases, we have μ_{ϵ} = Mp_{ϵ} and similarly we can define ν_{ϵ} = Mq_{ϵ}. In the cases where different noise locations experience different noise, using Le Cam’s theorem with negative probabilities and focusing on the zerooccurrence case, we can generalise Eq. (25) to
i.e. the sampling cost of quasiprobability transformation grows exponentially with the reduction in the error rate μ_{ϵ} − ν_{ϵ}.
Multiexponential error extrapolation
The idea of amplifying the hardware error rate and performing extrapolation using the original result and the noiseamplified result was first introduced by Li et al.^{7} and Temme et al.^{8}, and was later successfully realised experimentally using superconducting qubits^{11}. Endo et al.^{9} provided heuristic arguments on why the exponential decay curve should be used for error extrapolation in the large circuit limit, whose improved performance over linear extrapolation was validated via numerical simulations in refs. ^{9,12}.
Using \({\mathbb{L}}\) to denote the set of locations that the errors have occurred, when l errors have occurred in the circuit, our observable O will be transformed to a noisy observable \({O}_{\left{\mathbb{L}}\right = l}\). Recall that in the NISQ limit, the probability that l errors happen (denoted as P_{l}) will follows the Poisson distribution in Eq. (21). Therefore, the expectation value of the observable O at the mean circuit error count μ is then
Hence, how \(\left\langle {O}_{\mu }\right\rangle \) changes with μ is entirely determined by how \(\left\langle {O}_{\left{\mathbb{L}}\right = l}\right\rangle \) changes with l. When we try to fit a nth degree polynomial of μ to \(\left\langle {O}_{\mu }\right\rangle \), for example performing a linear extrapolation^{7,8}, we are essentially assuming that \(\left\langle {O}_{\left{\mathbb{L}}\right = l}\right\rangle \) is a nth degree polynomial of l using the expressions of the moments of the Poisson distribution.
At l = 0, we have the errorfree result \(\left\langle O\right\rangle \)
At large error number l, in the case of stochastic errors, the circuit will move closer to a random circuit. Hence, for a Pauli observable O we will expect
A generic polynomial of l will not satisfy the above boundary conditions. Hence, to align with the above boundary conditions, we can instead assume an exponential decay of \(\left\langle {O}_{\left{\mathbb{L}}\right = l}\right\rangle \) as l increase
in which γ is the observable decay rate that satisfies 0 ≤ γ ≤ 1. This will lead to an exponential function in μ
which is just the extrapolation curves employed in ref. ^{9}.
Using Eq. (29), if we probe at the error rates μ and λμ, we can perform twopoint exponential extrapolation and obtain the errormitigated estimate of \(\left\langle O\right\rangle \), denoted as \(\left\langle {O}_{0}\right\rangle \), using the following equation:
As discussed in Supplementary Note 7B, the sampling cost factor of performing such an extrapolation is
Now let us try to gain a deeper insight about the reason behind the exponential decay of \(\left\langle {O}_{\left{\mathbb{L}}\right = l}\right\rangle \). If a Pauli error G occurs at the end of a circuit and we are trying to measure an Pauli observable O, then the expectation value is just
where η(G, O) is the commutator between G and O
If a pure group error \({{\mathcal{J}}}_{1,{\mathbb{E}}}\) occurs at the end of the circuit, then the resultant expectation value is
Using the fact that the composition of the commutators of elements in a Pauli subgroup follows the same structure as the composition of the elements themselves
we can rewrite the above formula in terms of the generator of \({\mathbb{E}}\)
in which
Hence, if a pure group error \({{\mathcal{J}}}_{1,{\mathbb{E}}}\) occurs right before measuring a Pauli observable O, then the resultant expectation value \({\rm{Tr}}({{\mathcal{J}}}_{1,{\mathbb{E}}}(\rho )O)\) will only remain unchanged if O commutes with all elements in \({\mathbb{E}}\), otherwise the information about O is “erased” by the group error and the expectation value will be 0.
If we decompose the gates in a unitary circuit \(U=\mathop{\prod }\nolimits_{m = M}^{1}{V}_{m}\) into their Pauli components: \({V}_{m}={\sum }_{{j}_{m}}{\alpha }_{m{j}_{m}}{G}_{m{j}_{m}}\), then we have
where
i.e. the circuit U can be viewed as the superposition of many Pauli circuits \({G}_{\vec{j}}\).
The expectation value of observing O after applying the circuit U on ρ is
which is a linear sum of the measurement results for the set of effective Pauli observables \({G}_{\vec{i}}^{\dagger }O{G}_{\vec{j}}\) for different \(\vec{i}\) and \(\vec{j}\). Similar to Eq. (31), the information about \({G}_{\vec{i}}^{\dagger }O{G}_{\vec{j}}\) will either be “erased” or perfectly preserved if a group error occurs in the circuit. Assuming the average fraction of group error locations in our circuit that can erase the information about \({G}_{\vec{i}}^{\dagger }O{G}_{\vec{j}}\) is \({\gamma }_{\vec{i},\vec{j}}\), then as proven in Supplementary Note 4, in the limit of large M and nonvanishing \(1{\gamma }_{\vec{i},\vec{j}}\), the expectation value given l errors occurred can be approximated to be
which is just a multiexponential decay curve.
If we consider the case in which many error locations in the circuit are affected by the same type of noise, and adding onto the fact that in practice there are usually many repetitions of the circuit structures along the circuit and across the qubits, we can expect many \({\gamma }_{\vec{i},\vec{j}}\) of different \(\vec{i}\) and \(\vec{j}\) to be very similar. Hence, by grouping the terms with similar \({\gamma }_{\vec{i},\vec{j}}\) together, Eq. (33) becomes
where A_{k} is the sum of \({2}\,{\mathrm{Re}} \left\{ {\alpha }_{\vec{i}}^{* }{\alpha }_{\vec{j}}{\mathrm{Tr}}\left(\rho {G}_{\vec{i}}^{\dagger }O{G}_{\vec{j}}\right)\right\}\) for some subset of \(\vec{i}\) and \(\vec{j}\). Note that A_{k} are independent of l and we have \(\mathop{\sum }\nolimits_{k = 1}^{K}{A}_{k}=\left\langle O\right\rangle \).
So far we have only been considering group error channels. However, as shown in Supplementary Note 5, by approximating general Pauli channels as the composition of pure group channels, we can prove that decay of the expectation value under general Pauli noise can also be approximated by a sum of exponentials like in Eq. (34).
Equation (34) can be translated into a multiexponential decay of \(\left\langle {O}_{\mu }\right\rangle \) over the mean circuit error count μ using Eq. (28)
This can be rewritten as
Comparing with Eq. (34), we see that the shape of \(\left\langle {O}_{\mu }\right\rangle \) and \(\left\langle {O}_{\left{\mathbb{L}}\right = l}\right\rangle \) are the same up to the leading order of γ_{k} with the mean circuit error count μ in place of the circuit error count l.
The simplest shape that we can fit over \(\left\langle {O}_{\mu }\right\rangle \) is a single exponential decay curve (K = 1), which is the one we used in exponential extrapolation. We see here that a natural extension of this will be probing \(\left\langle {O}_{\mu }\right\rangle \) at more than two different error rates and trying to fit them using a sum of exponentials (K > 1). The estimate of the errorfree observable \(\left\langle O\right\rangle \) can then be obtained by substituting μ = 0 into our fitted curve.
From Eq. (36), we see that the kth exponential component can only survive up to the mean circuit error count \(\mu \sim \frac{1}{{\gamma }_{k}}\), thus we can only obtain information about this component by probing at the mean circuit error count \(\mu \lesssim \frac{1}{{\gamma }_{k}}\). Since 0 ≤ γ_{k} ≤ 1, we have \(\frac{1}{{\gamma }_{k}}\ge 1\) for all k, i.e. we should be able to retrieve all exponential components if we can probe enough points within μ ≲ 1. In practice, there is a minimum mean circuit error count that we can achieve, which we denote as μ^{*}. To have an accurate multiexponential fitting, it is essential that for all components with nonnegligible A_{k}, we have \({\mu }^{* }\lesssim \frac{1}{{\gamma }_{k}}\), i.e. none of the critical exponential components has died away at the minimal error rate that we can probe.
Numerical simulation for multiexponential extrapolation
In this section, we will try to apply multiexponential extrapolation to the Fermi–Hubbard model simulation circuit as outlined in ref. ^{3}, which consists of local twoqubit components that correspond to different interaction terms and the fermionic swaps. It can be used for both eigenstate preparation and time evolution simulation. We will assume there are M of these twoqubit components, and they all suffer from twoqubit depolarising noise of error probability p, which is just a group channel of the twoqubit Pauli group (without the phase factors). Using Eq. (17), we have
Since we usually know the number of fermions in the system, we can try to verify the fermion number parity symmetry of the output state, which is simply
in the Jordan–Wigner qubit encoding. All the local twoqubit components in the circuit conserve the symmetry S_{σ}. Hence when we start in a state with the right fermion number, the output state should also have the correct fermion number, enabling us to perform symmetry verification.
By checking S_{σ} = ∏_{i}Z_{i}, we can detect all error components with one X or Y in the local twoqubit depolarising channels since they anticommute with S_{σ}. We will remove the other error components in the local twoqubit depolarising channels using quasiprobability. The removed components are those can be generated from the set \(\widetilde{{\mathbb{Q}}}=\{{Z}_{1},{Z}_{2},{X}_{1}{X}_{2}\}\) following Section “Group errors”. Thus we have \(\left{\mathbb{Q}}\right={2}^{3}=8\) and using Eq. (13) we also have
The resultant noise channel after the application of quasiprobability is given by Eq. (19), which is just a uniform distribution of the twoqubit Pauli errors that are detectable by S_{σ}. We will call it the detectable noise.
In this section and later in Section “Numerical simulation for a combination of error mitigation techniques”, we will perform numerical simulations using the circuit for the 2 × 2 halffilled Fermi–Hubbard model, which consists of 8 qubits and 144 twoqubit gates. The twoqubit gates in the circuit that correspond to interaction terms are parametrised gates with the parameters indicating the strength of the interaction. In our simulation, we will obtain the results for a set of randomly chosen gate parameters (with additional results for another set of random parameters listed in Supplementary Note 9). We will also look at two different error scenarios: depolarising errors and detectable errors. One of them is a group channel while the other is a more general Pauli channel. The measurements that we perform will be the Pauli components of the Hamiltonian, from which we can reconstruct the energy of the output state. The simulations are performed using the Mathematica interface^{13} of the highperformance quantum computation simulation package QuEST^{14}.
In Fig. 1, we have plotted the noisy expectation values \(\left\langle {O}_{\mu }\right\rangle \) for each Pauli observable at the mean circuit error counts μ = 0.5, 1, 1.5, 2. When we perform multiexponential extrapolation on them, we find that all of the observables can be fitted using a sum of at most two exponentials, even though there should be very few symmetries in our circuits since they are generated from a set of random parameters. We now can proceed to compare the absolute bias in the estimate of the noiseless expectation values (μ = 0) using dualexponential extrapolation against that using the conventional singleexponential extrapolation for all of the noisy observables in Fig. 1. The absolute biases of single and dualexponential extrapolation are denoted as ϵ_{1} and ϵ_{2}, respectively, and different colours in the plots correspond to different estimation bias ratios \(\frac{{\epsilon }_{1}}{{\epsilon }_{2}}\).
For 32 out of the 34 observables we plotted, dualexponential extrapolation can achieve a smaller estimation bias than singleexponential extrapolation (\(\frac{{\epsilon }_{1}}{{\epsilon }_{2}}\,>\,1\)). Within the two cases that dualexponential extrapolation is outperformed (the green curves in Fig. 1), one of them is the case in which single and dualexponential extrapolation both achieve very small estimation bias of similar order. The other remaining case with larger ϵ_{2} relative to ϵ_{1} is mainly due to the small magnitude of its true expectation value, which lead to large uncertainties in the fitting parameters. It is also because we are only using the bare minimum of 4 data points to fit a dualexponential curve with 4 free parameters and thus the problem may be alleviated by simply probing at more error rates to obtain more data points. On the other hand, there are also a few cases in which the ϵ_{1} are exceptionally large (e.g. certain orange and red curves in Fig. 1a, b). These are usually observables whose decay curves have extrema and/or crossing over the xaxis, thus it is impossible to get a good fit with a singleexponential curve. We have zoomed into one such observable in Fig. 2. For these observables, dualexponential extrapolation can still perform extremely well and achieve ϵ_{2} ~ 10^{−5}, which is up to tens of thousands times lower than ϵ_{1}: \(\frac{{\epsilon }_{1}}{{\epsilon }_{2}} \sim 1{0}^{4}\).
Now we will exclude the few observables above with exceptionally large ϵ_{1} or ϵ_{2} and take the average of the remaining ϵ_{1} and ϵ_{2} to obtain a more representative performance of dualexponential extrapolation against singleexponential extrapolation. This is shown in Table 1, from which we see that by using dualexponential extrapolation instead of singleexponential extrapolation, we can achieve a tens or even a hundred times reduction in estimation bias across both noise models. Note that in Fig. 1 it appears to the eye that the true (noiseless) expectation values, marked by filled circles, never deviate from the dualexponential (dashed) lines. In fact there are minute discrepancies as specified in Table 1, but the extrapolation is remarkably successful.
Combination of error mitigation techniques
We have shown that extrapolating using a multiexponential curve can be very effective assuming Pauli noise. Besides the shape of the extrapolation curve, the other key component to error extrapolation is the way to tune the noise strength. Previously, noise is boosted by increasing gate pulse duration^{8}, applying additional gates that cancel each other^{12} or simulating the noise using random gate insertion^{7}. There are various practical challenges associated with these noiseboosting techniques, and furthermore as discussed at the end of Section “Multiexponential error extrapolation”, data points at boosted error rates may not contain enough information for effective extrapolation. Now as shown in Section “Quasiprobability”, we can actually use quasiprobability to reduce the error rate and obtain a set of data points with reduced noise strength, which can then be used for extrapolation. We should expect a smaller estimation bias by using data points with reduced noise strength rather than boosted noise strength, but the sampling cost will also increase due to the use of quasiprobability. For the special case of twopoint extrapolation using a singleexponential curve with the two data points at the unmitigated error rate μ and the quasiprobabilitysuppressed error rate ν, the total sampling cost as shown in Supplementary Note 7C is
with μ = λν. We will call this special case quasiprobability with exponential extrapolation.
As discussed in Section “Multiexponential error extrapolation”, the number of exponential components in the multiexponential extrapolation can be reduced with an increased degree of symmetry in the circuit and/or if the error channels are group channels. Hence, besides using quasiprobability for error suppression, we can also use quasiprobability to transform the error channels into group errors and/or errors of similar form for easier curve fitting in the extrapolation process.
Moving on, we may wish to combine symmetry verification and quasiprobability. We can first apply quasiprobability to transform all the error channels in the circuit with the total mean error count μ into detectable error channels with a total mean error count μ_{d}. After that, we can apply symmetry verification, but note that the additional quasiprobability operations may contain gates that take us from one symmetry space to another, for which we need to adjust our symmetry verification criterion accordingly. As discussed in Section “NISQ limit”, an even number of occurrence of local detectable errors can still escape the symmetry test and lead to circuit errors. We can further suppress them by applying additional quasiprobability operations as shown in Supplementary Note 6. Alternatively, we can also try to remove these remaining errors by applying error extrapolation as we will see below.
After using quasiprobability to transform all local errors into local detectable errors with the mean circuit error count μ_{d}, performing symmetry verification will split the circuit runs into two partitions, one has an even number of detectable errors occurring and will pass the symmetry test, the other has an odd number of detectable errors occurring and will fail the symmetry test. Consequently, the noisy observable expectation value (Eq. (35)) can also be split into the weighted sum of these two partitions
in which \({e}^{{\mu }_{d}}\cosh ({\mu }_{d})\) and \({e}^{{\mu }_{d}}\sinh ({\mu }_{d})\) are the probability to have an even and an odd number of errors occurring in the circuit, respectively. And \(\left\langle {O}_{c,{\mu }_{d}}\right\rangle \), \(\left\langle {O}_{s,{\mu }_{d}}\right\rangle \) are the corresponding expectation values in these cases with
We will consider the case that the decay of our expectation value \(\left\langle {O}_{{\mu }_{d}}\right\rangle \) over increased mean circuit error count μ_{d} follows a single exponential curve (K = 1) for simplicity, we then have
which gives
Note that we have used the fact that \(\left\langle {O}_{c,{\mu }_{d}}\right\rangle \) and \(\left\langle O\right\rangle \) have the same sign since 1 − γ > 0 and μ_{d} > 0. Here with the help of symmetry verification and quasiprobability, we can now obtain an estimate of the errorfree expectation value \(\left\langle O\right\rangle \) by combining the expectation value of the passed runs and failed runs at one error rate μ_{d} instead of combining the expectation value of runs at different error rates in the conventional error extrapolation. Note that here we have assumed that we know the value of the mean detectable circuit error count μ_{d}, which needs be known before we can apply the quasiprobability step anyway. The method we employed in Eq. (43) will be called hyperbolic extrapolation.
As derived in Supplementary Note 7D, the sampling cost factor of hyperbolic extrapolation is
To combine all three error mitigation techniques, we first use quasiprobability to remove the error components that are undetectable by symmetry verifications. Applying symmetry verification will then split the circuit runs into two sets: runs with even number of errors and runs with odd number of errors, obtaining two separate expectation values. Using our understanding about the decay of the expectation value from our study of error extrapolation, we can simply combine these two erroneous expectation values and obtain the errorfree expectation value. The full process is called quasiprobability with hyperbolic extrapolation, and the corresponding total sampling cost factor can be obtained using Eqs. (27) and (44)
We note that this is always smaller than the cost of pure quasiprobability \({C}_{Q,0}={e}^{4{\mu }_{\epsilon }}\). Its costsaving over pure quasiprobability will increase with the increase of γ.
Numerical simulation for a combination of error mitigation techniques
In this section, we will compare the performance of quasiprobability with exponential extrapolation (QE) and quasiprobability with hyperbolic extrapolation (QH) discussed in Section “Combination of error mitigation techniques”. Similar to Section “Numerical simulation for multiexponential extrapolation”, we will perform FermiHubbard model simulation with local twoqubit depolarising noise with a mean circuit error count μ. The symmetry we will used in QH is the fermionic number parity symmetry, which means that the resultant mean detectable circuit error count after we apply the quasiprobability step in QH will be \({\mu }_{d}=\frac{\mu }{2}\) following Eq. (38). For the quasiprobability in QE in this section, we will keep it at the same strength as that in QH, which means that they have the same resultant circuit error rate: \(\nu =\frac{\mu }{2}\). Note that even though resultant channels after the partial quasiprobability in both QE and QH give the same mean circuit error count \(\nu =\frac{\mu }{2}={\mu }_{d}\), in one case the resultant noise is still depolarising while in the other case the resultant noise is locally detectable. In this section, we will assume the quasiprobability process is performed perfectly. Recall that for simplicity we have only explicitly derived QH under the assumption that the observable follows a singleexponential decay, so for a fair comparison, the QE method in this section will also only employ singleexponential extrapolation. However as we will see later, even when we look at observables that follow a dualexponential decay, which breaks our assumptions above, QH can still achieve robust performance.
As shown in Fig. 1, for our example circuits, some observables can be fitted well enough using singleexponential decay curves while the other observables can only be fitted well using dualexponential decay curves. We will call these two types of observables singleexponential observables and dualexponential observables, respectively. In Fig. 3, we have plotted the absolute estimation bias ϵ_{est} using the two different extrapolation techniques for the singleexponential and dualexponential observables. First, we can see that the estimation biases for the dualexponential observables are almost one order of magnitude higher than the biases for the singleexponential observables. This should not come as a surprise since both singleexponential extrapolation and hyperbolic extrapolation are derived under the assumptions of singleexponential observables. At the mean circuit error counts μ = 2, for each observable, we have used markers to label the method that can achieve a lower estimation bias out of the two. We see that the number of singleexponential observables that can achieve a lower estimation bias using QE is comparable to that of QH. On the other hand, almost all dualexponential observables can achieve a lower estimation bias using QH.
In Table 2, we further calculate the average estimation bias of singleexponential, dualexponential and all observables separately at the circuit error rate μ = 1, 2, which reconfirm all of our observations above. We see that the estimation bias of QE is lower than that of QH for singleexponential observables, and on the other hand, QH can achieve a lower estimation bias for dualexponential observables. In other words, the performance of QH is more robust against whether the observable is singleexponential or not. When looking at the estimation bias averaged over all observables, we see the estimation bias of QH is always lower than QE and can be four times smaller than QE at μ = 2. The allobservable averages can be more indicative about the practical performance of the mitigation techniques since in experiments we do not know whether a given observable should be fitted with singleexponential or not beforehand.
There is another added layer of robustness when we try to apply QH instead of QE to multiexponential observables when we look back at the hyperbolic extrapolation equation Eq. (43). We can see that if the shape of the observable is far off from a singleexponential decay, then this might lead to a negative number in the square root of Eq. (43), allowing us to realise that we need to probe at more error rates to perform multiexponential extrapolation instead, and avoiding performing a bad extrapolation with a very large bias. In the simulation, we indeed identify a few observables that we cannot perform QH on. For these observables, we can still perform QE, but it will lead to huge biases in the estimates. These observables have been excluded in our comparison between QE and QH.
Using Eqs. (45), (37) and (38), the sampling cost factor of performing QH in our example circuit is
where γ is the decay rate of the observable expectation values under noise.
Using Eqs. (39), (37) and \(\nu ={\mu }_{d}=\frac{\mu }{2}\Rightarrow \lambda =2\), the sampling cost factor of performing QE is
For comparison purpose, we also write down the sampling cost factor for removing all the errors using quasiprobability given by Eq. (26)
The comparison between C_{Q,0}, C_{QE}(γ) and C_{QH}(γ) at different γ is plotted in Fig. 4. We can see that C_{QH}(γ) is always lower than C_{Q,0} across all μ and γ, i.e. we can always get a sampling cost saving by applying QH instead of pure quasiprobability, which is also proven in Section “Combination of error mitigation techniques”. On the other hand, at γ = 1, C_{QE} is larger than C_{QH} for all μ and larger than C_{Q,0} for μ < 2.4. As γ decreases, C_{QH}(γ) will increase while C_{QE}(γ) will decrease. Thus they naturally complement each other as QH will be more suitable for largeγ error mitigation while QE will be more suitable for smallγ error mitigation. At γ = 0, we see that C_{QE} becomes lower than both C_{QH} and C_{Q,0} at μ > 1.8.
The average fitted γ of all the singleexponential observables within each plot in Fig. 1 all lie within the range 0.5–0.6. Hence, we will now focus on the γ = 0.5 plot in Fig. 4 to get an indication of the practical sampling costs of implementing different mitigation techniques.
At μ = 1, the sampling cost factor of quasiprobability is 43. QE requires a higher sampling cost, thus there is no point performing QE since pure quasiprobability can remove all the noise perfectly in theory with a lower cost. Compared to quasiprobability, QH can reduce the cost by more than 70% while still achieving the small estimation bias \({\overline{\epsilon }}_{QH} \sim 3\times 1{0}^{3}\) shown in Table 2. In order for quasiprobability to have many advantages over QH, we must sample enough times such that the shot noise of pure quasiprobability is smaller than the estimation bias of QH (more rigorous arguments in Supplementary Note 8), which will require \({N}^{* } \sim \frac{{C}_{Q,0}}{{\overline{\epsilon }}_{QH}^{2}}\approx 4.3\times 1{0}^{6}\) samples for each observable. Therefore in practice, QH could be the preferred method over pure quasiprobability as it is challenging to sample more than N^{*} for each observable within reasonable runtime constraints^{3}.
At μ = 2, now the sampling cost factor of quasiprobability is 1800, which is hardly practical. QE can reduce this sampling cost by half while achieving estimation bias around 4 × 10^{−2} (Table 2), and QH can reduce this sampling cost by almost 90% while achieving estimation bias around 1 × 10^{−2} (Table 2), thus they both would be preferred over pure quasiprobability in practice following similar arguments in the μ = 1 case. We also see that QH outperforms QE in terms of both sampling cost and estimation bias at μ = 2, and thus would be preferred over QE. The cost of QE will only become lower than QH at μ = 3.9, however, at this point, neither of their sampling costs are likely to be practical.
Discussion
In this article, we have recapped and studied the mechanism and performance of three of the most wellknown error mitigation techniques: symmetry verification, quasiprobability and error extrapolation under Pauli noise. By introducing the concepts of group errors and NISQ limits, we managed to prove that the change of the expectation value of a Pauli observable with increased Pauli noise strength can be approximated using multiexponential decay, enabling us to extend exponential error extrapolation to multiexponential extrapolation. We then performed eightqubit numerical simulations for Fermi–Hubbard simulation under two different Pauli noise models, finding that the decay of their Pauli expectation values can all be fitted using single or dualexponential curves, confirming our earlier proof of multiexponential decay. Using the same circuits, we performed dualexponential extrapolation by probing at four different error rates, which is a minimal number of data points required, and managed to obtain a low estimation bias of ≲10^{−4} for almost all 34 observables except for one fringe case. In our simulations, the estimation bias of dualexponential extrapolation is on average ~100 times lower than that of singleexponential extrapolation, with the maximum factor of bias reduction reaching ~10^{4}.
We then proceeded to combine different error mitigation techniques in the context of wellcharacterised local Pauli noise. Instead of using quasiprobability to completely remove all the noise, we can use it to suppress the noise strength and perform error extrapolation, which is named quasiprobability with exponential extrapolation (QE). Alternatively, we can use quasiprobability to remove the local undetectable noise and perform symmetry verification. Then instead of discarding all the circuit runs that fail the symmetry test, we have developed a way to recombine the expectation values of the “failed” and “passed” runs to obtain an estimate of the noiseless observable. The full combined method is called quasiprobability with hyperbolic extrapolation (QH). Note that both QE and QH are free of the requirement to adjust the hardware error rate despite the name “extrapolation”. By performing eightqubit Fermi–Hubbard model simulations under local depolarising noise and using the fermionic number parity symmetry, we found that QH outperforms QE in terms of both estimation bias and sampling costs for almost all cases. When compared to pure quasiprobability, QH can achieve factorof4 and factorof9 sampling cost savings at the mean circuit error count μ = 1 and μ = 2, respectively, while still maintaining a low estimation bias of 10^{−3}–10^{−2}. Hence, QH would outperform pure quasiprobability in our examples unless we obtain an impractical number of samples (more than millions) per observable.
QH is derived under the assumption that the observables decay along singleexponential curves with increased noise. Our simulation shows that QH can be robust against violation of this assumption when applied to dualexponential observables. However, such robustness may not persist with a further increase in the number of exponential components. A multiexponential version of QH can be done through probing at more error rates and fitting Eq. (41) to the data. Alternatively, instead of probing at more error rates, we can also try to verify more symmetries. In such a way, we can obtain a set of expectation values corresponding to different verification syndromes for the multiexponential version of the hyperbolic fitting. An example can be using the separate fermion number parity symmetries for each spin subspace, which will lead to expectation values corresponding to the four possible verification syndromes. However, how to recombine these expectation values in the case of multiple symmetries and how to use quasiprobability to transform the local error channels into the suitable forms for such a recombination is not a simple extension of the singlesymmetry case we considered.
In our derivation, the number of exponential components in the expectation value decay curve in Eq. (34) is expected to scale exponentially with the number of gates. However, in our simulations, we fitted at most two exponential components for each of the observable decay curves. More analysis is needed to bridge the gap between the expected and the actual number of exponential components required, possibly based on the symmetry of the circuit. This will help us understand how the number of exponential components scales with the system size, enabling us to gauge the performance and the costs of scaling up the multiexponential extrapolation method. It might be useful to draw ideas from nonClifford randomized benchmarking^{15,16,17}, in which multiexponential decay is also employed for the fitting of the fidelity curves. When applying multiexponential extrapolation in practice, we might want to develop Bayesian methods to determine whether we need to probe at more error rates, which error rates to probe, and whether to change the number of exponential components of our fitted curve based on the existing data. This has been done in the context of randomized benchmarking^{18} and it would be interesting to see its performance in the context of multiexponential extrapolation.
One combination of error mitigation techniques that we have not explored here is pairing symmetry verification with error extrapolation without using quasiprobability. The naive version of such a combination is discussed in ref. ^{3}. To make use of the results in this Article, one possible way is to approximate all the local error channels as the compositions of detectable and undetectable error channels, so that we can deal with them separately using hyperbolic extrapolation and exponential extrapolation. It would be very interesting to see the implementation details of such a method and how it compares to pure error extrapolation.
We have only considered Pauli noise in this Article, thus it will also be interesting to see whether our arguments can be extended to other error channels like amplitude damping or coherent errors. In practice, we can transform any error channels into Pauli channels using Pauli twirling^{19,20} and then apply our methods. Note that we can even perform further twirling like Clifford twirling to transform the error channels into group channels, which can be better mitigated as we have observed. Ways to transform a given error channel into a group channel can be an interesting area of investigation.
Data availability
The data that support the findings of this study are available from the corresponding author upon reasonable request.
Code availability
The code used in the current study is available from the corresponding author upon reasonable request.
References
Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019).
Preskill, J. Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018).
Cai, Z. Resource estimation for quantum variational simulations of the Hubbard model. Phys. Rev. Appl. 14, 014059 (2020).
Cade, C., Mineh, L., Montanaro, A. & Stanisic, S. Strategies for solving the FermiHubbard model on nearterm quantum computers. Phys. Rev. B 102, 235122 (2020).
McArdle, S., Yuan, X. & Benjamin, S. Errormitigated digital quantum simulation. Phys. Rev. Lett. 122, 180501 (2019).
BonetMonroig, X., Sagastizabal, R., Singh, M. & O’Brien, T. E. Lowcost error mitigation by symmetry verification. Phys. Rev. A 98, 062339 (2018).
Li, Y. & Benjamin, S. C. Efficient variational quantum simulator incorporating active error minimization. Phys. Rev. X7, 021050 (2017).
Temme, K., Bravyi, S. & Gambetta, J. M. Error mitigation for shortdepth quantum circuits. Phys. Rev. Lett. 119, 180509 (2017).
Endo, S., Benjamin, S. C. & Li, Y. Practical quantum error mitigation for nearfuture applications. Phys. Rev. X 8, 031027 (2018).
Greenbaum, D. Introduction to quantum gate set tomography. Preprint at arXiv http://arxiv.org/abs/1509.02921 (2015).
Kandala, A. et al. Error mitigation extends the computational reach of a noisy quantum processor. Nature 567, 491–495 (2019).
GiurgicaTiron, T., Hindy, Y., LaRose, R., Mari, A. & Zeng, W. J. Digital zero noise extrapolation for quantum error mitigation. In Proc 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), 306–316 (2020).
Jones, T. & Benjamin, S. C. QuESTlink—Mathematica embiggened by a hardwareoptimised quantum emulator. Quantum Sci. Technol. 5, 034012 (2020).
Jones, T., Brown, A., Bush, I. & Benjamin, S. C. QuEST and high performance simulation of quantum computers. Sci. Rep. 9, 1–11 (2019).
Cross, A. W., Magesan, E., Bishop, L. S., Smolin, J. A. & Gambetta, J. M. Scalable randomised benchmarking of nonClifford gates. npj Quantum Inf. 2, 1–5 (2016).
Helsen, J., Xue, X., Vandersypen, L. M. K. & Wehner, S. A new class of efficient randomized benchmarking protocols. npj Quantum Inf. 5, 1–9 (2019).
Flammia, S. T. & Wallman, J. J. Efficient estimation of Pauli channels. ACM Trans. Quantum Comput. 1, 3:1–3:32 (2020).
Granade, C. et al. QInfer: statistical inference software for quantum applications. Quantum 1, 5 (2017).
Wallman, J. J. & Emerson, J. Noise tailoring for scalable quantum computation via randomized compiling. Phys. Rev. A 94, 052325 (2016).
Cai, Z. & Benjamin, S. C. Constructing smaller Pauli twirling sets for arbitrary error channels. Sci. Rep. 9, 1–11 (2019).
Acknowledgements
The author would like to thank Ying Li and Simon Benjamin for reading through the manuscript and providing valuable insights. The author is supported by the Junior Research Fellowship from St John’s College, Oxford and acknowledges support from Quantum Motion Technologies Ltd and the QCS Hub (EP/T001062/1).
Author information
Authors and Affiliations
Contributions
Z.C. is the sole author of the article.
Corresponding author
Ethics declarations
Competing interests
The author declares no competing interests.
Additional information
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Cai, Z. Multiexponential error extrapolation and combining error mitigation techniques for NISQ applications. npj Quantum Inf 7, 80 (2021). https://doi.org/10.1038/s41534021004043
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41534021004043
This article is cited by

Pipeline quantum processor architecture for silicon spin qubits
npj Quantum Information (2024)

Quantum error mitigation in the regime of high noise using deep neural network: Trotterized dynamics
Quantum Information Processing (2024)

Evidence for the utility of quantum computing before fault tolerance
Nature (2023)

Noiseresistant quantum state compression readout
Science China Physics, Mechanics & Astronomy (2023)

Nearterm quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulation
Science China Physics, Mechanics & Astronomy (2023)