| The ZX-calculus is complete for stabilizer quantum mechanics M Backens New Journal of Physics 16 (9), 093021, 2014 | 203 | 2014 |
| ZH: A complete graphical calculus for quantum computations involving classical non-linearity M Backens, A Kissinger arXiv preprint arXiv:1805.02175, 2018 | 126 | 2018 |
| There and back again: A circuit extraction tale M Backens, H Miller-Bakewell, G de Felice, L Lobski, J van de Wetering Quantum 5, 421, 2021 | 101 | 2021 |
| The ZX-calculus is complete for the single-qubit Clifford+ T group M Backens arXiv preprint arXiv:1412.8553, 2014 | 53 | 2014 |
| A simplified stabilizer ZX-calculus M Backens, S Perdrix, Q Wang arXiv preprint arXiv:1602.04744, 2016 | 44 | 2016 |
| A complete graphical calculus for Spekkens’ toy bit theory M Backens, AN Duman Foundations of Physics 46 (1), 70-103, 2016 | 42 | 2016 |
| Completeness and the ZX-calculus M Backens arXiv preprint arXiv:1602.08954, 2016 | 41* | 2016 |
| A complete dichotomy for complex-valued Holant^ c M Backens arXiv preprint arXiv:1704.05798, 2017 | 38 | 2017 |
| Making the stabilizer ZX-calculus complete for scalars M Backens arXiv preprint arXiv:1507.03854, 2015 | 38 | 2015 |
| A new Holant dichotomy inspired by quantum computation M Backens arXiv preprint arXiv:1702.00767, 2017 | 37 | 2017 |
| Towards a minimal stabilizer ZX-calculus M Backens, S Perdrix, Q Wang Logical Methods in Computer Science 16, 2020 | 18 | 2020 |
| Number of superclasses of four-qubit entangled states under the inductive entanglement classification M Backens Physical Review A 95 (2), 022329, 2017 | 16* | 2017 |
| Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements T McElvanney, M Backens arXiv preprint arXiv:2205.02009, 2022 | 14 | 2022 |
| Flow-preserving ZX-calculus rewrite rules for optimisation and obfuscation T McElvanney, M Backens arXiv preprint arXiv:2304.08166, 2023 | 13 | 2023 |
| A Full Dichotomy for \hol^c, Inspired by Quantum Computation M Backens SIAM Journal on Computing 50 (6), 1739-1799, 2021 | 12 | 2021 |
| Holant clones and the approximability of conservative Holant problems M Backens, LA Goldberg ACM Transactions on Algorithms (TALG) 16 (2), 1-55, 2020 | 9 | 2020 |
| Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin M Backens, A Bulatov, LA Goldberg, C McQuillan, S Živný Journal of Computer and System Sciences 109, 95-125, 2020 | 3 | 2020 |
| El cálculo ZX está completo para la mecánica cuántica estabilizadora M Backens New Journal of Physics 16 (9), 093021, 2014 | 2 | 2014 |
| An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms P Mitosek, M Backens arXiv preprint arXiv:2410.23439, 2024 | | 2024 |
| Co-creating an'EDI in Computer Science University Teaching'Toolkit with a Focus on LGBTQIA+ Issues M Backens Proceedings of the 54th ACM Technical Symposium on Computer Science …, 2022 | | 2022 |
