Efficiency of neural quantum states in light of the quantum geometric
tensor
- URL: http://arxiv.org/abs/2402.01565v2
- Date: Sun, 3 Mar 2024 21:33:57 GMT
- Title: Efficiency of neural quantum states in light of the quantum geometric
tensor
- Authors: Sidhartha Dash, Filippo Vicentini, Michel Ferrero and Antoine Georges
- Abstract summary: Neural quantum state (NQS) ans"atze have shown promise in variational Monte Carlo algorithms.
We show that the accuracy of our ansatz saturates with $alpha$ in both cases.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Neural quantum state (NQS) ans\"atze have shown promise in variational Monte
Carlo algorithms by their theoretical capability of representing any quantum
state. However, the reason behind the practical improvement in their
performance with an increase in the number of parameters is not fully
understood. In this work, we systematically study the efficiency of restricted
Boltzmann Machines (RBMs) to represent the ground states in different phases of
the spin-1 bilinear-biquadratic model, as the hidden layer density $\alpha$
increases. We train our ansatz by minimizing two different loss functions: 1)
energy, and 2) infidelity of the NQS ansatz w.r.t. that of the exact ground
state. We observe that the accuracy of our ansatz saturates with $\alpha$ in
both cases. We demonstrate that this can be explained by looking at the
spectrum of the quantum geometric tensor (QGT). We find that the rank of the
QGT saturates beyond a certain $\alpha$, and we emphasize that it corresponds
to the \textit{dimension of the relevant manifold} for an optimized NQS. This
provides a useful diagnostics for the practical representation power of an NQS
ansatz.
Related papers
- Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits [0.0]
We employ a quantum computer to solve a low-energy effective Hamiltonian for spin defects in diamond and aluminium nitride.
The spin singlet state is difficult to compute using density functional theory (DFT), which should be described by multiple Slater determinants.
This is the first instance of an encoded PITE circuit being executed on a trapped-ion quantum computer.
arXiv Detail & Related papers (2024-07-15T09:07:54Z) - Spin coupling is all you need: Encoding strong electron correlation on quantum computers [0.0]
We show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states.
Our work paves the way towards scalable quantum simulation of electronic structure for classically challenging systems.
arXiv Detail & Related papers (2024-04-29T17:14:21Z) - The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$.
In particular, we design global protocols for small set expansion, unique games, and PCP verification.
We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
arXiv Detail & Related papers (2024-02-29T01:35:46Z) - 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) - Barren plateaus in quantum tensor network optimization [0.0]
We analyze the variational optimization of quantum circuits inspired by matrix product states (qMPS), tree tensor networks (qTTN), and the multiscale entanglement renormalization ansatz (qMERA)
We show that the variance of the cost function gradient decreases exponentially with the distance of a Hamiltonian term from the canonical centre in the quantum tensor network.
arXiv Detail & Related papers (2022-09-01T08:42:35Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Quantum Circuits For Two-Dimensional Isometric Tensor Networks [0.0]
We give a detailed description of a quantum circuit version of the 2D tensor network (isoTNS) ansatz which we call qisoTNS.
We benchmark the performance of qisoTNS on two different 2D spin 1/2 Hamiltonians.
arXiv Detail & Related papers (2021-08-05T18:00:26Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z) - Roadmap for quantum simulation of the fractional quantum Hall effect [0.0]
A major motivation for building a quantum computer is that it provides a tool to efficiently simulate strongly correlated quantum systems.
In this work, we present a detailed roadmap on how to simulate a two-dimensional electron gas---cooled to absolute zero and pierced by a strong magnetic field---on a quantum computer.
arXiv Detail & Related papers (2020-03-05T10:17:21Z) - Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings.
In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$.
We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z)
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.