Related papers: Study of a new simulation algorithm for dynamical …
We introduce a numerical algorithm to stochastically sample the dual fermion perturbation series around the dynamical mean field theory, generating all topologies of two-particle interaction vertices. We show results in the weak and strong…
Due to decelerating gains in single-core CPU performance, computationally expensive simulations are increasingly executed on highly parallel hardware platforms. Agent-based simulations, where simulated entities act with a certain degree of…
Recently, many experiments with cold atomic gases have been conducted from interest in the non-equilibrium dynamics of correlated quantum systems. Of these experiments, the mixing dynamics of fermion clusters motivates us to research…
A parallel code has been written in FORTRAN90, C, and MPI for the analysis of biological simulation data. Using a master/slave algorithm, the software operates on AMBER generated trajectory data using either UNIX or MPI file IO, and it…
A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…
The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…
A version of the time-parallel algorithm parareal is analyzed and applied to stochastic models in chemical kinetics. A fast predictor at the macroscopic scale (evaluated in serial) is available in the form of the usual reaction rate…
Recently, a quantum algorithm for a fundamentally important task in data mining, association rules mining (ARM), called qARM for short, has been proposed. Notably, qARM achieves significant speedup over its classical counterpart for…
Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious…
Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the Filtering Variational Quantum…
A computer simulation has to be fast to be helpful, if it is employed to study the behavior of a multicomponent dynamic system. This paper discusses modeling concepts and algorithmic techniques useful for creating such fast simulations.…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
In recent years, quantum computing has drawn significant interest within the field of high-energy physics. We explore the potential of quantum algorithms to resolve the combinatorial problems in particle physics experiments. As a concrete…
We assess Coarse Graining by studying different partitions of the phase space of the Baker transformation and the periodic torus automorphisms. It turns out that the shape of autocorrelation functions for the Baker transformation is more or…
The computational cost of numerical simulations of QCD with light dynamical Wilson-quarks is estimated by determining the autocorrelation of various quantities. In test runs the expected qualitative behaviour of the pion mass and coupling…
This article introduces a highly parallel algorithm for molecular dynamics simulations with short-range forces on single node multi- and many-core systems. The algorithm is designed to achieve high parallel speedups for strongly…
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due…
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 propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
We compare the performance of the Kramers Equation Monte Carlo (KMC) Algorithm with that of the Hybrid Monte Carlo (HMC) algorithm for numerical simulations with dynamical Kogut-Susskind fermions. Using the lattice Gross-Neveu model in 2…