- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies uncertainty quantification for quantum Fisher information (QFI) estimation when randomized measurements are combined with a truncated Krylov representation. The authors formulated adaptive stopping as selective uncertainty quantification, with separate sampling and truncation radii and abstention when their sum does not support the requested tolerance.
Critical strengths
The paper identifies a real failure mode in adaptive QFI estimation. A sampling confidence interval can become arbitrarily narrow around a biased truncated target.
The paired study of positivity stabilization is well designed. Comparing full-space and Krylov-first positivity using identical random draws helps isolate the effect of the order in which stabilization and Krylov projection are performed.
Critical weaknesses
The conceptual contribution is relatively limited. The central decomposition is essentially the standard separation of statistical estimation error and approximation bias.
The strongest positive experiment relies on exact within-instance truncation calibration.
The empirical approximation surrogate does not solve the truncation problem.
The central scalability challenge is explicitly left as future work.
Questions for authors
What do the authors consider the main technical novelty beyond the basic decomposition of sampling error and approximation error?
Can the authors provide any finite-sample coverage result for the bootstrap radius used for the nonlinear positivity-plus-QFI estimator?
We appreciate your review. The question on finite-sample coverage was very useful to us, and it led to the main addition of the revision.
We agree that the decomposition itself is standard. For us its value lies in what it exposes. Proposition 1 and Figure 5 show that the adjacent-order change does not bound the approximation error even without sampling noise, so convergence cannot be read off the Krylov iterates. Once this is clear, the order of positivity and projection becomes important, and Krylov-first stabilization removes the false declarations caused by full-space positivity on the low-noise instance (Figure 4). The revision then adds finite-sample bounds on F from shadow data alone. The variational and variance bounds are known. What is new is fitting H on one batch and evaluating it on another, so that the guarantee survives both the data-driven choice of H and adaptive stopping. These bounds stay close to F up to eight qubits, where the randomized-measurement bound of Rath et al. loses much of the QFI (Table 2).
This question pushed us in a productive direction. Rather than analyzing the bootstrap of the nonlinear estimator, we moved the guarantee to a linear quantity, where it can be proved. Once H is fixed, L(H)=Tr(ρA) with A=−2i[H,G]−H2. Proposition 2 (Section 3.3) states that if H depends only on the exploration batch, and L^j is the mean of Tr(AXm) over the first Mj independent confirmation snapshots with empirical Bernstein radius rj at level δ/J, then Pr(∃j≤J: F<L^j−rj)≤δ. The bound therefore holds whenever the run stops. Corollary 2 adds the variance upper bound and gives a two-sided statement, which is reported in 144 of 160 runs from four to eight qubits at a 25% tolerance, with median error 8% and no false report.
We agree with both points for the submitted version, and this is exactly what the revision tries to address. The 10% result of Figure 4 uses the calibrated radius, and dK,M is used to allocate resources, not to bound the error. The new bounds use neither calibration nor the exact state. The lower bound also catches failed declarations from data (General Response). On scalability, the number of shadows needed for a 5% radius stays at 218 to 219 from four to eight qubits (Table 2).
We would be glad to discuss any of this further.