Engineering PapersSearch

DOE OSTI · 3012839

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

Abstract

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

An, Dong [Univ. of Maryland, College Park, MD (United States)] (ORCID:0000000229643603), Childs, Andrew M. [Univ. of Maryland, College Park, MD (United States)], Lin, Lin [University of California, Berkeley, CA (United States); Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)] (ORCID:0000000168609566). 2025-12-08. Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters. https://doi.org/10.1007/s00220-025-05509-w

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems