mlsanityData to 7 Oct 2026

Learning ground states of gapped quantum Hamiltonians with Kernel Methods

arXiv 2303.08902 ↗First posted 15 Mar 2023quant-ph cs.LG physics.comp-phcited by 2

Not on the map. Why?

Abstract (arXiv)

Neural network approaches to approximate the ground state of quantum hamiltonians require the numerical solution of a highly nonlinear optimization problem. We introduce a statistical learning approach that makes the optimization trivial by using kernel methods. Our scheme is an approximate realization of the power method, where supervised learning is used to learn the next step of the power iteration. We show that the ground state properties of arbitrary gapped quantum hamiltonians can be reached with polynomial resources under the assumption that the supervised learning is efficient. Using kernel ridge regression, we provide numerical evidence that the learning assumption is verified by applying our scheme to find the ground states of several prototypical interacting many-body quantum systems, both in one and two dimensions, showing the flexibility of our approach.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 68 references that are in the map. First posted on arXiv 15 Mar 2023.

Builds on

8 of 68 references.

References · 8

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2019Neural Tangents: Fast and Easy Infinite Neural Networks in Pythoncited by 149
  3. 2013The Noisy Power Method: A Meta Algorithm with Applicationscited by 58
  4. 2021NetKet 3: Machine Learning Toolbox for Many-Body Quantum Systemscited by 27
  5. 2020Neural network wave functions and the sign problemcited by 20
  6. 2022Scalable neural quantum states architecture for quantum chemistrycited by 9
  7. 2021Infinite Neural Network Quantum States: Entanglement and Training Dynamicscited by 4
  8. 2016Complex-Valued Kernel Methods for Regressioncited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.