Reasoning About Imperative Quantum Programs | Zendy

Rohit Chadha | Zendy; Paulo Mateus | Zendy; Amı́lcar Sernadas | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reasoning About Imperative Quantum Programs

Author(s) -

Rohit Chadha,

Paulo Mateus,

Amı́lcar Sernadas

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.04.003

Subject(s) - correctness , hoare logic , quantum logic , computer science , predicate transformer semantics , state (computer science) , quantum , calculus (dental) , programming language , theoretical computer science , mathematics , quantum computer , quantum mechanics , physics , semantics (computer science) , operational semantics , medicine , dentistry

A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum states and classical states. The state logic is used to provide a sound Hoare-style calculus for quantum imperative programs. The calculus is illustrated by proving the correctness of the Deutsch algorithm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research