Quantum PL & Verification Bibliography
About
Papers
People
Venues
Tags
Posts
Variants
BibLaTeX
BibTeX
bibtex2html
BibBase
Mailing List
Light
Dark
Automatic
termination
Algorithmic Analysis of Termination Problems for Quantum Programs
We introduce the notion of linear ranking super-martingale (LRSM) for quantum programs (with nondeterministic choices, namely angelic and demonic choices). Several termination theorems are established showing that the existence of the LRSMs of a …
Cite
×