Related papers: Stable and Efficient Algorithms for the Fermion De…
Preconditioning is at the core of modern many-fermion Monte Carlo algorithms, such as Hybrid Monte Carlo, where the repeated solution of a linear problem involving an ill-conditioned matrix is needed. We report on a performance comparison…
I explore computer simulations of the dynamics of small multi-fermion lattice systems. The method is more general, but I concentrate on Hubbard type models where the fermions hop between a small number of connected sites. I use the natural…
We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling…
The ab initio thermodynamic simulation of correlated Fermi systems is of central importance for many applications, such as warm dense matter, electrons in quantum dots, and ultracold atoms. Unfortunately, path integral Monte Carlo (PIMC)…
Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…
Microscopic models of classical degrees of freedom coupled to non-interacting fermions occur in many different contexts. Prominent examples from solid state physics are descriptions of colossal magnetoresistance manganites and diluted…
Quantum Monte Carlo (QMC) methods are one of the most important tools for studying interacting quantum many-body systems. The vast majority of QMC calculations in interacting fermion systems require a constraint to control the sign problem.…
A Monte Carlo program is presented that computes all four fermion processes in $e^+ e^-$ annihilation. QED initial state corrections and QCD contributions are included. Fermions are taken to be massless, allowing a very fast evaluation of…
We propose a computational protocol for quantum simulations of Fermionic Hamiltonians on a quantum computer, enabling calculations which were previously not feasible with conventional encoding and ansatses of variational quantum…
We describe an implementation of the Rational Hybrid Monte Carlo (RHMC) algorithm for dynamical computations with two flavours of staggered quarks. We discuss several variants of the method, the performance and possible sources of error for…
The quantum Monte Carlo methods represent a powerful and broadly applicable computational tool for finding very accurate solutions of the stationary Schroedinger equation for atoms, molecules, solids and a variety of model systems. The…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
An algorithm for separating the high- and low-frequency molecular dynamics modes in Hybrid Monte Carlo simulations of gauge theories with dynamical fermions is presented. The separation is based on splitting the pseudo-fermion action into…
Three possibilities to speed up the Hybrid Monte Carlo algorithm are investigated. Changing the step-size adaptively brings no practical gain. On the other hand, substantial improvements result from using an approximate Hamiltonian or a…
Quantum computers are believed to have the ability to process huge data sizes which can be seen in machine learning applications. In these applications, the data in general is classical. Therefore, to process them on a quantum computer,…
We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known…
We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In…
Warm dense matter is one of the most active frontiers in plasma physics due to its relevance for dense astrophysical objects as well as for novel laboratory experiments in which matter is being strongly compressed e.g. by high-power lasers.…
We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices, by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the…