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:2110.06390

Learning ground states of quantum Hamiltonians with graph networks

Dmitrii Kochkov, Tobias Pfaff, Álvaro Sánchez‐González, Peter Battaglia, Bryan K. Clark

Published Oct 12, 2021• 37 citations
arXivHTMLPDF

Abstract

Solving for the lowest energy eigenstate of the many-body Schrodinger equation is a cornerstone problem that hinders understanding of a variety of quantum phenomena. The difficulty arises from the exponential nature of the Hilbert space which casts the governing equations as an eigenvalue problem of exponentially large, structured matrices. Variational methods approach this problem by searching for the best approximation within a lower-dimensional variational manifold. In this work we use graph neural networks to define a structured variational manifold and optimize its parameters to find high quality approximations of the lowest energy solutions on a diverse set of Heisenberg Hamiltonians. Using graph networks we learn distributed representations that by construction respect underlying physical symmetries of the problem and generalize to problems of larger size. Our approach achieves state-of-the-art results on a set of quantum many-body benchmark problems and works well on problems whose solutions are not positive-definite. The discussed techniques hold promise of being a useful tool for studying quantum many-body systems and providing insights into optimization and implicit modeling of exponentially-sized objects.

DOI
10.48550/arxiv.2110.06390

Related papers

Solving Quantum Many-Particle Models with Graph Attention Network

Qi-Hang 启航 Yu 于, Zi-Jing 子敬 Lin 林

Deep learning methods have been shown to be effective in representing ground-state wavefunctions of quantum many-body systems, however the existing approaches cannot be easily used for non-square like or large systems. Here, we propose a variational ansatz based on the graph attention network (GAT) which learns distributed latent representations and can be used on non-square lattices. The GAT-based ansatz has a computational complexity that grows linearly with the system size and can be extended to large systems naturally. Numerical results show that our method achieves the state-of-the-art results on spin-1/2 J 1–J 2 Heisenberg models over the square, honeycomb, triangular, and kagome lattices with different interaction strengths and lattice sizes (up to 24 × 24 for square lattice). The method also provides excellent results for the ground states of transverse field Ising models on square lattices. The GAT-based techniques are efficient and versatile and hold promise for studying large quantum many-body systems with exponentially sized objects.

Chinese Physics Letters•Mar 1, 2024•5 citations

Improving Generalization and Trainability of Quantum Eigensolvers via Graph Neural Encoding

Jungyun Lee, Daniel K. Park

Determining the ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and combinatorial optimization, yet it is often classically intractable due to the exponential growth of Hilbert space with system size. Even on fault-tolerant quantum computers, quantum algorithms with convergence guarantees -- such as quantum phase estimation and quantum subspace methods -- require an initial state with sufficiently large overlap with the true ground state to be effective. Variational quantum eigensolvers (VQEs) are natural candidates for preparing such states; however, standard VQEs typically exhibit poor generalization, requiring retraining for each Hamiltonian instance, and often suffer from barren plateaus, where gradients can vanish exponentially with circuit depth and system size. To address these limitations, we propose an end-to-end representation learning framework that combines a graph autoencoder with a classical neural network to generate VQE parameters that generalize across Hamiltonian instances. By encoding interaction topology and coupling structure, the proposed model produces high-overlap initial states without instance-specific optimization. Through extensive numerical experiments on families of one- and two-local Hamiltonians, we demonstrate improved generalization and trainability, manifested as reduced test error and a significantly milder decay of gradient variance. We further show that our method substantially accelerates convergence in quantum subspace-based eigensolvers, highlighting its practical impact for downstream quantum algorithms.

quant-pharXiv:2602.19752•Machine Learning Science and Technology•Feb 24, 2026•1 citation

Learning eigenstates of quantum many-body Hamiltonians within the symmetric subspaces using neural network quantum states

Shuai-Ting Bao, Dian Wu, Pan Zhang +1 more

The exploration of neural network quantum states has become widespread in studies of complicated quantum many-body systems. However, achieving high precision remains challenging due to the exponential growth of Hilbert space size and the intricate sign structures. Utilizing symmetries of the physical system, we propose a method to evaluate and sample the variational Ansatz within a symmetric subspace. This approach isolates different symmetry sectors, reducing the relevant Hilbert space size by a factor approximately proportional to the size of the symmetry group. It is inspired by exact diagonalization techniques and the work of Choo et al., [Phys. Rev. Lett. 121, 167204 (2018)]. We validate our method using the frustrated spin-$\frac{1}{2}\phantom{\rule{4pt}{0ex}}{J}_{1}\text{\ensuremath{-}}{J}_{2}$ antiferromagnetic Heisenberg chain, and we compare its performance to the case without symmetrization. The results indicate that our symmetric subspace approach achieves a substantial improvement over the full Hilbert space on optimizing the Ansatz, reducing the energy error by orders of magnitude. We also compare the results on degenerate eigenstates with different quantum numbers, highlighting the advantage of operating within a smaller Hilbert subspace.

arXiv:2407.20065•Physical review. B./Physical review. B•Apr 18, 2025•3 citations

Variational-Correlations Approach to Quantum Many-body Problems

Arbel Haim, Richard Kueng, Gil Refael

We investigate an approach for studying the ground state of a quantum many-body Hamiltonian that is based on treating the correlation functions as variational parameters. In this approach, the challenge set by the exponentially-large Hilbert space is circumvented by approximating the positivity of the density matrix, order-by-order, in a way that keeps track of a limited set of correlation functions. In particular, the density-matrix description is replaced by a correlation matrix whose dimension is kept linear in system size, to all orders of the approximation. Unlike the conventional variational principle which provides an upper bound on the ground-state energy, in this approach one obtains a lower bound instead. By treating several one-dimensional spin $1/2$ Hamiltonians, we demonstrate the ability of this approach to produce long-range correlations, and a ground-state energy that converges to the exact result. Possible extensions, including to higher-excited states are discussed.

arXiv:2001.06510•Jan 17, 2020•29 citations

Approximating Ground State Energies and Wave Functions of Physical Systems with Neural Networks

Lema, Cesar, Anna Choromanska

Quantum theory has been remarkably successful in providing an understanding of physical systems at foundational scales. Solving the Schrödinger equation provides full knowledge of all dynamical quantities of the physical system. However closed form solutions to this equation are only available for a few systems and approximation methods are typically used to find solutions. In this paper we address the problem of solving the time independent Schrödinger equation for the ground state solution of physical systems. We propose using end-to-end deep learning approach in a variational optimization scheme for approximating the ground state energies and wave functions of these systems. A neural network realizes a universal trial wave function and is trained in an unsupervised learning framework by optimizing the expectation value of the Hamiltonian of a physical system. The proposed approach is evaluated on physical systems consisting of a particle in a box with and without a perturbation. We demonstrate that our approach obtains approximations of ground state energies and wave functions that are highly accurate, which makes it a potentially plausible candidate for solving more complex physical systems for which analytical solutions are beyond reach.

arXiv:2011.10694•Nov 21, 2020•1 citation

A Transferable Machine Learning Approach to Predict Optimized Orbitals for Electronic Structure Problems

Lucas van der Horst, Maniraman Periyasamy, Abhishek Y. Dubey +3 more

Variational quantum eigensolver ansätze hold considerable promise for ground-state energy calculations on near-term quantum hardware, yet most promising ansatz designs currently strongly depend on how well the molecular orbital basis captures the electronic correlation of the system. Computing optimized orbital coefficients via classical routines is computationally expensive and must be performed independently for each molecular geometry -- a bottleneck that limits scalability across chemical space. We present a graph neural network framework that predicts optimized orbital coefficients directly from molecular geometry and pair-wise bonding structure. Trained on hydrogenic systems of modest size ($H_4$ and $H_6$) across tens of thousands of geometries, our model transfers to larger, unseen systems ($H_8$, $H_{10}$ and $H_{12}$) without retraining -- demonstrating strong out-of-distribution generalization with respect to system size. When evaluating on structured and random configurations, and comparing against energies obtained with full classical optimization, our model reaches mean absolute energy errors $\mathcal{O}(10^2)$ and $\mathcal{O}(10)$ milli-Hartrees, respectively. Beyond energy estimation, the predicted orbitals serve as high-quality warm-start initializations that substantially reduce optimizer iterations to ground-state energy convergence. These results establish graph neural networks as an effective and scalable strategy for accelerating orbital optimization in hybrid quantum-classical workflows, directly reducing the classical pre-processing overhead that currently limits the practical deployment of variational quantum eigensolver on near-term quantum hardware.

quant-pharXiv:2605.04174•May 7, 2026•2 citations
Solving for the lowest energy eigenstate of the many-body Schrodinger equation is a cornerstone problem that hinders understanding of a variety of quantum phenomena. The difficulty arises from the exponential nature of the Hilbert space which casts the governing equations as an eigenvalue problem of exponentially large, structured matrices. Variational methods approach this problem by searching for the best approximation within a lower-dimensional variational manifold. In this work we use graph neural networks to define a structured variational manifold and optimize its parameters to find high quality approximations of the lowest energy solutions on a diverse set of Heisenberg Hamiltonians. Using graph networks we learn distributed representations that by construction respect underlying physical symmetries of the problem and generalize to problems of larger size. Our approach achieves state-of-the-art results on a set of quantum many-body benchmark problems and works well on problems whose solutions are not positive-definite. The discussed techniques hold promise of being a useful tool for studying quantum many-body systems and providing insights into optimization and implicit modeling of exponentially-sized objects.
Deep learning methods have been shown to be effective in representing ground-state wavefunctions of quantum many-body systems, however the existing approaches cannot be easily used for non-square like or large systems. Here, we propose a variational ansatz based on the graph attention network (GAT) which learns distributed latent representations and can be used on non-square lattices. The GAT-based ansatz has a computational complexity that grows linearly with the system size and can be extended to large systems naturally. Numerical results show that our method achieves the state-of-the-art results on spin-1/2 J 1–J 2 Heisenberg models over the square, honeycomb, triangular, and kagome lattices with different interaction strengths and lattice sizes (up to 24 × 24 for square lattice). The method also provides excellent results for the ground states of transverse field Ising models on square lattices. The GAT-based techniques are efficient and versatile and hold promise for studying large quantum many-body systems with exponentially sized objects.
Determining the ground state of a many-body Hamiltonian is a central problem across physics, chemistry, and combinatorial optimization, yet it is often classically intractable due to the exponential growth of Hilbert space with system size. Even on fault-tolerant quantum computers, quantum algorithms with convergence guarantees -- such as quantum phase estimation and quantum subspace methods -- require an initial state with sufficiently large overlap with the true ground state to be effective. Variational quantum eigensolvers (VQEs) are natural candidates for preparing such states; however, standard VQEs typically exhibit poor generalization, requiring retraining for each Hamiltonian instance, and often suffer from barren plateaus, where gradients can vanish exponentially with circuit depth and system size. To address these limitations, we propose an end-to-end representation learning framework that combines a graph autoencoder with a classical neural network to generate VQE parameters that generalize across Hamiltonian instances. By encoding interaction topology and coupling structure, the proposed model produces high-overlap initial states without instance-specific optimization. Through extensive numerical experiments on families of one- and two-local Hamiltonians, we demonstrate improved generalization and trainability, manifested as reduced test error and a significantly milder decay of gradient variance. We further show that our method substantially accelerates convergence in quantum subspace-based eigensolvers, highlighting its practical impact for downstream quantum algorithms.
The exploration of neural network quantum states has become widespread in studies of complicated quantum many-body systems. However, achieving high precision remains challenging due to the exponential growth of Hilbert space size and the intricate sign structures. Utilizing symmetries of the physical system, we propose a method to evaluate and sample the variational Ansatz within a symmetric subspace. This approach isolates different symmetry sectors, reducing the relevant Hilbert space size by a factor approximately proportional to the size of the symmetry group. It is inspired by exact diagonalization techniques and the work of Choo et al., [Phys. Rev. Lett. 121, 167204 (2018)]. We validate our method using the frustrated spin-$\frac{1}{2}\phantom{\rule{4pt}{0ex}}{J}_{1}\text{\ensuremath{-}}{J}_{2}$ antiferromagnetic Heisenberg chain, and we compare its performance to the case without symmetrization. The results indicate that our symmetric subspace approach achieves a substantial improvement over the full Hilbert space on optimizing the Ansatz, reducing the energy error by orders of magnitude. We also compare the results on degenerate eigenstates with different quantum numbers, highlighting the advantage of operating within a smaller Hilbert subspace.
We investigate an approach for studying the ground state of a quantum many-body Hamiltonian that is based on treating the correlation functions as variational parameters. In this approach, the challenge set by the exponentially-large Hilbert space is circumvented by approximating the positivity of the density matrix, order-by-order, in a way that keeps track of a limited set of correlation functions. In particular, the density-matrix description is replaced by a correlation matrix whose dimension is kept linear in system size, to all orders of the approximation. Unlike the conventional variational principle which provides an upper bound on the ground-state energy, in this approach one obtains a lower bound instead. By treating several one-dimensional spin 1/21/21/2 Hamiltonians, we demonstrate the ability of this approach to produce long-range correlations, and a ground-state energy that converges to the exact result. Possible extensions, including to higher-excited states are discussed.
Quantum theory has been remarkably successful in providing an understanding of physical systems at foundational scales. Solving the Schrödinger equation provides full knowledge of all dynamical quantities of the physical system. However closed form solutions to this equation are only available for a few systems and approximation methods are typically used to find solutions. In this paper we address the problem of solving the time independent Schrödinger equation for the ground state solution of physical systems. We propose using end-to-end deep learning approach in a variational optimization scheme for approximating the ground state energies and wave functions of these systems. A neural network realizes a universal trial wave function and is trained in an unsupervised learning framework by optimizing the expectation value of the Hamiltonian of a physical system. The proposed approach is evaluated on physical systems consisting of a particle in a box with and without a perturbation. We demonstrate that our approach obtains approximations of ground state energies and wave functions that are highly accurate, which makes it a potentially plausible candidate for solving more complex physical systems for which analytical solutions are beyond reach.
Variational quantum eigensolver ansätze hold considerable promise for ground-state energy calculations on near-term quantum hardware, yet most promising ansatz designs currently strongly depend on how well the molecular orbital basis captures the electronic correlation of the system. Computing optimized orbital coefficients via classical routines is computationally expensive and must be performed independently for each molecular geometry -- a bottleneck that limits scalability across chemical space. We present a graph neural network framework that predicts optimized orbital coefficients directly from molecular geometry and pair-wise bonding structure. Trained on hydrogenic systems of modest size (H4H_4H4​ and H6H_6H6​) across tens of thousands of geometries, our model transfers to larger, unseen systems (H8H_8H8​, H10H_{10}H10​ and H12H_{12}H12​) without retraining -- demonstrating strong out-of-distribution generalization with respect to system size. When evaluating on structured and random configurations, and comparing against energies obtained with full classical optimization, our model reaches mean absolute energy errors O(102)\mathcal{O}(10^2)O(102) and O(10)\mathcal{O}(10)O(10) milli-Hartrees, respectively. Beyond energy estimation, the predicted orbitals serve as high-quality warm-start initializations that substantially reduce optimizer iterations to ground-state energy convergence. These results establish graph neural networks as an effective and scalable strategy for accelerating orbital optimization in hybrid quantum-classical workflows, directly reducing the classical pre-processing overhead that currently limits the practical deployment of variational quantum eigensolver on near-term quantum hardware.