D. Aharonov, A Simple Proof that Toffoli and Hadamard are Quantum Universal. eprint arXiv:quant-ph, 2003.

M. Backens, The ZX-calculus is complete for stabilizer quantum mechanics, New Journal of Physics, vol.16, issue.9, p.93021, 2014.
DOI : 10.1088/1367-2630/16/9/093021

M. Backens, The ZX-calculus is complete for the single-qubit Clifford+T group, Electronic Proceedings in Theoretical Computer Science, 2014.
DOI : 10.4204/EPTCS.172.21

&. Niel-de-beaudrap and . Horsman, The ZX calculus is a language for surface code lattice surgery Available at https, QPL 2017, 2017.

N. Chancellor, A. Kissinger, J. Roffe, S. Zohren, and D. Horsman, Graphical Structures for Design and Verification of Quantum Error Correction. Available at https, 2016.

B. Coecke and &. Duncan, Interacting quantum observables: categorical algebra and diagrammatics, New Journal of Physics, vol.13, issue.4, p.43016, 2011.
DOI : 10.1088/1367-2630/13/4/043016

B. Coecke and &. Kissinger, The Compositional Structure of Multipartite Quantum Entanglement, pp.297-308978, 2010.
DOI : 10.1007/978-3-642-14162-1_25

B. Coecke and &. Kissinger, Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning, pp.10-1017, 2017.
DOI : 10.1017/9781316219317

R. Duncan and &. Simon-perdrix, Rewriting Measurement-Based Quantum Computations with Generalised Flow, Lecture Notes in Computer Science, vol.6199, pp.285-296, 2010.
DOI : 10.1007/978-3-642-14162-1_24
URL : https://hal.archives-ouvertes.fr/hal-00940895

R. Duncan and &. Simon-perdrix, Pivoting makes the ZX-calculus complete for real stabilizers, QPL 2013, Electronic Proceedings in Theoretical Computer Science, pp.50-62, 2013.
DOI : 10.1103/PhysRevA.69.022316
URL : https://hal.archives-ouvertes.fr/hal-00935185

A. Hadzihasanovic, A Diagrammatic Axiomatisation for Qubit Entanglement, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.573-584, 2015.
DOI : 10.1109/LICS.2015.59

A. Hadzihasanovic, The algebra of entanglement and the geometry of composition Available at https, 2017.

C. Horsman, Quantum picturalism for topological cluster-state computing, New Journal of Physics, vol.13, issue.9, p.95011, 2011.
DOI : 10.1088/1367-2630/13/9/095011

E. Jeandel, S. , and R. Vilmart, A Complete Axiomatisation of the ZX- Calculus for Clifford+T Quantum Mechanics Available at https, 2017.

E. Jeandel, S. , and R. Vilmart, Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics Available at https, 2018.

E. Jeandel, S. Perdrix, R. Vilmart, and &. Wang, ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics, 42nd International Symposium on Mathematical Foundations of Computer Science Leibniz International Proceedings in Informatics (LIPIcs) 83, Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01445707

A. Kissinger and &. Vladimir-zamdzhiev, Quantomatic: A Proof Assistant for Diagrammatic Reasoning, Automated Deduction -CADE-25, pp.326-336, 2015.
DOI : 10.1007/978-3-319-21401-6_22

&. Kang-feng-ng and . Wang, A universal completion of the ZX-calculus. Available at https://arxiv, 2017.

&. Kang-feng-ng and . Wang, Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics Available at https, 2018.

A. Michael, &. Nielsen, L. Isaac, and . Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition, pp.10-1017, 2010.

P. Selinger, -depth one, Physical Review A, vol.87, issue.4, p.42302, 2013.
DOI : 10.1119/1.1463744

Y. Shi, Both Toffoli and controlled-NOT Need Little Help to Do Universal Quantum Computing, Quantum Info. Comput, vol.3, issue.1, pp.84-92, 2003.