DeepAI AI Chat
Log In Sign Up

Quantum Natural Proof: A New Perspective of Hybrid Quantum-Classical Program Verification

by   Liyi Li, et al.

Many quantum programs are assured by formal verification, but such verification is usually laborious and time-consuming. This paper proposes quantum natural proof (QNP), an automated proof system for verifying hybrid quantum-classical algorithms. Natural proofs are a subclass of proofs that are amenable to completely automated reasoning, provide sound but incomplete procedures, and capture common reasoning tactics in program verification. The core of QNP is a type-guided quantum proof system, named Qafny, which views quantum operations as some classical array operations that can be modeled as proof rules in a classical separation logic framework, suitable for automated reasoning. We proved the soundness and completeness of the Qafny proof system as well as the soundness of the proof system compilation from Qafny to Dafny. By using the QNP implementation in Dafny, automated verification can be efficiently perform for many hybrid quantum-classical algorithms, including GHZ, Shor's, Grover's, and quantum walk algorithms, which saves a great amount of human efforts. In addition, quantum programs written in Qafny can be compiled to quantum circuits so that every verified quantum program can be run on a quantum machine.


Toward Automatic Verification of Quantum Programs

This paper summarises the results obtained by the author and his collabo...

A Deductive Verification Framework for Circuit-building Quantum Programs

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

VST-A: A Foundationally Sound Annotation Verifier

An interactive program verification tool usually requires users to write...

Hybrid Systems Verification with Isabelle/HOL: Simpler Syntax, Better Models, Faster Proofs

We extend a semantic verification framework for hybrid systems with the ...

Quantum Hoare Type Theory: Extended Abstract

As quantum computers become real, it is high time we come up with effect...

A Spectrum of Applications of Automated Reasoning

The likelihood of an automated reasoning program being of substantial as...

A Universal Technique for Machine-Certified Proofs of Linearizable Algorithms

Linearizability has been the long standing gold standard for consistency...