Related papers: paces: Parallelized Application of Co-Evolving Sub…
A given set of data-points in some feature space may be associated with a Schrodinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged…
An algorithm for simulation of quantum many-body dynamics having su(2) spectrum-generating algebra is developed. The algorithm is based on the idea of dynamical coarse-graining. The original unitary dynamics of the target observables, the…
The Cox proportional hazards model stands as a widely-used semi-parametric approach for survival analysis in medical research and many other fields. Numerous extensions of the Cox model have further expanded its versatility. Statistical…
Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators. Yet rigorous methods for time-dependent Hamiltonians and Lindbladians remain scarce despite their wide use. We close this gap by learning the…
Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor…
It is well-known that time-dependent Schr\"{o}dinger equation can only be exactly solvable in very rare cases, even for two-level quantum systems. Therefore, finding exact quantum dynamics under time-dependent Hamiltonian is not only of…
We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends…
Simulating quantum dynamics is one of the most important applications of quantum computers. Traditional approaches for quantum simulation involve preparing the full evolved state of the system and then measuring some physical quantity.…
We develop an analog classical simulation algorithm of noiseless quantum dynamics. By formulating the Schr\"{o}dinger equation into a linear system of real-valued ordinary differential equations (ODEs), the probability amplitudes of a…
The dynamics of M-site, N-particle Bose-Hubbard systems is described in quantum phase space constructed in terms of generalized SU(M) coherent states. These states have a special significance for these systems as they describe fully…
The time evolution of a closed quantum system is connected to its Hamiltonian through Schroedinger's equation. The ability to estimate the Hamiltonian is critical to our understanding of quantum systems, and allows optimization of control.…
We present an exactly solvable toy model for the continuous dissipative dynamics of permutation-invariant graph states of $N$ qubits. Such states are locally equivalent to an $N$-qubit Greenberger-Horne-Zeilinger (GHZ) state, a fundamental…
Parallel algorithms on CPU and GPU are implemented for the Unified Gas-Kinetic Scheme and their performances are investigated and compared by a two dimensional channel flow case. The parallel CPU algorithm has a one dimensional block…
We have been constructed a brand-new radiation hydrodynamics solver based upon Smoothed Particle Hydrodynamics (SPH), which works on parallel computer system. The code is designed to investigate the formation and evolution of the first…
Schroedinger equation on a Hilbert space ${\cal H}$, represents a linear Hamiltonian dynamical system on the space of quantum pure states, the projective Hilbert space $P {\cal H}$. Separable states of a bipartite quantum system form a…
In this work we employ the split-step technique combined with a Legendre pseudospectral representation to solve various time-dependent Gross-Pitaevskii equations (GPE). Our findings based on the numerical accuracy of this approach applied…
Massively parallel computer architectures create new opportunities for the performance of long-timescale molecular dynamics (MD) simulations. Here, we introduce the path-accelerated molecular dynamics (PAMD) method that takes advantage of…
Krylov subspace methods in quantum dynamics identify the minimal subspace in which a process unfolds. To date, their use is restricted to time evolutions governed by time-independent generators. We introduce a generalization valid for…
In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here we present quantum algorithms for…
We investigate convergence properties of discrete-time semigroup quantum dynamics, including asymptotic stability, probability and speed of convergence to pure states and subspaces. These properties are of interest in both the analysis of…