Related papers: An efficient algorithm simulating a macroscopic sy…
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fundamental in many applications like diagnosis, 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…
Interacting particle systems with many degrees of freedom may undergo phase transitions to sustain atypical fluctuations of dynamical observables such as the current or the activity. This leads in some cases to symmetry-broken space-time…
We consider stochastic optimization problems with the dual tasks of (i) effectively finding the optimizer and (ii) reliably conducting statistical inference for the optimal objective function value. We find that classical simulation…
We describe a new algorithm for simulating complex Markoff-processes. We have used a reaction-cell method in order to simulate arbitrary reactions. It can be used for any kind of RDS on arbitrary topologies, including fractal dimensions or…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
We present a quantum algorithm for efficiently sampling transformed Gaussian random fields on $d$-dimensional domains, based on an enhanced version of the classical moving average method. Pointwise transformations enforcing boundedness are…
A number of algorithms for computing the simulation preorder (and equivalence) on Kripke structures are available. Let Sigma denote the state space, -> the transition relation and Psim the partition of Sigma induced by simulation…
The precise description of quantum nuclear fluctuations in atomistic modelling is possible by employing path integral techniques, which involve a considerable computational overhead due to the need of simulating multiple replicas of the…
The article is devoted to the problem of applying the maximum principle for finding optimal control parameters in simulation tasks of interest for a variety of engineering and industrial systems and processes. Especially important is the…
An algorithm for the unbiased simulation of continuous max-(resp.\ min-)id stochastic processes is developed. The algorithm only requires the simulation of finite Poisson random measures on the space of continuous functions and avoids the…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
A fluctuating non-ideal fluid at its critical point is simulated with the Lattice Boltzmann method. It is demonstrated that the method, employing a Ginzburg-Landau free energy functional, correctly reproduces the static critical behavior…
Recently, significant connections between compressed sensing problems and optimization of a particular class of functions relating to solutions of Hamilton-Jacobi equation was discovered. In this paper we introduce a fast approximate…
Deterministic policy gradient algorithms are foundational for actor-critic methods in controlling continuous systems, yet they often encounter inaccuracies due to their dependence on the derivative of the critic's value estimates with…
In this paper, we consider the optimal coordination of automated vehicles at intersections under fixed crossing orders. We formulate the problem using direct optimal control and exploit the structure to construct a semi-distributed…
Active matter generates order or patterns through nonequilibrium dynamics. An open research challenge is to determine how efficiently a nonequilibrium self-organising system can convert consumed energy into macroscopic order. We study an…
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…
We propose a new Monte Carlo method for efficiently sampling trajectories with fixed initial and final conditions in a system with discrete degrees of freedom. The method can be applied to any stochastic process with local interactions,…
We present a novel method for the accurate numerical determination of the phase behavior of fluid mixtures having large particle size asymmetries. By incorporating the recently developed geometric cluster algorithm within a restricted Gibbs…