- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper introduces fragment classification, a quantum learning task motivated by Hilbert-space fragmentation. Given labeled Schur-basis states, the objective is to learn a circuit that identifies sector and basis labels while generalizing across multiplicity labels not represented in training. The authors construct a symmetry-preserving QNN from local Hamiltonian generators and analyze its trainability under assumptions including polynomial effective sector dimensions and full eigenstate thermalization. The paper claims inverse-polynomial gradient scaling and the absence of spurious local minima under polynomial overparameterization. It also argues that existing algebra-based classical simulation methods cannot be directly applied without additional algebraic information. Small numerical experiments on Temperley–Lieb systems illustrate training behavior. Classical hardness remains conjectural, and no empirical quantum advantage is demonstrated.
Critical strengths
S1: The paper exploits physical symmetries through quantum operations without requiring an explicit classical description of the underlying algebra. This identifies a potentially meaningful distinction between a quantum learning procedure and existing algebra-based simulation techniques.
S2: The QNN construction also provides a concrete mechanism for generalization across multiplicity labels. Because the circuit acts identically on equivalent multiplicity sectors, this generalization follows from its structure rather than from observing exponentially many training examples.
Critical weaknesses
W1: The trainability analysis does not clearly establish the polynomial-time learning guarantee required by Definition 1. The main argument combines a gradient second-moment bound with a claimed absence of spurious local minima. These properties alone do not provide a polynomial bound on the number of optimization steps or quantum measurements needed to achieve a specified classification error. In particular, the gradient bound concerns an approximate distribution over randomized architectures, rather than a quantitative convergence guarantee along training trajectories. A complete argument connecting the landscape results to the stated poly(L,1/ϵ) learning complexity is necessary because efficient learnability is the paper’s central claim.
W2: The evidence for the intended quantum–classical distinction and its practical relevance is also limited. Section 3.3 identifies obstacles to applying particular algebra-based simulation methods, but provides no formal classical-hardness reduction. The numerical experiments contain no classical baseline comparisons and use small Temperley–Lieb instances that the authors acknowledge admit efficient classical simulation. They therefore illustrate QNN trainability without testing the setting responsible for the proposed computational advantage. Moreover, the experimental application in Section 4 is only proposed: the paper does not establish that accessible training states and the relevant physical sectors satisfy its theoretical assumptions. These limitations leave the significance of the separation insufficiently substantiated beyond the conditional theoretical construction.
Questions for authors
None.
We thank the reviewer for their comments and suggestions regarding our manuscript. We respond to the reviewer's comments on the weaknesses of the work.
It is true that we do not give an explicit bound on the number of optimization steps necessary to achieve a certain classification error. Doing so for a QNN ansatz such as the one we consider is generally not a tractable task, and the conditions on barren plateaus and local minima that we study are widely accepted proxies for efficient trainability in the quantum machine learning literature (see, e.g., arXiv:2408.11901 (ICLR 2025); Nat. Commun. 15, 7172 (2024); Nat. Commun. 15, 7171 (2024); and Nat. Commun. 16, 7907 (2025)). While these conditions do not formally guarantee that the optimization of a model will necessarily converge within a given number of steps, they eliminate the two main mechanisms that are known to prevent a QNN model from being efficiently trainable using local optimizers.
We agree with the reviewer that establishing a formal classical-hardness reduction would further strengthen our results, and we hope to pursue this direction in future work. Nevertheless, we believe that identifying a learning setting that circumvents all currently known classical simulation techniques for algebraically structured quantum systems is itself a significant contribution. In particular, our results identify a concrete setting in which provable trainability does not immediately come at the expense of classical simulability, in contrast to many existing results on trainable QNNs (see, e.g., arXiv:2408.11901 (ICLR 2025) and Nat. Commun. 16, 7907 (2025)). This presents an interesting dichotomy: either our construction provides a route toward quantum computational advantage, or its classical simulation will require fundamentally new dequantization techniques that go beyond existing algebraic approaches. We believe that both possibilities are of substantial interest to the quantum machine learning community, and that identifying this setting is a valuable step toward establishing rigorous quantum–classical separations for trainable QNNs.