相关论文: Improving the dynamical overlap algorithm

We present two Monte Carlo sampling algorithms for probabilistic inference that guarantee polynomial-time convergence for a larger class of network than current sampling algorithms provide. These new methods are variants of the known…

We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…

Current nonequilibrium Monte Carlo methods suffer from a dynamical sign problem that makes simulating real-time dynamics for long times exponentially hard. We propose a new `Inchworm Algorithm', based on iteratively reusing information…

We study the eigenvalues of Dirac operators in QCD with two mass degenerate dynamical fermions. The gauge configurations have been obtained with HMC and the so-called Chirally Improved fermionic action. We compare eigenvalues obtained for…

We extend the Longstaff-Schwartz algorithm for approximately solving optimal stopping problems on high-dimensional state spaces. We reformulate the optimal stopping problem for Markov processes in discrete time as a generalized statistical…

We consider the problem of estimating the expected outcomes of Monte Carlo processes whose outputs are described by multidimensional random variables. We tightly characterize the quantum query complexity of this problem for various choices…

Modern adaptive optimization methods, such as Adam and its variants, have emerged as the most widely used tools in deep learning over recent years. These algorithms offer automatic mechanisms for dynamically adjusting the update step based…

We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…

We present a continuous-variable photonic quantum algorithm for the Monte Carlo evaluation of multi-dimensional integrals. Our algorithm encodes n-dimensional integration into n+3 modes and can provide a quadratic speedup in runtime…

Estimating the overlap between an approximate wavefunction and a target eigenstate of the system Hamiltonian is essential for the efficiency of quantum phase estimation. In this work, we derive upper and lower bounds on this overlap using…

We provide an extension to lattice systems of the reptation quantum Monte Carlo algorithm, originally devised for continuous Hamiltonians. For systems affected by the sign problem, a method to systematically improve upon the so-called…

We present a Monte Carlo algorithm that allows the simultaneous determination of a few extremal eigenpairs of a very large matrix without the need to compute the inner product of two vectors or store all the components of any one vector.…

The Hybrid Monte Carlo algorithm is adapted to the simulation of a system of classical degrees of freedom coupled to non self-interacting lattices fermions. The diagonalization of the Hamiltonian matrix is avoided by introducing a…

We investigate the Brillouin action in terms of its suitability as a kernel to the overlap procedure, with a view on both heavy and light quark physics. We use the diagonal elements of the Kenney-Laub family of iterations for the sparse…

It has been known for a long time that stratification is one possible strategy to obtain higher convergence rates for the Monte Carlo estimation of integrals over the hyper-cube $[0, 1]^s$ of dimension $s$. However, stratified estimators…

The action of the overlap-Dirac operator on a vector is typically implemented indirectly through a multi-shift conjugate gradient solver. The compute-time required depends upon the condition number, $\kappa$, of the matrix that is used as…

Recently, it has been shown that the hybrid Monte Carlo (HMC) algorithm is guaranteed to converge exponentially to a given target probability distribution $p(x)\propto e^{-V(x)}$ on non-compact spaces if augmented by an appropriate radial…

We introduce a new Monte Carlo method for pure gauge theories. It is not intended for use with dynamical fermions. It belongs to the class of Local Hybrid Monte Carlo (LHMC) algorithms, which make use of the locality of the action by…

We describe an explicit construction of approximate Ginsparg-Wilson fermions for QCD. We use ingredients of perfect action origin, and further elements. The spectrum of the lattice Dirac operator reveals the quality of the approximation. We…

Quantum-enhanced Markov chain Monte Carlo, an algorithm in which configurations are proposed through a measured quantum quench and accepted or rejected by a classical algorithm, has been proposed as a possible method for robust quantum…