Verifying the Steane code with Quantomatic
classification
🪐 quant-ph
cs.AIcs.LO
keywords
quantomaticcodesteanebestcarriedcomplicatedcorrectingcorrectness
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.