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

arXiv:2411.18168 · The Journal of Chemical Physics

Quantum algorithm for the simulation of non-Markovian quantum dynamics using Feynman–Vernon influence functional

Avin Seneviratne, Peter Walters, Fei Wang

Published May 15, 2025• 4 citations
arXivHTMLPDF

Abstract

In this work, we developed a quantum algorithm for the simulation of non-Markovian quantum dynamics based on the Feynman-Vernon's path integral formulation. The algorithm performs the full path sum and proves to be polynomial either in time or in space, compared to the same classical algorithm, which is exponential in time. In addition, the algorithm has no classical overhead and is equally applicable regardless of whether the temporal entanglement due to non-Markovianity is low or high, making it a unified framework for simulating non-Markovian dynamics in open quantum systems.

DOI
10.1063/5.0258227

Related papers

Quantum Fast Forwarding of Non-Markovian Quantum Dynamics

Avin Seneviratne, Peter Walters, Fei Wang

In this work, we present a quantum algorithm for simulating non-Markovian quantum dynamics based on the Feynman-Vernon influence functional formalism, which provides an exact description of the dynamics of a quantum system linearly coupled to a harmonic bath. In condensed-phase environments, the bath correlation functions typically decay over time, allowing them to be truncated beyond a finite time scale and enabling an iterative propagation scheme. We implement the finite-memory propagator using a fast-forwarding algorithm that achieves constant circuit depth with respect to the number of propagation steps, while the nonunitary matrices are realized on quantum circuits using unitary dilation. We further exploit the structure of the unitary dilation to show that the additional circuit complexity introduced by the dilation scales polynomially with the number of dilation ancilla qubits, while the dominant computational cost arises from the implementation of the underlying 1-dilation. The algorithm is compared with classical benchmark calculations for the spin-boson model and shows close agreement. Together, these developments establish a quantum-circuit framework for fast forwarding non-Markovian dynamics and identify the principal computational bottlenecks that must be overcome to achieve quantum advantage.

The Journal of Physical Chemistry Letters•Oct 12, 2026•0 citations

Quantum simulation of non-Markovian dynamical systems

Abtin Ameri, Arkopal Dutt, Hari Krovi

Existing quantum algorithms for simulating dynamical systems -- from Hamiltonian simulation to linear and nonlinear differential equations solvers -- simulate Markovian dynamics, in which the system's future evolution depends solely on its current state. We turn our attention to developing quantum algorithms for non-Markovian dynamical systems where the system's future evolution depends on its past history and thus has memory. Specifically, we develop efficient algorithms for linear Volterra integro-differential equations (VIDEs) with a convolution memory kernel that output a quantum state encoding the state description over a time interval or at a particular time. Given efficient circuits for the problem inputs, our algorithms achieve an exponential speedup in system size over existing classical algorithms. We develop an algorithm for general kernels assuming that $\textsf{M} < 1$, where $\textsf{M}$ characterizes the strength of the memory term relative to the dissipation of the Markovian part of the dynamics. We complement this with lower bounds for general-kernel VIDEs when $\textsf{M} \geq 1$, showing that the problem becomes intractable for a family of systems. However, by specializing to structured kernels which admit concise decompositions over exponentials, we develop efficient quantum algorithms even when $\textsf M \geq 1$ by converting the VIDE into a larger set of ODEs, a procedure which we call Markovianization. As an application of the overall framework, we discuss the Mori-Zwanzig formalism used in open quantum systems and fluid dynamics. Overall, our results expand the range of dynamical systems that quantum computers can simulate efficiently.

quant-pharXiv:2608.13533•Aug 14, 2026•2 citations

Path integral quantum algorithm for simulating non-Markovian quantum dynamics in open quantum systems

Peter Walters, Fei Wang

Research in open quantum system dynamics has received growing interest in recent years, and its ongoing investigation has uncovered many intriguing physics departing from closed systems. A particularly useful application of the open quantum system theory is to simulate quantum dynamical processes in condensed phase materials. As the quantum degree of freedom is constantly under the influence of its thermal environment, the accurate description of the dynamics often requires non-Markovian time evolution at finite temperature. Such calculation is usually quite challenging on classical computers as extensive memory storage is required. In this work, we focus on a quantum system linearly coupled to its harmonic bath and present a path integral based quantum algorithm that time-evolves the reduced density matrix under finite temperature non-Markovian dynamics. To treat the nonunitary time evolution, the Sz.-Nagy dilation scheme is used for the conversion to unitary dynamics that can be implementable on gate-based quantum computers. The modified Hadamard test is then used to retrieve all the information of the reduced density matrix. Complexity analysis shows that the memory requirement has exponential reduction on the quantum machine whereas the runtime complexity stays roughly the same as for the classical computer. It points to the possibility of using this algorithm to simulate multilevel and multisite non-Markovian quantum dynamics that are beyond the reach of classical computers. The algorithm makes no ad hoc assumptions and extends naturally beyond Markovian and weak coupling regimes. We validated the algorithm on the quantum simulator with the spin-boson model and demonstrated its excellent agreement with the classical computer benchmark. Published by the American Physical Society 2024

Physical Review Research•Feb 1, 2024•18 citations

Simulating Non-Markovian Dynamics in Open Quantum Systems

Meng Xu, Vasilii Vadimov, J. T. Stockburger +1 more

Recent advances in quantum technologies and related experiments have created a need for highly accurate, versatile, and computationally efficient simulation techniques for the dynamics of open quantum systems. Long-lived correlation effects (non-Markovianity), system-environment hybridization, and the necessity for accuracy beyond the Born-Markov approximation form particular challenges. Approaches to meet these challenges have been introduced, originating from different fields, such as hierarchical equations of motion, Lindblad-pseudomode formulas, chain-mapping approaches, quantum Brownian motion master equations, stochastic unravelings, and refined quantum master equations. This diversity, while indicative of the field's relevance, has inadvertently led to a fragmentation that hinders cohesive advances and their effective cross-community application to current problems for complex systems. How are different approaches related to each other? What are their strengths and limitations? Here we give a systematic overview and concise discussion addressing these questions. We make use of a unified framework which very conveniently allows to link different schemes and, this way, may also catalyze further progress. In line with the state of the art, this framework is formulated not in a fully reduced space of the system but in an extended state space which in a minimal fashion includes effective reservoir modes. This in turn offers a comprehensive understanding of existing methods, elucidating their physical interpretations, interconnections, and applicability.

quant-pharXiv:2601.02160•Reviews of Modern Physics•Jan 6, 2026•21 citations

Analytically continued physical states in the path-integral: a sign-problem-free Quantum Monte Carlo simulation of Bell states dynamics

Evgeny Polyakov, Alexey N. Rubtsov

The derivation of path integrals is reconsidered. It is shown that the expression for the discretized action is not unique, and the path integration domain can be deformed so that at least Gaussian path integrals become probabillistic. This leads to a practical algorithm of sign-problem-free Monte Carlo sampling from the Gaussian path integrals. Moreover, the dynamical influence of Gaussian quantum system (the bath) on any other quantum system can be exactly represented as interaction with classical non-Markovian noise. We discuss the relation of these findings to the Bell's theorem and the Feynman's conjecture on the exponential complexity of the classical simulation of quantum systems. In Feynman's path integral we have quasiprobability distributions for trajectories, and in analitycally continued path integrals we have probability distributions for quasitrajectories.

arXiv:1610.08964•Oct 25, 2016•0 citations

Quantum correlation functions through tensor network path integral

Amartya Bose

Tensor networks have historically proven to be of great utility in providing compressed representations of wave functions that can be used for the calculation of eigenstates. Recently, it has been shown that a variety of these networks can be leveraged to make real time non-equilibrium simulations of dynamics involving the Feynman-Vernon influence functional more efficient. In this work, a tensor network is developed for non-perturbatively calculating the equilibrium correlation function for open quantum systems using the path integral methodology. These correlation functions are of fundamental importance in calculations of rates of reactions, simulations of response functions and susceptibilities, spectra of systems, etc. The influence of the solvent on the quantum system is incorporated through an influence functional, whose unconventional structure motivates the design of a new optimal matrix product-like operator that can be applied to the so-called path amplitude matrix product state. This complex-time tensor network path integral approach provides an exceptionally efficient representation of the path integral, enabling simulations for larger systems strongly interacting with baths and at lower temperatures out to longer time. The derivation, design, and implementation of this method are discussed along with a wide range of illustrations ranging from rate theory and symmetrized spin correlation functions to simulation of response of the Fenna-Matthews-Olson complex to light.

arXiv:2308.10540•The Journal of Chemical Physics•Dec 5, 2023•7 citations
In this work, we developed a quantum algorithm for the simulation of non-Markovian quantum dynamics based on the Feynman-Vernon's path integral formulation. The algorithm performs the full path sum and proves to be polynomial either in time or in space, compared to the same classical algorithm, which is exponential in time. In addition, the algorithm has no classical overhead and is equally applicable regardless of whether the temporal entanglement due to non-Markovianity is low or high, making it a unified framework for simulating non-Markovian dynamics in open quantum systems.
In this work, we present a quantum algorithm for simulating non-Markovian quantum dynamics based on the Feynman-Vernon influence functional formalism, which provides an exact description of the dynamics of a quantum system linearly coupled to a harmonic bath. In condensed-phase environments, the bath correlation functions typically decay over time, allowing them to be truncated beyond a finite time scale and enabling an iterative propagation scheme. We implement the finite-memory propagator using a fast-forwarding algorithm that achieves constant circuit depth with respect to the number of propagation steps, while the nonunitary matrices are realized on quantum circuits using unitary dilation. We further exploit the structure of the unitary dilation to show that the additional circuit complexity introduced by the dilation scales polynomially with the number of dilation ancilla qubits, while the dominant computational cost arises from the implementation of the underlying 1-dilation. The algorithm is compared with classical benchmark calculations for the spin-boson model and shows close agreement. Together, these developments establish a quantum-circuit framework for fast forwarding non-Markovian dynamics and identify the principal computational bottlenecks that must be overcome to achieve quantum advantage.
Existing quantum algorithms for simulating dynamical systems -- from Hamiltonian simulation to linear and nonlinear differential equations solvers -- simulate Markovian dynamics, in which the system's future evolution depends solely on its current state. We turn our attention to developing quantum algorithms for non-Markovian dynamical systems where the system's future evolution depends on its past history and thus has memory. Specifically, we develop efficient algorithms for linear Volterra integro-differential equations (VIDEs) with a convolution memory kernel that output a quantum state encoding the state description over a time interval or at a particular time. Given efficient circuits for the problem inputs, our algorithms achieve an exponential speedup in system size over existing classical algorithms. We develop an algorithm for general kernels assuming that M<1\textsf{M} < 1M<1, where M\textsf{M}M characterizes the strength of the memory term relative to the dissipation of the Markovian part of the dynamics. We complement this with lower bounds for general-kernel VIDEs when M≥1\textsf{M} \geq 1M≥1, showing that the problem becomes intractable for a family of systems. However, by specializing to structured kernels which admit concise decompositions over exponentials, we develop efficient quantum algorithms even when M≥1\textsf M \geq 1M≥1 by converting the VIDE into a larger set of ODEs, a procedure which we call Markovianization. As an application of the overall framework, we discuss the Mori-Zwanzig formalism used in open quantum systems and fluid dynamics. Overall, our results expand the range of dynamical systems that quantum computers can simulate efficiently.
Research in open quantum system dynamics has received growing interest in recent years, and its ongoing investigation has uncovered many intriguing physics departing from closed systems. A particularly useful application of the open quantum system theory is to simulate quantum dynamical processes in condensed phase materials. As the quantum degree of freedom is constantly under the influence of its thermal environment, the accurate description of the dynamics often requires non-Markovian time evolution at finite temperature. Such calculation is usually quite challenging on classical computers as extensive memory storage is required. In this work, we focus on a quantum system linearly coupled to its harmonic bath and present a path integral based quantum algorithm that time-evolves the reduced density matrix under finite temperature non-Markovian dynamics. To treat the nonunitary time evolution, the Sz.-Nagy dilation scheme is used for the conversion to unitary dynamics that can be implementable on gate-based quantum computers. The modified Hadamard test is then used to retrieve all the information of the reduced density matrix. Complexity analysis shows that the memory requirement has exponential reduction on the quantum machine whereas the runtime complexity stays roughly the same as for the classical computer. It points to the possibility of using this algorithm to simulate multilevel and multisite non-Markovian quantum dynamics that are beyond the reach of classical computers. The algorithm makes no ad hoc assumptions and extends naturally beyond Markovian and weak coupling regimes. We validated the algorithm on the quantum simulator with the spin-boson model and demonstrated its excellent agreement with the classical computer benchmark. Published by the American Physical Society 2024
Recent advances in quantum technologies and related experiments have created a need for highly accurate, versatile, and computationally efficient simulation techniques for the dynamics of open quantum systems. Long-lived correlation effects (non-Markovianity), system-environment hybridization, and the necessity for accuracy beyond the Born-Markov approximation form particular challenges. Approaches to meet these challenges have been introduced, originating from different fields, such as hierarchical equations of motion, Lindblad-pseudomode formulas, chain-mapping approaches, quantum Brownian motion master equations, stochastic unravelings, and refined quantum master equations. This diversity, while indicative of the field's relevance, has inadvertently led to a fragmentation that hinders cohesive advances and their effective cross-community application to current problems for complex systems. How are different approaches related to each other? What are their strengths and limitations? Here we give a systematic overview and concise discussion addressing these questions. We make use of a unified framework which very conveniently allows to link different schemes and, this way, may also catalyze further progress. In line with the state of the art, this framework is formulated not in a fully reduced space of the system but in an extended state space which in a minimal fashion includes effective reservoir modes. This in turn offers a comprehensive understanding of existing methods, elucidating their physical interpretations, interconnections, and applicability.
The derivation of path integrals is reconsidered. It is shown that the expression for the discretized action is not unique, and the path integration domain can be deformed so that at least Gaussian path integrals become probabillistic. This leads to a practical algorithm of sign-problem-free Monte Carlo sampling from the Gaussian path integrals. Moreover, the dynamical influence of Gaussian quantum system (the bath) on any other quantum system can be exactly represented as interaction with classical non-Markovian noise. We discuss the relation of these findings to the Bell's theorem and the Feynman's conjecture on the exponential complexity of the classical simulation of quantum systems. In Feynman's path integral we have quasiprobability distributions for trajectories, and in analitycally continued path integrals we have probability distributions for quasitrajectories.
Tensor networks have historically proven to be of great utility in providing compressed representations of wave functions that can be used for the calculation of eigenstates. Recently, it has been shown that a variety of these networks can be leveraged to make real time non-equilibrium simulations of dynamics involving the Feynman-Vernon influence functional more efficient. In this work, a tensor network is developed for non-perturbatively calculating the equilibrium correlation function for open quantum systems using the path integral methodology. These correlation functions are of fundamental importance in calculations of rates of reactions, simulations of response functions and susceptibilities, spectra of systems, etc. The influence of the solvent on the quantum system is incorporated through an influence functional, whose unconventional structure motivates the design of a new optimal matrix product-like operator that can be applied to the so-called path amplitude matrix product state. This complex-time tensor network path integral approach provides an exceptionally efficient representation of the path integral, enabling simulations for larger systems strongly interacting with baths and at lower temperatures out to longer time. The derivation, design, and implementation of this method are discussed along with a wide range of illustrations ranging from rate theory and symmetrized spin correlation functions to simulation of response of the Fenna-Matthews-Olson complex to light.