Efficient Learning of Long-Range and Equivariant Quantum Systems
- URL: http://arxiv.org/abs/2312.17019v2
- Date: Wed, 31 Jan 2024 14:08:52 GMT
- Title: Efficient Learning of Long-Range and Equivariant Quantum Systems
- Authors: \v{S}t\v{e}p\'an \v{S}m\'id, Roberto Bondesan
- Abstract summary: 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.
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.
- Score: 9.427635404752936
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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 $1$D
long-range and disordered systems with up to $128$ 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.
Related papers
- Quantum topological data analysis via the estimation of the density of
states [17.857341127079305]
We develop a quantum topological data analysis protocol based on the estimation of the density of states (DOS) of the Laplacian.
We test our protocol on noiseless and noisy quantum simulators and run examples on IBM quantum processors.
arXiv Detail & Related papers (2023-12-12T09:43:04Z) - A hybrid method for quantum dynamics simulation [2.6340447642310383]
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition.
Our method predicts observables of a quantum state in the long time by using data from a set of short time measurements from a quantum computer.
arXiv Detail & Related papers (2023-07-27T23:43:13Z) - Exponentially Improved Efficient and Accurate Machine Learning for
Quantum Many-body States with Provable Guarantees [0.0]
We provide theoretical guarantees for efficient and accurate learning of quantum many-body states and their properties.
Our results provide model-independent applications not restricted to ground states of gapped Hamiltonians.
arXiv Detail & Related papers (2023-04-10T02:22:36Z) - Efficient learning of ground & thermal states within phases of matter [1.1470070927586014]
We consider two related tasks: (a) estimating a parameterisation of a given Gibbs state and expectation values of Lipschitz observables on this state; and (b) learning the expectation values of local observables within a thermal or quantum phase of matter.
arXiv Detail & Related papers (2023-01-30T14:39:51Z) - Towards Neural Variational Monte Carlo That Scales Linearly with System
Size [67.09349921751341]
Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors.
The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems.
We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
arXiv Detail & Related papers (2022-12-21T19:00:04Z) - Neural network enhanced measurement efficiency for molecular
groundstates [63.36515347329037]
We adapt common neural network models to learn complex groundstate wavefunctions for several molecular qubit Hamiltonians.
We find that using a neural network model provides a robust improvement over using single-copy measurement outcomes alone to reconstruct observables.
arXiv Detail & Related papers (2022-06-30T17:45:05Z) - Scalable approach to many-body localization via quantum data [69.3939291118954]
Many-body localization is a notoriously difficult phenomenon from quantum many-body physics.
We propose a flexible neural network based learning approach that circumvents any computationally expensive step.
Our approach can be applied to large-scale quantum experiments to provide new insights into quantum many-body physics.
arXiv Detail & Related papers (2022-02-17T19:00:09Z) - Learning quantum many-body systems from a few copies [1.5229257192293197]
Estimating physical properties of quantum states from measurements is one of the most fundamental tasks in quantum science.
We identify conditions on states under which it is possible to infer the expectation values of all quasi-local observables of a state.
We show that this constitutes a provable exponential improvement in the number of copies over state-of-the-art tomography protocols.
arXiv Detail & Related papers (2021-07-07T16:21:51Z) - Consistency of mechanistic causal discovery in continuous-time using
Neural ODEs [85.7910042199734]
We consider causal discovery in continuous-time for the study of dynamical systems.
We propose a causal discovery algorithm based on penalized Neural ODEs.
arXiv Detail & Related papers (2021-05-06T08:48:02Z) - Out-of-time-order correlations and the fine structure of eigenstate
thermalisation [58.720142291102135]
Out-of-time-orderors (OTOCs) have become established as a tool to characterise quantum information dynamics and thermalisation.
We show explicitly that the OTOC is indeed a precise tool to explore the fine details of the Eigenstate Thermalisation Hypothesis (ETH)
We provide an estimation of the finite-size scaling of $omega_textrmGOE$ for the general class of observables composed of sums of local operators in the infinite-temperature regime.
arXiv Detail & Related papers (2021-03-01T17:51:46Z) - Multipole Graph Neural Operator for Parametric Partial Differential
Equations [57.90284928158383]
One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data.
We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity.
Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
arXiv Detail & Related papers (2020-06-16T21:56:22Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.