Metraipolis › archive › dc_28b4e1a861de

Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation — arXiv:2608.30629

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.30629
License (as archived)
CC0-1.0
Archived
2026-10-17T10:07:18.112Z
SHA-256 of the archived text
9626087f8a61457c70fe8d849ced251303f4c1bd36761604658d6255ca188319
Stable URL of this page
https://metraipolis.com/documento/dc_28b4e1a861de

How to cite

Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation — arXiv:2608.30629 — arXiv (en), https://arxiv.org/abs/2608.30629 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_28b4e1a861de (Metraipolis archive dc_28b4e1a861de, sha256 9626087f8a61457c70fe8d849ced251303f4c1bd36761604658d6255ca188319)
BibTeX
@misc{dc28b4e1a861de,
  title = {Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation — arXiv:2608.30629},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.30629},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_28b4e1a861de; sha256 9626087f8a61457c70fe8d849ced251303f4c1bd36761604658d6255ca188319},
  year = {2026}
}

Archived text

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

The query-optimal algorithm of [CGWZ26] for general time-dependent Hamiltonian simulation uses $$ q = O\left( \alpha T + \frac{\log(1/\varepsilon)}{\log\left(e + \log(1/\varepsilon)/(\alpha T) \right)} \right) $$ queries to $\mathrm{HAM\mbox{-}T}$ within $\varepsilon$ error for a Lipschitz-continuous time-dependent Hamiltonian $H(t)$ on $[0,T]$ satisfying $\left\lVert H(t)\right\rVert\leq\alpha$. However, its direct circuit implementation incurs a substantially larger gate overhead. In this note, we give an implementation of the same algorithm that retains its optimal query complexity and uses $$ O\left[ q \left( a + \log\left(1 + \frac{T(\alpha + \beta T)}{\varepsilon} \right) \right) \right] $$ one- and two-qubit gates, where $a$ is the number of block-encoding ancilla qubits and $\beta$ is the Lipschitz constant of $H$. The main ingredient is an exact dyadic factorization of the ordered update product in the underlying one-query transducer.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in cs.DS).
Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.30629 — 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-17T10:00:01.304Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).