arrow
Return

Relational proofs for quantum programs

delete2019-12-20
delete0
delete
OA
AI
DOI:10.1145/3371089delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Relational verification of quantum programs has many potential applications in quantum and post-quantum security and other domains. We propose a relational program logic for quantum programs. The interpretation of our logic is based on a quantum analogue of probabilistic couplings. We use our logic to verify non-trivial relational properties of quantum programs, including uniformity for samples generated by the quantum Bernoulli factory, reliability of quantum teleportation against noise (bit and phase flip), security of quantum one-time pad and equivalence of quantum walks.
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

No journal information available

Organization

No organization information available
Cited Papers

Cited Papers

No cited papers available