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:2007.09788 · Physical review. B./Physical review. B

Coarse-grained spectral projection: A deep learning assisted approach to quantum unitary dynamics

Pinchen Xie, E Weinan

Published Jan 28, 2021• 4 citations
arXivHTMLPDF

Abstract

We propose the coarse-grained spectral projection method (CGSP), a deep learning assisted approach for tackling quantum unitary dynamic problems with an emphasis on quench dynamics. We show that CGSP can extract spectral components of many-body quantum states systematically with a sophisticated neural network quantum ansatz. CGSP fully exploits the linear unitary nature of the quantum dynamics and is potentially superior to other quantum Monte Carlo methods for ergodic dynamics. Preliminary numerical results on one-dimensional XXZ models with periodic boundary conditions are carried out to demonstrate the practicality of CGSP.

DOI
10.1103/physrevb.103.024304

Related papers

Projected Inverse Iteration: An Eigenvalue Approach to Ground-State Computation with Neural Quantum States

Hang Zhang, Victor Armegioiu, Juan Carrasquilla +4 more

Deep learning offers a powerful approach to quantum many-body problems via neural network wavefunctions, but their optimization remains a severe bottleneck. Existing optimization methods, including natural gradient descent and stochastic reconfiguration, suffer from spectral gap-dependent convergence that limits their effectiveness on systems fraught with competing orders and nearly degenerate ground states, such as frustrated magnets and strongly correlated electron materials. Here, we introduce Projected Inverse Iteration (PII) by re-framing the ground-state search as an eigenvalue problem. PII achieves rapid, gap-insensitive convergence while preserving the favorable polynomial computational scaling of stochastic reconfiguration. Demonstrated on challenging two-dimensional spin systems, including the highly frustrated $J_1$-$J_2$ model, PII outperforms standard optimization techniques and presents a promising algorithmic strategy for discovering complex quantum states in the presence of small spectral gaps. More broadly, PII can be interpreted as a novel natural gradient method tailored for eigenvalue problems, opening up its application to related challenges within deep learning.

quant-pharXiv:2606.07825•Jun 9, 2026•3 citations

Neural Projected Quantum Dynamics: a systematic study

Luca Gravina, Vincenzo Savona, Filippo Vicentini

We investigate the challenge of classical simulation of unitary quantum dynamics with variational Monte Carlo approaches, addressing the instabilities and high computational demands of existing methods. By systematically analyzing the convergence of stochastic infidelity optimizations, examining the variance properties of key stochastic estimators, and evaluating the error scaling of multiple dynamical discretization schemes, we provide a thorough formalization and significant improvements to the projected time-dependent Variational Monte Carlo (p-tVMC) method. We benchmark our approach on a two-dimensional Ising quench, achieving state-of-the-art performance. This work establishes p-tVMC as a powerful framework for simulating the dynamics of large-scale two-dimensional quantum systems, surpassing alternative VMC strategies on the investigated benchmark problems.

arXiv:2410.10720•Quantum•Jul 22, 2025•32 citations

Generalized Lanczos method for systematic optimization of neural-network quantum states

Jia-Qi Wang, Rong-Qiang He, Zhong-Yi Lu

Recently, artificial intelligence for science has made significant inroads into various fields of natural science research. In the field of quantum many-body computation, researchers have developed numerous ground state solvers based on neural-network quantum states (NQSs), achieving ground state energies with accuracy comparable to or surpassing traditional methods such as variational Monte Carlo methods, density matrix renormalization group, and quantum Monte Carlo methods. Here, we combine supervised learning, variational Monte Carlo (VMC), and the Lanczos method to develop a systematic approach to improving the NQSs of many-body systems, which we refer to as the NQS Lanczos method. The algorithm mainly consists of two parts: the supervised learning part and the VMC optimization part. Through supervised learning, the Lanczos states are represented by the NQSs. Through VMC, the NQSs are further optimized. We analyze the reasons for the underfitting problem and demonstrate how the NQS Lanczos method systematically improves the energy in the highly frustrated regime of the two-dimensional Heisenberg $J_1$-$J_2$ model. Compared to the existing method that combines the Lanczos method with the restricted Boltzmann machine, the primary advantage of the NQS Lanczos method is its linearly increasing computational cost.

arXiv:2502.01264•Physical review. B./Physical review. B•Jan 13, 2026•2 citations

Machine learning approach to dynamical properties of quantum many-body systems

Douglas Hendry, Adrian E. Feiguin

Variational representations of quantum states abound and have successfully been used to guess ground-state properties of quantum many-body systems. Some are based on partial physical insight (Jastrow, Gutzwiller-projected, and fractional quantum Hall states, for instance), and others operate as a black box that may contain information about the underlying structure of entanglement and correlations (tensor networks, neural networks) and offer the advantage of a large set of variational parameters that can be efficiently optimized. However, using variational approaches to study excited states and, in particular, calculating the excitation spectrum, remains a challenge. We present a variational method to calculate the dynamical properties and spectral functions of quantum many-body systems in the frequency domain, where the Green's function of the problem is encoded in the form of a restricted Boltzmann machine (RBM). We introduce a natural gradient descent approach to solve linear systems of equations and use Monte Carlo to obtain the dynamical correlation function. In addition, we propose a strategy to regularize the results that improves the accuracy dramatically. As an illustration, we study the dynamical spin structure factor of the one dimensional ${J}_{1}\ensuremath{-}{J}_{2}$ Heisenberg model. The method is general and can be extended to other variational forms.

arXiv:1907.01384•Physical review. B./Physical review. B•Dec 12, 2019•43 citations

Autoregressive Projective Quantum Monte Carlo: From a Hermitian to a Non-Hermitian Perspective

Lavoisier Wah, Remmy Zen, Flore K. Kunst

Accurately determining the ground-state properties of quantum many-body systems remains a central challenge. In this work, we introduce an autoregressive projective quantum Monte Carlo (PQMC) framework that leverages recurrent neural networks (RNNs) to guide the stochastic dynamics. By incorporating autoregressive sampling into PQMC, we demonstrate substantial improvements in accuracy compared to standard unguided PQMC, while retaining polynomial computational cost. We benchmark our approach against conventional variational RNN ansätze and find that the autoregressive PQMC consistently achieves lower energies and higher fidelity, regardless of system size or whether the Hamiltonian is Hermitian or non-Hermitian. Our results highlight the versatility and power of neural-guided PQMC methods, paving the way for promising scalable simulations of low-energy states in complex quantum many-body systems.

quant-pharXiv:2608.09496•Aug 11, 2026•2 citations

Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schrödinger Equation

Kirill Neklyudov, Jannes Nys, Luca Thiede +4 more

Solving the quantum many-body Schrödinger equation is a fundamental and challenging problem in the fields of quantum physics, quantum chemistry, and material sciences. One of the common computational approaches to this problem is Quantum Variational Monte Carlo (QVMC), in which ground-state solutions are obtained by minimizing the energy of the system within a restricted family of parameterized wave functions. Deep learning methods partially address the limitations of traditional QVMC by representing a rich family of wave functions in terms of neural networks. However, the optimization objective in QVMC remains notoriously hard to minimize and requires second-order optimization methods such as natural gradient. In this paper, we first reformulate energy functional minimization in the space of Born distributions corresponding to particle-permutation (anti-)symmetric wave functions, rather than the space of wave functions. We then interpret QVMC as the Fisher-Rao gradient flow in this distributional space, followed by a projection step onto the variational manifold. This perspective provides us with a principled framework to derive new QMC algorithms, by endowing the distributional space with better metrics, and following the projected gradient flow induced by those metrics. More specifically, we propose "Wasserstein Quantum Monte Carlo" (WQMC), which uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.

arXiv:2307.07050•neural information processing systems•Jan 1, 2023•10 citations
We propose the coarse-grained spectral projection method (CGSP), a deep learning assisted approach for tackling quantum unitary dynamic problems with an emphasis on quench dynamics. We show that CGSP can extract spectral components of many-body quantum states systematically with a sophisticated neural network quantum ansatz. CGSP fully exploits the linear unitary nature of the quantum dynamics and is potentially superior to other quantum Monte Carlo methods for ergodic dynamics. Preliminary numerical results on one-dimensional XXZ models with periodic boundary conditions are carried out to demonstrate the practicality of CGSP.
Deep learning offers a powerful approach to quantum many-body problems via neural network wavefunctions, but their optimization remains a severe bottleneck. Existing optimization methods, including natural gradient descent and stochastic reconfiguration, suffer from spectral gap-dependent convergence that limits their effectiveness on systems fraught with competing orders and nearly degenerate ground states, such as frustrated magnets and strongly correlated electron materials. Here, we introduce Projected Inverse Iteration (PII) by re-framing the ground-state search as an eigenvalue problem. PII achieves rapid, gap-insensitive convergence while preserving the favorable polynomial computational scaling of stochastic reconfiguration. Demonstrated on challenging two-dimensional spin systems, including the highly frustrated J1J_1J1​-J2J_2J2​ model, PII outperforms standard optimization techniques and presents a promising algorithmic strategy for discovering complex quantum states in the presence of small spectral gaps. More broadly, PII can be interpreted as a novel natural gradient method tailored for eigenvalue problems, opening up its application to related challenges within deep learning.
We investigate the challenge of classical simulation of unitary quantum dynamics with variational Monte Carlo approaches, addressing the instabilities and high computational demands of existing methods. By systematically analyzing the convergence of stochastic infidelity optimizations, examining the variance properties of key stochastic estimators, and evaluating the error scaling of multiple dynamical discretization schemes, we provide a thorough formalization and significant improvements to the projected time-dependent Variational Monte Carlo (p-tVMC) method. We benchmark our approach on a two-dimensional Ising quench, achieving state-of-the-art performance. This work establishes p-tVMC as a powerful framework for simulating the dynamics of large-scale two-dimensional quantum systems, surpassing alternative VMC strategies on the investigated benchmark problems.
Recently, artificial intelligence for science has made significant inroads into various fields of natural science research. In the field of quantum many-body computation, researchers have developed numerous ground state solvers based on neural-network quantum states (NQSs), achieving ground state energies with accuracy comparable to or surpassing traditional methods such as variational Monte Carlo methods, density matrix renormalization group, and quantum Monte Carlo methods. Here, we combine supervised learning, variational Monte Carlo (VMC), and the Lanczos method to develop a systematic approach to improving the NQSs of many-body systems, which we refer to as the NQS Lanczos method. The algorithm mainly consists of two parts: the supervised learning part and the VMC optimization part. Through supervised learning, the Lanczos states are represented by the NQSs. Through VMC, the NQSs are further optimized. We analyze the reasons for the underfitting problem and demonstrate how the NQS Lanczos method systematically improves the energy in the highly frustrated regime of the two-dimensional Heisenberg J1J_1J1​-J2J_2J2​ model. Compared to the existing method that combines the Lanczos method with the restricted Boltzmann machine, the primary advantage of the NQS Lanczos method is its linearly increasing computational cost.
Variational representations of quantum states abound and have successfully been used to guess ground-state properties of quantum many-body systems. Some are based on partial physical insight (Jastrow, Gutzwiller-projected, and fractional quantum Hall states, for instance), and others operate as a black box that may contain information about the underlying structure of entanglement and correlations (tensor networks, neural networks) and offer the advantage of a large set of variational parameters that can be efficiently optimized. However, using variational approaches to study excited states and, in particular, calculating the excitation spectrum, remains a challenge. We present a variational method to calculate the dynamical properties and spectral functions of quantum many-body systems in the frequency domain, where the Green's function of the problem is encoded in the form of a restricted Boltzmann machine (RBM). We introduce a natural gradient descent approach to solve linear systems of equations and use Monte Carlo to obtain the dynamical correlation function. In addition, we propose a strategy to regularize the results that improves the accuracy dramatically. As an illustration, we study the dynamical spin structure factor of the one dimensional ${J}_{1}\ensuremath{-}{J}_{2}$ Heisenberg model. The method is general and can be extended to other variational forms.
Accurately determining the ground-state properties of quantum many-body systems remains a central challenge. In this work, we introduce an autoregressive projective quantum Monte Carlo (PQMC) framework that leverages recurrent neural networks (RNNs) to guide the stochastic dynamics. By incorporating autoregressive sampling into PQMC, we demonstrate substantial improvements in accuracy compared to standard unguided PQMC, while retaining polynomial computational cost. We benchmark our approach against conventional variational RNN ansätze and find that the autoregressive PQMC consistently achieves lower energies and higher fidelity, regardless of system size or whether the Hamiltonian is Hermitian or non-Hermitian. Our results highlight the versatility and power of neural-guided PQMC methods, paving the way for promising scalable simulations of low-energy states in complex quantum many-body systems.
Solving the quantum many-body Schrödinger equation is a fundamental and challenging problem in the fields of quantum physics, quantum chemistry, and material sciences. One of the common computational approaches to this problem is Quantum Variational Monte Carlo (QVMC), in which ground-state solutions are obtained by minimizing the energy of the system within a restricted family of parameterized wave functions. Deep learning methods partially address the limitations of traditional QVMC by representing a rich family of wave functions in terms of neural networks. However, the optimization objective in QVMC remains notoriously hard to minimize and requires second-order optimization methods such as natural gradient. In this paper, we first reformulate energy functional minimization in the space of Born distributions corresponding to particle-permutation (anti-)symmetric wave functions, rather than the space of wave functions. We then interpret QVMC as the Fisher-Rao gradient flow in this distributional space, followed by a projection step onto the variational manifold. This perspective provides us with a principled framework to derive new QMC algorithms, by endowing the distributional space with better metrics, and following the projected gradient flow induced by those metrics. More specifically, we propose "Wasserstein Quantum Monte Carlo" (WQMC), which uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.