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.
|Number of pages||21|
|Journal||Electronic Proceedings in Theoretical Computer Science|
|Publication status||Published - 29 Jan 2019|
|Event||15th International Conference on Quantum Physics and Logic - Dalhousie University, Halifax, Canada|
Duration: 3 Jun 2018 → 7 Jun 2018
- quantum computation
- Clifford circuits