[19] Andrew Fagan and Ross Duncan. Optimising Clifford Circuits with Quantomatic.
In Proceedings of the 15th International Conference on Quantum Physics and Logic
(QPL), volume 287 of Electronic Proceedings in Theoretical Computer Science, pages
85–105. Open Publishing Association, 2019. DOI: 10.4204/EPTCS.287.5.
[20] Amar Hadzihasanovic, Kang Feng Ng, and Quanlong Wang. Two complete ax-
iomatisations of pure-state qubit quantum computing. In Proceedings of the 33rd
Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’18, pages
502–511, New York, NY, USA, 2018. ACM. ISBN 978-1-4503-5583-4. DOI:
10.1145/3209108.3209128.
[21] Marc Hein, Wolfgang Dür, Jens Eisert, Robert Raussendorf, M Nest, and H-J Briegel.
Entanglement in graph states and its applications. In Proceedings of the International
School of Physics "Enrico Fermi", Quantum Computers, Algorithms and Chaos,, vol-
ume 162, pages 115 – 218, 2006. DOI: 10.3254/978-1-61499-018-5-115.
[22] Luke E Heyfron and Earl T Campbell. An efficient quantum compiler that reduces
T count. Quantum Science and Technology, 4(015004), 2018. DOI: 10.1088/2058-
9565/aad604.
[23] Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart. Diagrammatic Rea-
soning Beyond Clifford+T Quantum Mechanics. In Proceedings of the 33rd An-
nual ACM/IEEE Symposium on Logic in Computer Science, LICS ’18, pages
569–578, New York, NY, USA, 2018. ACM. ISBN 978-1-4503-5583-4. DOI:
10.1145/3209108.3209139.
[24] Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart. A Complete Axiomati-
sation of the ZX-Calculus for Clifford+T Quantum Mechanics. In Proceedings of
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’18,
pages 559–568, New York, NY, USA, 2018. ACM. ISBN 978-1-4503-5583-4. DOI:
10.1145/3209108.3209131.
[25] Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart. A generic normal form for
zx-diagrams and application to the rational angle completeness. In Proceedings of the
34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019.
DOI: 10.1109/LICS.2019.8785754.
[26] Aleks Kissinger and Arianne Meijer-van de Griend. Cnot circuit extraction for
topologically-constrained quantum memories. arXiv preprint arXiv:1904.00633, 2019.
[27] Aleks Kissinger and John van de Wetering. Reducing T-count with the ZX-calculus.
arXiv preprint arXiv:1903.10477, 2019.
[28] Aleks Kissinger and John van de Wetering. Pyzx: Large scale automated diagram-
matic reasoning. In Bob Coecke and Matthew Leifer, editors, Proceedings 16th In-
ternational Conference on Quantum Physics and Logic, Chapman University, Or-
ange, CA, USA., 10-14 June 2019, volume 318 of Electronic Proceedings in Theo-
retical Computer Science, pages 229–241. Open Publishing Association, 2020. DOI:
10.4204/EPTCS.318.14.
[29] Vadym Kliuchnikov and Dmitri Maslov. Optimization of Clifford circuits. Phys. Rev.
A, 88:052307, Nov 2013. DOI: 10.1103/PhysRevA.88.052307.
[30] Anton Kotzig. Eulerian lines in finite 4-valent graphs and their transformations. In
Colloqium on Graph Theory Tihany 1966, pages 219–230. Academic Press, 1968.
[31] Samuel A Kutin, David Petrie Moulton, and Lawren M Smithline. Computation at a
distance. arXiv preprint quant-ph/0701194, 2007.
[32] Ketan Markov, Igor Patel, and John Hayes. Optimal synthesis of linear reversible
circuits. Quantum Information and Computation, 8(3&4):0282–0294, 2008.
Accepted in Quantum 2020-04-27, click title to verify 20