- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper introduces a new quantum ansatz, namely the commutator-residual ansatz, along with a sampling strategy called CoPairSite that aims to mitigate barren-plateaus in quantum systems. The paper conjectures that this ansatz has favorable gradient variance under certain conditions and provides numerical evidence to support this conjecture. The numerical experiments also compare this new ansatz with the Hardware Efficient Ansatz (HEA) and demonstrate that the commutator-residual ansatz exhibits larger gradient signals when compared to HEA under similar conditions.
Critical strengths
- The idea of interleaving gates with their conjugates is an interesting idea and could prove fruitful. In particular, the fact that it ties parameter size to strength of application of the commutator (eq 1 and 2) is interesting.
Critical weaknesses
The paper contains many technical weaknesses that I will summarize in two broad points:
- Regarding the writing of the paper, the paper’s presentation needs substantial work. The text does not communicate the ideas of the paper clearly. The text is non-linear, and many concepts are discussed without being properly defined first in the earlier sections. For example, line 074 refers to and without first establishing their meaning. Moreover, the text contains many confusing terms. Some examples include:
The text uses “unit” instead of “unitary” which is not standard terminology and is confusing as the terms can have different mathematical meanings.
The term “verdict” is used throughout the text, and it is not clear if it has a particular definition or the authors simply used it instead of the standard “result.”
The text refers to “Naive” without any clear explanation as to what it is referring to. Line 137 is the first occurrence of the term with the phrase “Naive’s independent position sampling” which makes it seem like “Naive” is the name of a person. The text also includes inconsistent capitalization; compare line 476 to line 137.
The term “decade” is used multiple times throughout the text, and it has no clear established meaning in the context it is used for.
- Regarding the content itself, I have concerns regarding the wording of conjecture 1: It is not clear from the statement how is related to or . This has significant implications for the usefulness of conjecture 1. Moreover, conjecture 1 fixes the input state and forces a 1 qubit local observable. Conjecture 1 is also limited to parameters close to the cost observable site, and it is not clear how a global BP free landscape follows from the behavior of a local subset of parameters. While this setting could be interesting as a theoretical example of no BPs with exponential DLA, it is very restrictive and without a concrete proof, its wider application in the BP literature is not clear.
The overall architecture of the proposed circuit, as I understand it, is repeating blocks of gates assembled from a set of 2-qubit Pauli rotation unitaries. The literature has highlighted several limitations of this “problem agnostic” architecture, Larocca et al. (2025) Section V.A for example. The authors should discuss how CoPairSite addresses these limitations. In particular, the paper does not address whether the gates themselves form a local 2-design, which is relevant in light of Cerezo et al. (2021b).
Questions for authors
- What is the implication of the variance in line 234 for global BP behavior?
2 comments
Thank you for your response.
Regarding the presentation weakness
The problems I have stated go beyond fixing the examples I have included in my review. The author's response mainly concerns fixing the examples I have explicitly pointed out. Given that the authors have not yet provided a revised manuscript, I cannot judge the rewritten paper's clarity. As it stands, my evaluation of the paper's presentation remains and I still believe it misses the mark of quality.
Regarding Conjecture 1 and the content
I thank the authors for clarifying their stated claims.
The problem-agnostic criticism applies broadly to architectures that rely on group coverage. Our claim is narrower and different
I don't understand how the stated architecture does not rely on group coverage, when the pool of operators is explicitly chosen based on its coverage criteria (as I understand).
CoPairSite constrains the generator pair, support, and initialization to a nonuniform, near-identity regime, so the standard 2-design sufficient condition is not the relevant criterion.
Can the authors provide a more rigorous argument to support this claim? It is still unclear whether this statement is true.
If the conjecture holds, it rules out the strongest global failure mode in which every parameter gradient vanishes exponentially.
While true, how is this contribution different from other works such as Gaussian initialization schemes (Zhang et al. 2022) for example? We already have works that through constraining the initialization landscapes (e.g. Gaussian initialization) or through structured training (e.g. Layerwise training Skolik et al. 2021) aim to reduce this global failure. What is the novelty of the contribution compared to other methods discussed in the literature? What are its expected benefits when compared to other approaches? Given my comments regarding the restrictive assumptions of Conjecture 1, how do the authors expect this work to contribute to the wider literature?
I doubt the validity of Conjecture 1 as formulated: wouldn't Fig 3(b) imply that CoPairSite follows the same exponential decay as the other methods, save for some constants?
The central contribution remains the exact construction, its DLA characterization, and the proved gradient mechanism.
Overall, given this characterization, I don't think this work contributes anything novel to the literature as it stands.
I appreciate your time in considering my comments.
Proved construction, local conjecture, and requested clarifications
We thank the reviewer for the detailed reading. The review raises two weaknesses and one question. Some of the content criticism rests on a reading of Conjecture 1 as a global claim, which the paper does not make. We address all three points below.
1. Weakness 1: presentation. The terminology and ordering problems are real and will be corrected. We will replace “unit” with “commutator block,” “verdict” with “comparison” or “result,” and “Naive” with “independent sampling,” defined at first use. We will remove “decade” and state the actual range σ=0.05,…,0.18. Every symbol at line 074 will be defined before that line, and a notation table will be added. We will restructure the paper so that the circuit, notation, and sampling rule precede all interpretive claims, with proofs moved to the appendix.
2. Weakness 2: content. The main proved results are the exact Y-odd DLA, the proof that independent sampling creates identity blocks with zero gradients, the CoPairSite rule that removes this degeneracy, and the exact gradient decomposition into a propagated single-qubit Y expectation. These results are independent of the conjecture and remain valid even if the asymptotic bound is never proved.
Conjecture 1 is deliberately local. It concerns the d=0 parameters, a fixed input, and a local cost. The paper explicitly does not expect a uniform bound over all parameters. The current placement of that disclaimer is too late, so we will move it before the conjecture and rename the result the “cost-adjacent variance conjecture.” We will also state that σ is bounded by an n- and L-independent σ0, with no assumed joint scaling such as σ∼n−p.
The problem-agnostic criticism applies broadly to architectures that rely on group coverage. Our claim is narrower and different: we identify one specific algebraic failure, identity-block degeneracy, and show that a structured ensemble with an exponentially large DLA can avoid uniform concentration. We will add an explicit limitations paragraph citing Larocca et al. (2025), Section V.A, and will not claim general approximation guarantees.
The construction also does not claim that its gates form a local 2-design. CoPairSite constrains the generator pair, support, and initialization to a nonuniform, near-identity regime, so the standard 2-design sufficient condition is not the relevant criterion. We will add a second-moment diagnostic on small systems to quantify the departure from local Haar moments.
3. Question: implication of the 1/poly(n,L) variance for global BP behavior. If the conjecture holds, it rules out the strongest global failure mode in which every parameter gradient vanishes exponentially. It does not imply that all parameters are trainable or that the full landscape is BP-free. That distinction is deliberate, not an unstated global claim.
To measure it, we ran a parameter-resolved experiment separating d=0 from distant parameters. At σ=0.1, the d=0 variance has log-log slopes of −1.01 for θ and −0.97 for ϕ between n=8 and 16. At n=16,σ=0.1, the θ variance is 1.33×10−3 at d=0, 5.40×10−7 at d=1, and 1.33×10−10 at d=2. The local signal persists while distant directions decay sharply.
The reviewer is right that this does not establish a global theorem, and the paper does not present it as one. The distinction between a proved local mechanism and an empirical global claim will be stated explicitly. The central contribution remains the exact construction, its DLA characterization, and the proved gradient mechanism.