- Rating
- 1(−1)
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes QEM-STEP, a learning-based quantum error mitigation (QEM) method based on pseudo-quantum state perturbations. The method represents the output correction as a weighted sum of Pauli responses. It selects a limited set of perturbation directions by propagating Pauli operators backward through an ideal circuit and uses neural networks to predict the corresponding correction coefficients. The authors provide bounds on the finite-shot variance for response estimation and analyze errors introduced by propagation truncation. They also propose two classical simulation-based strategies for generating training data: iterative gate addition and near-Clifford states. Numerical experiments on small quantum circuits, swap test scenarios, and many-body dynamics with locally applied noise demonstrate that their method can improve QEM accuracy under various settings.
Critical strengths
- The paper introduces a novel QEM method using Pauli responses and demonstrates its advantages on small qubit experiments.
- The writing is clear and easy to follow.
- It proposes two strategies for generating training data that can be classically simulated, reducing the reliance on ideal labels from the target task.
Critical weaknesses
- My primary concerns are the issues of cost and accuracy. For the cost problem, the paper defines backward propagation truncation as:
Questions for authors
See Weaknesses above.
4 comments
Response to Reviewer fkrZ (part 2)
Q4: In the experiments of Table 3, [...] these experiments do not demonstrate that the method is effective on large-qubit systems in a general sense.
Answer: We thank the reviewer for this insightful comment. We agree this experiment should not be interpreted as demonstrating the scalability of QEM-STEP on large quantum systems. We would like to clarify that the primary motivation of this experiment is to evaluate the applicability of QEM-STEP across different types of quantum evolution, rather than to establish scalability solely in terms of qubit count. Specifically, Table 1 consider gate-based quantum circuits, where the evolution is represented by a sequence of quantum gates with associated noise channels. In contrast, the many-body benchmark considers the real-time evolution of a 50-qubit transverse-field Ising system governed by a Hamiltonian, without requiring an explicit gate-based circuit representation for the mitigation model. As discussed in the Introduction, one limitation of existing ML-based QEM methods, such as GTranQEM, is their reliance on circuit encoding to represent quantum evolution. This dependence limits their direct applicability to quantum dynamics that are not provided in an explicit gate-based circuit representation. In contrast, QEM-STEP is formulated through observable responses under noisy quantum evolution and does not require an explicit circuit encoding for its neural predictor. Therefore, an important motivation of our work is to develop a more flexible QEM framework applicable to different representations of quantum evolution. We will revise the experimental description to clarify this motivation.
Q5: [...] if ZNE outperforms the proposed method at medium shot counts, it would not demonstrate the superiority of the proposed method:
Answer: We rerun the ZNE for experiment in Table 3 with 2000 shots for each circuit execution. This increase improves ZNE performance, reducing its MAE from 0.0341 to 0.0239 under amplitude damping and from 0.0311 to 0.0219 under dephasing. Nevertheless, QEM-STEP achieves substantially lower MAEs of 0.0140 and 0.0148, respectively, while maintaining considerably higher CIR values of 0.8381 and 0.8551. Notably, QEM-STEP requires only 12,367 shots per test instance on average, approximately half the increased ZNE budget. This experiment demonstrate the superiority of QEM-STEP over ZNE even with smaller budget.
| Method | Amplitude Damping MAE ↓ | CIR ↑ | Dephasing MAE ↓ | CIR ↑ | Average shots per test instance |
|---|---|---|---|---|---|
| ZNE (original) | 0.0341 | 0.4222 | 0.0311 | 0.4173 | 12,000 |
| ZNE (increase shots) | 0.0239 | 0.4720 | 0.0219 | 0.4472 | 24,000 |
| QEM-STEP | 0.0140 | 0.8381 | 0.0148 | 0.8551 | 12,367 |
Minor: In the revised manuscript, we also update Figure 2 for better visibility and add the definition of and in Lemma 3.1 and Remark 3.2
-
This is very strange. Even if you consider two-qubit gates, doesn't the Pauli expansion ultimately still have to be expanded over the entire n-qubit circuit? Moreover, in your Figure 4, with only 6 qubits, the number of selected Pauli terms is already between 500 and 1000. Isn't that still exponential?
-
In Figure 4, with only 6 qubits, the coefficient magnitudes are already on the order of to . Wouldn't they become even smaller with more qubits? Moreover, a single example alone cannot demonstrate that this holds in other scenarios as well.
In summary, I think this method looks good, but it can hardly be used in practice. Therefore, I choose to lower my score.
Dear Reviewer fkrZ,
Thank you for your thoughtful and constructive feedback. We sincerely appreciate the time and effort you have devoted to evaluating our work.
First, we would like to clarify that restricting a circuit to one- and two-qubit gates does not eliminate the possibility of Pauli expansion over an -qubit system. Rather, our previous response addressed your Q1 aimed to explain how sequential Top- truncation controls the size of the intermediate representation. Specifically, at each propagation step, we retain at most Pauli strings, and applying a two-qubit gate generates at most candidate terms before merging and truncation. Consequently, the computational cost of each propagation step depends on the retained support size , rather than directly on the full Pauli-space dimension . Furthermore, we would also like to clarify that observing 500–1000 selected Pauli terms for a fixed six-qubit system does not, by itself, establish exponential scaling. For six qubits, the full Pauli space contains terms, so the selected support remains smaller than the full space.
Second, we agree that individual Pauli coefficient magnitudes may decrease as the number of qubits increases. However, their behavior depends on the circuit structure and the distribution of Pauli coefficients. Importantly, our selection procedure does not rely on the assumption that individual coefficients remain large. Instead, it retains the largest-magnitude coefficients at each propagation step, while Theorem 3.3 bounds the accumulated truncation error in terms of the discarded squared Pauli mass, together with the finite-shot estimation error. Thus, the approximation quality is characterized by the collective contribution of the discarded coefficients rather than their individual magnitudes alone.
We thank the reviewer again for the valuable comments, which have helped us clarify our approach.
Best regards, The Authors
Response to Reviewer fkrZ
Dear Reviewer fkrZ,
Thanks for your constructive feedback and thoughtful review. Below, we provide detailed responses to your questions and concerns. We hope that our clarifications adequately address your concerns and encourage you to reconsider your evaluation of our paper.
Answer: We thank the reviewer for raising this important concern regarding support selection cost. Our truncation algorithm follows the Pauli propagation framework of [1]. In general, Pauli propagation can generate exponentially many terms. However, our method considers Pauli observables and gates acting on at most two qubits, which are sufficient for universal quantum computation. Since each gate expands a Pauli string into at most 16 terms and we retain at most K terms after each propagation step, the intermediate expansion Al−1 contains at most 16K terms. Therefore, the computational cost of each propagation step scales linearly with K, avoiding exponential growth in the number of qubits. To provide empirical evidence, we have added Figure 4 to the revised manuscript, which illustrates the distributions of the selected K∗ and Pauli coefficients α. The results indicate that the selected support sizes remain below the full Pauli-space dimension 4n in the evaluated circuits.
Answer: We thank the reviewer for this comment. We would like to clarify that the proposed algorithm involves two distinct procedures: sequential Top-K Pauli truncation and optimization of the support size K. We agree that sequential Top-K truncation is a greedy procedure and does not guarantee a globally optimal final Pauli support. Nevertheless, at each propagation step, retaining the K largest Pauli coefficients minimizes the instantaneous truncation error in the coefficient ℓ2 norm, assuming exact knowledge of the current Pauli expansion. Our theorem explicitly accounts for the accumulated errors of these sequential truncations and does not assume global support optimality. Importantly, the selection of $K^* $ itself is not greedy. As detailed in Algorithm 1 of the appendix, we evaluate the objective 2E(K)2+K/(2M) over candidate values of K and retain the best score. The two early-stopping conditions preserve global optimality with respect to this objective: when E(K)=0, larger values of K cannot reduce the truncation error further; when (K+1)/(2M) exceeds the best score, the nonnegative truncation term ensures that no subsequent candidate can improve the objective. Therefore, the use of argmin is justified for selecting $K^* $ with respect to the derived theoretical error-bound criterion. We emphasize that this does not imply global optimality of the resulting Pauli support or minimization of the actual mitigation error. We will clarify this distinction in the main text to avoid ambiguity.
Answer: We thank the reviewer for raising this important concern regarding measurement scalability. We acknowledge that Pauli coefficients can become exponentially small as the number of qubits increases. However, their exact magnitudes depend on the structure of the observable, quantum evolution, and noise, rather than solely on the number of qubits. Although ci=2nαi, this normalization factor scales both the signal and its statistical uncertainty equally and therefore does not, by itself, degrade the signal-to-noise ratio. Nevertheless, we acknowledge that estimating small Pauli coefficients can become challenging under finite-shot measurements and quantum noise. Our framework addresses this challenge in two ways. First, Pauli-propagation-based support selection restricts measurements to a reduced set of informative Pauli directions, avoiding the need to estimate all 4n coefficients. Second, Theorem 3.3 explicitly characterizes the trade-off between truncation error and finite-shot uncertainty, providing a principled criterion for selecting the support size K. To provide empirical evidence, we have added Figure 4 to the revised manuscript, which illustrates the distributions of the selected $K^* $ and Pauli coefficients α. The results indicate that the selected support sizes remain below the full Pauli-space dimension 4n and our method select the coefficients with large magnitude. This reduces the number of required coefficient estimates and can improve their robustness to finite-shot uncertainty.
[1] Shao, Yuguo, Song Cheng, and Zhengwei Liu. "Pauli propagation: Simulating quantum spin dynamics via operator complexity." arXiv e-prints (2025): arXiv-2510.