Metraipolis › archive › dc_91eed562f596

Query-optimal quantum simulation of Lindblad evolution — arXiv:2609.17490

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.17490
License (as archived): CC0-1.0
Archived: 2026-10-15T22:06:45.725Z
SHA-256 of the archived text: e49818627fb8c977a891541dcf805ba094d2f694d7523d82a1fee9bf42e31573
Stable URL of this page: https://metraipolis.com/documento/dc_91eed562f596

How to cite

Query-optimal quantum simulation of Lindblad evolution — arXiv:2609.17490 — arXiv (en), https://arxiv.org/abs/2609.17490 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_91eed562f596 (Metraipolis archive dc_91eed562f596, sha256 e49818627fb8c977a891541dcf805ba094d2f694d7523d82a1fee9bf42e31573)

BibTeX

@misc{dc91eed562f596,
  title = {Query-optimal quantum simulation of Lindblad evolution — arXiv:2609.17490},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.17490},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_91eed562f596; sha256 e49818627fb8c977a891541dcf805ba094d2f694d7523d82a1fee9bf42e31573},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17490. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For the problem of simulating Lindblad evolution for time $t$ to precision $\epsilon$, Hamiltonian simulation provides an additive query lower bound, informally, $\Omega(t + \mathrm{polylog}(1/\epsilon))$. However, the best previously known algorithms for general Lindblad simulation achieve a multiplicative upper bound, informally, $\mathcal{O}(t\,\mathrm{polylog}(1/\epsilon))$, in query complexity. It has remained open whether this multiplicative dependence is necessary. In this paper, we close the gap in query complexity by giving an algorithm with optimal additive dependence on evolution time and precision in the block-encoding model. Our approach uses the transducer framework to reduce the query cost of composing first-order approximations to the evolution channel, together with linear combinations of reuse circuits of different lengths to suppress catalyst-removal error. We further achieve nearly optimal gate complexity in evolution time and precision through history compression and an efficient implementation of the query-free part of the transducer using operation reordering and linear combinations of unitaries, while preserving the optimal query complexity.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-16 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.17490 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T21:52:12.844Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).