Quantum Hoare Type Theory

12/03/2020
by   Kartik Singhal, et al.
0

As quantum computers become real, it is high time we come up with effective techniques that help programmers write correct quantum programs. Inspired by Hoare Type Theory in classical computing, we propose Quantum Hoare Type Theory (QHTT) in which precise specifications about the modification to the quantum state can be provided within the type of a computation. These specifications within a Hoare type are given in the form of Hoare-logic style pre- and postconditions following the propositions-as-types principle. The type-checking process verifies that the implementation conforms to the provided specification. QHTT has the potential to be a unified system for programming, specifying, and reasoning about quantum programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2021

Quantum Hoare Type Theory: Extended Abstract

As quantum computers become real, it is high time we come up with effect...
research
05/23/2021

Quantum and classical registers

We present a generic theory of "registers" in imperative programs and in...
research
04/08/2019

A HoTT Quantum Equational Theory (Extended Version)

This paper presents an equational theory for the QRAM model of quantum c...
research
06/18/2023

On Refactoring Quantum Programs

Refactoring is a crucial technique for improving the efficiency and main...
research
03/01/2018

Q#: Enabling scalable quantum computing and development with a high-level domain-specific language

Quantum computing exploits quantum phenomena such as superposition and e...
research
03/30/2018

Performing Fully Parallel Constraint Logic Programming on a Quantum Annealer

A quantum annealer exploits quantum effects to solve a particular type o...
research
10/30/2020

Programming Metamorphic Algorithms: An Experiment in Type-Driven Algorithm Design

In dependently typed programming, proofs of basic, structural properties...

Please sign up or login with your details

Forgot password? Click here to reset