A noise-aware quantum Hoare logic and an automated synthesis method produce hardware-specific optimal quantum subroutines, showing that classical probabilistic branching can be necessary for optimality.
On the Relative Completeness of Satisfaction-based Quantum Hoare Logic
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Quantum Hoare logic (QHL) is a formal verification tool specifically designed to ensure the correctness of quantum programs. There has been an ongoing challenge to achieve a relatively complete satisfaction-based QHL with while-loop since its inception in 2006. This paper presents a solution by proposing the first relatively complete satisfaction-based QHL with while-loop. The completeness is proved in two steps. First, we establish a semantics and proof system of Hoare triples with quantum programs and deterministic assertions. Then, by utilizing the weakest precondition of deterministic assertion, we construct the weakest preterm calculus of probabilistic expressions. The relative completeness of QHL is then obtained as a consequence of the weakest preterm calculus. Using our QHL, we formally verify the correctness of Deutsch's algorithm and quantum teleportation.
citation-role summary
background 1
citation-polarity summary
fields
cs.PL 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Noise-aware Verification and Synthesis of Quantum Programs
A noise-aware quantum Hoare logic and an automated synthesis method produce hardware-specific optimal quantum subroutines, showing that classical probabilistic branching can be necessary for optimality.