• Hadzihasanovic A. The smash product of monoidal theories. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. (1-13).

    https://doi.org/10.1109/LICS52264.2021.9470575

  • Coecke B, Horsman D, Kissinger A and Wang Q. (2021). Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus. Theoretical Computer Science. 10.1016/j.tcs.2021.07.024. Online publication date: 1-Aug-2021.

    https://linkinghub.elsevier.com/retrieve/pii/S0304397521004308

  • Carette T, Jeandel E, Perdrix S and Vilmart R. (2021). Completeness of Graphical Languages for Mixed State Quantum Mechanics. ACM Transactions on Quantum Computing. 2:4. (1-28). Online publication date: 31-Dec-2022.

    https://doi.org/10.1145/3464693

  • Jeandel E, Perdrix S and Vilmart R. (2019). A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 10.1109/LICS.2019.8785754. 978-1-7281-3608-0. (1-10).

    https://ieeexplore.ieee.org/document/8785754/

  • Vilmart R. A near-minimal axiomatisation of ZX-calculus for pure qubit quantum mechanics. Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science. (1-10).

    /doi/10.5555/3470152.3470198

  • Jeandel E, Perdrix S and Vilmart R. A generic normal form for ZX-diagrams and application to the rational angle completeness. Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science. (1-10).

    /doi/10.5555/3470152.3470196

  • Vilmart R. (2019). A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 10.1109/LICS.2019.8785765. 978-1-7281-3608-0. (1-10).

    https://ieeexplore.ieee.org/document/8785765/

  • Jeandel E, Perdrix S and Vilmart R. Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics. Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. (569-578).

    https://doi.org/10.1145/3209108.3209139

  • Jeandel E, Perdrix S and Vilmart R. A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics. Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. (559-568).

    https://doi.org/10.1145/3209108.3209131

  • Collins J and Duncan R. (2020). Hopf-Frobenius Algebras and a Simpler Drinfeld Double. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.318.10. 318. (150-180).

    http://arxiv.org/abs/1905.00797v3

  • Comfort C. (2021). The ZX&-calculus: A complete graphical calculus for classical circuits using spiders. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.340.4. 340. (60-90).

    http://arxiv.org/abs/2004.05287v5

  • Fagan A and Duncan R. (2019). Optimising Clifford Circuits with Quantomatic. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.287.5. 287. (85-105).

    http://arxiv.org/abs/1901.10114v1

  • Garvie L and Duncan R. (2018). Verifying the Smallest Interesting Colour Code with Quantomatic. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.266.10. 266. (147-163).

    http://arxiv.org/abs/1706.02717v2

  • Hadzihasanovic A. (2017). A Topological Perspective on Interacting Algebraic Theories. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.236.5. 236. (70-86).

    http://arxiv.org/abs/1701.00658

  • Roy P, van de Wetering J and Yeh L. (2023). The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.384.9. 384. (142-170).

    http://arxiv.org/abs/2307.10095v2