Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.06939

Essentially No Energy Barrier Between Independent Fermionic Neural Quantum State Minima

David D. Dai, Marin Soljačić

cond-mat.dis-nncond-mat.mes-hallcond-mat.str-elphysics.comp-phquant-phSubmitted Jan 11, 2026• Announced Jan 13, 2026• 1 citation
arXivHTMLPDF

Abstract

Neural quantum states (NQS) have proven highly effective in representing quantum many-body wavefunctions, but their loss landscape remains poorly understood and debated. Here, we demonstrate that the NQS loss landscape is more benign and similar to conventional deep learning than previously thought, exhibiting mode connectivity: independently trained NQS are connected by paths in parameter space with essentially no energy barrier. To construct these paths, we develop GeoNEB, a path optimizer integrating efficient stochastic reconfiguration with the nudged elastic band method for constructing minimum energy paths. For the strongly interacting six-electron quantum dot modeled by a $1.6$M-parameter Psiformer, we find two independent minima with expected energy barrier $\sim10^{-5}$ times smaller than the system's overall energy scale and $\sim10^{-3}$ times smaller than the linear path's barrier. The path respects physical symmetry in addition to achieving low energy, with the angular momentum remaining well quantized throughout. Our work is the first to construct optimized paths between independently trained NQS, and it suggests that the NQS loss landscape may not be as pathological as once feared.

Comments
8 pages, 7 figures

Related papers

Symmetry Constraints Regularize Neural Quantum State Learning

Turbasu Chatterjee, Manas Sajjan, Songbo Xie +4 more

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.

quant-pharXiv:2608.08798•Aug 11, 2026•0 citations

One More Time: Revisiting Neural Quantum States from a Reinforcement Learning Perspective

Juan Agustín Duque, Sergio García Heredia, Vinicius Hernandes +4 more

Neural quantum states (NQS) provide a flexible and scalable framework for approximating quantum many-body wavefunctions. Among NQS parameterizations, autoregressive models are especially attractive because they enable exact, independent sampling from the Born distribution, avoiding the autocorrelation and mixing issues of Markov chain methods. Yet their optimization remains comparatively underexplored: Adam is a scalable method but ignores function space geometry, while stochastic reconfiguration is principled but costly and numerically fragile in large models. To address this gap, we show that variational energy minimization can be viewed as an advantage policy-gradient problem over the Born distribution, motivating trust-region optimization for NQS training. We introduce Proximal Wavefunction Optimization (PWO), a principled trust-region algorithm that clips probability-ratio changes in the amplitude channel and phase increments in the phase channel. PWO avoids explicit matrix inversion, reuses samples across multiple updates, and combines the scalability of first-order optimization with theoretical guarantees. Across Ising and frustrated $J_1$-$J_2$ one- and two-dimensional spin systems, PWO improves stability and wall-clock convergence over Adam, minSR, and SPRING. Finally, we fine-tune a $1.5$B-parameter RWKV-7 model, demonstrating NQS optimization at a scale over three orders of magnitude beyond prior work.

cs.LGCross-listedarXiv:2607.02292•Jul 3, 2026•1 citation

Empowering deep neural quantum states through efficient optimization

Ao Chen, Markus Heyl

Abstract Computing the ground state of interacting quantum matter is a long-standing challenge, especially for complex two-dimensional systems. Recent developments have highlighted the potential of neural quantum states to solve the quantum many-body problem by encoding the many-body wavefunction into artificial neural networks. However, this method has faced the critical limitation that existing optimization algorithms are not suitable for training modern large-scale deep network architectures. Here, we introduce a minimum-step stochastic-reconfiguration optimization algorithm, which allows us to train deep neural quantum states with up to 10 6 parameters. We demonstrate our method for paradigmatic frustrated spin-1/2 models on square and triangular lattices, for which our trained deep networks approach machine precision and yield improved variational energies compared to existing results. Equipped with our optimization algorithm, we find numerical evidence for gapless quantum-spin-liquid phases in the considered models, an open question to date. We present a method that captures the emergent complexity in quantum many-body problems through the expressive power of large-scale artificial neural networks.

arXiv:2302.01941•Nature Physics•Jul 1, 2024•155 citations

Exploring the Effect of Basis Rotation on NQS Performance

Sven Benjamin Kožić, Vinko Zlatić, Fabio Franchini +1 more

Neural Quantum States (NQS) are powerful variational representations of quantum many-body wavefunctions, yet their performance depends sensitively on the chosen basis. Using an exactly solvable one-dimensional Ising model, we show that local basis rotations leave the minimization landscape unchanged while relocating the exact ground state in parameter space. This provides a controlled framework to disentangle representational limitations from optimization-induced trainability effects. This geometric displacement, quantified through information-geometric measures, can steer optimization of shallow architectures toward saddle points and high-curvature regions. As a result, low energy errors may coexist with an incorrect wavefunction structure. By comparing energy and infidelity optimization within the same variational architectures, we show that optimization failure can persist even when the rotated target state remains representable. Our results identify a geometric mechanism contributing to basis dependence in NQS and motivate landscape-aware variational design.

quant-pharXiv:2512.17893•Dec 22, 2025•3 citations

Scalable imaginary time evolution with neural network quantum states

Eimantas Ledinauskas, Egidijus Anisimovas

The representation of a quantum wave function as a neural network quantum state (NQS) provides a powerful variational ansatz for finding the ground states of many-body quantum systems. Nevertheless, due to the complex variational landscape, traditional methods often employ the computation of quantum geometric tensor, consequently complicating optimization techniques. Contributing to efforts aiming to formulate alternative methods, we introduce an approach that bypasses the computation of the metric tensor and instead relies exclusively on first-order gradient descent with Euclidean metric. This allows for the application of larger neural networks and the use of more standard optimization methods from other machine learning domains. Our approach leverages the principle of imaginary time evolution by constructing a target wave function derived from the Schrödinger equation, and then training the neural network to approximate this target. We make this method adaptive and stable by determining the optimal time step and keeping the target fixed until the energy of the NQS decreases. We demonstrate the benefits of our scheme via numerical experiments with 2D J_1-J_2 J 1 − J 2 , Heisenberg model, which showcase enhanced stability and energy accuracy in comparison to direct energy loss minimization. Importantly, our approach displays competitiveness with the well-established density matrix renormalization group method and NQS optimization with stochastic reconfiguration.

arXiv:2307.15521•SciPost Physics•Dec 6, 2023•14 citations

Quantum Walk-Based Optimization of Deep Neural Networks

Jincheng Zhang

This paper investigates the potential of quantum walks to optimize deep neural networks. Traditional deep learning training relies on gradient descent methods, which can be computationally expensive and prone to getting trapped in local minima. We propose a novel approach utilizing a quantum walk algorithm to explore the loss landscape of a neural network more efficiently. The core idea involves mapping the loss surface of the network to a quantum walk environment, allowing the walker to simultaneously explore multiple possible updates, thereby increasing the chances of escaping local minima and converging to a global minimum. We formally define the quantum walk model and explore its potential advantages in terms of exploration and convergence speed. This work presents a theoretical framework and outlines a potential strategy for integrating quantum walk algorithms into the deep learning training process. The effectiveness of this approach hinges on the ability to accurately represent the complex loss surface of a deep neural network within a quantum mechanical framework.

•Aug 29, 2026•0 citations
Neural quantum states (NQS) have proven highly effective in representing quantum many-body wavefunctions, but their loss landscape remains poorly understood and debated. Here, we demonstrate that the NQS loss landscape is more benign and similar to conventional deep learning than previously thought, exhibiting mode connectivity: independently trained NQS are connected by paths in parameter space with essentially no energy barrier. To construct these paths, we develop GeoNEB, a path optimizer integrating efficient stochastic reconfiguration with the nudged elastic band method for constructing minimum energy paths. For the strongly interacting six-electron quantum dot modeled by a 1.61.61.6M-parameter Psiformer, we find two independent minima with expected energy barrier ∼10−5\sim10^{-5}∼10−5 times smaller than the system's overall energy scale and ∼10−3\sim10^{-3}∼10−3 times smaller than the linear path's barrier. The path respects physical symmetry in addition to achieving low energy, with the angular momentum remaining well quantized throughout. Our work is the first to construct optimized paths between independently trained NQS, and it suggests that the NQS loss landscape may not be as pathological as once feared.
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-ZZZ 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.
Neural quantum states (NQS) provide a flexible and scalable framework for approximating quantum many-body wavefunctions. Among NQS parameterizations, autoregressive models are especially attractive because they enable exact, independent sampling from the Born distribution, avoiding the autocorrelation and mixing issues of Markov chain methods. Yet their optimization remains comparatively underexplored: Adam is a scalable method but ignores function space geometry, while stochastic reconfiguration is principled but costly and numerically fragile in large models. To address this gap, we show that variational energy minimization can be viewed as an advantage policy-gradient problem over the Born distribution, motivating trust-region optimization for NQS training. We introduce Proximal Wavefunction Optimization (PWO), a principled trust-region algorithm that clips probability-ratio changes in the amplitude channel and phase increments in the phase channel. PWO avoids explicit matrix inversion, reuses samples across multiple updates, and combines the scalability of first-order optimization with theoretical guarantees. Across Ising and frustrated J1J_1J1​-J2J_2J2​ one- and two-dimensional spin systems, PWO improves stability and wall-clock convergence over Adam, minSR, and SPRING. Finally, we fine-tune a 1.51.51.5B-parameter RWKV-7 model, demonstrating NQS optimization at a scale over three orders of magnitude beyond prior work.
Abstract Computing the ground state of interacting quantum matter is a long-standing challenge, especially for complex two-dimensional systems. Recent developments have highlighted the potential of neural quantum states to solve the quantum many-body problem by encoding the many-body wavefunction into artificial neural networks. However, this method has faced the critical limitation that existing optimization algorithms are not suitable for training modern large-scale deep network architectures. Here, we introduce a minimum-step stochastic-reconfiguration optimization algorithm, which allows us to train deep neural quantum states with up to 10 6 parameters. We demonstrate our method for paradigmatic frustrated spin-1/2 models on square and triangular lattices, for which our trained deep networks approach machine precision and yield improved variational energies compared to existing results. Equipped with our optimization algorithm, we find numerical evidence for gapless quantum-spin-liquid phases in the considered models, an open question to date. We present a method that captures the emergent complexity in quantum many-body problems through the expressive power of large-scale artificial neural networks.
Neural Quantum States (NQS) are powerful variational representations of quantum many-body wavefunctions, yet their performance depends sensitively on the chosen basis. Using an exactly solvable one-dimensional Ising model, we show that local basis rotations leave the minimization landscape unchanged while relocating the exact ground state in parameter space. This provides a controlled framework to disentangle representational limitations from optimization-induced trainability effects. This geometric displacement, quantified through information-geometric measures, can steer optimization of shallow architectures toward saddle points and high-curvature regions. As a result, low energy errors may coexist with an incorrect wavefunction structure. By comparing energy and infidelity optimization within the same variational architectures, we show that optimization failure can persist even when the rotated target state remains representable. Our results identify a geometric mechanism contributing to basis dependence in NQS and motivate landscape-aware variational design.
The representation of a quantum wave function as a neural network quantum state (NQS) provides a powerful variational ansatz for finding the ground states of many-body quantum systems. Nevertheless, due to the complex variational landscape, traditional methods often employ the computation of quantum geometric tensor, consequently complicating optimization techniques. Contributing to efforts aiming to formulate alternative methods, we introduce an approach that bypasses the computation of the metric tensor and instead relies exclusively on first-order gradient descent with Euclidean metric. This allows for the application of larger neural networks and the use of more standard optimization methods from other machine learning domains. Our approach leverages the principle of imaginary time evolution by constructing a target wave function derived from the Schrödinger equation, and then training the neural network to approximate this target. We make this method adaptive and stable by determining the optimal time step and keeping the target fixed until the energy of the NQS decreases. We demonstrate the benefits of our scheme via numerical experiments with 2D J_1-J_2 J 1 − J 2 , Heisenberg model, which showcase enhanced stability and energy accuracy in comparison to direct energy loss minimization. Importantly, our approach displays competitiveness with the well-established density matrix renormalization group method and NQS optimization with stochastic reconfiguration.
This paper investigates the potential of quantum walks to optimize deep neural networks. Traditional deep learning training relies on gradient descent methods, which can be computationally expensive and prone to getting trapped in local minima. We propose a novel approach utilizing a quantum walk algorithm to explore the loss landscape of a neural network more efficiently. The core idea involves mapping the loss surface of the network to a quantum walk environment, allowing the walker to simultaneously explore multiple possible updates, thereby increasing the chances of escaping local minima and converging to a global minimum. We formally define the quantum walk model and explore its potential advantages in terms of exploration and convergence speed. This work presents a theoretical framework and outlines a potential strategy for integrating quantum walk algorithms into the deep learning training process. The effectiveness of this approach hinges on the ability to accurately represent the complex loss surface of a deep neural network within a quantum mechanical framework.