Related papers: Efficient algorithm for simulating particles in re…
Exactly computing the full output distribution of linear optical circuits remains a challenge, as existing methods are either time-efficient but memory-intensive or memory-efficient but slow. Moreover, any realistic simulation must account…
We present "torchGDM", a numerical framework for nano-optical simulations based on the Green's Dyadic Method (GDM). This toolkit combines a hybrid approach, allowing for both fully discretized nano-structures and structures approximated by…
We give a quantum algorithm for solving the Bounded Distance Decoding (BDD) problem with a subexponential approximation factor on a class of integer lattices. The quantum algorithm uses a well-known but challenging-to-use quantum state on…
Quasiperiodic systems are important space-filling ordered structures, without decay and translational invariance. How to solve quasiperiodic systems accurately and efficiently is of great challenge. A useful approach, the projection method…
We propose a reconstruction of the full $(x, \xi, t)$ dependence of unpolarized isovector proton generalized parton distributions (GPDs) $H^{u-d}$ and $E^{u-d}$ from lattice QCD data in the pseudo-distribution formalism. For the first time,…
We present a hybrid numerical approach to simulate quantum many body problems on two spatial dimensional quantum lattice models via the non-Abelian ab initio version of the density matrix renormalization group method on state-of-the-art…
We study numerical methods for dissipative particle dynamics (DPD), which is a system of stochastic differential equations and a popular stochastic momentum-conserving thermostat for simulating complex hydrodynamic behavior at mesoscales.…
We present a distributed asynchronous algorithm for approximating a single component of the solution to a system of linear equations $Ax = b$, where $A$ is a positive definite real matrix, and $b \in \mathbb{R}^n$. This is equivalent to…
We study smooth, caustic-free, chaotic semiclassical dynamics on two-dimensional phase space and find that the dynamics can be approached by an iterative procedure which constructs an approximation to the exact long-time semiclassical…
A common way to accelerate shortest path algorithms on graphs is the use of a bidirectional search, which simultaneously explores the graph from the start and the destination. It has been observed recently that this strategy performs…
This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…
We determine properties of the lattice Boltzmann method for semiclassical fluids, which is based on the Boltzmann equation and the equilibrium distribution function is given either by the Bose-Einstein or the Fermi-Dirac ones. New…
The AMAS group at the Paul Scherrer Institute developed an object oriented library for high performance simulation of high intensity ion beam transport with space charge. Such particle-in-cell (PIC) simulations require a method to generate…
We consider the problem of efficiently computing the maximum likelihood estimator in Generalized Linear Models (GLMs) when the number of observations is much larger than the number of coefficients ($n \gg p \gg 1$). In this regime,…
This article concerns numerical simulations of the dynamics of particles immersed in a continuum solvent. As prototypical systems, we consider colloidal dispersions of spherical particles and solutions of uncharged polymers. After a brief…
Two types of particles, A and B with their corresponding antiparticles, are defined in a one dimensional cyclic lattice with an odd number of sites. In each step of time evolution, each particle acts as a source for the polarization field…
As the scope of Computational Fluid Dynamics (CFD) grows to encompass ever larger problem scales, so does the interest in whether quantum computing can provide an advantage. In recent years, Quantum Lattice Gas Automata (QLGA) and Quantum…
A substantial number of algorithms exists for the simulation of moving particles suspended in fluids. However, finding the best method to address a particular physical problem is often highly non-trivial and depends on the properties of the…
The numerical simulation of multiphase flows involving dispersed components with large scale disparities, such as the collisions between millimeter-sized bubbles and micron-sized mineral particles in flotation, poses a significant…
Wrapping a computation domain with a perfectly matched layer (PML) is one of the most effective methods of imitating/approximating the radiation boundary condition in Maxwell and wave equation solvers. Many PML implementations often use a…