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

Scientific Reports

Duality quantum algorithm efficiently simulates open quantum systems

Shi-Jie Wei, Dong Ruan, Gui‐Lu Long

Published Jul 28, 2016• 67 citations
Publisher

Abstract

Because of inevitable coupling with the environment, nearly all practical quantum systems are open system, where the evolution is not necessarily unitary. In this paper, we propose a duality quantum algorithm for simulating Hamiltonian evolution of an open quantum system. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality quantum algorithm, the time evolution of the open quantum system is realized by using Kraus operators which is naturally implemented in duality quantum computer. This duality quantum algorithm has two distinct advantages compared to existing quantum simulation algorithms with unitary evolution operations. Firstly, the query complexity of the algorithm is O(d(3)) in contrast to O(d(4)) in existing unitary simulation algorithm, where d is the dimension of the open quantum system. Secondly, By using a truncated Taylor series of the evolution operators, this duality quantum algorithm provides an exponential improvement in precision compared with previous unitary simulation algorithm.

DOI
10.1038/srep30727

Related papers

Efficient simulation of open quantum system in duality quantum computing

Shi-Jie Wei, Gui‐Lu Long

Practical quantum systems are open systems due to interactions with their environment. Understanding the evolution of open systems dynamics is important for quantum noise processes , designing quantum error correcting codes, and performing simulations of open quantum systems. Here we proposed an efficient quantum algorithm for simulating the evolution of an open quantum system on a duality quantum computer. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality algorithm, the time evolution of open quantum system is realized by using Kraus operators which is naturally realized in duality quantum computing. Compared to the Lloyd's quantum algorithm [Science.273, 1073(1996)] , the dependence on the dimension of the open quantum system in our algorithm is decreased. Moreover, our algorithm uses a truncated Taylor series of the evolution operators, exponentially improving the performance on the precision compared with existing quantum simulation algorithms with unitary evolution operations.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 3, 2016•3 citations

Simulating Hamiltonian Dynamics with a Truncated Taylor Series

Dominic William Berry, Andrew M. Childs, Richard Cleve +2 more

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations together with a robust form of oblivious amplitude amplification.

arXiv:1412.4687•Physical Review Letters•Mar 3, 2015•850 citations

Quantum-Trajectory-Inspired Lindbladian Simulation

Sirui Peng, Xiaoming Sun, Qi Zhao +1 more

Simulating the dynamics of open quantum systems is a crucial task in quantum computing, offering wide-ranging applications but remaining computationally challenging. In this paper, we propose two quantum algorithms for simulating the dynamics of open quantum systems governed by Lindbladians. We introduce a new approximation channel for short-time evolution, inspired by the quantum trajectory method, which underpins the efficiency of our algorithms. The first algorithm achieves a gate complexity independent of the number of jump operators, m , marking a significant improvement in efficiency. The second algorithm achieves near-optimal dependence on the evolution time t and precision ϵ and introduces only an additional O ~ ( m ) factor, which strictly improves upon state-of-the-art gate-based quantum algorithm that has an O ~ ( m 2 ) factor. The improvement stems from the integration of the new approximation channel with a novel structured linear combination of unitaries method. In both our algorithms, the reduction of dependence on m significantly enhances the efficiency of simulating practical dissipative processes characterized by a large number of jump operators.

arXiv:2408.10505•PRX Quantum•Aug 15, 2025•14 citations

Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems

Sophia Simon, Dominic W. Berry, Rolando D. Somma

We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity $\widetilde{\mathcal{O}}(ν\mathcal{L} t/ε)$, where the constant $ν$ depends on the problem parameters, $\mathcal{L}$ involves a time integral of upper bounds on the norms of evolution operators, and $ε$ is the error. In particular, $ν\mathcal{L}$ is linear in $t$ for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions, which can be extended to other quantum and classical systems. We compare with classical algorithms and give evidence of polynomial quantum speedups for systems in a lattice, which become more pronounced for systems with long-range interactions and can be shown to be exponential in general. We also provide a lower bound of $Ω(ν\mathcal{L} t/ε)$ for unitary or dissipative dynamics that proves our algorithm is optimal up to logarithmic factors.

quant-pharXiv:2605.16195•May 18, 2026•2 citations

An enhanced algorithm for simulating non-unitary dynamics on quantum computers

Mader, Simon

This thesis introduces an algorithm for efficiently simulating the non-unitary dynamics of open quantum systems on quantum computers. Open quantum systems interact with their surrounding environment, resulting in non-unitary dynamics. This creates a fundamental challenge for quantum simulation, since quantum hardware is inherently restricted to unitary operations. Building on the Kraus operator sum representation, this work explores dilation techniques that embed non-unitary maps into larger unitary operations, suitable for implementation on quantum processors. In addition to reproducing recent results from the literature, an enhanced algorithm that reuses the quantum state from the previous time step is presented. This reuse strategy increases efficiency, permits repeated application of the same quantum circuit, and shifts the dominant computational workload toward the quantum processor. The method is implemented and tested on models of the Fenna–Matthews–Olson light-harvesting complex and compares the obtained results against existing approaches. Importantly, the algorithm is broadly applicable to a wide class of open quantum systems. The proposed scheme provides a practical pathway for studying transport, dynamics, and spectral properties of interacting quantum systems on a quantum simulator, while keeping the demands on classical resources modest. The thesis concludes with a discussion of implementation details, numerical results, and prospects for scaling the method to larger systems.

•Jan 1, 2025•0 citations

Improved Hamiltonian simulation via a truncated Taylor series and corrections

Leonardo Novo, Dominic William Berry

We describe an improved version of the quantum algorithm for Hamiltonian simulation based on the implementation of a truncated Taylor series of the evolution operator. The idea is to add an extra step to the previously known algorithm which implements an operator that corrects the weightings of the Taylor series. This way, the desired accuracy is achieved with an improvement in the overall complexity of the algorithm. This quantum simulation method is applicable to a wide range of Hamiltonians of interest, including to quantum chemistry problems.

arXiv:1611.10033•Quantum Information and Computation•May 1, 2017•22 citations
Because of inevitable coupling with the environment, nearly all practical quantum systems are open system, where the evolution is not necessarily unitary. In this paper, we propose a duality quantum algorithm for simulating Hamiltonian evolution of an open quantum system. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality quantum algorithm, the time evolution of the open quantum system is realized by using Kraus operators which is naturally implemented in duality quantum computer. This duality quantum algorithm has two distinct advantages compared to existing quantum simulation algorithms with unitary evolution operations. Firstly, the query complexity of the algorithm is O(d(3)) in contrast to O(d(4)) in existing unitary simulation algorithm, where d is the dimension of the open quantum system. Secondly, By using a truncated Taylor series of the evolution operators, this duality quantum algorithm provides an exponential improvement in precision compared with previous unitary simulation algorithm.
Practical quantum systems are open systems due to interactions with their environment. Understanding the evolution of open systems dynamics is important for quantum noise processes , designing quantum error correcting codes, and performing simulations of open quantum systems. Here we proposed an efficient quantum algorithm for simulating the evolution of an open quantum system on a duality quantum computer. In contrast to unitary evolution in a usual quantum computer, the evolution operator in a duality quantum computer is a linear combination of unitary operators. In this duality algorithm, the time evolution of open quantum system is realized by using Kraus operators which is naturally realized in duality quantum computing. Compared to the Lloyd's quantum algorithm [Science.273, 1073(1996)] , the dependence on the dimension of the open quantum system in our algorithm is decreased. Moreover, our algorithm uses a truncated Taylor series of the evolution operators, exponentially improving the performance on the precision compared with existing quantum simulation algorithms with unitary evolution operations.
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations together with a robust form of oblivious amplitude amplification.
Simulating the dynamics of open quantum systems is a crucial task in quantum computing, offering wide-ranging applications but remaining computationally challenging. In this paper, we propose two quantum algorithms for simulating the dynamics of open quantum systems governed by Lindbladians. We introduce a new approximation channel for short-time evolution, inspired by the quantum trajectory method, which underpins the efficiency of our algorithms. The first algorithm achieves a gate complexity independent of the number of jump operators, m , marking a significant improvement in efficiency. The second algorithm achieves near-optimal dependence on the evolution time t and precision ϵ and introduces only an additional O ~ ( m ) factor, which strictly improves upon state-of-the-art gate-based quantum algorithm that has an O ~ ( m 2 ) factor. The improvement stems from the integration of the new approximation channel with a novel structured linear combination of unitaries method. In both our algorithms, the reduction of dependence on m significantly enhances the efficiency of simulating practical dissipative processes characterized by a large number of jump operators.
We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity O~(νLt/ε)\widetilde{\mathcal{O}}(ν\mathcal{L} t/ε)O(νLt/ε), where the constant ννν depends on the problem parameters, L\mathcal{L}L involves a time integral of upper bounds on the norms of evolution operators, and εεε is the error. In particular, νLν\mathcal{L}νL is linear in ttt for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions, which can be extended to other quantum and classical systems. We compare with classical algorithms and give evidence of polynomial quantum speedups for systems in a lattice, which become more pronounced for systems with long-range interactions and can be shown to be exponential in general. We also provide a lower bound of Ω(νLt/ε)Ω(ν\mathcal{L} t/ε)Ω(νLt/ε) for unitary or dissipative dynamics that proves our algorithm is optimal up to logarithmic factors.
This thesis introduces an algorithm for efficiently simulating the non-unitary dynamics of open quantum systems on quantum computers. Open quantum systems interact with their surrounding environment, resulting in non-unitary dynamics. This creates a fundamental challenge for quantum simulation, since quantum hardware is inherently restricted to unitary operations. Building on the Kraus operator sum representation, this work explores dilation techniques that embed non-unitary maps into larger unitary operations, suitable for implementation on quantum processors. In addition to reproducing recent results from the literature, an enhanced algorithm that reuses the quantum state from the previous time step is presented. This reuse strategy increases efficiency, permits repeated application of the same quantum circuit, and shifts the dominant computational workload toward the quantum processor. The method is implemented and tested on models of the Fenna–Matthews–Olson light-harvesting complex and compares the obtained results against existing approaches. Importantly, the algorithm is broadly applicable to a wide class of open quantum systems. The proposed scheme provides a practical pathway for studying transport, dynamics, and spectral properties of interacting quantum systems on a quantum simulator, while keeping the demands on classical resources modest. The thesis concludes with a discussion of implementation details, numerical results, and prospects for scaling the method to larger systems.
We describe an improved version of the quantum algorithm for Hamiltonian simulation based on the implementation of a truncated Taylor series of the evolution operator. The idea is to add an extra step to the previously known algorithm which implements an operator that corrects the weightings of the Taylor series. This way, the desired accuracy is achieved with an improvement in the overall complexity of the algorithm. This quantum simulation method is applicable to a wide range of Hamiltonians of interest, including to quantum chemistry problems.