2019/04/30 by Zixuan Hu, Rongxin Xia, Sabre Kais · 3 citations
Computer Science · Physics and Astronomy · #Algorithm #Computer science #Neural Networks and Reservoir Computing #Open quantum system #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Fourier transform #Quantum Information and Cryptography #Quantum algorithm #Quantum computer #Quantum dynamics #Quantum error correction #Quantum mechanics #Quantum network #Quantum operation #Quantum phase estimation algorithm #Quantum simulator #Quantum technology #quant-ph
paper · pdf · doi:10.1038/s41598-020-60321-x
published in Scientific Reports 10(1), 3301 (Nature Portfolio) · This new version is a major revision
arxiv created 2019/05/14 · openalex publication_date 2020/02/24 · arxiv updated 2022/02/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
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.