Floating block method for quantum Monte Carlo simulations
- URL: http://arxiv.org/abs/2306.11439v2
- Date: Fri, 27 Oct 2023 13:21:10 GMT
- Title: Floating block method for quantum Monte Carlo simulations
- Authors: Avik Sarkar, Dean Lee, and Ulf-G. Mei{\ss}ner
- Abstract summary: We introduce an algorithm called the floating block method, which solves the problem by performing Euclidean time evolution with two different Hamiltonians and interleaving the corresponding time blocks.
We use the floating block method and nuclear lattice simulations to build eigenvector continuation emulators for energies of $4$He, $8$Be, $12$C, and $16$O nuclei.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum Monte Carlo simulations are powerful and versatile tools for the
quantum many-body problem. In addition to the usual calculations of energies
and eigenstate observables, quantum Monte Carlo simulations can in principle be
used to build fast and accurate many-body emulators using eigenvector
continuation or design time-dependent Hamiltonians for adiabatic quantum
computing. These new applications require something that is missing from the
published literature, an efficient quantum Monte Carlo scheme for computing the
inner product of ground state eigenvectors corresponding to different
Hamiltonians. In this work, we introduce an algorithm called the floating block
method, which solves the problem by performing Euclidean time evolution with
two different Hamiltonians and interleaving the corresponding time blocks. We
use the floating block method and nuclear lattice simulations to build
eigenvector continuation emulators for energies of $^4$He, $^8$Be, $^{12}$C,
and $^{16}$O nuclei over a range of local and non-local interaction couplings.
From the emulator data, we identify the quantum phase transition line from a
Bose gas of alpha particles to a nuclear liquid.
Related papers
- Quantum Calculation for Two-Stream Instability and Advection Test of Vlasov-Maxwell Equations: Numerical Evaluation of Hamiltonian Simulation [0.0]
We develop a quantum-classical hybrid Vlasov-Maxwell solver.
We perform numerical simulation of a 1D advection test and a 1D1V two-stream instability test.
Our quantum algorithm is robust under larger time steps compared with classical algorithms.
arXiv Detail & Related papers (2024-08-21T11:56:55Z) - Spin coupling is all you need: Encoding strong electron correlation in molecules 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 provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
arXiv Detail & Related papers (2024-04-29T17:14:21Z) - An efficient and exact noncommutative quantum Gibbs sampler [0.0]
We construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary noncommutative Hamiltonians.
Our construction can also be regarded as a continuous-time quantum analog of the Metropolis-Hastings algorithm.
arXiv Detail & Related papers (2023-11-15T18:51:24Z) - Nuclear Spectra from Quantum Lanczos Algorithm with Real-Time Evolution
and Multiple Reference States [0.0]
I performed numerical simulations to find the low-lying eigenstates of $20$Ne, $22$Na, and $29$Na to compare imaginary- and real-time evolution.
I present the quantum circuits for the QLanczos algorithm with real-time evolution and multiple references.
arXiv Detail & Related papers (2023-09-01T23:25:57Z) - Robust Extraction of Thermal Observables from State Sampling and
Real-Time Dynamics on Quantum Computers [49.1574468325115]
We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series.
Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
arXiv Detail & Related papers (2023-05-30T18:00:05Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Calculating the many-body density of states on a digital quantum
computer [58.720142291102135]
We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer.
We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
arXiv Detail & Related papers (2023-03-23T17:46:28Z) - Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions [42.3779227963298]
We provide a framework for encoding time dependent dynamics as time independent systems.
First, we create a time dependent simulation algorithm based on performing qubitization on the augmented clock system.
Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials.
arXiv Detail & Related papers (2022-03-21T21:29:22Z) - Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems.
These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
arXiv Detail & Related papers (2021-07-01T01:02:17Z) - Holographic quantum algorithms for simulating correlated spin systems [0.0]
We present a suite of "holographic" quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin-systems.
The algorithms exploit the equivalence between matrix-product states (MPS) and quantum channels, along with partial measurement and qubit re-use.
As a demonstration of the potential resource savings, we implement a holoVQE simulation of the antiferromagnetic Heisenberg chain on a trapped-ion quantum computer.
arXiv Detail & Related papers (2020-05-06T18:00:01Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
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.