Related papers: Fourth-order leapfrog algorithms for numerical tim…
Trotterization is a technique that allows one to approximate a time evolution of a Hamiltonian by repeatedly evolving the individual terms of the Hamiltonian one-at-a-time for small time durations. Bounds on the error of this approximation…
Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node $u$ to reach node $v$. They have broad applications across domains such as network…
We develop a fourth order simulation algorithm for solving the stochastic Langevin equation. The method consists of identifying solvable operators in the Fokker-Planck equation, factorizing the evolution operator for small time steps to…
We propose a new primal-dual splitting method for solving composite inclusions involving Lipschitzian, and parallel-sum-type monotone operators. Our approach extends the framework in \cite{Siopt4} to a more general class of monotone…
Efficient simulation of the semiclassical Schr\"odinger equation has garnered significant attention in the numerical analysis community. While controlling the error in the unitary evolution or the wavefunction typically requires the time…
We reveal the power of Grover's algorithm from thermodynamic and geometric perspectives by showing that it is a product formula approximation of imaginary-time evolution (ITE), a Riemannian gradient flow on the special unitary group. This…
Variational quantum algorithms offer a promising new paradigm for solving partial differential equations on near-term quantum computers. Here, we propose a variational quantum algorithm for solving a general evolution equation through…
The paper examines the prominent algorithm D-MORPH to search for the optimal control of a quantum system in order to implement desired unitary evolution of the quantum system at the final time, and reveals new mathematical expressions for…
A semiclassical formula for the coherent-state propagator requires the determination of specific classical paths inhabiting a complex phase-space through a Hamiltonian flux. Such trajectories are constrained to special boundary conditions…
In recent publications, the construction of explicit symplectic integrators for Schwarzschild and Kerr type spacetimes is based on splitting and composition methods for numerical integrations of Hamiltonians or time-transformed Hamiltonians…
Trotter and linear-combination-of-unitary (LCU) are two popular Hamiltonian simulation methods. We propose Hamiltonian simulation algorithms using LCU to compensate Trotter error, which enjoy both of their advantages. By adding few gates…
Leapfrog integration has been the method of choice in N-body simulations owing to its low computational cost for a symplectic integrator with second order accuracy. We introduce a new leapfrog integrator that allows for variable timesteps…
Efficient fourth order symplectic integrators are proposed for numerical integration of separable Hamiltonian systems H(p,q)=T(p)+V(q). Symmetric splitting coefficients with five to nine stages are obtained by higher order decomposition of…
The semi-implicit leapfrog time-discretization is a workhorse algorithm for initial-value MHD codes to bridge between vastly separated time scales. Inclusion of atomic interactions with neutrals breaks the functional structure of the MHD…
Finite differences and Runge-Kutta time stepping schemes used in Computational AeroAcoustics simulations are often optimized for low dispersion and dissipation (e.g. DRP or LDDRK schemes) when applied to linear problems in order to…
We present a new class of high-order imaginary time propagators for path-integral Monte Carlo simulations by subtracting lower order propagators. By requiring all terms of the extrapolated propagator be sampled uniformly, the subtraction…
The present work provides a comprehensive study of symmetric-conjugate operator splitting methods in the context of linear parabolic problems and demonstrates their additional benefits compared to symmetric splitting methods. Relevant…
We give an algorithm for the hidden subgroup problem for the dihedral group $D_N$, or equivalently the cyclic hidden shift problem, that supersedes our first algorithm and is suggested by Regev's algorithm. It runs in $\exp(O(\sqrt{\log…
We discuss time dependent quantum systems on bounded domains. Our work may be viewed as a framework for several models, including linear iterations involved in time dependent density functional theory (TDDFT), the Hartree-Fock model, or…
An algorithm for a family of self-starting high-order implicit time integration schemes with controllable numerical dissipation is proposed for both linear and nonlinear transient problems. This work builds on the previous works of the…