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

page 1

page 2

page 3

page 4

research
10/03/2020

Proving Quantum Programs Correct

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

Quantum Consensus: an overview

We review the literature about reaching agreement in quantum networks, a...
research
11/10/2022

Quantum Power Flows: From Theory to Practice

Climate change is becoming one of the greatest challenges to the sustain...
research
12/02/2022

Quantum NETwork: from theory to practice

The quantum internet is envisioned as the ultimate stage of the quantum ...
research
09/23/2022

QuantumSolver: A quantum tool-set for developers

This paper introduces a new opensource quantum tool-set called QuantumSo...
research
01/11/2023

A Quantum Algorithm for Shapley Value Estimation

The introduction of the European Union's (EU) set of comprehensive regul...
research
08/27/2023

Hands-on Quantum Programming Labs for EECS Students

This report presents a practical approach to teaching quantum computing ...

Please sign up or login with your details

Forgot password? Click here to reset