The results indicate that symmetry compilation concentrates the expressive power of NQS on states relevant to the target problem, thereby reducing model size and training cost without sacrificing accuracy.
Abstract
Neural quantum states (NQS) offer highly expressive variational wavefunctions, but their optimization is frequently bottlenecked by redundant parameters and poorly conditioned landscapes. We demonstrate that embedding Hamiltonian symmetries directly into the variational parameterization geometrically regularizes this learning problem. For Boltzmann-family NQS, we enforce symmetries by tying local Pauli-$Z$ generators along physical geometric orbits, analytically collapsing the trainable coefficient space prior to optimization. To quantify the resulting optimization geometry, we introduce a geometric metric built on the Jacobian and Hessian of the optimization landscape. This framework evaluates the fraction of the physically accessible state space that corresponds to high-quality, low-energy solutions. Evaluating our approach on transverse-field Ising (TFIM) and XXZ spin chains shows that symmetry compilation excises the vast majority of parameters while maintaining ground-state accuracy within the resolution of the reported benchmarks. In large TFIM systems, strong spatial constraints compress thousands of parameters down to tens, delivering substantial runtime accelerations. Our geometric diagnostics indicate that symmetry produces a more favorable target-aware geometry by concentrating the reachable state space around low-energy solutions while retaining broad target basins. Together, our results indicate that symmetry compilation concentrates the expressive power of NQS on states relevant to the target problem, thereby reducing model size and training cost without sacrificing accuracy.
This work examines when structured long-range connectivity provides a useful resource, focusing on sparse power-of-two (PWR2) coupling graphs, and identifies circuit geometry and qubit reconfigurability as task-dependent resources for variational algorithms.
Helene M. Losl, Aydin Deger, Andrew J. Daley· 0 citations
We benchmark eight classical optimizers for exact-statevector VQE calculations on a controlled hierarchy of frustrated spin models, ranging from a diagonal Ising glass to transverse-field Ising and anisotropic Heisenberg models. The benchmark includes local, stochastic-gradient, evolutionary, covariance-adaptation, and...
Vojtěch Novák, Ivan Zelinka, Swagatam Das et al.· 3 citations
Annealed gradient descent is established as a lightweight complement to expressive neural architectures, improved sampling strategies for scalable quantum many-body optimization and enables compact neural quantum states to attain chemical accuracy and competitive state-of-the-art performance.
This work shows that minSR can be stabilized through simple regularization techniques, enabling robust training of RNN-based NQS with only a few samples, and offers a promising pathway for using modern optimization techniques with autoregressive NQS to address open questions in quantum simulation.
Adi Attar, A. M. Aboussalah, Mohamed Hibat-Allah· 1 citation
Parametrized quantum circuits (PQCs) form the computational backbone of variational quantum algorithms, yet their practical utility is increasingly constrained by optimisation failures as circuit depth grows. Gradient signals decay rapidly under standard random initialisation, and existing structured approaches abandon...
Thi Thuy Nga Nguyen, John Le, T. Vu et al.· 2026 IEEE International Conf...· 0 citations
This work introduces a machine-learned compact subspace generation protocol based on Restricted Boltzmann Machines, termed QSCI-RBM, and integrates it within the Density Matrix Embedding Theory (DMET) framework, highlighting that RBM-assisted configuration generation produces significantly more compact subspace while p...
A. Patra, V. AnuragK.S., Ruchika Bhat et al.· arXiv.org· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.