Reproduce “Connecting Quantum Proof Systems and Hoare Logic” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Liyi Li, Zoukarneini Difaizi Tagba, Alex Potanin
The authors translate proofs of quantum programs in Qafny into classical Hoare logic with array theory, representing superpositions symbolically as arrays and expressing quantum-operation effects through array operations. They prove translation completeness and soundness: completeness is mechanized in Rocq, while soundness is proved on paper. The result applies to an idealized logic, not an evaluated Dafny backend.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.