Certified Quantum Computation in Isabelle/HOL

12/27/2020
by   Anthony Bordg, et al.
0

In this article we present an ongoing effort to formalise quantum algorithms and results in quantum information theory using the proof assistant Isabelle/HOL. Formal methods being critical for the safety and security of algorithms and protocols, we foresee their widespread use for quantum computing in the future. We have developed a large library for quantum computing in Isabelle based on a matrix representation for quantum circuits, successfully formalising the no-cloning theorem, quantum teleportation, Deutsch's algorithm, the Deutsch-Jozsa algorithm and the quantum Prisoner's Dilemma. We discuss the design choices made and report on an outcome of our work in the field of quantum game theory.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/03/2020

Proving Quantum Programs Correct

As quantum computing steadily progresses from theory to practice, progra...
01/11/2021

Quantum Consensus: an overview

We review the literature about reaching agreement in quantum networks, a...
01/30/2021

Zur Integration von Post-Quantum Verfahren in bestehende Softwareprodukte

Currently, PQC algorithms are being standardized to address the emerging...
02/11/2019

Reliable quantum circuits have defects

State of the art quantum computing architectures are founded on the deci...
05/17/2021

Quantum Transport Protocols for Distributed Quantum Computing

Quantum computing holds a great promise and this work proposes to use ne...
03/02/2021

Diagrammatic security proof for 8-state encoding

Dirac notation is the most common way to describe quantum states and ope...
08/17/2021

A comparative study of universal quantum computing models: towards a physical unification

Quantum computing has been a fascinating research field in quantum physi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.