Simulating Markovian open quantum systems using higher-order series expansion
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 7 Pith papers
-
Improved sample complexity bound for sample-based Lindbladian simulation
Derives explicit sample complexity bound O(d t²/ε) for WML-based Lindbladian simulation, with typical-case O(t²/ε) when ||L||_∞² = O(1/d) and worst-case Ω(d t²/ε).
-
A Compilation Framework for Quantum Simulation of Non-unitary Dynamics
A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
-
Semantic Prompting: Agentic Incremental Narrative Refinement through Spatial Semantic Interaction
The paper extends KMS-detailed-balance Lindbladian constructions beyond Gibbs states to prepare general stationary states σ=f(H)/Tr[f(H)], including microcanonical window states, with polynomial-time quantum circuit i...
-
Semantic Prompting: Agentic Incremental Narrative Refinement through Spatial Semantic Interaction
Semantic Prompting enables LLMs to perform precise incremental narrative revisions by perceiving semantic interactions in spatial layouts, addressing misalignment gaps in existing methods.
-
Hamiltonian dynamics from pure dissipation
Purely dissipative Lindbladians without Hamiltonian part can approximate unitary dynamics to ε error in diamond norm with O(t²/ε) time, which is optimal for time-independent cases.
-
Quantum algorithms based on quantum trajectories
Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.
-
Dissipative microcanonical ensemble preparation from KMS-detailed balance
Extends KMS-detailed balance constructions from open quantum systems to prepare microcanonical ensembles and other stationary states with criteria for efficient implementation.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.