Metraipolis › archive › dc_28f43a7346fc

Lindblad Multiproduct Formulas — arXiv:2609.05024

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05024
License (as archived)
CC0-1.0
Archived
2026-10-17T00:01:41.286Z
SHA-256 of the archived text
b9085c7063f7681e567c95670469415715a70b766057c1572d1c3bbd0aa213ea
Stable URL of this page
https://metraipolis.com/documento/dc_28f43a7346fc

How to cite

Lindblad Multiproduct Formulas — arXiv:2609.05024 — arXiv (en), https://arxiv.org/abs/2609.05024 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_28f43a7346fc (Metraipolis archive dc_28f43a7346fc, sha256 b9085c7063f7681e567c95670469415715a70b766057c1572d1c3bbd0aa213ea)
BibTeX
@misc{dc28f43a7346fc,
  title = {Lindblad Multiproduct Formulas — arXiv:2609.05024},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05024},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_28f43a7346fc; sha256 b9085c7063f7681e567c95670469415715a70b766057c1572d1c3bbd0aa213ea},
  year = {2026}
}

Archived text

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

We introduce Lindblad Multiproduct Formulas: a quantum error mitigation technique that uses two-dimensional tensor networks contracted with loop-corrected belief propagation. The quantities required to implement the error mitigation scheme that are evaluated with tensor networks can be less computationally expensive to calculate than the expectation values themselves, thus allowing for the possibility of applying our method to certain systems for which tensor network methods may struggle to calculate the observable quantities of interest. The workflow incorporates Clifford rescaling techniques and outputs an estimated error bar. We apply our method to a model of two-dimensional discrete time crystals studied previously and implement it on $65$ qubits arranged in a $3\!\times\!3$ heavy-hexagonal topology on the quantum computer ibm_basquecountry. We show that a GPU implementation of the classical part of our workflow achieves a speedup of up to $5.6\times$.

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