Related papers: Efficient algorithm for simulating particles in re…
Generative models for quantum data pose significant challenges but hold immense potential in fields such as chemoinformatics and quantum physics. Quantum denoising diffusion probabilistic models (QuDDPMs) enable efficient learning of…
Generalized Parton Distribution functions (GPDs) are off-diagonal light-cone matrix elements that encode the internal structure of hadrons in terms of quark and gluon degrees of freedom. In this work, we present the first nonperturbative…
Based on the Dirac representation of Maxwell equations we present an explicit, discrete space-time, quantum walk-inspired algorithm suitable for simulating the electromagnetic wave propagation and scattering from inhomogeneities within…
We study driven particle systems with excluded volume interactions on a two-lane ladder with periodic boundaries, using Monte Carlo simulation, cluster mean-field theory, and numerical solution of the master equation. Particles in one lane…
Online data assimilation in time series models over a large spatial extent is an important problem in both geosciences and robotics. Such models are intrinsically high-dimensional, rendering traditional particle filter algorithms…
We present a first numerical investigation of the accuracy of the recently proposed {\em non-classical transport equation}. This equation contains an extra independent variable (the path-length $s$), and models particle transport taking…
We present local distributed, stochastic algorithms for \emph{alignment} in self-organizing particle systems (SOPS) on two-dimensional lattices, where particles occupy unique sites on the lattice, and particles can make spatial moves to…
Realistic path planning applications often require optimizing with respect to several criteria simultaneously. Here we introduce an efficient algorithm for bi-criteria path planning on graphs. Our approach is based on augmenting the state…
We formulate a path-integral Monte Carlo algorithm for simulating lattice systems consisting of fictitious particles governed by a generalized exchange statistics. This method, initially proposed for continuum systems, introduces a…
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum…
We present a new probabilistic analysis of distributed algorithms. Our approach relies on the theory of quasi-stationary distributions (QSD) recently developped by Champagnat and Villemonais. We give properties on the deadlock time and the…
A quantum system interacting with a dilute gas experiences irreversible dynamics. The corresponding master equation can be derived within two different approaches: The fully quantum description in the low-density limit and the semiclassical…
We introduce a classical algorithm to approximate the free energy of local, translation-invariant, one-dimensional quantum systems in the thermodynamic limit of infinite chain size. While the ground state problem (i.e., the free energy at…
Algorithms based on the particle flow approach are becoming increasingly utilized in collider experiments due to their superior jet energy and missing energy resolution compared to the traditional calorimeter-based measurements. Such…
This article addresses the problem of efficient Bayesian inference in dynamic systems using particle methods and makes a number of contributions. First, we develop a correlated pseudo-marginal (CPM) approach for Bayesian inference in state…
Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing…
In recent work, the so-called quasi-Zeno dynamics of a system has been investigated in the context of the quantum first passage problem. This dynamics considers the time evolution of a system subjected to a sequence of selective projective…
We perform an experimental evaluation of algorithms for finding geodesic shortest paths between two points inside a simple polygon in the constant-workspace model. In this model, the input resides in a read-only array that can be accessed…
We demonstrate the use of a new algorithm called the Flat Histogram sampling algorithm for the simulation of lattice polymer systems. Thermodynamics properties, such as average energy or entropy and other physical quantities such as…
We present a free energy lattice Boltzmann model capable of simulating fluid systems with an arbitrary number of immiscible components in principle. Our method is strictly reduction consistent, ensuring that absent fluid components do not…