Metraipolis › archive › dc_58cbee749287

Variational Programs with Open Clocks — arXiv:2610.40988

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40988
License (as archived)
CC0-1.0
Archived
2026-11-03T08:26:09.373Z
SHA-256 of the archived text
f67b7633c71b38e3ba48b5b94e86ab7e5a7c2fbedb73f8179b9dd320648fb261
Stable URL of this page
https://metraipolis.com/documento/dc_58cbee749287

How to cite

Variational Programs with Open Clocks — arXiv:2610.40988 — arXiv (en), https://arxiv.org/abs/2610.40988 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_58cbee749287 (Metraipolis archive dc_58cbee749287, sha256 f67b7633c71b38e3ba48b5b94e86ab7e5a7c2fbedb73f8179b9dd320648fb261)
BibTeX
@misc{dc58cbee749287,
  title = {Variational Programs with Open Clocks — arXiv:2610.40988},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40988},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_58cbee749287; sha256 f67b7633c71b38e3ba48b5b94e86ab7e5a7c2fbedb73f8179b9dd320648fb261},
  year = {2026}
}

Archived text

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

Variational quantum algorithms leave the durations of Hamiltonian evolutions open for a classical optimizer to set. We present VHamilton, a minimal extension of the Hamilton quantum programming language in which such durations are open clocks: one program denotes a family of Hamiltonian trajectories, and a valuation fills its clocks with exact dyadic times, so that each instance is an ordinary Hamilton program that compiles to circuits as before. Because the semantics stays exact and affine in the clocks, the Hamiltonian structure of a variational program remainsavail able for reasoning about every valuation at once. Equivalence becomes a finite calculation, which we mechanize in Agda for a fragment and use to prove the VHamilton form of the compiler rewrite "rzz(t) = cx; rz(t); cx" for every clock value. We then show what the same structure supports in a two-qubit chemistry eigensolver written in VHamilton and run through a Haskell prototype. It supports a fusion of commuting blocks, a closed form and an expressibility proof for the ansatz, and an exact split of the error between the precision of the target and that of the clocks, with a priori bounds. It also supports a coordinate search whose queries per sweep, fixed by the spectra of the generators, do not grow with the precision. On the benchmark this search reaches the numerically verified optimum of a grid of 134 million valuations in 53 energy queries. It finds the grid optimum in only 21 of 30 validation settings, however, so the gain is conditional, not a global-optimization guarantee.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.40988 — 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-11-03T08:09:38.803Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).