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:2505.01623 · ACM Transactions on Quantum Computing

Divide-and-Conquer Simulation of Open Quantum Systems

Thiago Melo D. Azevedo, Caio Leão, Pedro Linck Maciel, Adenilton José da Silva, Nadja K. Bernardes

Published Nov 7, 2026• 1 citation
arXivHTMLPDF

Abstract

One of the promises of quantum computing is to simulate physical systems efficiently. However, simulation of open quantum systems remains challenging, as their evolution involves non-unitary operators. The Stinespring dilation can simulate an open dynamic using a logarithmic number of auxiliary qubits, but requires a high circuit depth, which is impractical for NISQ devices. An alternative approach is parallel probabilistic block-encoding methods, such as the Sz.-Nagy and Singular Value Decomposition dilations. These methods implement the action of a single Kraus operator on quantum hardware and require one auxiliary qubit for each operator. They also result in shallower circuits but are hybrid methods, and do not simulate the complete quantum dynamic on the quantum computer. In this work, we describe a divide-and-conquer strategy to combine the output of each Kraus operator dilation and obtain the complete dynamic on quantum hardware with a lower circuit depth. We also introduce a balanced strategy that groups the Kraus operators into an expanded operator, leading to a trade-off between circuit depth, CNOT count, and number of qubits. We perform a computational analysis to demonstrate the advantages of the method and present a simulation of the Fenna-Matthews-Olson dynamic on current hardware.

DOI
10.1145/3858415

Related papers

Exact Non-Markovian Quantum Dynamics on the NISQ Device Using Kraus Operators

Avin Seneviratne, Peter Walters, Fei Wang

The theory of open quantum systems has many applications ranging from simulating quantum dynamics in condensed phases to better understanding quantum-enabled technologies. At the center of theoretical chemistry are the developments of methodologies and computational tools for simulating charge and excitation energy transfer in solutions, biomolecules, and molecular aggregates. As a variety of these processes display non-Markovian behavior, classical computer simulation can be challenging due to exponential scaling with existing methods. With quantum computers holding the promise of efficient quantum simulations, in this paper, we present a new quantum algorithm based on Kraus operators that capture the exact non-Markovian effect at a finite temperature. The implementation of the Kraus operators on the quantum machine uses a combination of singular value decomposition (SVD) and optimal Walsh operators that result in shallow circuits. We demonstrate the feasibility of the algorithm by simulating the spin-boson dynamics and the exciton transfer in the Fenna-Matthews-Olson (FMO) complex. The NISQ results show very good agreement with the exact ones.

ACS Omega•Feb 15, 2024•13 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

Quantum state preparation and nonunitary evolution with diagonal operators

Anthony W. Schlimgen, Kade Head-Marsden, LeeAnn M. Sager-Smith +2 more

Realizing nonunitary transformations on unitary-gate-based quantum devices is critically important for simulating a variety of physical problems, including open quantum systems and subnormalized quantum states. We present a dilation-based algorithm to simulate nonunitary operations using probabilistic quantum computing with only one ancilla qubit. We utilize the singular-value decomposition (SVD) to decompose any general quantum operator into a product of two unitary operators and a diagonal nonunitary operator, which we show can be implemented by a diagonal unitary operator in a one-qubit dilated space. While dilation techniques increase the number of qubits in the calculation, and thus the gate complexity, our algorithm limits the operations required in the dilated space to a diagonal unitary operator, which has known circuit decompositions. We use this algorithm to prepare random subnormalized two-level states on a quantum device with high fidelity. Furthermore, we present the accurate nonunitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude-damping channel computed on a quantum device. The algorithm presented will be most useful for implementing general nonunitary operations when the SVD can be readily computed, which is the case for most operators in the noisy intermediate-scale quantum computing era.

arXiv:2205.02826•Physical Review A•Aug 16, 2022•53 citations

A quantum algorithm for evolving open quantum dynamics on quantum computing devices

Zixuan Hu, Rongxin Xia, Sabre Kais

Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.

arXiv:1904.00910•Scientific Reports•Feb 24, 2020•176 citations

Two-Unitary Decomposition Algorithm and Open Quantum System Simulation

Nishchay Suri, Joseph Barreto, Stuart Hadfield +3 more

Simulating general quantum processes that describe realistic interactions of quantum systems following a non-unitary evolution is challenging for conventional quantum computers that directly implement unitary gates. We analyze complexities for promising methods such as the Sz.-Nagy dilation and linear combination of unitaries that can simulate open systems by the probabilistic realization of non-unitary operators, requiring multiple calls to both the encoding and state preparation oracles. We propose a quantum two-unitary decomposition (TUD) algorithm to decompose a d -dimensional operator A with non-zero singular values as A=(U1+U2)/2 using the quantum singular value transformation algorithm, avoiding classically expensive singular value decomposition (SVD) with an O(d3) overhead in time. The two unitaries can be deterministically implemented, thus requiring only a single call to the state preparation oracle for each. The calls to the encoding oracle can also be reduced significantly at the expense of an acceptable error in measurements. Since the TUD method can be used to implement non-unitary operators as only two unitaries, it also has potential applications in linear algebra and quantum machine learning.

arXiv:2207.10007•Quantum•May 15, 2023•38 citations

Simulation of open quantum systems via low-depth convex unitary evolutions

Joseph Peetz, Scott E. Smart, Spyros Tserkis +1 more

Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because they typically require ancilla qubits and extensive controlled sequences. In this work, we propose a hybrid quantum-classical approach for simulating a class of open system dynamics called random-unitary channels. These channels naturally decompose into a series of convex unitary evolutions, which can then be efficiently sampled and run as independent circuits. The method does not require deep ancilla frameworks and thus can be implemented with lower noise costs. We implement simulations of open quantum systems up to dozens of qubits and with large channel ranks. Published by the American Physical Society 2024

arXiv:2307.14325•Physical Review Research•Jun 10, 2024•14 citations
One of the promises of quantum computing is to simulate physical systems efficiently. However, simulation of open quantum systems remains challenging, as their evolution involves non-unitary operators. The Stinespring dilation can simulate an open dynamic using a logarithmic number of auxiliary qubits, but requires a high circuit depth, which is impractical for NISQ devices. An alternative approach is parallel probabilistic block-encoding methods, such as the Sz.-Nagy and Singular Value Decomposition dilations. These methods implement the action of a single Kraus operator on quantum hardware and require one auxiliary qubit for each operator. They also result in shallower circuits but are hybrid methods, and do not simulate the complete quantum dynamic on the quantum computer. In this work, we describe a divide-and-conquer strategy to combine the output of each Kraus operator dilation and obtain the complete dynamic on quantum hardware with a lower circuit depth. We also introduce a balanced strategy that groups the Kraus operators into an expanded operator, leading to a trade-off between circuit depth, CNOT count, and number of qubits. We perform a computational analysis to demonstrate the advantages of the method and present a simulation of the Fenna-Matthews-Olson dynamic on current hardware.
The theory of open quantum systems has many applications ranging from simulating quantum dynamics in condensed phases to better understanding quantum-enabled technologies. At the center of theoretical chemistry are the developments of methodologies and computational tools for simulating charge and excitation energy transfer in solutions, biomolecules, and molecular aggregates. As a variety of these processes display non-Markovian behavior, classical computer simulation can be challenging due to exponential scaling with existing methods. With quantum computers holding the promise of efficient quantum simulations, in this paper, we present a new quantum algorithm based on Kraus operators that capture the exact non-Markovian effect at a finite temperature. The implementation of the Kraus operators on the quantum machine uses a combination of singular value decomposition (SVD) and optimal Walsh operators that result in shallow circuits. We demonstrate the feasibility of the algorithm by simulating the spin-boson dynamics and the exciton transfer in the Fenna-Matthews-Olson (FMO) complex. The NISQ results show very good agreement with the exact ones.
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.
Realizing nonunitary transformations on unitary-gate-based quantum devices is critically important for simulating a variety of physical problems, including open quantum systems and subnormalized quantum states. We present a dilation-based algorithm to simulate nonunitary operations using probabilistic quantum computing with only one ancilla qubit. We utilize the singular-value decomposition (SVD) to decompose any general quantum operator into a product of two unitary operators and a diagonal nonunitary operator, which we show can be implemented by a diagonal unitary operator in a one-qubit dilated space. While dilation techniques increase the number of qubits in the calculation, and thus the gate complexity, our algorithm limits the operations required in the dilated space to a diagonal unitary operator, which has known circuit decompositions. We use this algorithm to prepare random subnormalized two-level states on a quantum device with high fidelity. Furthermore, we present the accurate nonunitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude-damping channel computed on a quantum device. The algorithm presented will be most useful for implementing general nonunitary operations when the SVD can be readily computed, which is the case for most operators in the noisy intermediate-scale quantum computing era.
Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.
Simulating general quantum processes that describe realistic interactions of quantum systems following a non-unitary evolution is challenging for conventional quantum computers that directly implement unitary gates. We analyze complexities for promising methods such as the Sz.-Nagy dilation and linear combination of unitaries that can simulate open systems by the probabilistic realization of non-unitary operators, requiring multiple calls to both the encoding and state preparation oracles. We propose a quantum two-unitary decomposition (TUD) algorithm to decompose a d -dimensional operator A with non-zero singular values as A=(U1+U2)/2 using the quantum singular value transformation algorithm, avoiding classically expensive singular value decomposition (SVD) with an O(d3) overhead in time. The two unitaries can be deterministically implemented, thus requiring only a single call to the state preparation oracle for each. The calls to the encoding oracle can also be reduced significantly at the expense of an acceptable error in measurements. Since the TUD method can be used to implement non-unitary operators as only two unitaries, it also has potential applications in linear algebra and quantum machine learning.
Simulating physical systems on quantum devices is one of the most promising applications of quantum technology. Current quantum approaches to simulating open quantum systems are still practically challenging on NISQ-era devices, because they typically require ancilla qubits and extensive controlled sequences. In this work, we propose a hybrid quantum-classical approach for simulating a class of open system dynamics called random-unitary channels. These channels naturally decompose into a series of convex unitary evolutions, which can then be efficiently sampled and run as independent circuits. The method does not require deep ancilla frameworks and thus can be implemented with lower noise costs. We implement simulations of open quantum systems up to dozens of qubits and with large channel ranks. Published by the American Physical Society 2024