Related papers: paces: Parallelized Application of Co-Evolving Sub…
To simulate the dynamics of fluid with polydisperse particles on macroscale level, one has to solve hydrodynamic equations with several relaxation terms, representing momentum transfer from fluid to particles and vice versa. For small…
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware. We investigate the performance of continuous-time quantum walks…
A symplectic, symmetric, second-order scheme is constructed for particle evolution in a time-dependent field with a fixed spatial step. The scheme is implemented in one space dimension and tested, showing excellent adequacy to experiment…
In this paper we propose a systematic method to solve the inverse dynamical problem for a quantum system governed by the von Neumann equation: to find a class of Hamiltonians reproducing a prescribed time evolution of a pure or mixed state…
This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…
We present a new parallel algorithm for probabilistic graphical model optimization. The algorithm relies on data-parallel primitives (DPPs), which provide portable performance over hardware architecture. We evaluate results on CPUs and GPUs…
[Abridged] We present the results of a highly parallel Kepler equation solver using the Graphics Processing Unit (GPU) on a commercial nVidia GeForce 280GTX and the "Compute Unified Device Architecture" programming environment. We apply…
We present a new parallel numerical method for solving the non-stationary Schr\"odinger equation with linear nonlocal condition and time-dependent potential which does not commute with the stationary part of the Hamiltonian. The given…
Quantum state diffusion (QSD) as a tool to solve quantum-optical master equations by stochastic simulation can be made several orders of magnitude more efficient if states in Hilbert space are represented in a moving basis of excited…
Time symmetry in quantum mechanics, where the current quantum state is determined jointly by both the past and the future, offers a more comprehensive description of physical phenomena. This symmetry facilitates both forward and backward…
As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we…
Graphics Processing Units (GPUs) are high performance co-processors originally intended to improve the use and quality of computer graphics applications. Once, researchers and practitioners noticed the potential of using GPU for general…
Simulating large-scale microswimmer dynamics in viscous fluid poses significant challenges due to the coupled high spatial and temporal complexity. Conventional high-performance computing (HPC) methods often address these two dimensions in…
This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several…
A general approach is presented that offers exact analytical solutions for the time-evolution of quantum spin systems during parametric waveforms of arbitrary functions of time. The proposed method utilises the \emph{path-sum} method that…
Many-particle continuous-time quantum walks (CTQWs) represent a resource for several tasks in quantum technology, including quantum search algorithms and universal quantum computation. In order to design and implement CTQWs in a realistic…
We consider the problem of generating uniformly random partitions of the vertex set of a graph such that every piece induces a connected subgraph. For the case where we want to have partitions with linearly many pieces of bounded size, we…
In a recent paper we proposed and compared various approaches to compute the ground state and dynamics of the Schr\"{o}dinger--Poisson--Slater (SPS) system for general external potential and initial condition, concluding that the methods…
Sparse Matrix-Matrix Multiplication (SpMM) is a fundamental operation in graph computing and analytics. However, the irregularity of real-world graphs poses significant challenges to achieving efficient SpMM operation for graph data on…
The real- and imaginary-time evolution of quantum states are powerful tools in physics, chemistry, and beyond, to investigate quantum dynamics, prepare ground states or calculate thermodynamic observables. On near-term devices, variational…