Metraipolis › archive › dc_f3dcdae3ff48

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-02T08:08:08.036Z
SHA-256 of the archived text: 5fcea1a4cf4eafe48ad5f96890b2f9724d589a63a2fff3c3c73e35471e27a578
Stable URL of this page: https://metraipolis.com/documento/dc_f3dcdae3ff48

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_f3dcdae3ff48 (Metraipolis archive dc_f3dcdae3ff48, sha256 5fcea1a4cf4eafe48ad5f96890b2f9724d589a63a2fff3c3c73e35471e27a578)

BibTeX

@misc{dcf3dcdae3ff48,
  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_f3dcdae3ff48; sha256 5fcea1a4cf4eafe48ad5f96890b2f9724d589a63a2fff3c3c73e35471e27a578},
  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-02T07:47:00.721Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).