Efficient Learning of Long-Range and Equivariant Quantum Systems
arXiv:2312.17019 · doi:10.22331/q-2025-01-15-1597
Abstract
In this work, we consider a fundamental task in quantum many-body physics - finding and learning ground states of quantum Hamiltonians and their properties. Recent works have studied the task of predicting the ground state expectation value of sums of geometrically local observables by learning from data. For short-range gapped Hamiltonians, a sample complexity that is logarithmic in the number of qubits and quasipolynomial in the error was obtained. Here we extend these results beyond the local requirements on both Hamiltonians and observables, motivated by the relevance of long-range interactions in molecular and atomic systems. For interactions decaying as a power law with exponent greater than twice the dimension of the system, we recover the same efficient logarithmic scaling with respect to the number of qubits, but the dependence on the error worsens to exponential. Further, we show that learning algorithms equivariant under the automorphism group of the interaction hypergraph achieve a sample complexity reduction, leading in particular to a constant number of samples for learning sums of local observables in systems with periodic boundary conditions. We demonstrate the efficient scaling in practice by learning from DMRG simulations of D long-range and disordered systems with up to qubits. Finally, we provide an analysis of the concentration of expectation values of global observables stemming from the central limit theorem, resulting in increased prediction accuracy.
51 pages
References in corpus (30)
- Scikit-learn: Machine Learning in Python
- The density-matrix renormalization group in the age of matrix product states
- Quantum information with Rydberg atoms
- Solving the Quantum Many-Body Problem with Artificial Neural Networks
- E(3)-Equivariant Graph Neural Networks for Data-Efficient and Accurate Interatomic Potentials
- Graph Networks as a Universal Machine Learning Framework for Molecules and Crystals
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Many-body localization edge in the random-field Heisenberg chain
- Engineered 2D Ising interactions on a trapped-ion quantum simulator with hundreds of spins
- Realizing a lattice spin model with polar molecules
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Spectral Gap and Exponential Decay of Correlations
- Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks
- Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)
- Matrix product operator representations
- Long-range interacting quantum systems
- Provably efficient machine learning for quantum many-body problems
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Automorphic Equivalence within Gapped Phases of Quantum Lattice Systems
- Machine Learning for Quantum Matter
- Drug design on quantum computers
- Localization phenomena in interacting Rydberg lattice gases with position disorder
- Strictly linear light cones in long-range interacting systems of arbitrary dimensions
- Disorder in quantum many-body systems
- Hierarchy of linear light cones with long-range interactions
- Complete devil's staircase and crystal--superfluid transitions in a dipolar XXZ spin chain: A trapped ion quantum simulation
- Machine Learning from a Continuous Viewpoint
- Random transverse-field Ising chain with long-range interactions
- Improved machine learning algorithm for predicting ground state properties
- Exponentially improved efficient machine learning for quantum many-body states with provable guarantees