Purity-Assisted Zero-Noise Extrapolation for Quantum Error Mitigation
Abstract
Quantum error mitigation aims to reduce errors in quantum systems and improve accuracy. Zero-noise extrapolation (ZNE) is a commonly used method, where noise is amplified, and the target expectation is extrapolated to a noise-free point. However, ZNE relies on assumptions about error rates based on the error model. In this study, a purity-assisted zero-noise extrapolation (pZNE) method is utilized to address limitations in error rate assumptions and enhance the extrapolation process. The pZNE is based on the Pauli diagonal error model implemented using the Pauli twirling technique. Although this method does not significantly reduce the bias of routine ZNE, it extends its effectiveness to a wider range of error rates where routine ZNE may face limitations. In addition, the practicality of the pZNE method is verified through numerical simulations and experiments on the online quantum computation platform, Quafu. Comparisons with routine ZNE and virtual distillation methods show that biases in extrapolation methods increase with error rates and may become divergent at high error rates. The bias of pZNE is slightly lower than routine ZNE, while its error rate threshold surpasses that of routine ZNE. Furthermore, for full density matrix information, the pZNE method is more efficient than the routine ZNE.
keywords:
quantum error mitigation, zero-noise extrapolation, purity, Pauli twirling, quantum computation platform, superconducting qubitsTian-Ren Jin Yun-Hao Shi Zheng-An Wang Tian-Ming Li Kai Xu* Heng Fan*
T.-R. Jin, Dr. Y.-H. Shi, T.-M. Li, Prof. K. Xu, Prof. H. Fan
Institute of Physics, Chinese Academy of Sciences, Beijing 100190, China
School of Physical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China
Email Address: [email protected], [email protected]
Dr. Z.-A. Wang, Prof. K. Xu, Prof. H. Fan
Beijing Academy of Quantum Information Sciences, Beijing 100193, China
Hefei National Laboratory, Hefei 230088, China
Prof. K. Xu, Prof. H. Fan
Songshan Lake Materials Laboratory, Dongguan 523808, China
CAS Center for Excellence in Topological Quantum Computation, UCAS, Beijing 100190, China
1 Introduction
Quantum computation is expected to surpass classical computation for specific problems; nevertheless, the vulnerability of qubits to environmental noise poses a significant challenge to realizing a practical quantum computer. Consequently, the development of fault-tolerant quantum computation methodologies is crucial for enabling the widespread application of quantum computation. Quantum error correction code (QECC) provides a systematic solution to fault-tolerant quantum computation [1], while its application requires many physical qubits and the error rate should be lower than a threshold [2, 3, 4]. With remarkable progress [5, 6], however, it is challenging for the state-of-the-art technique to meet the requirements for the full implementation of QECCs. Therefore, fault-tolerant quantum computation based on high-precision logic qubits is still a far-reaching task.
In the noisy intermediate-scale quantum era [7], quantum error mitigation (QEM) provides an alternative approach to dealing with noise. QECCs detect and correct errors that occur in the quantum process to ensure that there are no errors in the coded logic qubits. On the contrary, QEMs allow errors to occur, but use some post-processing techniques to reduce the bias between the output information of noisy quantum circuit and the ideal quantum circuit [8, 9].
In recent years, several QEM schemes have been proposed, including zero-noise extrapolation (ZNE) [10, 11, 12, 13, 14], probabilistic error cancellation (PEC) [13, 14, 15, 16], symmetry verification methods [17, 18, 19], purification methods [20, 21, 22, 23], subspace expansion [24, 25, 26, 27], and learning-based error mitigation [28, 29]. These methods have been applied on different quantum computation platforms and interesting physics [15, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 31, 44]. In addition, there have been some efforts to integrate various QEM schemes in a generalized framework [45, 19, 46, 47, 48, 49]. Among these various error mitigation schemes, the ZNE and PEC are used to deal with quantum circuits, which based on specific error models of noise. The PEC method mitigates the error by post-cancelling the noise, which is previously estimated from experiments in the selected error basis. Although the Pauli basis is sufficient with Pauli twirling technique [50, 51, 52, 34], in practice, the selected basis should be truncated for large systems, such as the -weighted Pauli basis [34]. Thus, the effectiveness of PEC depends on the error model described by the error basis. Recently, an attempt was made to integrate ZNE into the PEC framework [47].
However, the ZNE method is a subtle approach based on the analyticity of the observable expectation related to the error rate, which is a fundamental physical condition. The relation to the error model emerges when the error rate is considered. To perform the ZNE, the error must be amplified, and the ideal value is obtained by extrapolating the expectation backward to the point of zero noise. In the early application of ZNE, the error is amplified by stretching the duration of pulse for each gate [15]. However, this amplification is not suitable for digital quantum gates. Another implementation is to deliberately add redundant gates in the circuit [30], which is improved with a treatment called unitary folding [53]. In the unitary folding method, the redundant gates are implemented by the target circuit of interest. Specifically, the circuit evolves forward and backward successively, and the error rate is characterized by the number of folds. Although the amplifications of the error are developed more feasible, the estimation of the error rate is a priori, which has limitations on the noise type. Moreover, for the complex circuit in the experiment, the effect of errors cannot be sufficiently described by a single parameter of the error rate alone.
In the ZNE method, dependence of the error model in noisy amplification is contrary to the universal idea of the extrapolation, which limits the effectiveness of this method. In this paper, we try to release the limitation of noise in the ZNE method with the assistance of the purity of the noisy output state. Here, we introduce the purity-assisted zero-noise extrapolation (pZNE) method. Specifically, we propose a modified purification method based on the Pauli diagonal error model. By estimating the bias of the modified purification methods, it is shown that the bias is controlled by error rate, which can be represented by purity of noisy state. The pZNE method mitigates the noisy expectation by extrapolating the mitigated expectations of the modified purification method with different error rates to a noise-free pure state. Equivalently, it can be applied by extrapolating the noisy expectations with purity.
This paper is organized as follows. In Sec. 2, we review the routine ZNE method and analyze how this method is based on the error model of noise. Then, we show that the purity of the output state can assist the extrapolation in zero-noise error mitigation in Sec. 3. We describe the detailed procedures of pZNE in Sec. 4, including the fitting model, purity estimation methods, and the measurement overhead. We also verify this method by numerical simulations and experiments on Quafu cloud-based quantum computation platform in Sec. 5. The conclusion and discussion are given in Sec. 6.
2 Zero-noise Extrapolation with Unitary Folding
The ZNE method consists of two steps:
-
1.
Noise amplification: Collecting the raw data of different error rates via measuring on modulated circuits.
-
2.
Extrapolation: Post-processing the experiment data to obtain the mitigated expectation value based on some specific fitting models.
In this section, we will review the ZNE method, the fitting models, and the noise amplification method of unitary folding. In addition, we discuss how the assumption that the error rate is proportional to the number of folds is based on the error model of noise.
Consider the ideal unitary circuit of interest. However, in practice, we can only perform a noisy circuit instead. Then the experimental expectation value of observable of interest is different from the ideal one , where is the noisy output state, and is the ideal output state. Now, we are going to infer the ideal value from some noisy expectation values .
This method is inspired by a simple idea that the expectation value is an analytic function of a parameter , which characterizes the noise level of noisy circuit , and assume when . According to analyticity, the expectation value can be expanded in a power series of as
(1) |
and by definition of , we have . Thus, by interpolation the function with expectations of different error rate , one can infer the noise-free expectation value .
For the number of experimental data is finite, the expansion of should be truncated at some order of , which requires that the error rate should small enough, and this is the polynomial model of function [10, 13]. In addition, there are also (multi-)exponential model [11]
(2) |
and poly-exponential model [53]
(3) |
where is a polynomial of . These fitting models are put forward under the consideration that the physical observable should be bounded.
Then, the noisy data of different error rates is obtained by error amplification. The unitary folding performs the circuit sequence in the experiment
(4) |
where denotes the composition of quantum operations, the corresponding error rate is expected as , and the resolution is . The circuit is shown in Figure 1. To have a more fine-grained resolution, it can also perform the layer (gate) folding [53], which assumes the gate can be decomposed into layers , and performs the folding on these layers
(5) |
in the circuit. By doing so, the resolution can be promoted to .

To consider the procedure of unitary folding in more detail, we assume that the circuit is a gate only, and set the noise in forward and backward evolutions as
(6) | ||||
(7) |
which can be interpreted as the definition of forward error and backward error . The error rate for both errors is denoted as and respectively. Then, we formally have
(8) |
thus the noisy gate is
(9) |
where is the error channel with the error rate , where is the error rate of error channel .
To obtain , we can assume , which is true when the error channel satisfies . However, this assumption is not always realized [54] (or see Appendix A). If we assume , it will introduce an additional error in the inference of the ideal value before fitting the experimental data. As a result, the ZNE method is constrained by the error model of noise. The direct way to solve this problem is to determine the error rate from experiments.
3 Extrapolation with Purity
Fidelity is always used to witness the difference between the state with an ideal state, however, the ideal state cannot be prepared precisely due to the inevitable noise in the experiment. Therefore, measuring the fidelity of the noisy state and the ideal state requires the classical simulation of the quantum circuit, which is generally impractical for large systems. In this section, we will describe the idea of using the purity of the output state of the noisy circuit
(10) |
to reflect the influence of noise in the circuit. The ideal unitary circuit will not influence the purity of the state. We assume that the error is not unitary, otherwise, it can be canceled by the folding of the well-calibrated circuit. Moreover, we assume the error is in the form of Pauli diagonal
(11) |
where is Pauli operations, and distinguish the forward and backward errors. This assumption can be realized by the Pauli twirling technique.
Let the ideal state be decomposed into Pauli basis . The Pauli diagonal forward error channel acts as
(12) |
where is the eigenvalue of the error, with . We assume that the operators whose expectation values of interest are Pauli operators. Then, the expectation of of the folded noisy state are
(13) |
By fitting these expectations with the exponential model, only the parameters and are obtained. To find the ideal expectation , we should estimate . In general, , so the ideal expectation cannot be extracted.
We use purity to do this estimation. The purity of the noisy state is
(14) |
where is the average of nontrivial eigenvalues of folding circuits, is the purity of ideal state, and is the purity of the stable state of the forward error channel. For convenience, we can assume the ideal state is pure, , and the stable state is a maximally mixed state, . If the distribution of concentrates, so that the variance is small, then we can approximate
(15) |
and the ideal expectation is estimated as
(16) |
The effectiveness of this approximation that requires to be small, which is based mainly on the distribution of eigenvalue of error channel and slightly on the state in large systems. The relative bias of this method is
(17) |
Given a tolerant error , the probability of failing is
(18) |
where , by Chebyshev’s inequality (for detail, see Appendix D).
Denote the failing probability as , and select the tolerant error so small, we expand the left-hand of inequality to the leading term of
(19) |
which means that the pZNE method works if the eigenvalues of forward error satisfy , and the tolerant error is controlled by . The parameter relies on the form of the forward error, for example, for the global depolarizing error, all the nontrivial eigenvalues are the same, so no matter how large the error. Moreover, without specifying the form of errors, this parameter is controlled by the error probability , where is the coefficients of Pauli diagonal error . Obviously , we have
(20) |
thus when the error is so small that , this method always has the possibility of success, and the relative bias is roughly controlled as
(21) |
With more detail estimation (see Appendix D), .
In all, the estimator in Equation (16) has bias controlled by the error probability in general, so the number of folding. Therefore, we can extrapolate the estimators of different folding circuits to reduce bias. In this step there are two strategies. One is to extrapolate the estimators to , which is similar to the extrapolation of routine ZNE. Another is to extrapolate the estimators along the effective error rate to , and in this effective error rate,
(22) |
which means that we can also extrapolate the noisy expectation with the effective error rate, or purity.
4 Procedure of Methods
In Sec. 3, we discuss the procedure of the pZNE method. Assume our quantum computation task consists of , where is the initial state, is the ideal unitary evolution, and is the operator of interest. The outcome we want from this computation task is the expectation . The procedure of the pZNE method to mitigate the error in this task is following.
-
1.
Task decomposing: Decompose the operator of interest into Pauli basis , where is the set of indices with nonzero coefficients .
-
2.
Pauli twirling: Construct the Pauli-twirling the ideal circuit , which corresponds to the noisy circuit in experiment.
-
3.
Task performing: Perform the circuit to estimate the expectation and the purity .
-
4.
Data processing: Estimate with and . Extrapolate to noise-free point, or . Calculate the estimation of the ideal expectation with coefficients .
In this section, we will discuss the steps of task performing and data processing (for the technique of Pauli twirling, see Appendix C).
4.1 Task Performing
The unitary folding technique to construct the circuit sequence is discussed in the previous section. Unlike the routine ZNE method, we use purity to assist the estimation of ideal expectations. However, it is not an easy task to measure purity, since purity is not an expectation of linear operator on Hilbert space , but . In this subsection, we will introduce the purity estimation methods.

The most trivial way to measure the purity is to perform the quantum state tomography (QST), and then calculate the purity by definition. However, QST is so expensive that it is hard to perform on a large system. Therefore, we need more efficient methods to measure purity. The purity can be measured by random measurement [55], where we randomly measure the operators sampled from an ensemble, typically the Pauli string of the qubits. The circuit is shown in Figure 2. This method is called classical shadow, which can substitute QST. By random measurement of operators with the Monte Carlo sampling, this method is more feasible than QST for large-size systems. The number of measurements is shown in the order of
(23) |
which is determined by the observable operators of interest, the ensemble of unitary gates, and the precision . However, since it is equivalent to QST in probability, it cannot solve the problem of exponential increasing dimension of the quantum system.

In the purification method, the measurement of quantities is the key problem. The measurement method with a replica is proposed, which is founded on the following equation
(24) |
where is copies of , is the operator acted on the -th copy, typically , and is cyclic permutation on copies
(25) |
The purity can be mapped to the expectation of on two-replica state . The circuit of is shown in Figure 3(a), and the circuit to measure the expectation in Equation (24) is shown in Figure 3(b). This method allows us to measure the purity directly from the quantum circuit, which is generally used in the so-called virtual distillation or error suppression by derangement (VD/ESD) in the purification method [21]. Although it can reduce the exponentially increasing quantities measured in QST, it enlarges the space complexity of qubits for the preparation of copies, and the SWAP gates needed in applying will enlarge the time complexity of the quantum circuit.
4.2 Data Processing
With the data , from experiments, we calculate the effective error rate and the estimators in Equation (16). Then, we extrapolate the estimators to noise-free estimator , where or . Finally, calculate the estimator of ideal expectation .
Since the errors are Pauli diagonal with the Pauli twirling technique, as shown in Equation (13) and (14), is an exponential function of , while is a multi-exponential function of , so the fitting model is
(26) | ||||
(27) |
Moreover, it can be simplified as
(28) |
where is the parameters need to determine.
In particular, the expectation can be calculated with the estimator without unitary folding and extrapolation. This should be interpreted as a modified VD/ESD of the purification method (see Appendix B). In the following, we will discuss the difference between the two criteria of noisy-free point, and the difference between the -fold pZNE (without extrapolation) and VD/ESD.
For extrapolation to , by Equation (51). The tolerant error is
(29) |
where , has lower order than the bias of estimator without extrapolation. For extrapolation to pure state, , the tolerant error is (see Appendix. D)
(30) |
which is in the same order as extrapolate to , and in practice, we can select the one in and closer to .
For routine ZNE method, the relative bias is . The tolerant error is (see Appendix. D)
(31) |
when , otherwise it may fail. The relative bias up to the lowest order is the same as the pZNE extrapolating to , however, considering the constraint of pZNE or , we find that the pZNE can be used in the region where the error rate is large so that the routine ZNE method may fail. The suppression of bias to second order is from the assumption that the difference of forward and backward error is in the second order, which comes from the pulse-inverse technique [54]. Without the pulse-inverse technique, the error rate in the above calculation is substituted by .
Then, we consider the VD/ESD method with -replica (see Appendix B). The estimator of VD/ESD is
(32) |
where . Under the Pauli diagonal error, with Equation (13) and Equation (14), the bias of the estimator is
(33) |
which approaches to zero when , the noise-free point, or if . Therefore, it is only reliable when error is small enough. As the estimation in Appendix D, the tolerant error
(34) |
is larger than the one for the -fold pZNE method. Notice that the requirement of the -fold pZNE method is weaker than that of VD/ESD. Therefore, the -folded pZNE has lower tolerant error and looser conditions than the VD/ESD method with -replica.
4.3 Efficiency
To describe the efficiency of this method, we consider its overhead [9, 45]. The overhead depends on the fitting model, and here, we abstractly denote the fitting model as
(35) |
where is a function of the data of purity and observable expectation from the experiment. Then, we calculate the overhead of pZNE, and the details of calculation is in Appendix E.
According to the law of large numbers (LLN), the overhead is given by
(36) |
where and is the number of shots to measure the mitigated estimator and the raw estimator up to precision correspondingly, and the overhead of routine ZNE method . The variance depends on the method to measure the purity, and as we previously discussed, there are two kinds of methods to measure the purity. One is the replica measurement method, which is based on the Equation (24). Another one is the QST-like method, QST and classical shadow, which measure the expectation of all Pauli operators , where , and is the system size. Then, we calculate the overhead of these two different measurement methods respectively. (For details, see Appendix E.)
For the replica measurement method, if we assume the observable of interest is a Pauli operator, and when the error rate , , then the overhead is
(37) |
In the contrary, if , the overhead increases by a constant
(38) |
For the QST-like measurement method, we assume the observable is a Pauli operator located on qubits, namely is not identity exactly on qubits, and we call it -weight Pauli operator in below. We measure the different -weight Pauli operators with the same number of shots to perform the QST-like method. The overhead is
(39) |
If , when , the second term in the rightest inequality goes to zero, which means that the overhead
(40) |
Thus, the variance of purity is well controlled by the variance of Pauli operator with large weight.
However, we note that the overhead of ZNE here is calculated under the assumption that the expectation of is measured from QST-like method. In the ZNE method, we need not perform QST to measure , thus the actual ZNE overhead is
(41) |
where is the number of different -weight operators covering the operator of interest. Therefore, the overhead asymptotically is
(42) |
Moreover, if the operators of interest is so dense that every -weight operator covers at least one operator of interest, , the efficiency of pZNE is of the same order as the routine ZNE.



5 Verification
In this section, we simulate the pZNE method numerically and experimentally.
5.1 Numerical Simulation: Depolarizing Error
We verify the effectiveness of pZNE by numerical simulation. First, we simulate the CNOT gates under the depolarizing error of different error rates. The initial state is selected as , and the observable expectation of Pauli operator on the qubit is measured for showing the effect of the error. For ideal CNOT gates, the expectation is invariant for any number of folds. However, the depolarizing error will lead to the decay of the expectation. We compare the mitigated expectation of the pZNE to the routine ZNE method, the VD/ESD method, and the modified purification method. Each layer of CNOT gate is a folded gate, with and CNOT gates. We simulate the circuit with different layers, which enlarge the error rate of -fold gate. The results are shown in Figure 4. The estimators of pZNE, ZNE, VD/ESD, and modified purification method are shown in Figure 4(b), the raw value of expectations are shown in the Figure 4(c), and the purities of the noisy state are shown in the Figure 4(d). (For details of data processing, see Appendix F.)
Among the several methods, the VD/ESD method presents a large bias of expectation, which is expected in Equation (33). The modified purification has the lowest bias and standard deviation since the depolarizing error . However, in cases where the error is not a depolarizing error but a Pauli diagonal error, the modified purification method may exhibit a significant bias that increases with the error rate. We will discuss this later in Sec 5.2.
The reason pZNE (with extrapolation) does not perform better than the modified purification, -fold pZNE without extrapolation, is that for the depolarizing errors, the error is from the random errors in measurement. The extrapolation thus cannot cancel the bias, but enlarge the random errors in measurement. We expect that there exist errors with small but not vanish , where the modified purification method perform better than the routine ZNE method. With sufficiently large number of shots, the random errors in measurement are sufficiently smaller than the error from error models. In this case, the pZNE (with extrapolation) will perform better than both the modified purification and the routine ZNE method.
Comparing the pZNE with the ZNE, the bias between the average mitigated data and ideal expectation of these two methods are comparable before the -th layer, where the purity of -folded noisy state , as shown in Figure 4(d). It can be seen that the standard deviations of the pZNE method are lower than those of the ZNE method. Despite this, purity estimation necessitates complete information about the quantum state, resulting in an additional measurement overhead. However, in scenarios where dense information about the state is required, the purity can be estimated simultaneously from the measurement outcomes. In such cases, pZNE does not involve higher overhead compared to ZNE, and it showcases the advantage of offering higher precision than ZNE.
5.2 Numerical Simulation: Pauli Diagonal Error
To analyze the pZNE method with the Pauli diagonal error, we first simulate the CNOT gate under this kind of error models. The settings of simulations are the same as those in the depolarizing error model case. The results are shown in Figure 5. The estimators of pZNE, ZNE, VD/ESD, and modified purification method of -folded gate are shown in Figure 5(a), the raw value of expectations are shown in Figure 5(b), and the purities of the noisy state are shown in Figure 5(c). (For details, see Appendix F.)
The VD/ESD estimator still has a large bias from the ideal expectation. Different from the depolarizing error model case, the modified purification method also has bias with randomly selected Pauli diagonal error. The bias increases with the increasing of the layer in Figure 5(a), which represents the increasing error rate. This result is because the eigenvalues of the selected error channel do not concentrate enough. For the pZNE and routine ZNE method, same as the depolarizing error case, the bias of pZNE is comparable with the routine ZNE. In addition, the standard deviation of pZNE is lower than routine ZNE.
However, the observation from the results of the depolarizing error and the selected Pauli diagonal error are not sufficient to represent the performance of different methods. To confirm this, we perform the numerical simulations of the CNOT gate under a wider range of randomly sampled Pauli diagonal errors with the same error rates. We take 50 instances of Pauli diagonal errors, randomly sampled, and computed the expectations and variances of various mitigation methods for each instance. Subsequently, we calculated the square root of the second moment of biases for these sampled instances
(43) |
and the average standard deviation
(44) |
to represent the average performance of the different methods.
The quantity represents the accuracy of the methods, and the quantity represents the precision. The result is shown in Figure 5(d).
The VD/ESD method exhibits a noticeable average bias, whereas the bias of the modified purification method increases linearly with the number of layers. Interestingly, their standard deviations remain comparable and do not show an increase in the number of layers. In comparison, the biases of the pZNE and conventional ZNE methods are nearly equivalent and tend to increase with the number of layers. However, before the -th layer, the bias of pZNE is marginally smaller than that of conventional ZNE. After the -th layer, conventional ZNE encounters failures for some sampled instances due to their diverging biases, while pZNE manages to remain effective until the -th layer. Furthermore, the standard deviations of pZNE show a corresponding increase with the number of layers, as both methods involve extrapolation. Notably, these standard deviations are consistently lower than those of the routine ZNE method.
These results show that the pZNE method offers enhanced accuracy and precision, particularly in scenarios with substantial error rates, while also maintaining a lower standard deviation compared to routine ZNE on average across various Pauli diagonal errors. Nonetheless, to harness these benefits effectively, it is recommended to leverage the pZNE method primarily in tasks that necessitate detailed and comprehensive information about the quantum state.
5.3 Experiment
We perform the pZNE and ZNE experiments on the cloud-based superconducting quantum computation platform, Quafu [56]. For the information of the Quafu platform and device, see Appendix G. The experimental setup was identical to that of the numerical simulations but was performed only once. We applied the Pauli twirling technique to the folded CNOT gate. The results are illustrated in Figure 6, where the mitigated outcomes of pZNE, ZNE, VD/ESD, and the modified purification method of the -folded gate are presented in Figure 6(b). Additionally, the raw expectation values are shown in Figure 6(c), and the purities of the noisy state are shown in Figure 6(d). The data processing procedures were the same as those used in the numerical simulation, with the exception of calculating standard deviations.
The results of the VD/ESD and modified purification methods exhibit significant biases away from the ideal values, indicating a lack of concentration in the eigenvalues of the twirled error channel. The mitigated expectations of the pZNE show biases comparable to those of the standard ZNE method. Interestingly, for error rates in the moderate range, specifically after the -th layer and before the -th layer, the bias of the pZNE method is lower than that of the standard ZNE approach. Our previous assumption considered each error channel of the layers in the circuit to be Pauli diagonal. However, implementing individual Pauli twirling for each layer in the circuit would lead to an exponential increase in compiled circuit instances with the number of layers. To simplify this process, we twirled the folding circuit as a whole. Consequently, the coherent part of the error channels, which would have been eliminated in individual Pauli twirling, contributed to the overall error channel of longer layers. In such cases, the purity of the state can assist in extrapolating expectations, thereby reducing the bias in pZNE expectations compared to routine ZNE for stages with moderate errors.
6 Conclusion
In this paper, we introduce a method that utilizes purity to assess noise error rates, operating under the assumption that the error channel is Pauli diagonal. By using the Pauli twirling technique, we ensure that this assumption holds universally. Our study involves estimating the bias of the pZNE method based on a specified failing probability and conducting a comparative analysis with other relevant methods. We demonstrate that the pZNE method may not lead to a substantial reduction in bias compared to the routine ZNE method when error rates are low. However, it showcases its utility within a certain threshold where the routine ZNE method might encounter limitations or failures.
Moreover, we analyze the overhead of the pZNE method using different purity estimation techniques, such as the replica measurement method and the QST-like method. Our results reveal distinct behaviors in the upper bounds of pZNE for these estimation methods. Specifically, the overhead of the replica measurement method is constrained by the overhead of ZNE with a finite constant added, while the overhead of a QST-like method escalates exponentially with the growth of system size. In cases with exponentially increasing overhead, the pZNE method may not be efficient for large systems when using a QST-like method. However, if the task requires dense information about the density matrix, the purity estimation will not significantly inflate the overhead.
In addition, we verify the pZNE method with the numerical simulations under the depolarizing error and the Pauli diagonal errors, as well as the experiments on the quantum computation platform, Quafu. We compare it with the routine ZNE and the VD/ESD method. The results show that the bias of both routine ZNE and pZNE increases with the error rate, and divergence when the error rate is large enough. The bias of pZNE is slightly lower than routine ZNE when the error rate is moderate, and the critical point of error rate for pZNE is larger than routine ZNE method. The standard deviation of pZNE is lower than that of ZNE, indicating that the pZNE method is more efficient when dense state information is of interest.
Our results show that the purity of noisy quantum states can be used to assist the ZNE method, thus extending its effectiveness. It can be expected that pZNE will reinforce the wide usage of the ZNE method in the NISQ era.
Appendix A The Forward and Backward Errors
In this appendix, we consider the forward and backward errors. The equality of forward and backward error is the basic assumption of the ZNE method. However, it is not such easy to satisfy, even for the unitary evolution whose inverse is itself. For example, assume the ideal unitary is CNOT gate, the noisy circuit is . Since the CNOT gate is self-inverse, in the unitary folding technique, the backward evolution is , and the backward error is
(45) |
We assume the circuit is implemented with the Pauli twirling technique, thus the forward and backward errors are Pauli diagonal. Let the Pauli operators on the first control qubit of CNOT gate be , and on the target qubit be . The action of CNOT gate is
(46) |
so if there is no symmetry that all coefficients of Pauli diagonal forward error are different (the converse case is zero-measure in space of error), then the forward and backward error is different.
In Ref. [54], they deal with this problem by introducing the pulse-inverse circuit ( in original context). The pulse-inverse circuit is a special circuit of inverse of . Assume the ideal evolution is implemented by a time-dependent Hamiltonian , and the error is described by a Lindblad operation . The ideal pulse-inverse circuit is implemented by time-dependent Hamiltonian , and a reasonable assumption is that the error in this inverse pulse is described by the Lindblad operation . The forward and backward error thus is related to the evolution in the interaction picture
(47) | ||||
(48) |
where are the Lindblad operations in the interaction picture. Ref. [54] shows that in the first order of Magnus expansion , which agrees with the first order expansion of time-independent case. However, to higher order, these two errors are still different, if the Hamiltonian evolution and Lindblad evolution are not commute. Therefore, the pulse-inverse circuit extends the requirement of time-independence on unitary folding to the Floquet system, which is more suitable for digital systems, but cannot fix the problem in the assumption that the forward and backward errors are equal.
Moreover, intersecting a perturbative parameter before Lindblad operations to reflect the intensity of the noise, the expansion shows that
(50) |
the difference between forward and backward errors is up to the second order. With the Pauli twirling technique, both forward and backward errors are Pauli diagonal, thus commute, so their eigenvalues have a relation
(51) |
Appendix B Brief Introduction to Purification Method
The purification method is based on the belief that in practice the output state is always mixed, while the ideal state is pure. If the error is not so large, the ideal pure state should not be far away from the experimental mixed state. Thus, the pure state closest to the mixed state may be a good approximation of the ideal state, and this state is the aim of the purification method.
Let the mixed state decomposed as
(52) |
where are the spectrum of the density ordered descendingly, and are the corresponding eigenstates. For some other pure state , the distance
(53) |
minimizes when , namely the state with the largest probability in the mixed state is the closest pure state. It is clear that if we know the mixed state completely, by diagonalization we can get the closest pure state.
For large systems, the dimension of the matrix is too overwhelming to perform the diagonalization. The better way is to realize the purification by iteration. One of the iteration procedures is the McWeeny purification [57, 40]
(54) |
In a basis that can diagonalize the mixed state, this iteration only maps the spectrum. However, the attractive fixed point of this map is and the critical point is , thus it has the probability of convergence to for all eigenvalues, which is not what we desire. Only if there is an eigenvalue greater than , namely the error is small enough, the purification is working. Another one is the map
(55) |
In the diagonal representation, the spectra are mapped as
(56) |
In the limit , the spectra , since is in descending order, which is what pure state we want.
To do the purification, one can perform the tomography of target density, and then iterate the procedure given above on a classical computer. However, tomography is expensive for large systems, other method is also needed. One can prepare the purified state by post-selection, Other strategy is to realize the purification virtually. The purified state can be approximated as for some given integer , so the expectation of quantity under the purified state approximate as
(57) |
If the value can be evaluated from the experiment, the purified expectation value can be obtained.
A method called virtual distillation or error suppression by derangement is proposed [21], which is based on the Equation (24). where is copies of , is the operator acted on the -th copy, typically , and is cyclic Thus, and can be measured with copies of . For is cyclic permutation on copies, the expectation of operator is same as the original one
(58) |
Since are commute with , we can find the common eigenstates as the basis, which allows measuring and simultaneously. One can measure the expectation and by Hadamard test (see Figure 3) or by diagonalization [21]. For the measurement by diagonalization, in a qubit system, let be the operator, the eigenstates are just spin waves. Moreover, considering the case with two copies, i.e. , the eigenstates states are just the spin singlet and triplet, and the transformation is
(59) |
Under this transformation,
(60) |
and we can verify that . Thus, the estimator of is
(61) |
In addition to the above-mentioned methods, there is a variation of purity estimation called state verification [23]. We consider the purity of , namely
(62) |
This is the overlap of initial state with quasi-state , which is not physical in general. Here, the on the channel is acted on its Kraus operators, but not on the output state . For , the quasi-channel is
(63) |
In ideal case, , , we have
(64) |
where . Thus, in the purification method, the recurrence probability can be used instead of purity
(65) |
where is a physical state, to substitute the purity.
The state verification echo is easier to measure than purity. However, it is coincident with the purity if the error channels satisfy
(66) |
In the Pauli twirling case, it is equivalent to , where the routine ZNE method is satisfied. Therefore, it cannot be used in pZNE to measure purity.
Appendix C Pauli Twirling
Pauli twirling technique can compile non-diagonal error channel into Pauli diagonal. Given a group of gates the twirling channel of with these gates is
(67) |
If the gate is Pauli group, writing the error channel as the Kraus decomposition in Pauli basis
(68) |
the twirling channel is
(69) |
To go ahead, let , then we have
(70) |
which means . Note that for , all , otherwise, with equal probabilities, thus
(71) |
With this result, the twirling channel
(72) |
is Pauli diagonal.
However, in practice, the error channel company with the ideal gate , so our task is to twirl the error channel in the noisy gate without changing the ideal gate . To do so, notice that the Clifford gate combined with T-gate forms the universal quantum gate set. For the Clifford gate , the twirling channel of its noisy realization is
(73) |
where are also Pauli gates. In this selection of , the twirling channel of noisy gate is
(74) |
For the T-gate , the construction is similar
(75) |
while are Clifford gates instead. Note that if the error channel is so defined that on the ideal gate , the twirling channel can be constructed similarly, with a small modification
(76) |
where .
Appendix D Effectiveness
The failing probability is
(77) |
By exponential from of Chebyshev’s inequality, and , we have
(78) |
where in the second line, we use the cumulant expansion to the second order, and in the third line, we keep to the first order of . Similarly, we have
(79) |
These give the result in Equation (18).
Then, we estimate the tolerant error in detail. By , where is the parity between Pauli operators , the average is
(80) |
For , , while , distributes with equal probability , with the assumption that are, so the average
(81) |
where we treat as a random variable distributing over the parity , and . Without accurate knowledge of the state, we assume the distribution of is nearly symmetric, thus . In this consideration, we have
(82) |
For the second-order moment,
(83) |
where the second line follows that when , and are independent, and the third line is because . Therefore, the parameter is of the order
(84) |
and the tolerant error
(85) |
We calculate the tolerant error of relative bias for extrapolation to pure state, . With , and by Equation (51), we have
(86) |
where we expect and use cumulant expansion to second order. Thus, the effective noise-free point is
(87) |
It follows that , and the relative bias is
(88) |
For routine ZNE method, the relative bias is , and the failing probability is calculated as
(89) |
The tolerant error is bounded as
(90) |
For the VD/ESD method with -replica, with and , the failing probability is calculated in the similar way,
(91) | ||||
(92) |
where stands for , and we assume and in the third line. This shows that the tolerant error
(93) |
Appendix E Efficiency
To calculate the overhead , we consider the variance of the estimator. Since the estimator is not linear, the variance is not defined rigidly. But up to linear order, we can derive it approximately.
(94) | |||
(95) |
According to the law of large numbers (LLN), the overhead is given by
(96) |
where and is the number of shots to measure the mitigated estimator and the raw estimator up to precision correspondingly. Here, we assume that the overhead of routine ZNE method approximates to the observable expectation part of the overhead of pZNE. The reason is that the purity influences the mitigated estimator via the error-rate-like index , thus the fitting model is similar to of ZNE.
In the second term of the overhead , the part depending on is correlated to the specific fitting model. We only consider the variance of purity in the latter. The variance depends on the method to measure the purity, and as we previously discussed, there are two kinds of methods to measure the purity. One is the replica measurement method, which is based on the Equation (24). Another one is the QST-like method, such as QST and classical shadow, which measure the expectation of all Pauli operators , where , and is the system size. The definition of the purity is
(97) |
Then, we calculate the overhead of these two different measurement methods respectively.
For the replica measurement method, the variance of purity is
(98) |
Next, if we assume the observable of interest is a Pauli operator, we have , thus
(99) |
When the error rate , we have , if , then the second term of the overhead has less influence, and we have
(100) |
In the contrary, if also, we have
(101) |
where , and . The second equality of is because that is real. Then the overhead is
(102) |
For the QST-like measurement method, we assume that the observable is a Pauli operator located on qubits, namely is not identity exactly on qubits, and we call it the -weight Pauli operator in the following. Then, the variance of purity of system with qubits is
(103) |
We measure the different -weight Pauli operators with the same number of shots to perform the QST-like method. The number of shots used to estimate the -weight Pauli operator shorter than is . Thus, by LLN, the variance of the -weight Pauli operator is
(104) |
Dividing the summation of into the summation of weight , we have
(105) |
where . Therefore, the overhead is bounded as
(106) |
Appendix F The Detail of Numerical Simulation
F.1 Data Process
For the extrapolation, we substitute the gates with the folded gates with odd numbers and . In addition, we also simulate the case without any gate to separate the error of the circuit and the error of preparation and measurement. The circuit with layers from to is simulated times. After each circuit with given layers, we perform the projective measurement on each qubit based on all three Pauli operators. Each Pauli operator is measured with shots.
With the measurement outcome, we estimate the expectations of all Pauli operators of the two-qubit system, which is used to calculate the purity of states. For the operator , it is estimated from shots, while the purity of the system is estimated from shots. For a given number of layers, there are results of four different circuits, whose layer is and folded gate. The estimator of ZNE is extrapolated to the noise-free gate from the expectation of and folded gate, with the exponential fitting model
(107) |
where are the parameters to be determined, and is the number of folding, namely and . The estimator of pZNE is extrapolated from the expectation of and folded gates, and the purity of and folded gates. The fitting model is
(108) |
and the estimator is
(109) |
We fit the parameters , , and by the least square method.
For the VD/ESD method, we use the state estimator with replica
(110) |
where is the noisy state of the qubit . The estimator of expectation is
(111) |
It can be verified that , thus
(112) |
The estimator of the modified purification method is
(113) |
F.2 Pauli Errors Sampling
We randomly sample the Pauli diagonal errors , where , with a fixed error probability . Therefore, all these errors form located on a dimension projective space . By stereographic projection, the projective space is diffeomorphic to Riemann sphere . The errors are sampled uniformly on this sphere.
First, we uniformly sample number from . The points formed from them are discarded if it is located out of the inscribed sphere, otherwise, the point is normalized to the surface of the sphere. Then, the point on spherical surface is map to the projective space by stereographic projection. The point on projective space which has negative components is also discarded. The left point is normalized to the given error probability .
The parameters of error model used to obtain the results of Figure 5(a), (b) and (c) is shown in Table 1.
F.3 Pauli Twirling of CNOT Gate
For our circuits in the experiment, Pauli twirling is performed for the whole circuit. The Pauli gates in Figure 6(a) run over the elements of Pauli group, and the Pauli gates are selected by the Equation 73 accordingly.
If is even, then the ideal circuit is identity, and . Otherwise, when is odd, can be calculated by Equation A. All the instances are shown in Table 2.
Appendix G Device Information on Quafu Cloud Platform
In Sec. 5, we use the ScQ-P18 device on Quafu cloud platform for experimental verification. Here we utilize the open-source Python SDK, namely PyQuafu, to write the experimental code for running the circuits. The layout of the ScQ-P18 device and the error rates of CZ gates are shown in Figure 7. We use qubits 4 and 5 on ScQ-P18 for the two-qubit demonstration. The XEB fidelity of single-qubit gates is about 0.9947 for qubit 4, 0.9972 for qubit 5, and their CZ gate is about 0.966. More information about the two used qubits can be found in Table 3.

Qubit index | 4 | 5 |
---|---|---|
Qubit frequency, () | 4.930 | 4.465 |
Readout frequency, () | 6.713 | 6.693 |
Anharmonicity, () | -204.8 | -191.7 |
Relaxation time, () | 23.37 | 31.03 |
Coherence time, () | 2.47 | 1.51 |
Readout fidelity of state , | 0.9524 | 0.9109 |
Readout fidelity of state , | 0.9025 | 0.8647 |
Here we mitigate the readout error of the experimental results on the cloud platform. In specific, we first assume the ideal and noisy measurements are in bases and , respectively. According to the Bayesian readout correction, the relation between the noisy measurement operator and the ideal operator can be expressed as
(114) |
where the matrix can be evaluated from the probability of experimental outcome when performing the noisy measurement on the prepared states , namely
(115) |
In the single-qubit case, the matrix is constructed by the readout fidelities:
(116) |
where and are the readout fidelities of states and . Ignoring the readout crosstalk, the multi-qubit matrix can be reduced to the direct product of each single-qubit matrix.
With the knowledge of matrix , we can construct the ideal measurement outcome by using its inverse
(117) |
and the probability of some state in state is thus
(118) |
where is the probability of this state in . In addition, we also use the least square method to limit the mitigated probabilities, so that all of them meet the non-negative and normalization conditions.
Acknowledgements
This work was supported by National Natural Science Foundation of China (Grants Nos.92265207, T2121001, 11934018, 12122504), the Innovation Program for Quantum Science and Technology (Grant No. 2021ZD0301800), and Beijing Natural Science Foundation (Grant No. Z200009). We also acknowledge the support from the Synergetic Extreme Condition User Facility (SECUF) in Beijing, China.
Conflict of Interest
The authors declare no conflict of interest.
Data Availability Statement
The data that support the findings of this study are available from the corresponding author upon reasonable request.
References
- [1] B. M. Terhal, Rev. Mod. Phys. 2015, 87 307.
- [2] E. Knill, R. Laflamme, W. Zurek, arXiv:9610011 1996.
- [3] D. Aharonov, M. Ben-Or, In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC ’97. Association for Computing Machinery, New York, NY, USA, ISBN 0897918886, 1997 176–188, URL https://doi.org/10.1145/258533.258579.
- [4] A. Y. Kitaev, Russian Mathematical Surveys 1997, 52, 6 1191.
- [5] Y. Zhao, Y. Ye, H.-L. Huang, Y. Zhang, D. Wu, H. Guan, Q. Zhu, Z. Wei, T. He, S. Cao, et al., Phys. Rev. Lett. 2022, 129 030501.
- [6] G. Q. AI, Nature 2023, 614, 7949 676.
- [7] J. Preskill, Quantum 2018, 2 79.
- [8] S. Endo, Z. Cai, S. C. Benjamin, X. Yuan, Journal of the Physical Society of Japan 2021, 90, 3 032001.
- [9] Z. Cai, R. Babbush, S. C. Benjamin, S. Endo, W. J. Huggins, Y. Li, J. R. McClean, T. E. O’Brien, Rev. Mod. Phys. 2023, 95 045005.
- [10] Y. Li, S. C. Benjamin, Phys. Rev. X 2017, 7 021050.
- [11] Z. Cai, npj Quantum Information 2021, 7, 1 80.
- [12] M. Urbanek, B. Nachman, V. R. Pascuzzi, A. He, C. W. Bauer, W. A. de Jong, Phys. Rev. Lett. 2021, 127 270502.
- [13] K. Temme, S. Bravyi, J. M. Gambetta, Phys. Rev. Lett. 2017, 119 180509.
- [14] S. Endo, S. C. Benjamin, Y. Li, Phys. Rev. X 2018, 8 031027.
- [15] A. Kandala, K. Temme, A. D. Córcoles, A. Mezzacapo, J. M. Chow, J. M. Gambetta, Nature 2019, 567, 7749 491.
- [16] A. Mari, N. Shammah, W. J. Zeng, Phys. Rev. A 2021, 104 052607.
- [17] X. Bonet-Monroig, R. Sagastizabal, M. Singh, T. E. O’Brien, Phys. Rev. A 2018, 98 062339.
- [18] S. McArdle, X. Yuan, S. Benjamin, Phys. Rev. Lett. 2019, 122 180501.
- [19] Z. Cai, Quantum 2021, 5 548.
- [20] B. Koczor, Phys. Rev. X 2021, 11 031057.
- [21] W. J. Huggins, S. McArdle, T. E. O’Brien, J. Lee, N. C. Rubin, S. Boixo, K. B. Whaley, R. Babbush, J. R. McClean, Phys. Rev. X 2021, 11 041036.
- [22] M. Huo, Y. Li, Phys. Rev. A 2022, 105 022427.
- [23] Z. Cai, arXiv:2107.07279 2021.
- [24] J. R. McClean, M. E. Kimchi-Schwartz, J. Carter, W. A. de Jong, Phys. Rev. A 2017, 95 042308.
- [25] J. R. McClean, Z. Jiang, N. C. Rubin, R. Babbush, H. Neven, Nature communications 2020, 11, 1 636.
- [26] P. D. Nation, H. Kang, N. Sundaresan, J. M. Gambetta, PRX Quantum 2021, 2 040326.
- [27] N. Yoshioka, H. Hakoshima, Y. Matsuzaki, Y. Tokunaga, Y. Suzuki, S. Endo, Phys. Rev. Lett. 2022, 129 020502.
- [28] A. Strikis, D. Qin, Y. Chen, S. C. Benjamin, Y. Li, PRX Quantum 2021, 2 040330.
- [29] P. Czarnik, M. McKerns, A. T. Sornborger, L. Cincio, arXiv preprint arXiv:2204.07109 2022.
- [30] E. F. Dumitrescu, A. J. McCaskey, G. Hagen, G. R. Jansen, T. D. Morris, T. Papenbrock, R. C. Pooser, D. J. Dean, P. Lougovski, Phys. Rev. Lett. 2018, 120 210501.
- [31] Y. Kim, C. J. Wood, T. J. Yoder, S. T. Merkel, J. M. Gambetta, K. Temme, A. Kandala, Nature Physics 2023, 19 752–759.
- [32] M. Foss-Feig, S. Ragole, A. Potter, J. Dreiling, C. Figgatt, J. Gaebler, A. Hall, S. Moses, J. Pino, B. Spaun, B. Neyenhuis, D. Hayes, Phys. Rev. Lett. 2022, 128 150504.
- [33] C. Song, J. Cui, H. Wang, J. Hao, H. Feng, Y. Li, Science Advances 2019, 5, 9 eaaw5686.
- [34] E. Van Den Berg, Z. K. Minev, A. Kandala, K. Temme, Nature Physics 2023, 19 1116–1121.
- [35] S. Zhang, Y. Lu, K. Zhang, W. Chen, Y. Li, J.-N. Zhang, K. Kim, Nature communications 2020, 11, 1 587.
- [36] R. Sagastizabal, X. Bonet-Monroig, M. Singh, M. A. Rol, C. Bultink, X. Fu, C. Price, V. Ostroukh, N. Muthusubramanian, A. Bruno, et al., Phys. Rev. A 2019, 100 010302(R).
- [37] L.-H. Ren, Y.-H. Shi, J.-J. Chen, H. Fan, Phys. Rev. A 2023, 107 052617.
- [38] D. Zhu, S. Johri, N. M. Linke, K. A. Landsman, C. H. Alderete, N. H. Nguyen, A. Y. Matsuura, T. H. Hsieh, C. Monroe, Proceedings of the National Academy of Sciences 2020, 117, 41 25402.
- [39] J. I. Colless, V. V. Ramasesh, D. Dahlen, M. S. Blok, M. E. Kimchi-Schwartz, J. R. McClean, J. Carter, W. A. de Jong, I. Siddiqi, Phys. Rev. X 2018, 8 011021.
- [40] Google AI Quantum and Collaborators, Science 2020, 369, 6507 1084.
- [41] F. Arute, et al., arXiv:2010.07965 2020.
- [42] S. Stanisic, J. L. Bosse, F. M. Gambetta, R. A. Santos, W. Mruczkiewicz, T. E. O’Brien, E. Ostby, A. Montanaro, Nature Communications 2022, 13, 1 5743.
- [43] J. Sun, X. Yuan, T. Tsunoda, V. Vedral, S. C. Benjamin, S. Endo, Phys. Rev. Appl. 2021, 15 034026.
- [44] R. Majumdar, P. Rivero, F. Metz, A. Hasan, D. S. Wang, In 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), volume 01. 2023 881–887, URL https://doi.org/10.1109/QCE57702.2023.00102.
- [45] Z. Cai, arXiv:2110.05389 2021.
- [46] R. Takagi, S. Endo, S. Minagawa, M. Gu, npj Quantum Information 2022, 8, 1 114.
- [47] Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. Van Den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, et al., Nature 2023, 618, 7965 500.
- [48] Y. Quek, D. S. França, S. Khatri, J. J. Meyer, J. Eisert, arXiv:2210.11505 2023.
- [49] K. Tsubouchi, T. Sagawa, N. Yoshioka, Phys. Rev. Lett. 2023, 131 210601.
- [50] J. J. Wallman, J. Emerson, Phys. Rev. A 2016, 94 052325.
- [51] Z. Cai, S. C. Benjamin, Scientific reports 2019, 9, 1 11281.
- [52] A. Hashim, R. K. Naik, A. Morvan, J.-L. Ville, B. Mitchell, J. M. Kreikebaum, M. Davis, E. Smith, C. Iancu, K. P. O’Brien, I. Hincks, J. J. Wallman, J. Emerson, I. Siddiqi, Phys. Rev. X 2021, 11 041039.
- [53] T. Giurgica-Tiron, Y. Hindy, R. LaRose, A. Mari, W. J. Zeng, In 2020 IEEE International Conference on Quantum Computing and Engineering (QCE). 2020 306–316.
- [54] I. Henao, J. P. Santos, R. Uzdin, npj Quantum Information 2023, 9, 1 120.
- [55] H.-Y. Huang, R. Kueng, J. Preskill, Nature Physics 2020, 16, 10 1050.
- [56] C.-T. Chen, Y.-H. Shi, Z. Xiang, Z.-A. Wang, T.-M. Li, H.-Y. Sun, T.-S. He, X. Song, S. Zhao, D. Zheng, et al., Sci. China-Phys. Mech. Astron. 2022, 65, 11 110362.
- [57] R. McWeeny, Rev. Mod. Phys. 1960, 32 335.
Table of Contents