Related papers: Complexity reduction in many particles systems wit…
It is a challenge to manage complex systems efficiently without confronting NP-hard problems. To address the situation we suggest to use self-organization processes of prime integer relations for information processing. Self-organization…
In this work, we consider one-dimensional particles interacting in mean-field type through a bounded kernel. In addition, when particles hit some barrier (say zero), they are removed from the system. This absorption of particles is…
The possibility of using strongly and continuously interacting spins for quantum computation has recently been discussed. Here we present a simple optical scheme that achieves this goal while avoiding the drawbacks of earlier proposals. We…
We present a family of methods, analytical and numerical, which can describe behaviour in (non) equilibrium ensembles, both classical and quantum, especially in the complex systems, where the standard approaches cannot be applied. We…
The aim of this work is to study the properties of groups of operators for evolution equations of quantum many-particle systems, namely, the von Neumann hierarchy for correlation operators, the BBGKY hierarchy for marginal density operators…
In this paper, we introduce a one-dimensional model of particles performing independent random walks, where only pairs of particles can produce offspring ("cooperative branching"), and particles that land on an occupied site merge with the…
Consider a system of Brownian particles on the real line where each pair of particles coalesces at a certain rate according to their intersection local time. Assume that there are infinitely many initial particles in the system. We give a…
Despite significant advances in particle imaging technologies over the past two decades, few advances have been made in particle tracking, i.e. linking individual particle positions across time series data. The state-of-the-art tracking…
Approximate Bayes Computations (ABC) are used for parameter inference when the likelihood function of the model is expensive to evaluate but relatively cheap to sample from. In particle ABC, an ensemble of particles in the product space of…
Spurred by tremendous success in pattern matching and prediction tasks, researchers increasingly resort to machine learning to aid original scientific discovery. Given large amounts of observational data about a system, can we uncover the…
While free and weakly interacting particles are well described by a a second-quantized nonlinear Schr\"odinger field, or relativistic versions of it, the fields of strongly interacting particles are governed by effective actions, whose…
There is a remarkable interest in the study of Out-of-time ordered correlators (OTOCs) that goes from many body theory and high energy physics to quantum chaos. In this latter case there is a special focus on the comparison with the…
We propose a high-order stochastic-statistical moment closure model for efficient ensemble prediction of leading-order statistical moments and probability density functions in multiscale complex turbulent systems. The statistical moment…
In this paper we propose a framework inspired by interacting particle physics and devised to perform clustering on multidimensional datasets. To this end, any given dataset is modeled as an interacting particle system, under the assumption…
We report on a lattice based algorithm, completely vectorized for molecular dynamics simulations. Its algorithmic complexity is of the order O(N), where $N$ is the number of particles. The algorithm works very effectively when the particles…
Quantum statistical systems, composed of atoms or molecules interacting with each other through highly singular non-integrable potentials, are considered. The treatment of such systems cannot start with the standard approximations such as…
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon…
Competition between short- and long-range interactions underpins many emergent phenomena in nature. Despite rapid progress in their experimental control, computational methods capable of accurately simulating open quantum many-body systems…
We consider the dynamics of particle systems where the particles are confined by impenetrable barriers to a bounded, possibly non-convex domain $\Omega$. When particles hit the boundary, we consider an instant change in velocity, which…
Shape formation is a basic distributed problem for systems of computational mobile entities. Intensively studied for systems of autonomous mobile robots, it has recently been investigated in the realm of programmable matter. Namely, it has…