Verification Logics for Quantum Programs

04/08/2019
by   Robert Rand, et al.
0

We survey the landscape of Hoare logics for quantum programs. We review three papers: "Reasoning about imperative quantum programs" by Chadha, Mateus and Sernadas; "A logic for formal verification of quantum programs" by Yoshihiko Kakutani; and "Floyd-hoare logic for quantum programs" by Mingsheng Ying. We compare the mathematical foundations of the logics, their underlying languages, and the expressivity of their assertions. We also use the languages to verify the Deutsch-Jozsa Algorithm, and discuss their relative usability in practice.

READ FULL TEXT
research
12/02/2018

A Logic for Recursive Quantum Programs

Most modern (classical) programming languages support recursion. Recursi...
research
04/12/2019

Verified Optimization in a Quantum Intermediate Representation

We present sqire, a low-level language for quantum computing and verific...
research
09/16/2015

Quantum Look at two Common Logics: the Logic of Primitive Thinking and the Logic of Everyday Human Reasoning

Based on ideas of quantum theory of open systems and psychological dual ...
research
07/24/2021

Reasoning about Recursive Quantum Programs

Most modern (classical) programming languages support recursion. Recursi...
research
06/21/2021

Defeasible Reasoning via Datalog^

We address the problem of compiling defeasible theories to Datalog^ prog...
research
03/12/2020

A Deductive Verification Framework for Circuit-building Quantum Programs

While recent progress in quantum hardware open the door for significant ...
research
09/14/2021

Formal Methods for Quantum Programs: A Survey

While recent progress in quantum hardware open the door for significant ...

Please sign up or login with your details

Forgot password? Click here to reset