Divide-and-Conquer Simulation of Open Quantum Systems

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.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Quantum Computing
Published
2026-11-07
DOI
https://doi.org/10.1145/3858415
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Divide-and-Conquer Simulation of Open Quantum Systems

Thiago Melo D. Azevedo, Nadja K. Bernardes, Adenilton José da Silva, Pedro Linck Maciel
3 links
ACM Transactions on Quantum Computing
Quantum Computing Algorithms and Architecture
article

Divide-and-Conquer Simulation of Open Quantum Systems

Thiago Melo D. Azevedo, Nadja K. Bernardes, Adenilton José da Silva, Pedro Linck Maciel
article en

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.

ACM Transactions on Quantum Computing
Universidade Federal de Pernambuco (BR)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior, Conselho Nacional de Desenvolvimento Científico e Tecnológico, Fundação de Amparo à Ciência e Tecnologia do Estado de Pernambuco
Openalex Percentile: Top 100%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon