Quantum-Inspired Tempering for Ground State Approximation using
Artificial Neural Networks
- URL: http://arxiv.org/abs/2210.11405v2
- Date: Wed, 16 Nov 2022 17:23:33 GMT
- Title: Quantum-Inspired Tempering for Ground State Approximation using
Artificial Neural Networks
- Authors: Tameem Albash, Conor Smith, Quinn Campbell, Andrew D. Baczewski
- Abstract summary: We propose a parallel tempering method that facilitates escape from local minima.
We show that augmenting the training with quantum parallel tempering becomes useful to finding good approximations to the ground states of problem instances.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: A large body of work has demonstrated that parameterized artificial neural
networks (ANNs) can efficiently describe ground states of numerous interesting
quantum many-body Hamiltonians. However, the standard variational algorithms
used to update or train the ANN parameters can get trapped in local minima,
especially for frustrated systems and even if the representation is
sufficiently expressive. We propose a parallel tempering method that
facilitates escape from such local minima. This methods involves training
multiple ANNs independently, with each simulation governed by a Hamiltonian
with a different "driver" strength, in analogy to quantum parallel tempering,
and it incorporates an update step into the training that allows for the
exchange of neighboring ANN configurations. We study instances from two classes
of Hamiltonians to demonstrate the utility of our approach. The first instance
is based on a permutation-invariant Hamiltonian whose landscape stymies the
standard training algorithm by drawing it increasingly to a false local
minimum. The second instance is four hydrogen atoms arranged in a rectangle,
which is an instance of the second quantized electronic structure Hamiltonian
discretized using Gaussian basis functions. We study this problem in a minimal
basis set, which exhibits false minima that can trap the standard variational
algorithm despite the problem's small size. We show that augmenting the
training with quantum parallel tempering becomes useful to finding good
approximations to the ground states of these problem instances.
Related papers
- Optimizing Temperature Distributions for Training Neural Quantum States using Parallel Tempering [0.0]
We show that temperature optimization can significantly increase the success rate of variational algorithms.
We demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network.
arXiv Detail & Related papers (2024-10-30T13:48:35Z) - Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
We use FNOs to model the evolution of random quantum spin systems.
We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
arXiv Detail & Related papers (2024-09-05T07:18:09Z) - Predicting Ground State Properties: Constant Sample Complexity and Deep Learning Algorithms [48.869199703062606]
A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians.
We introduce two approaches that achieve a constant sample complexity, independent of system size $n$, for learning ground state properties.
arXiv Detail & Related papers (2024-05-28T18:00:32Z) - 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) - Ab-Initio Potential Energy Surfaces by Pairing GNNs with Neural Wave
Functions [2.61072980439312]
In this work, we combine a Graph Neural Network (GNN) with a neural wave function to simultaneously solve the Schr"odinger equation for multiple geometries via VMC.
Compared to existing state-of-the-art networks, our Potential Energy Surface Network (PESNet) speeds up training for multiple geometries by up to 40 times while matching or surpassing their accuracy.
arXiv Detail & Related papers (2021-10-11T07:58:31Z) - A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems.
We numerically demonstrate that the MNIST image dataset satisfies such conditions.
We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
arXiv Detail & Related papers (2021-07-19T23:41:03Z) - Parallel Quantum Algorithm for Hamiltonian Simulation [9.680246554758343]
A parallel quantum algorithm is proposed for simulating the dynamics of a large class of Hamiltonians.
The running time of our parallel quantum simulation algorithm measured by the quantum circuit depth has a doubly (poly-)logarithmic dependence.
We show that the total gate depth of our algorithm has a $operatornamepolyloglog (1/epsilon)$ dependence in the parallel setting.
arXiv Detail & Related papers (2021-05-25T12:46:33Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer.
Here, we propose an adaptive approach to construct a low-depth time evolution circuit.
Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
arXiv Detail & Related papers (2020-11-10T18:00:42Z) - Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with
an artificial neural-network correlator ansatz [62.997667081978825]
We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei.
We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
arXiv Detail & Related papers (2020-07-28T14:52:28Z)
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.