Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Functional Analysis and Its Applications

Probabilistic Approximation of the Evolution Operator

Il'dar Abdullovich Ibragimov, Nataliya V. Smorodina, Михаил Михайлович Фаддеев

Published Apr 1, 2018• 8 citations
Publisher
DOI
10.1007/s10688-018-0216-5

Related papers

A Probabilistic Approximation of the Evolution Operator exp (t (S∇, ∇)) with a Complex Matrix S

Il'dar Abdullovich Ibragimov, Nataliya V. Smorodina, Михаил Михайлович Фаддеев

Journal of Mathematical Sciences•Jan 9, 2020•0 citations

Symmetric approximations for the evolution operator

T. Yu. Mikhaîlova, Vladimir I. Pupyshev

Physics Letters A•Jun 1, 1999•12 citations

Approximation of the Evolution Operator by Expectations of Functionals of Sums of Independent Random Variables

Il'dar Abdullovich Ibragimov, Nataliya V. Smorodina, Михаил Михайлович Фаддеев

A method of probabilistic approximation of the operator $e^{-itH}$, where $H = -\frac{1}{2}\,\frac{d^2}{dx^2}+V(x), V\in L_\infty({\mathbf{R}})$, in the strong operator topology is proposed. The approximating operators have the form of expectations of functionals of sums of independent identically distributed random variables.

Theory of Probability and Its Applications•Jan 1, 2019•0 citations

Bounding the Convergence Time of Local Probabilistic Evolution

Simon Apers, Alain Sarlette, Francesco Ticozzi

arXiv:1711.06024•Lecture notes in computer science•Jan 1, 2017•2 citations

A probabilistic imaginary-time evolution quantum algorithm for advection-diffusion equation: Explicit gate-level implementation and comparisons to quantum linear system algorithms

Xinchi Huang, Hirofumi Nishi, Taichi Kosugi +2 more

Simulating differential equations on classical computers becomes an intractable problem if the grid size is extremely large. Quantum computers are believed to achieve a possibly exponential speedup in the matrix operation. In this paper, we propose a quantum algorithm for solving the advection-diffusion-reaction equation by employing a novel approximate probabilistic imaginary-time evolution (PITE) operator. First, the effectiveness of the proposed approximate PITE operator is justified by the theoretical evaluation of the error. Next, we construct the explicit quantum circuit to realize the imaginary-time evolution of the Hamiltonian coming from the advection-diffusion equation, whose gate complexity is logarithmic regarding the size of the discretized Hamiltonian matrix. Compared to the existing algorithms for the quantum linear system problem, our algorithm achieves an exponential speedup regarding the matrix size at the cost of a worse dependence on the error bound. Moreover, numerical simulations using gate-based quantum emulator for 1D/2D examples are also provided to verify our algorithm. Finally, we extend our algorithm to the coupled system of advection-diffusion equations to show the prospects for practical applications.

arXiv:2409.18559•Sep 27, 2024•0 citations

On the representation of linear evolution operators

Andrzej Posiewnik

Reports on Mathematical Physics•Jun 1, 1984•0 citations
A method of probabilistic approximation of the operator e−itHe^{-itH}e−itH, where H=−12 d2dx2+V(x),V∈L∞(R)H = -\frac{1}{2}\,\frac{d^2}{dx^2}+V(x), V\in L_\infty({\mathbf{R}})H=−21​dx2d2​+V(x),V∈L∞​(R), in the strong operator topology is proposed. The approximating operators have the form of expectations of functionals of sums of independent identically distributed random variables.
Simulating differential equations on classical computers becomes an intractable problem if the grid size is extremely large. Quantum computers are believed to achieve a possibly exponential speedup in the matrix operation. In this paper, we propose a quantum algorithm for solving the advection-diffusion-reaction equation by employing a novel approximate probabilistic imaginary-time evolution (PITE) operator. First, the effectiveness of the proposed approximate PITE operator is justified by the theoretical evaluation of the error. Next, we construct the explicit quantum circuit to realize the imaginary-time evolution of the Hamiltonian coming from the advection-diffusion equation, whose gate complexity is logarithmic regarding the size of the discretized Hamiltonian matrix. Compared to the existing algorithms for the quantum linear system problem, our algorithm achieves an exponential speedup regarding the matrix size at the cost of a worse dependence on the error bound. Moreover, numerical simulations using gate-based quantum emulator for 1D/2D examples are also provided to verify our algorithm. Finally, we extend our algorithm to the coupled system of advection-diffusion equations to show the prospects for practical applications.