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:1604.02992 · Physical Review A

Algorithmic quantum simulation of memory effects

Unai Alvarez-Rodriguez, Roberto Di Candia, Jorge Casanova, Mikel Sanz, E. Solano

Published Feb 1, 2017• 8 citations
arXivHTMLPDF

Abstract

We propose a method for the algorithmic quantum simulation of memory effects described by integrodifferential evolution equations. It consists in the systematic use of perturbation theory techniques and a Markovian quantum simulator. Our method aims to efficiently simulate both completely positive and nonpositive dynamics without the requirement of engineering non-Markovian environments. Finally, we find that small error bounds can be reached with polynomially scaling resources, evaluated as the time required for the simulation.

DOI
10.1103/physreva.95.020301

Related papers

Quantum Simulation of Dissipative Processes without Reservoir Engineering

R. Di Candia, J. S. Pedernales, A. del Campo +2 more

We present a quantum algorithm to simulate general finite dimensional Lindblad master equations without the requirement of engineering the system-environment interactions. The proposed method is able to simulate both Markovian and non-Markovian quantum dynamics. It consists in the quantum computation of the dissipative corrections to the unitary evolution of the system of interest, via the reconstruction of the response functions associated with the Lindblad operators. Our approach is equally applicable to dynamics generated by effectively non-Hermitian Hamiltonians. We confirm the quality of our method providing specific error bounds that quantify its accuracy.

arXiv:1406.2592•Scientific Reports•May 29, 2015•45 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

Multiple-scale integro-differential perturbation method for generic non-Markovian environments

Xiangyi Meng, Yang Li, Jianwei Zhang +2 more

Non-Markovianity may significantly speed up quantum dynamics when the system interacts strongly with an infinite large reservoir, of which the coupling spectrum should be fine-tuned. The potential benefits are evident in many dynamics schemes, especially the continuous-time quantum walk. Difficulty exists, however, in producing closed-form solutions with controllable accuracy against the complexity of memory kernels. Here, we introduce a new multiple-scale perturbation method that works on integro-differential equations for general study of memory effects in dynamical systems. We propose an open-system model in which a continuous-time quantum walk is enclosed in a non-Markovian reservoir, that naturally corresponds to an error correction algorithm scheme. By applying the multiple-scale method we show how emergence of different time scales is related to transition of system dynamics into the non-Markovian regime. We find that up to two long-term modes and two short-term modes exist in regular networks, limited by their intrinsic symmetries. In addition to the effective approximation by our perturbation method on general forms of reservoirs, the speed-up of quantum walks assisted by non-Markovianity is also confirmed, revealing the advantage of reservoir engineering in designing time-sensitive quantum algorithms.

arXiv:1603.06261•Mar 20, 2016•2 citations

Optimal quantum simulation of open quantum systems

Pragati Gupta, C. M. Chandrashekar

Digital quantum simulation on quantum systems require algorithms that can be implemented using finite quantum resources. Recent studies have demonstrated digital quantum simulation of open quantum systems on Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we develop quantum circuits for optimal simulation of Markovian and Non-Markovian open quantum systems. The circuits use ancilla qubits to simulate the environment, and memory effects are induced by storing information about the system on extra qubits. We simulate the amplitude damping channel and dephasing channel as examples of the framework and infer (Non-)Markovianity from the (non-)monotonic behaviour of the dynamics. Further, we develop a method to optimize simulations by decomposing complex open quantum dynamics into smaller parts, that can be simulated using a small number of qubits. We show that this optimization reduces quantum space complexity from $O(l)$ to $O(1)$ for simulating the environment.

arXiv:2012.07540•Dec 14, 2020•8 citations

Quantum simulation of open quantum systems.

Ryan Sweke

Over the last two decades the field of quantum simulations has experienced incredible \ngrowth, which, coupled with progress in the development of controllable quantum \nplatforms, has recently begun to allow for the realisation of quantum simulations of a \nplethora of quantum phenomena in a variety of controllable quantum platforms. Within \nthe context of these developments, we investigate within this thesis methods for the \nquantum simulation of open quantum systems. \nMore specically, in the first part of the thesis we consider the simulation of Markovian \nopen quantum systems, and begin by leveraging previously constructed universal \nsets of single-qubit Markovian processes, as well as techniques from Hamiltonian simulation, \nfor the construction of an efficient algorithm for the digital quantum simulation \nof arbitrary single-qubit Markovian open quantum systems. The algorithm we provide, \nwhich requires only a single ancillary qubit, scales slightly superlinearly with respect \nto time, which given a recently proven no fast-forwarding theorem for Markovian dynamics, \nis therefore close to optimal. Building on these results, we then proceed to \nexplicitly construct a universal set of Markovian processes for quantum systems of any \ndimension. Specifically, we prove that any Markovian open quantum system, described \nby a one-parameter semigroup of quantum channels, can be simulated through coherent \noperations and sequential simulations of processes from the universal set. Under the assumption \nthat these universal Markovian processes can be efficiently implemented, this \nallows us to propose an efficient algorithm for a wide class of Markovian open quantum \nsystems, while simultaneously providing a tool for combining and exploiting existing \nsimulation methods. \nIn the second part of this thesis we then consider the simulation of many-body non- \nMarkovian open quantum systems. In particular, we develop an algorithmic procedure \nfor the quantum simulation of system propagators which are not completely positive \nmaps, which allows us to provide an explicit algorithm for the digital quantum simulation \nof many-body locally-indivisible non-Markovian open quantum systems described by \ntime-dependent master equations. Finally we construct generalised Suzuki-Lie-Trotter \ntheorems which allow us to analyse the efficiency of our method, which is expected to \nbe experimentally achievable for a variety of interesting cases.

•Jan 1, 2016•0 citations

Efficient construction of time-invariant process tensors for simulating high-dimensional non-Markovian open quantum systems

Émile Cochin, Jonathan Keeling, Brendon W. Lovett +1 more

Numerical methods for obtaining exact dynamics of non-Markovian open quantum systems are mostly limited to either small systems or to short-time evolution only. Here, we propose a new algorithm for computing process tensors--matrix product operator (MPO) representations that capture the environment influence--which achieves greatly enhanced computational scalings with system size, while maintaining linear scaling with simulation length. We build on recent developments in the field which allow for long-time evolutions through process tensors which have a time-translational invariance. These can be built for general Gaussian environments and generic coupling operators with the system using infinite time-evolving block decimation (iTEBD). We introduce a modified iTEBD algorithm using intermediate compression steps which bring down the computation time scaling with system size $d$ from $\mathcal{O}(d^8)$ to $\mathcal{O}(d^4)$, as well as significantly lowering the required memory. To illustrate the power of this method, we apply it to the problem of dispersive qubit readout in circuit QED, which was previously out-of-reach numerically. The full treatment of the measurement resonator, which requires a large system space, combined with the long simulation times precipitated by the separation of timescales between the measurement drive and the environment dissipation, is now possible. The algorithm we introduce not only allows for capturing non-Markovian dynamics in large open quantum systems, but also further extends all the existing capabilities of process tensors, for example in quantum optimal control, or in computation of multi-time correlations or of steady states, to more complex systems with tens of levels.

quant-pharXiv:2603.06840•Mar 10, 2026•8 citations
We propose a method for the algorithmic quantum simulation of memory effects described by integrodifferential evolution equations. It consists in the systematic use of perturbation theory techniques and a Markovian quantum simulator. Our method aims to efficiently simulate both completely positive and nonpositive dynamics without the requirement of engineering non-Markovian environments. Finally, we find that small error bounds can be reached with polynomially scaling resources, evaluated as the time required for the simulation.
We present a quantum algorithm to simulate general finite dimensional Lindblad master equations without the requirement of engineering the system-environment interactions. The proposed method is able to simulate both Markovian and non-Markovian quantum dynamics. It consists in the quantum computation of the dissipative corrections to the unitary evolution of the system of interest, via the reconstruction of the response functions associated with the Lindblad operators. Our approach is equally applicable to dynamics generated by effectively non-Hermitian Hamiltonians. We confirm the quality of our method providing specific error bounds that quantify its accuracy.
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.
Non-Markovianity may significantly speed up quantum dynamics when the system interacts strongly with an infinite large reservoir, of which the coupling spectrum should be fine-tuned. The potential benefits are evident in many dynamics schemes, especially the continuous-time quantum walk. Difficulty exists, however, in producing closed-form solutions with controllable accuracy against the complexity of memory kernels. Here, we introduce a new multiple-scale perturbation method that works on integro-differential equations for general study of memory effects in dynamical systems. We propose an open-system model in which a continuous-time quantum walk is enclosed in a non-Markovian reservoir, that naturally corresponds to an error correction algorithm scheme. By applying the multiple-scale method we show how emergence of different time scales is related to transition of system dynamics into the non-Markovian regime. We find that up to two long-term modes and two short-term modes exist in regular networks, limited by their intrinsic symmetries. In addition to the effective approximation by our perturbation method on general forms of reservoirs, the speed-up of quantum walks assisted by non-Markovianity is also confirmed, revealing the advantage of reservoir engineering in designing time-sensitive quantum algorithms.
Digital quantum simulation on quantum systems require algorithms that can be implemented using finite quantum resources. Recent studies have demonstrated digital quantum simulation of open quantum systems on Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we develop quantum circuits for optimal simulation of Markovian and Non-Markovian open quantum systems. The circuits use ancilla qubits to simulate the environment, and memory effects are induced by storing information about the system on extra qubits. We simulate the amplitude damping channel and dephasing channel as examples of the framework and infer (Non-)Markovianity from the (non-)monotonic behaviour of the dynamics. Further, we develop a method to optimize simulations by decomposing complex open quantum dynamics into smaller parts, that can be simulated using a small number of qubits. We show that this optimization reduces quantum space complexity from O(l)O(l)O(l) to O(1)O(1)O(1) for simulating the environment.
Over the last two decades the field of quantum simulations has experienced incredible \ngrowth, which, coupled with progress in the development of controllable quantum \nplatforms, has recently begun to allow for the realisation of quantum simulations of a \nplethora of quantum phenomena in a variety of controllable quantum platforms. Within \nthe context of these developments, we investigate within this thesis methods for the \nquantum simulation of open quantum systems. \nMore specically, in the first part of the thesis we consider the simulation of Markovian \nopen quantum systems, and begin by leveraging previously constructed universal \nsets of single-qubit Markovian processes, as well as techniques from Hamiltonian simulation, \nfor the construction of an efficient algorithm for the digital quantum simulation \nof arbitrary single-qubit Markovian open quantum systems. The algorithm we provide, \nwhich requires only a single ancillary qubit, scales slightly superlinearly with respect \nto time, which given a recently proven no fast-forwarding theorem for Markovian dynamics, \nis therefore close to optimal. Building on these results, we then proceed to \nexplicitly construct a universal set of Markovian processes for quantum systems of any \ndimension. Specifically, we prove that any Markovian open quantum system, described \nby a one-parameter semigroup of quantum channels, can be simulated through coherent \noperations and sequential simulations of processes from the universal set. Under the assumption \nthat these universal Markovian processes can be efficiently implemented, this \nallows us to propose an efficient algorithm for a wide class of Markovian open quantum \nsystems, while simultaneously providing a tool for combining and exploiting existing \nsimulation methods. \nIn the second part of this thesis we then consider the simulation of many-body non- \nMarkovian open quantum systems. In particular, we develop an algorithmic procedure \nfor the quantum simulation of system propagators which are not completely positive \nmaps, which allows us to provide an explicit algorithm for the digital quantum simulation \nof many-body locally-indivisible non-Markovian open quantum systems described by \ntime-dependent master equations. Finally we construct generalised Suzuki-Lie-Trotter \ntheorems which allow us to analyse the efficiency of our method, which is expected to \nbe experimentally achievable for a variety of interesting cases.
Numerical methods for obtaining exact dynamics of non-Markovian open quantum systems are mostly limited to either small systems or to short-time evolution only. Here, we propose a new algorithm for computing process tensors--matrix product operator (MPO) representations that capture the environment influence--which achieves greatly enhanced computational scalings with system size, while maintaining linear scaling with simulation length. We build on recent developments in the field which allow for long-time evolutions through process tensors which have a time-translational invariance. These can be built for general Gaussian environments and generic coupling operators with the system using infinite time-evolving block decimation (iTEBD). We introduce a modified iTEBD algorithm using intermediate compression steps which bring down the computation time scaling with system size ddd from O(d8)\mathcal{O}(d^8)O(d8) to O(d4)\mathcal{O}(d^4)O(d4), as well as significantly lowering the required memory. To illustrate the power of this method, we apply it to the problem of dispersive qubit readout in circuit QED, which was previously out-of-reach numerically. The full treatment of the measurement resonator, which requires a large system space, combined with the long simulation times precipitated by the separation of timescales between the measurement drive and the environment dissipation, is now possible. The algorithm we introduce not only allows for capturing non-Markovian dynamics in large open quantum systems, but also further extends all the existing capabilities of process tensors, for example in quantum optimal control, or in computation of multi-time correlations or of steady states, to more complex systems with tens of levels.