Metraipolis › archive › dc_4546bd591e29

Faster Quantum Monte Carlo Simulation by Random Compilation — arXiv:2609.10486

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10486
License (as archived)
CC0-1.0
Archived
2026-10-16T11:22:08.251Z
SHA-256 of the archived text
47a982a2e34769b140e40700855b83a45e78f414af820e5e0a312adf6aa4d243
Stable URL of this page
https://metraipolis.com/documento/dc_4546bd591e29

How to cite

Faster Quantum Monte Carlo Simulation by Random Compilation — arXiv:2609.10486 — arXiv (en), https://arxiv.org/abs/2609.10486 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4546bd591e29 (Metraipolis archive dc_4546bd591e29, sha256 47a982a2e34769b140e40700855b83a45e78f414af820e5e0a312adf6aa4d243)
BibTeX
@misc{dc4546bd591e29,
  title = {Faster Quantum Monte Carlo Simulation by Random Compilation — arXiv:2609.10486},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10486},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4546bd591e29; sha256 47a982a2e34769b140e40700855b83a45e78f414af820e5e0a312adf6aa4d243},
  year = {2026}
}

Archived text

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

Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-10 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Strongly Correlated Electrons (cond-mat.str-el); High Energy Physics - Lattice (hep-lat).
Pagina del lavoro: https://arxiv.org/abs/2609.10486 — 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-16T11:00:36.253Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).