Verifying the Steane code with Quantomatic

06/19/2013
by   Ross Duncan, et al.
0

In this paper we give a partially mechanized proof of the correctness of Steane's 7-qubit error correcting code, using the tool Quantomatic. To the best of our knowledge, this represents the largest and most complicated verification task yet carried out using Quantomatic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2017

Codes Correcting Two Deletions

In this work, we investigate the problem of constructing codes capable o...
research
09/05/2022

Exploring the Verifiability of Code Generated by GitHub Copilot

GitHub's Copilot generates code quickly. We investigate whether it gener...
research
08/06/2021

Verifying Time Complexity of Binary Search using Dafny

Formal software verification techniques are widely used to specify and p...
research
05/19/2019

Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics

Verification of fault-tolerant distributed protocols is an immensely dif...
research
10/27/2018

Beyond Structured Programming

The correctness of a structured program is, at best, plausible. Though t...
research
10/21/2022

Non-binary Codes for Correcting a Burst of at Most t Deletions

The problem of correcting deletions has received significant attention, ...
research
08/27/2018

AutoFrame: Automatic Frame Inference for Object-Oriented Languages

Automatic program verification has made tremendous strides, but is not y...

Please sign up or login with your details

Forgot password? Click here to reset