A Logic for Formal Verification of Quantum Programs
نویسنده
چکیده
This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quantum probabilistic programs. Our target programming language is QPL defined by Selinger, and our logic is an extension of the probabilistic Hoare-style logic defined by den Hartog. In this paper, we demonstrate how the quantum Hoare-style logic proves properties of well-known algorithms.
منابع مشابه
ar X iv : 0 90 6 . 45 86 v 1 [ qu an t - ph ] 2 5 Ju n 20 09 Hoare Logic for Quantum Programs ∗
Hoare logic is a foundation of axiomatic semantics of classical programs and it provides effective proof techniques for reasoning about correctness of classical programs. To offer similar techniques for quantum program verification and to build a logical foundation of programming methodology for quantum computers, we develop a full-fledged Hoare logic for both partial and total correctness of q...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملTemporal logics for reasoning about quantum systems
Reasoning about quantum systems has gained prominence due to a big potential in applications such as information processing, security, distributed systems and randomized algorithms. This fact has attracted research in formal reasoning about quantum states, programs and processes. On the other hand, temporal logics have proved to be successful in the verification of classical distributed systems...
متن کاملFormal Modeling of Timed Function Blocks for the Automatic Verification of Ladder Diagram Programs
We describe our approach to the automated verification of Ladder Diagrams programs. This combines a formal semantics for a large fragment of the LD language (including a modeling of timed function blocks), and a powerful temporal logic model checking technology.
متن کاملA Formal Approach to Unconditional Security Proofs for Quantum Key Distribution
We present an approach to automate Shor-Preskill style unconditional security proof of QKDs. In Shor-Preskill’s proof, the target QKD, BB84, is transformed into another QKD based on an entanglement distillation protocol (EDP), which is more feasible for direct analysis. We formalized heir method as program transformation in a quantum programming language, QPL. The transform is defined as rewrit...
متن کامل