Verifying the Smallest Interesting Colour Code with Quantomatic
Quantum Physics
2018-03-05 v2 Logic in Computer Science
Abstract
In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detecting code.
Cite
@article{arxiv.1706.02717,
title = {Verifying the Smallest Interesting Colour Code with Quantomatic},
author = {Liam Garvie and Ross Duncan},
journal= {arXiv preprint arXiv:1706.02717},
year = {2018}
}
Comments
In Proceedings QPL 2017, arXiv:1802.09737. v2 removes the long appendix with the complete proofs. This is still available in v1 of this paper