- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
In VarQITE, each step solves G_t v_t = f_t with the quantum geometric tensor G_t, and the regularization choice is usually retuned per problem. The paper frames this as regularization transfer: learn, from source QGT/force systems, a map from local spectral descriptors to a regularization action, then deploy it on shifted targets without target-side tuning. It proposes two controllers. ScalarGuard predicts a log-residual on a fixed Tikhonov anchor λ_ref = 10⁻³. SpectralGuard predicts bounded per-mode filter gates. A deterministic verifier falls back to a QNG–Levenberg–Marquardt reference when a learned proposal scores worse on a resolved-subspace McLachlan model. Source tasks are random k-local, Sherrington–Kirkpatrick, and QEC-derived diagonal-Ising Hamiltonians. The evaluation covers clean in-distribution, held-out family/instance, size, depth, and synthetic estimator-noise shifts. The main established result is that SpectralGuard beats QNG–LM on pooled clean structural shifts. Descriptively, SpectralGuard also has the smallest worst-case relative regret (20.9%).
Critical strengths
None
Critical weaknesses
The scope is limited, and the ML contribution is modest for ICLR. Systems have ≤ 18 qubits, the simulations are statevector, the noise is synthetic, and the QEC families reduce to diagonal (classical) Ising Hamiltonians on which every method reaches the floor. The learning component is a small controller over spectral features trained by imitation. With effect sizes of about 0.006 infidelity against the weakest baseline, both the practical and the methodological contribution are thin.
Questions for authors
What does regularization actually correct in the clean regimes? Without estimation noise, the minimum-norm McLachlan solution is already correct. So what is the controller learning there: finite-step nonlinearity, ill-conditioning, or something else? And why should a fixed map from spectral features to gates transfer across Hamiltonian families?
4 comments
Response to Reviewer sBu4 (Part 2/4)
2. What does regularization correct in the clean-QGT regime?
An exact QGT determines the instantaneous McLachlan projection, while the executed variational update is evaluated through its finite-step state fidelity and numerical stability. Our analytic one-qubit example demonstrates that, even with a perfectly conditioned QGT (), two states with identical instantaneous McLachlan velocities can have different finite-step fidelity-optimal velocities.
This distinction is also supported empirically. On 20 matched Random/SK tasks, at , the learned update has a higher instantaneous McLachlan objective than source-fixed ridge (), yet achieves lower one-step infidelity (), with this ranking reversal observed in 20/20 task averages. Separately, in 30 exact-QGT trajectory experiments, the unregularized pseudoinverse triggers numerical failure in 20 tasks; at , its failure-penalized infidelity is 0.66667, compared with 0.01700 for SpectralGuard and 0.01543 for fixed ridge.
These results identify two distinct mechanisms: finite-step state-fidelity mismatch and numerical amplification of weak QGT modes. Together, they establish the numerical role of regularization even when the QGT is exactly available, and provide a direct motivation for learning regularization decisions from finite-step state accuracy.
We have added the analytic example and exact-QGT trajectory experiments to Section 3.1 and Table 1, with the complete matched-state analysis provided in Supplementary Section H.1.
3. Why should the learned rule transfer across Hamiltonian families?
We thank the reviewer for raising this important question. The relevant transfer hypothesis is that regularization depends more directly on the local numerical geometry of the inverse problem than on Hamiltonian identity itself. This is consistent with data-driven numerical linear algebra and cross-instance algorithm configuration, where solver decisions can generalize when conditioned on structural information shared across problem instances (Khodak et al., 2024; Balcan et al., 2022; Bartlett et al., 2022).
We tested this hypothesis directly. In the prespecified family-exclusion benchmark, the evaluated Hamiltonian family is removed from both training and validation. SpectralGuard improves over condition-adaptive QNG–LM on all four non-floor structural shifts, with the 118-group pooled result decreasing trajectory infidelity from 0.05191 to 0.04585 (, 95% CI ).
We further added a targeted post-review experiment on 40 entirely new size/depth-OOD groups. To separate transferred spectral direction from step-size effects, every comparator is rescaled to the same local QGT/Fubini–Study speed. At , SpectralGuard obtains one-step infidelity versus for matched fixed ridge, a 37.4% reduction, with 37/40 groups favorable. Positive-spectrum TSVD gives , while source-selected adaptive LM and a force-aware rule obtain and , respectively. These matched-speed comparisons provide direct evidence that the transferred policy encodes useful directional information beyond step-size control, and characterize its behavior relative to strong adaptive alternatives.
Together, the family-exclusion and matched-speed experiments establish two complementary aspects of transfer: the frozen policy retains its effectiveness across structural distribution shifts, and its learned spectral direction contributes to finite-step accuracy under controlled update speeds. We have added the family-exclusion transfer evidence to Section 4.1 and the new Fubini–Study-speed-matched experiment to Section 4.3, with the full protocol reported in Supplementary Section H.2.
Response to Reviewer sBu4 (Part 3/4)
4. Experimental scale, numerical simulation, and estimator noise
We thank the reviewer for the thoughtful and constructive suggestion concerning experimental scale, numerical simulation, and measurement realism. Our experimental setting is designed around the central question of this work: whether finite-step-informed spectral regularization can be learned from source quantum-geometric inverse problems and transferred to unseen Hamiltonians and circuit geometries. This setting enables a controlled evaluation of the relationship between quantum geometry, regularization decisions, and finite-step state accuracy.
Regarding system scale, our training systems contain 6–12 qubits, while the size-OOD evaluation extends to 14–18 qubits, with additional independent shifts in circuit depth. These ranges provide a meaningful test of quantum-geometric extrapolation, particularly because circuit geometry, parameter redundancy, and the conditioning of the quantum geometric tensor evolve with system size and ansatz depth (McArdle et al., 2019; Stokes et al., 2020; Gomes et al., 2021; Haug et al., 2021). On 30 independent larger-system groups, SpectralGuard achieves a mean trajectory infidelity of 0.08293 versus 0.09547 for the condition-adaptive QNG–LM reference, representing a 13.1% relative reduction with a paired 95% confidence interval of . These results demonstrate the effectiveness of the learned regularization policy under increased system size and previously unseen quantum geometries.
Larger-scale variational quantum dynamics introduces a related but distinct challenge: the measurement and computational resources required to construct and evolve the quantum-geometric system. Accordingly, recent scalable approaches employ specialized formulations, including measurement-efficient metric estimation (van Straaten & Koczor, 2021), QGT-free dual evolution (Gacon et al., 2024), random-measurement imaginary-time evolution (Kolotouros et al., 2025), and operator-projected dynamics (Anuar et al., 2026). These developments primarily address resource-efficient quantum evolution, whereas our work focuses on learning transferable regularization decisions for the QGT-based inverse problem. The two directions therefore investigate complementary aspects of variational quantum dynamics.
Regarding statevector simulation, exact state references allow us to evaluate the finite-step consequences of different regularization decisions under matched initial conditions, identical QGT/force inputs, and controlled distribution shifts. This follows the established numerical evaluation methodology in variational quantum dynamics (McArdle et al., 2019; Gomes et al., 2021; Gacon et al., 2024). A corresponding hardware study would additionally require sufficiently accurate QGT/force measurements, reproducible comparisons across multiple Hamiltonian families and circuit configurations, and reliable reference-state characterization throughout complete trajectories. These requirements motivate a dedicated experimental design that integrates measurement efficiency, device calibration, and state-characterization protocols. Our controlled numerical evaluation directly isolates the transferable regularization mechanism and provides a rigorous basis for that subsequent experimental development.
Regarding estimator noise, our perturbations are applied directly to the estimated QGT and force, providing controlled tests of the numerical quantities governing variational updates. This experimental interface is motivated by established analyses of quantum-geometric measurement uncertainty and its influence on variational dynamics (van Straaten & Koczor, 2021; Koczor & Benjamin, 2022; Zhang et al., 2026). We have further strengthened the evidence through two additional comparisons. Table 2 reports results on 108 clean structural-OOD groups and 16 moderate-noise OOD groups. Under moderate estimator perturbations, the frozen SpectralGuard policy without verification achieves 0.05286 versus 0.09543 mean trajectory infidelity for raw-QGT TSVD, a 44.6% reduction. Table 3 additionally examines severe estimator perturbations. At noise strengths 0.003 and 0.01, the verification mechanism reduces mean infidelity by 30.8% and 39.2%, respectively, with the associated fallback behavior explicitly characterized. These experiments provide complementary evidence for the learned spectral response and the numerical verification mechanism across different estimator regimes.
Response to Reviewer sBu4 (Part 4/4)
We find the reviewer's suggestion of extending this investigation to substantially larger systems and physical quantum hardware particularly interesting and constructive. We are highly interested in pursuing a dedicated large-scale formulation that combines scalable quantum-geometric estimation, resource-aware spectral regularization, and hardware-specific validation. The revised manuscript now presents the larger-system results in Table 1, the additional clean and moderate-noise comparisons in Table 2, and the severe-noise verification results in Table 3, strengthening the experimental evidence for finite-step-aware spectral regularization and its transfer across quantum-geometric distribution shifts.
References
Afkham, B. M., Chung, J., & Chung, M. (2021). Learning Regularization Parameters of Inverse Problems via Deep Neural Networks. Inverse Problems, 37(10), 105017.
Amos, B. (2023). Tutorial on Amortized Optimization. Foundations and Trends in Machine Learning, 16(5), 592–732.
Andrychowicz, M., et al. (2016). Learning to Learn by Gradient Descent by Gradient Descent. Advances in Neural Information Processing Systems (NeurIPS 2016).
Anuar, A. A., et al. (2026). Operator-Projected Variational Quantum Imaginary Time Evolution. Journal of Physics A: Mathematical and Theoretical, 59, 245301.
Arisaka, S., & Li, Q. (2023). Principled Acceleration of Iterative Numerical Methods Using Machine Learning. Proceedings of the 40th International Conference on Machine Learning (ICML 2023), PMLR 202, 1041–1059.
Balcan, M.-F., et al. (2022). Provably Tuning the ElasticNet Across Instances. Advances in Neural Information Processing Systems (NeurIPS 2022).
Bartlett, P., Indyk, P., & Wagner, T. (2022). Generalization Bounds for Data-Driven Numerical Linear Algebra. Proceedings of the 35th Conference on Learning Theory (COLT 2022), PMLR 178, 2013–2040.
Gacon, J., et al. (2024). Variational Quantum Time Evolution Without the Quantum Geometric Tensor. Physical Review Research, 6, 013143.
Gomes, N., et al. (2021). Adaptive Variational Quantum Imaginary Time Evolution Approach for Ground State Preparation. Advanced Quantum Technologies, 4(12), 2100114.
Haug, T., Bharti, K., & Kim, M. S. (2021). Capacity and Quantum Geometry of Parametrized Quantum Circuits. PRX Quantum, 2, 040309.
Khodak, M., et al. (2024). Learning to Relax: Setting Solver Parameters Across a Sequence of Linear System Instances. International Conference on Learning Representations (ICLR 2024).
Koczor, B., & Benjamin, S. C. (2022). Quantum Natural Gradient Generalized to Noisy and Nonunitary Circuits. Physical Review A, 106, 062416.
Kolotouros, I., Joseph, D., & Narayanan, A. K. (2025). Accelerating Quantum Imaginary-Time Evolution with Random Measurements. Physical Review A, 111, 012424.
McArdle, S., et al. (2019). Variational Ansatz-Based Quantum Simulation of Imaginary Time Evolution. npj Quantum Information, 5, 75.
Stokes, J., Izaac, J., Killoran, N., & Carleo, G. (2020). Quantum Natural Gradient. Quantum, 4, 269.
van Straaten, B., & Koczor, B. (2021). Measurement Cost of Metric-Aware Variational Quantum Algorithms. PRX Quantum, 2, 030324.
Wichrowska, O., et al. (2017). Learned Optimizers That Scale and Generalize. Proceedings of the 34th International Conference on Machine Learning (ICML 2017), PMLR 70, 3751–3760.
Zhang, F., et al. (2026). Sampling Noise and Optimized Measurement Distribution in Imaginary-Time Quantum Dynamics Simulations. Advanced Quantum Technologies, 9(9), e70418.
Response to Reviewer sBu4 (Part 1/4)
We thank the reviewer for the careful assessment and constructive suggestions. We appreciate the valuable suggestions regarding the machine-learning contribution, the role of regularization in the clean-QGT regime, the transferability of the learned policy across Hamiltonian families, and the experimental scale and validation methodology. We have further strengthened the manuscript through additional theoretical analysis, targeted experiments, expanded comparisons, and corresponding revisions to the main text and supplementary material. Our point-by-point responses are provided below.
1. Machine-learning contribution
We thank the reviewer for raising the question of whether the learning component constitutes a substantive machine-learning contribution beyond conventional numerical regularization. This is an important point for positioning the work.
The central ML problem in this study is amortized, conditional regularization under distribution shift. Along variational quantum dynamics, the appropriate numerical action changes with the local quantum geometry, force orientation, and trajectory state. The learning problem is therefore to infer this action from source experience and to preserve useful behavior when the Hamiltonian family, circuit dimension, or circuit depth changes. This is distinct from identifying a single globally tuned regularization parameter for a fixed numerical problem.
There is a close methodological precedent in Learning to Relax (Khodak et al., 2024), which formulates parameter selection for a sequence of related linear systems as a learning problem and studies the transition from a globally fixed solver parameter to a context-dependent policy. More broadly, this perspective is consistent with amortized optimization (Amos, 2023), learned optimization across tasks (Andrychowicz et al., 2016; Wichrowska et al., 2017), and learning-augmented iterative numerical methods (Arisaka & Li, 2023). In inverse problems specifically, Afkham et al. (2021) learn instance-dependent regularization parameters rather than solving a new parameter-selection problem for every observation. These works establish the relevant methodological setting: repeated numerical decisions with shared structure can themselves define a learning and generalization problem.
Within that setting, our contribution is more specific than scalar hyperparameter prediction. The learned object is a structured spectral decision rule whose hypothesis class is shared across modes and parameter dimensions, while its supervision is defined by the downstream finite-step quantum-state consequence of the update. These two choices are coupled: dimension-shared spectral structure makes frozen transfer across different QGT sizes well-defined, while trajectory-level supervision makes the learned decision depend on the effect of regularization on executed variational dynamics rather than solely on an algebraic inverse criterion. The subsequent short-horizon rollout refinement is therefore methodologically relevant: the training procedure uses imitation to initialize a policy that is further optimized for finite-step trajectory behavior.
The transfer question is also empirically nontrivial. Source validation exhibits approximately 6.5 orders of magnitude variation in preferred scalar regularization across Hamiltonian families, while family identity is unavailable to the learned policy. Under the frozen evaluation protocol, the same learned spectral rule improves over the condition-adaptive QNG–LM reference in each of the four non-floor clean structural shifts. These observations connect the learning formulation to the quantity being evaluated: whether regularization experience acquired from source quantum-geometric systems can be reused when the inverse systems themselves change.
We have revised the manuscript to state this learning problem explicitly and to position SpectralGuard relative to amortized optimization, learned regularization, and learning-augmented numerical solvers, separately from questions of architectural complexity.