Related papers: Fourth-order leapfrog algorithms for numerical tim…
In this paper, we extend several time reversible numerical integrators to solve the Lorentz force equations from second order accuracy to higher order accuracy for relativistic charged particle tracking in electromagnetic fields. A fourth…
We consider second order explicit and implicit two-step time-discrete schemes for wave-type equations. We derive optimal order aposteriori estimates controlling the time discretization error. Our analysis, has been motivated by the need to…
Dissipation and irreversibility are central to most physical processes, yet they lead to non-unitary dynamics that are challenging to realise on quantum processors. High-order operator splitting is an attractive approach for simulating…
We discuss systematic extensions of the standard (St{\"o}rmer-Verlet) splitting method for differential equations of Hamiltonian mechanics, with relative accuracy of order $\tau^2$ for a timestep of length $\tau$, to higher orders in…
Since 2005 there has been a huge growth in the use of engineered control pulses to perform desired quantum operations in systems such as NMR quantum information processors. These approaches, which build on the original gradient ascent pulse…
Classical quasi-integrable systems are known to have Lyapunov times much shorter than their ergodicity time, but the situation for their quantum counterparts is less well understood. As a first example, we examine the quantum Lyapunov…
In this paper, authors successfully construct a new algorithm for the new higher order scheme of weak approximation of SDEs. The algorithm presented here is based on [1][2]. Although this algorithm shares some features with the algorithm…
We propose an efficient algorithm for the approximation of fractional integrals by using Runge--Kutta based convolution quadrature. The algorithm is based on a novel integral representation of the convolution weights and a special…
We begin with a treatment of the Caputo time-fractional diffusion equation, by using the Laplace transform, to obtain a Volterra intego-differential equation where we may examine the weakly singular nature of this convolution…
This work presents a new evolutionary optimization algorithm in theoretical mathematics with important applications in scientific computing. The use of the evolutionary algorithm is justified by the difficulty of the study of the…
We propose and develop a general method of numerical calculation of the wave function time evolution in a quantum system which is described by Hamiltonian of an arbitrary dimensionality and with arbitrary interactions. For this, we obtain a…
We explore the applicability of a stochastic time-evolution algorithm based on probabilistic angle interpolation. To simplify the pre-processing of the algorithm, we take the continuous-time limit, thereby explicitly eliminating Trotter…
Regularized factorization is proposed to simulate time evolution for quantum lattice systems. Transcending the Trotter decomposition, the resulting compact structure of the propagator indicates a high-order Baker-Campbell-Hausdorff series.…
A set of algorithms is presented for efficient numerical calculation of the time evolution of classical dynamical systems. Starting with a first approximation for solving the differential equations that has a "reversible" character, we show…
The explicit split-operator algorithm is often used for solving the linear and nonlinear time-dependent Schr\"{o}dinger equations. However, when applied to certain nonlinear time-dependent Schr\"{o}dinger equations, this algorithm loses…
When simulating trajectories by integrating time-continuous car-following models, standard integration schemes such as the forth-order Runge-Kutta method (RK4) are rarely used while the simple Euler's method is popular among researchers. We…
We have evaluated perturbation coefficients of Wilson loops up to $O(g^8)$ for the four-dimensional twisted Eguchi-Kawai model using the numerical stochastic perturbation theory (NSPT) in arXiv:1902.09847. In this talk we present a progress…
Simulating the time evolution of quantum field theories given some Hamiltonian $H$ requires developing algorithms for implementing the unitary operator e^{-iHt}. A variety of techniques exist that accomplish this task, with the most common…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
For quantum theories with a classical limit (which includes the large N limits of typical field theories), we derive a hierarchy of evolution equations for equal time correlators which systematically incorporate corrections to the limiting…