Simulating Markovian Open Quantum Systems Using Higher-Order Series Expansion

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. The performance of our algorithm is similar to the previous state-of-the-art quantum algorithm, i.e., it scales linearly in evolution time and poly-logarithmically in inverse precision. However, our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding. Our approach is based on a novel mathematical treatment of the evolution map, which involves a higher-order series expansion based on Duhamel’s principle and approximating multiple integrals using scaled Gaussian quadrature. Our method easily generalizes to simulating quantum dynamics with time-dependent Lindbladians. Furthermore, our method of approximating multiple integrals using scaled Gaussian quadrature could potentially be used to produce a more efficient approximation of time-ordered integrals, and therefore can simplify existing quantum algorithms for simulating time-dependent Hamiltonians based on a truncated Dyson series.

Original languageEnglish (US)
Title of host publication50th International Colloquium on Automata, Languages, and Programming, ICALP 2023
EditorsKousha Etessami, Uriel Feige, Gabriele Puppis
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772785
DOIs
StatePublished - Jul 2023
Event50th International Colloquium on Automata, Languages, and Programming, ICALP 2023 - Paderborn, Germany
Duration: Jul 10 2023Jul 14 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume261
ISSN (Print)1868-8969

Conference

Conference50th International Colloquium on Automata, Languages, and Programming, ICALP 2023
Country/TerritoryGermany
CityPaderborn
Period7/10/237/14/23

All Science Journal Classification (ASJC) codes

  • Software

Cite this