Metraipolis › archive › dc_eabe5c7133e2
A Complete Calculus for Hamiltonian Quantum Programming — arXiv:2611.08675
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08675
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:47:55.061Z
- SHA-256 of the archived text
84451092079e0220e4d9644de8237be214ea4a3f524bc27ad4e89ae386929e92- Stable URL of this page
https://metraipolis.com/documento/dc_eabe5c7133e2
How to cite
A Complete Calculus for Hamiltonian Quantum Programming — arXiv:2611.08675 — arXiv (en), https://arxiv.org/abs/2611.08675 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eabe5c7133e2 (Metraipolis archive dc_eabe5c7133e2, sha256 84451092079e0220e4d9644de8237be214ea4a3f524bc27ad4e89ae386929e92)
BibTeX
@misc{dceabe5c7133e2,
title = {A Complete Calculus for Hamiltonian Quantum Programming — arXiv:2611.08675},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08675},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eabe5c7133e2; sha256 84451092079e0220e4d9644de8237be214ea4a3f524bc27ad4e89ae386929e92},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08675. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Given the forces acting on a quantum particle, a Hamiltonian models its continuous evolution. Quantum computers evolve Hamiltonians to simulate physical systems, to solve optimisation problems, and to estimate eigenvalues, and even the popular circuit abstraction is compiled to Hamiltonians on the hardware. We introduce Hamilton, a process calculus whose parallel operator is the sum of interactions acting simultaneously. Its operational semantics is the Lie-Trotter product formula, which recovers a sum as the limit of ever finer sequential interleavings; compiling a program means halving it to a chosen precision and unrolling the interleaving into a circuit. The semantics is fully abstract, the expressible Hamiltonians are exactly those whose Pauli coefficients have the form $m/2^k$, the precision that successive halving reaches, and the equational theory is complete and decidable. A full implementation compiles Hamilton programs to circuits and decides their equivalence, and Agda proofs sanity-check the core metatheory. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.PL, nuovi lavori del giorno). Categorie arXiv: Programming Languages (cs.PL) ; Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2611.08675 — 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-09T22:41:29.870Z dalla pagina https://arxiv.org/list/cs.PL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).