Metraipolis › archive › dc_7a72ac0ab019

Near-optimal quantum simulation of lattice Lindbladian dynamics — arXiv:2609.36203

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.36203
License (as archived)
CC0-1.0
Archived
2026-10-07T19:26:21.848Z
SHA-256 of the archived text
aab8b7dc4dbf20ba1fbbc37b75e0388c9fa8620f140f06e3e5e87f1b63e2012a
Stable URL of this page
https://metraipolis.com/documento/dc_7a72ac0ab019

How to cite

Near-optimal quantum simulation of lattice Lindbladian dynamics — arXiv:2609.36203 — arXiv (en), https://arxiv.org/abs/2609.36203 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7a72ac0ab019 (Metraipolis archive dc_7a72ac0ab019, sha256 aab8b7dc4dbf20ba1fbbc37b75e0388c9fa8620f140f06e3e5e87f1b63e2012a)
BibTeX
@misc{dc7a72ac0ab019,
  title = {Near-optimal quantum simulation of lattice Lindbladian dynamics — arXiv:2609.36203},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.36203},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7a72ac0ab019; sha256 aab8b7dc4dbf20ba1fbbc37b75e0388c9fa8620f140f06e3e5e87f1b63e2012a},
  year = {2026}
}

Archived text

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

We consider the problem of simulating dynamics under geometrically local Lindbladians acting on a lattice of qudits. We present an algorithm to approximate the time evolution under these Lindbladians for evolution time $t$ and on $N$ qudits to diamond norm error $\varepsilon$ using geometrically local circuits of depth $O(t \ \polylog(Nt/\varepsilon))$. Our results thus achieve a performance comparable to that of the Haah-Hastings-Kothari-Low (HHKL) algorithm for lattice Hamiltonian simulation.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-30 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.36203 — 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-07T18:55:50.522Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).