Related papers: Unbiasing the initiator approximation in Full Conf…
Many large scale problems in computational fluid dynamics such as uncertainty quantification, Bayesian inversion, data assimilation and PDE constrained optimization are considered very challenging computationally as they require a large…
Quantum Monte Carlo belongs to the most accurate simulation techniques for quantum many-particle systems. However, for fermions, these simulations are hampered by the sign problem that prohibits simulations in the regime of strong…
Integrability is a cornerstone of classical mechanics, where it has a precise meaning. Extending this notion to quantum systems, however, remains subtle and unresolved. In particular, deciding whether a quantum Hamiltonian - viewed simply…
Quantum computers are expected to bring drastic acceleration to several computing tasks against classical computers. Noisy intermediate-scale quantum (NISQ) devices, which have tens to hundreds of noisy physical qubits, are gradually…
We extend the recently introduced phaseless auxiliary-field quantum Monte Carlo (QMC) approach to any single-particle basis, and apply it to molecular systems with Gaussian basis sets. QMC methods in general scale favorably with system…
In nuclear fusion and fission, fluctuation and dissipation arise due to the coupling of collective degrees of freedom with internal excitations. Close to the barrier, both quantum, statistical and non-Markovian effects are expected to be…
We perform \emph{ab initio} quantum Monte Carlo (QMC) simulations of the warm dense uniform electron gas in the thermodynamic limit. By combining QMC data with linear response theory we are able to remove finite-size errors from the…
Instantaneous quantum polynomial quantum circuit Born machines (IQP-QCBMs) have been proposed as quantum generative models with a classically tractable training objective based on the maximum mean discrepancy (MMD) and a potential quantum…
We assume a drift condition towards a small set and bound the mean square error of estimators obtained by taking averages along a single trajectory of a Markov chain Monte Carlo algorithm. We use these bounds to construct fixed-width…
Qubits are typically reset into a known state by coupling them to a low-temperature environment. When treated in the Born-Markov approximation such couplings produce exponential relaxation to equilibrium, giving high reset fidelities…
A generalized Bose-Hubbard model in a two-mode approximation is applied to study the rotational dynamics of a direct-current atomtronic quantum interference device. Modified values of on-site interaction and pair-tunneling parameters of the…
Accurate quantum many-body calculations often depend on reliable reference states or good human-designed ans\"atze, yet these sources of knowledge can become unreliable in hard problems like strongly correlated systems. We introduce the…
Mean-field molecular dynamics based on path integrals is used to approximate canonical quantum observables for particle systems consisting of nuclei and electrons. A computational bottleneck is the sampling from the Gibbs density of the…
Monte Carlo (MC) simulations provide gold-standard accuracy for carbon ion therapy dose calculations but are computationally intensive. Analytical pencil beam algorithms offer speed but reduced accuracy in heterogeneous tissues. We…
Reliable Bayesian predictive inference has long been an open problem under unidentified transformation models, since the Markov Chain Monte Carlo (MCMC) chains of posterior predictive distribution (PPD) values are generally poorly mixed. We…
In this paper we consider the estimation of unknown parameters in Bayesian inverse problems. In most cases of practical interest, there are several barriers to performing such estimation, This includes a numerical approximation of a…
Algorithms based on non-unitary evolution have attracted much interest for ground state preparation on quantum computers. One recently proposed method makes use of ancilla qubits and controlled unitary operators to implement weak…
This study introduces a computationally efficient algorithm, delayed acceptance Markov chain Monte Carlo (DA-MCMC), designed to improve posterior simulation in quasi-Bayesian inference. Quasi-Bayesian methods, which do not require fully…
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…
A numerical renormalization-group survey of the zero-bias electrical conductance through a quantum dot embedded in the conduction path of a nanodevice is reported. The results are examined in the light of a recently derived linear mapping…