Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3representative citing papers
End-to-end QSP-based quantum circuits solve linear PDEs on IBM hardware with tunable error and handle non-homogeneous Dirichlet boundaries for a plasma Poisson problem.
Proves intractability of DQPT estimation on quantum computers but equivalence of subsystem DQPT decision to quantum circuit simulation, with quadratic speedup for critical time search.
citing papers explorer
-
Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems
Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.