- The experiment does not test the claim
As far as I can tell, Adam is run on exact gradients, and the shot budget enters only through the analytic resolution in Tables 7 and 8. The paper does not say how the training gradients are computed, but no shot count is attached to the training runs in Tables 3, 6 and 10. If this is right, shot noise never enters the optimization, and whether the variance is above or below the resolution limit has no effect on the training runs. Adam is also invariant to diagonal rescaling of the gradients (Kingma and Ba, 2015), so a smaller exact gradient does not by itself slow the optimizer down at these sizes.
Barren plateaus are usually considered fatal because the number of shots required to resolve the gradient grows like the inverse of the variance, which is exponential in n (see Cerezo et al., Nature Communications 2021, and the review of Larocca et al., Nature Reviews Physics 2025). Table 9 reports this quantity, and at n=10 it is 465 shots per term, which is a modest budget. To test whether training succeeds below the resolution limit, the training itself has to run with a finite number of shots. Cerezo et al. (Nature Communications, 2021) do this for a quantum autoencoder with up to 100 qubits and find that the global cost can be trained only for the smallest sizes they consider, while the local cost trains in all cases. So the statement in the abstract and Section 1 that barren plateau papers report only variance decay is not accurate.
The claim itself is weaker than the abstract suggests. The fourth predicate in Table 1 ("single shot bar is degenerate") holds because the single-shot bar is crossed at the smallest system, and in Section 4 the authors add that "any claim relative to it is trivially true and we do not use it". The claim in Section 1 is stated relative to exactly this bar, and the abstract reports "literal single shot gap = 7" as a principal quantity. At the reference budget of 100 shots per term, only one further qubit count (n=9) is trained past the resolution limit (Table 7, "trainable qubits past shot floor" is 1), which is not "several qubit counts". The verdict therefore rests either on a bar the authors call trivial or on a single system size, with 3 seeds and a success criterion that is not stated.
Even the failure at n=10 is barely resolved with 3 seeds. The final ⟨Z0⟩ is −0.8087±0.1840, an interval that extends to −0.993, and the corresponding value at n=9 is not reported. No measurement links this failure to the variance. The final value improves by only 0.0084 when the Adam budget is tripled (Table 3), which looks more like convergence to a poor local minimum than a vanishing gradient, and local minima are a separate obstacle to training (Anschuetz and Kiani, Nature Communications 2022).
These issues bear directly on the only scientific claim in the paper, so I view them as decisive. Even with shot noise in the training, the qubit count at which decay and trainability "actually diverge" would be set by the chosen shot budget rather than by the circuit, and I do not see what new understanding of barren plateaus the paper offers.
- The experiment is never described clearly
The paper never describes its circuit or its training procedure. Section 3 begins with "The construction is the one described in Section 1", but Section 1 contains no construction, and the reader has to piece together the ansatz, the observable and the optimizer from entries of Tables 3 to 11. Several quantities that are crucial to the results are not defined: the distribution of the parameter draws, which partial derivative (or which average over parameters) the variance refers to, how the 10 "structurally zero-gradient parameters" in Table 11 are treated, the learning rate, the success threshold behind "largest trainable qubits", and the rule that turns the data into the predicate "decay precedes untrainability". In Section 4 the authors write "We report every quantity the experiment recorded rather than a selected subset", but Tables 10 and 11 give per-size values only at n=2 and n=10, Figure 2 refers to recorded quantities that appear in no table. Appendix A, which is said to list all values along with their origin, contains one sentence and no table.
Contributions (ii) to (iv) of the paper are about complete, machine-derived reporting, so these gaps undermine the methodological contribution as well as the scientific one. As written, the experiment cannot be reproduced or checked from the paper.
Author Response to Reviewer FePW: Gradient Estimator, Circuit Spec, and Tables
We thank Reviewer FePW for the constructive review and for noting our gradient verification checks and matched circuit-observable design. We have completely rewritten the manuscript and executed new finite-shot training experiments to answer all three of your questions.
1. Gradient Estimator in Adam, Finite-Shot Training Evidence & Resolution Derivation (Question 1)
Q1: What gradient estimator was used in Adam’s updates? Does “trainability past the shot floor” refer exclusively to ideal-gradient optimization, or to training with the stated finite measurement budget? ... how is the resolution derived from the actual shifted-expectation statistics?
2. Complete Circuit, Initialization, Light-Cone, Optimizer & Per-Size n=2…10 Results (Questions 2 & 3)
In Section 3 and Tables 2–4 (plus Appendix B), we provide a complete, self-contained specification: