Metraipolis › archive › dc_652f3184ebdb

Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation (2026) · DOI 10.22331/q-2026-09-03-2204

Source: Metraipolis archive
Original: https://doi.org/10.22331/q-2026-09-03-2204
License (as archived): CC-BY-4.0
Archived: 2026-10-07T12:29:55.937Z
SHA-256 of the archived text: ff4ff80a0304116185cf7c0204a2f87b9c8ed810511c7d6bb6bab5bc5f32a228
Stable URL of this page: https://metraipolis.com/documento/dc_652f3184ebdb

How to cite

Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation (2026) · DOI 10.22331/q-2026-09-03-2204 — Metraipolis archive, https://doi.org/10.22331/q-2026-09-03-2204 (CC-BY-4.0); archived copy: https://metraipolis.com/documento/dc_652f3184ebdb (Metraipolis archive dc_652f3184ebdb, sha256 ff4ff80a0304116185cf7c0204a2f87b9c8ed810511c7d6bb6bab5bc5f32a228)

BibTeX

@misc{dc652f3184ebdb,
  title = {Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation (2026) · DOI 10.22331/q-2026-09-03-2204},
  howpublished = {Metraipolis archive},
  url = {https://doi.org/10.22331/q-2026-09-03-2204},
  note = {License CC-BY-4.0; archived copy https://metraipolis.com/documento/dc_652f3184ebdb; sha256 ff4ff80a0304116185cf7c0204a2f87b9c8ed810511c7d6bb6bab5bc5f32a228},
  year = {2026}
}

Archived text

Reproduced under CC-BY-4.0. Attribution: Metraipolis archive, https://doi.org/10.22331/q-2026-09-03-2204. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Articolo recente con licenza aperta: scheda dai metadati Crossref (journal-article).
Titolo: Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation
Autori: I.J. David, I. Sinayskiy, F. Petruccione
Pubblicato: 2026-09-03 · in: Quantum · editore: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
DOI: https://doi.org/10.22331/q-2026-09-03-2204
Licenza dell'articolo: CC-BY-4.0

Abstract (testo degli autori, CC-BY-4.0):
When simulating the dynamics of open quantum systems with quantum computers, it is essential to accurately approximate the system&apos;s behaviour while preserving the physicality of its evolution. Traditionally, for Markovian open quantum systems, this has been achieved using first and second-order Trotter-Suzuki product formulas or probabilistic algorithms. In this work, we introduce novel non-probabilistic algorithms for simulating Markovian open quantum systems using randomisation. Our methods, including first and second-order randomised Trotter-Suzuki formulas and the QDRIFT channel, not only maintain the physicality of the system&apos;s evolution but also enhance the scalability and precision of quantum simulations. We derive error bounds and step count limits for these techniques, bypassing the need for the mixing lemma typically employed in Hamiltonian simulation proofs. Furthermore, we implement these randomised algorithms using Classical Sampling (CS), demonstrating their gate complexity advantages over deterministic TS product formulas. This work systematically extends powerful randomisation techniques from Hamiltonian simulation to the general setting of Markovian open quantum systems, highlighting their potential to enable faster and more accurate simulations.

Fonte: https://api.crossref.org/works/10.22331%2Fq-2026-09-03-2204 — metadati Crossref, consultati il 2026-10-07. Interrogazione: «open science infrastructure».