# Verifying the Smallest Interesting Colour Code with Quantomatic

arXiv: https://arxiv.org/abs/1706.02717 · HTML: https://mlsanity.com/paper/1706.02717/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Jun 2017.

## Built on by (most cited first, 2 of 2)

- [Optimizing ZX-Diagrams with Deep Reinforcement Learning](https://mlsanity.com/paper/2311.18588/) (2023)
- [Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks](https://mlsanity.com/paper/2504.03429/) (2025)

## Abstract (arXiv)

In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detecting code.