Optimising Clifford circuits with Quantomatic

Fagan, Andrew and Duncan, Ross (2019) Optimising Clifford circuits with Quantomatic. Electronic Proceedings in Theoretical Computer Science, 287. pp. 85-105. ISSN 2075-2180 (https://doi.org/10.4204/EPTCS.287.5)

[thumbnail of Fagan-Duncan-EPTCS-2019-Optimising-Clifford-circuits-with]
Text. Filename: Fagan_Duncan_EPTCS_2019_Optimising_Clifford_circuits_with.pdf
Final Published Version

Download (387kB)| Preview


We present a system of equations between Clifford circuits, all derivable in the ZX-calculus, and formalised as rewrite rules in the Quantomatic proof assistant. By combining these rules with some non-trivial simplification procedures defined in the Quantomatic tactic language, we demonstrate the use of Quantomatic as a circuit optimisation tool. We prove that the system always reduces Clifford circuits of one or two qubits to their minimal form, and give numerical results demonstrating its performance on larger Clifford circuits.


Fagan, Andrew ORCID logoORCID: https://orcid.org/0000-0001-9714-2096 and Duncan, Ross ORCID logoORCID: https://orcid.org/0000-0001-6758-1573;