Related papers: Fourth Order Algorithms for Solving the Multivaria…
We investigate whether the stationary solution of the Fokker-Planck equation of the complex Langevin algorithm reproduces the correct expectation values. When the complex Langevin algorithm for an action $S(x)$ is convergent, it produces an…
We show that when time-reversible symplectic algorithms are used to solve periodic motions, the energy error after one period is generally two orders higher than that of the algorithm. By use of correctable algorithms, we show that the…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…
In this paper, we introduce a novel and general framework for the variational quantum simulation of Lindblad equations. Building on the close relationship between the unraveled Lindblad dynamics, stochastic Magnus integrators, and…
Schemes with the second-order approximation in time are considered for numerical solving the Cauchy problem for an evolutionary equation of first order with a self-adjoint operator. The implicit two-level scheme based on the Pad\'{e}…
In this paper, we introduce a Matlab program method to compute Carleman estimate for the fourth order partial differential operator $\gamma\partial_t+\partial_x^4\ (\gamma\in\mathbb{R})$. We obtain two kinds of Carleman estimates with…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm…
One of the outstanding problems in the numerical discretization of the Feynman-Kac formula calls for the design of arbitrary-order short-time approximations that are constructed in a stable way, yet only require knowledge of the potential…
A time-stepping $L1$ scheme for solving a time fractional Fokker-Planck equation of order $\alpha \in (0, 1)$, with a general driving force, is investigated. A stability bound for the semi-discrete solution is obtained for…
We get fractional symmetric Fokker - Planck and Einstein - Smoluchowski kinetic equations, which describe evolution of the systems influenced by stochastic forces distributed with stable probability laws. These equations generalize known…
We study a novel large dimensional approximate factor model with regime changes in the loadings driven by a latent first order Markov process. By exploiting the equivalent linear representation of the model, we first recover the latent…
The Fokker--Planck equation is a key ingredient of many models in physics, and related subjects, and arises in a diverse array of settings. Analytical solutions are limited to special cases, and resorting to numerical simulation is often…
Gibbs sampling from continuous real-valued functions is a challenging problem of interest in machine learning. Here we leverage quantum Fourier transforms to build a quantum algorithm for this task when the function is periodic. We use the…
Constrained optimization problems appear in a wide variety of challenging real-world problems, where constraints often capture the physics of the underlying system. Classic methods for solving these problems rely on iterative algorithms…
Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the problem that the algorithm is intended to solve. A notable example…
We present and experimentally realize a quantum algorithm for efficiently solving the following problem: given an $N\times N$ matrix $\mathcal{M}$, an $N$-dimensional vector $\textbf{\emph{b}}$, and an initial vector $\textbf{\emph{x}}(0)$,…
Inference and simulation in the context of high-dimensional dynamical systems remain computationally challenging problems. Some form of dimensionality reduction is required to make the problem tractable in general. In this paper, we propose…
This paper is concerned with the Fokker-Planck (FP) description of classical stochastic systems with discrete time delay. The non-Markovian character of the corresponding Langevin dynamics naturally leads to a coupled infinite hierarchy of…
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these…