Metraipolis › archive › dc_b84dec1230db

Optimized Randomized Hamiltonian Simulation via Average-Error Analysis — arXiv:2609.36694

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

How to cite

Optimized Randomized Hamiltonian Simulation via Average-Error Analysis — arXiv:2609.36694 — arXiv (en), https://arxiv.org/abs/2609.36694 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b84dec1230db (Metraipolis archive dc_b84dec1230db, sha256 658cce9e80ed6caad5f45f94f091e216f7e6d7cd2926dfad4da686fa7a08cfcf)
BibTeX
@misc{dcb84dec1230db,
  title = {Optimized Randomized Hamiltonian Simulation via Average-Error Analysis — arXiv:2609.36694},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.36694},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b84dec1230db; sha256 658cce9e80ed6caad5f45f94f091e216f7e6d7cd2926dfad4da686fa7a08cfcf},
  year = {2026}
}

Archived text

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

Hamiltonian simulation is a central application of quantum computing. Randomized Hamiltonian simulation approximates the target dynamics by sampling quantum circuits and often allows simpler circuit implementations. We develop a framework for randomized Hamiltonian simulation in which Hamiltonian terms are sampled with arbitrary probabilities and the corresponding short-time evolutions are implemented sequentially. The leading channel error relative to ideal time evolution is governed by the variance of the sampled generators. Minimizing the variance-based upper bound on the worst-case error recovers qDRIFT, a leading randomized Hamiltonian simulation algorithm that samples terms in proportion to their operator norms. For typical input states, however, this sampling distribution need not be optimal. Minimizing Haar-averaged error bounds instead yields sampling probabilities proportional to the Hilbert-Schmidt norms of the terms. This choice can provide smaller average-error bounds than conventional qDRIFT. For Hamiltonians expressed as sums of Pauli strings, we combine this framework with commuting Pauli grouping to obtain smaller error bounds than conventional qDRIFT at fixed $R_z$ depth. Numerical benchmarks for the Sachdev-Ye-Kitaev model show error-bound improvement factors consistent with linear scaling in the number of qubits. For the 108-qubit FeMoco Hamiltonian, the error bounds are reduced by a factor of about 5.65. These results establish average-error optimization as a practical design principle for randomized 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.36694 — 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.556Z 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).