Verifying the Smallest Interesting Colour Code with Quantomatic
Not on the map. Why?
Abstract (arXiv)
In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detecting code.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.