English

Design nearly optimal quantum algorithm for linear differential equations via Lindbladians

Quantum Physics 2025-10-30 v3 Mesoscale and Nanoscale Physics

Abstract

Solving linear ordinary differential equations (ODE) is one of the most promising applications for quantum computers to demonstrate exponential advantages. The challenge of designing a quantum ODE algorithm is how to embed non-unitary dynamics into intrinsically unitary quantum circuits. In this work, we propose a new quantum algorithm for solving ODEs by harnessing open quantum systems. Specifically, we propose a novel technique called non-diagonal density matrix encoding, which leverages the inherent non-unitary dynamics of Lindbladians to encode general linear ODEs into the non-diagonal blocks of density matrices. This framework enables us to design quantum algorithms with both theoretical simplicity and high performance. Combined with the state-of-the-art quantum Lindbladian simulation algorithms, our algorithm can outperform all existing quantum ODE algorithms and achieve near-optimal dependence on all parameters under a plausible input model. We also give applications of our algorithm including the Gibbs state preparations and the partition function estimations.

Keywords

Cite

@article{arxiv.2410.19628,
  title  = {Design nearly optimal quantum algorithm for linear differential equations via Lindbladians},
  author = {Zhong-Xia Shang and Naixu Guo and Dong An and Qi Zhao},
  journal= {arXiv preprint arXiv:2410.19628},
  year   = {2025}
}

Comments

8+11 pages, 1 figure, and 1 table. PRL version

R2 v1 2026-06-28T19:35:40.986Z