Related papers: Engineering Local optimality in Quantum Monte Carl…
We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the…
Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring…
We investigate the feasibility of integrating quantum algorithms as subroutines of simulation-based optimisation problems with relevance to and potential applications in mathematical finance. To this end, we conduct a thorough analysis of…
A quantum world-line Monte Carlo method for high-symmetrical quantum models is proposed. Firstly, based on a representation of a partition function using the Matsubara formula, the principle of quantum world-line Monte Carlo methods is…
We review the development of update schemes for quantum lattice models simulated using world line quantum Monte Carlo algorithms. Starting from the Suzuki-Trotter mapping we discuss limitations of local update algorithms and highlight the…
We develop Monte Carlo methods for sampling random states and corresponding bit strings in qubit systems. To this end, we derive exact probability density functions that yield the Porter-Thomas distribution in the limit of large systems. We…
High-quality random samples of quantum states are needed for a variety of tasks in quantum information and quantum computation. Searching the high-dimensional quantum state space for a global maximum of an objective function with many local…
A classical Monte Carlo algorithm based on the quasi-classical approximation is applied to the pseudospin Hamiltonian of the model cuprate. The model takes into account both local and non-local correlations, Heisenberg spin-exchange…
We consider dynamically constrained Monte-Carlo dynamics and show that this leads to the generation of long ranged effective interactions. This allows us to construct a local algorithm for the simulation of charged systems without ever…
We present an exact quantum Monte Carlo method for spin systems coupled to dissipative bosonic baths which makes use of nonlocal wormhole updates to simulate the retarded spin-flip interactions originating from an off-diagonal spin-boson…
Global optimization is an active area of research in atomistic simulations, and many algorithms have been proposed to date. A prominent example is basin hopping Monte Carlo, which performs a modified Metropolis Monte Carlo search to explore…
A quantum Monte Carlo method combining update of the loop algorithm with the global flip of the world line is proposed as an efficient method to study the magnetization process in an external field, which has been difficult because of…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
Quantum computing offers an alternative paradigm for addressing combinatorial optimization problems compared to classical computing. Despite recent hardware improvements, the execution of empirical quantum optimization experiments at scales…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
In this note, variational Monte Carlo method based on neural quantum states for spin systems is reviewed. Using a neural network as the wave function allows for a more generalized expression of various types of interactions, including…
We introduce an exact Monte Carlo approach to the statistics of discrete quantum systems which does not rely on the standard fragmentation of the imaginary time, or any small parameter. The method deals with discrete objects, kinks,…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
This review covers applications of quantum Monte Carlo methods to quantum mechanical problems in the study of electronic and atomic structure, as well as applications to statistical mechanical problems both of static and dynamic nature. The…
We present an exact version of the local bosonic algorithm for the simulation of dynamical quarks in lattice QCD. This version is based on a non-hermitian polynomial approximation of the inverse of the quark matrix. A Metropolis test…