Related papers: Fast Simulated Annealing inspired by Quantum Monte…
Quantum computers use quantum resources to carry out computational tasks and may outperform classical computers in solving certain computational problems. Special-purpose quantum computers such as quantum annealers employ quantum adiabatic…
Quantum annealing is a practical approach to approximately implement the adiabatic quantum computational model under a real-world setting. The goal of an adiabatic algorithm is to prepare the ground state of a problem-encoded Hamiltonian at…
In this paper, we generalize the Quantum Kinetic Monte Carlo (QKMC) method of the Schrodinger equation, which was first proposed by [Z. Cai and J. Lu. SIAM J. Sci. Comput., 40(3):B706-B722, 2018] to the Lindblad equation. This algorithm…
One of the open challenges in quantum computing is to find meaningful and practical methods to leverage quantum computation to accelerate classical machine learning workflows. A ubiquitous problem in machine learning workflows is sampling…
We apply the Quasi Monte Carlo (QMC) and recursive numerical integration methods to evaluate the Euclidean, discretized time path-integral for the quantum mechanical anharmonic oscillator and a topological quantum mechanical rotor model.…
Efficient and accurate algorithm for partition function, free energy and thermal entropy calculations is of great significance in statistical physics and quantum many-body physics. Here we present an unbiased but low-technical-barrier…
We consider the problem of estimating the probability of a large loss from a financial portfolio, where the future loss is expressed as a conditional expectation. Since the conditional expectation is intractable in most cases, one may…
The Markov chain Monte Carlo (MCMC) method is used to evaluate the imaginary-time path integral of a quantum oscillator with a potential that includes both a quadratic term and a quartic term whose coupling is varied by several orders of…
The study of the response of magnetic nanoparticles (MNP) assemblies to an external alternating magnetic field is of great interest for applications such as hyperthermia. The key quantity here is the complex susceptibility and its behavior…
The protocol of quantum annealing is applied to an optimization problem with a one-dimensional continuous degree of freedom, a variant of the problem proposed by Shinomoto and Kabashima. The energy landscape has a number of local minima,…
We propose an efficient method for Monte Carlo simulation of quantum lattice models. Unlike most other quantum Monte Carlo methods, a single run of the proposed method yields the free energy and the entropy with high precision for the whole…
In these lectures we describe the use of Monte Carlo simulations in understanding the role of tunneling events, instantons, in a quantum mechanical toy model. We study, in particular, a variety of methods that have been used in the QCD…
We introduce the Quantization Monte Carlo method to solve thermal radiative transport equations with possibly several collision regimes, ranging from few collisions to massive number of collisions per time unit. For each particle in a given…
Quantum Monte Carlo is an efficient technique for finding the ground-state energy and related properties of small molecules. A major challenge remains in accurate determination of a molecule's geometry, i.e. the optimal location of its…
Recently, Huggins et. al. [Nature, 603, 416-420 (2022)] devised a general projective Quantum Monte Carlo method suitable for implementation on quantum computers. This hybrid approach, however, relies on a subroutine -the computation of the…
An exact Quantum Kinetic Monte Carlo method is proposed to calculate electron transport for 1D Fermi Hubbard model. The method is directly formulated in real time and can be applied to extract time dependent dynamics of general interacting…
In this work, we test a recently developed method to enhance classical auxiliary-field quantum Monte Carlo (AFQMC) calculations with quantum computers against examples from chemistry and material science, representatives of classes of…
Quantum Annealing (QA) is one of the most promising frameworks for quantum optimization. Here, we focus on the problem of minimizing complex classical cost functions associated with prototypical discrete neural networks, specifically the…
Monte Carlo sampling is a powerful toolbox of algorithmic techniques widely used for a number of applications wherein some noisy quantity, or summary statistic thereof, is sought to be estimated. In this paper, we survey the literature for…
We develop a quantum Monte Carlo method for many fermions that allows the use of any one-particle basis. It projects out the ground state by random walks in the space of Slater determinants. An approximate approach is formulated to control…