{"id":13,"date":"2015-06-15T10:26:53","date_gmt":"2015-06-15T08:26:53","guid":{"rendered":"http:\/\/members.loria.fr\/thierrygartiser\/?page_id=13"},"modified":"2026-01-21T11:51:25","modified_gmt":"2026-01-21T09:51:25","slug":"publications","status":"publish","type":"page","link":"https:\/\/members.loria.fr\/MBackens\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"
    \n
  1. Piotr Mitosek and Miriam Backens (2026), An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms<\/a>. Journal of Physics A: Mathematical and Theoretical, vol. 59(3), p. 035301. arXiv:2410.23439<\/a>.<\/li>\n
  2. Miriam Backens and Thomas Perez (2025), Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow<\/a>. In Proceedings of the 22nd International Conference on Quantum Physics and Logic<\/i> (QPL 2025), EPTCS<\/i> 426, pp. 100-126. arXiv:2508.14671<\/a>.<\/li>\n
  3. Miriam Backens and Kostia Chardonnet (2025), L’informatique quantique et le ZX. In: Informatique fondamentale et ses Mathématiques : Une photographie en 2025<\/i><\/a>, pp.1-73. CNRS Éditions, ISBN: 978-2-271-15855-0. \u27e8hal-05322779\u27e9<\/a>.<\/li>\n
  4. Tommy McElvanney and Miriam Backens (2023), Flow-preserving ZX-calculus rewrite rules for optimisation and obfuscation<\/a>. In Proceedings of the 20th International Conference on Quantum Physics and Logic<\/i> (QPL 2023), EPTCS<\/i> 384, 2023, pp. 203-219. arXiv:2304.08166<\/a>.<\/li>\n
  5. Miriam Backens (2022), Co-creating an ‘EDI in Computer Science University Teaching’ Toolkit with a Focus on LGBTQIA+ Issues<\/a> (abstract). In Proceedings of the 54th ACM Technical Symposium on Computer Science Education<\/i> (SIGCSE 2023), vol. 2, p. 1266.<\/li>\n
  6. Tommy McElvanney and Miriam Backens (2022), Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements<\/a>. In Proceedings of the 19th International Conference on Quantum Physics and Logic<\/i> (QPL 2022), EPTCS<\/i> 394, 2023, pp. 66-82. arXiv:2205.02009<\/a>.<\/li>\n
  7. Miriam Backens (2021), A full dichotomy for Holantc<\/sup>, inspired by quantum computation<\/a>. SIAM Journal on Computing 50(6), pp. 1739-1799. arXiv:2201.03375<\/a>. See also this erratum for the proof of Lemma 5.8<\/a> (arXiv v2 is corrected).<\/li>\n
  8. Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell, John van de Wetering, and Sal Wolffs (2023), Completeness of the ZH-calculus<\/a>, Compositionality 5, p. 5. arXiv:2103.06610<\/a>.<\/li>\n
  9. Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice, Leo Lobski, and John van de Wetering (2021), There and back again: A circuit extraction tale<\/a>. Quantum 5, p. 421. arXiv:2003.01664<\/a>.<\/li>\n
  10. Miriam Backens and Leslie Ann Goldberg (2020), Holant clones and the approximability of conservative holant problems<\/a>. ACM Transactions on Algorithms 16(2), pp. 23:1-23:55. arXiv:1811.00817<\/a>.<\/li>\n
  11. Miriam Backens and Aleks Kissinger (2019), ZH: A complete graphical calculus for quantum computations involving classical non-linearity<\/a>. In Proceedings of the 15th International Conference on Quantum Physics and Logic<\/i> (QPL 2018), EPTCS<\/i> 287, pp. 23-42. arXiv:1805.02175<\/a>.<\/li>\n
  12. Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan and Stanislav \u017divn\u00fd (2020), Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin<\/a>. Journal of Computer and Systems Sciences 109, pp. 95-125. arXiv:1804.04993<\/a>.<\/li>\n
  13. Miriam Backens, Simon Perdrix, and Quanlong Wang (2020), Towards a Minimal Stabilizer ZX-calculus<\/a>. Logical Methods in Computer Science 16(4), pp. 19:1-19:30. arXiv:1709.08903<\/a>.<\/li>\n
  14. Miriam Backens (2018), A complete dichotomy for complex-valued Holantc<\/sup><\/a>. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming<\/i> (ICALP 2018), LIPIcs<\/i> 107, pp. 12:1-12:14. arXiv:1704.05798<\/a>.<\/li>\n
  15. Miriam Backens (2017), A new Holant dichotomy inspired by quantum computation<\/a>. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming<\/i> (ICALP 2017), LIPIcs<\/i> 80, pp. 16:1-16:14. arXiv:1702.00767<\/a>.<\/li>\n
  16. Miriam Backens (2017), Number of superclasses of four-qubit entangled states under the inductive entanglement classification<\/a>. Physical Review A 95, p. 022329. arXiv:1611.02076<\/a>.<\/li>\n
  17. Miriam Backens, Simon Perdrix and Quanlong Wang (2016), A Simplified Stabilizer ZX-calculus<\/a>. In Proceedings of the 13th International Conference on Quantum Physics and Logic<\/i> (QPL 2016), EPTCS<\/i> 236, pp. 1-20. arXiv:1602.04744<\/a>.<\/li>\n
  18. Miriam Backens (2015), Making the stabilizer ZX-calculus complete for scalars<\/a>. In Proceedings of the 12th International Workshop on Quantum Physics and Logic<\/i> (QPL 2015), EPTCS<\/i> 195, pp. 17-32. arXiv:1507.03854<\/a>.<\/li>\n
  19. Miriam Backens (2015), The ZX-calculus is complete for the single-qubit Clifford+T group<\/a>. In Proceedings of the 11th International Workshop on Quantum Physics and Logic<\/i> (QPL 2014), EPTCS<\/i> 172, pp. 293-303. arXiv:1412.8553<\/a>.<\/li>\n
  20. Miriam Backens and Ali Nabi Duman (2015), A complete graphical calculus for Spekkens’ toy bit theory<\/a>. Foundations of Physics 46(1), pp. 70-103. arXiv:1411.1618<\/a>.<\/li>\n
  21. Miriam Backens (2014), The ZX-calculus is complete for stabilizer quantum mechanics<\/a>. New Journal of Physics 16(9), p. 093021. arXiv:1307.7025<\/a>.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"
      \n
    1. Piotr Mitosek and Miriam Backens (2026), An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms<\/a>. Journal of Physics A: Mathematical and Theoretical, vol. 59(3), p. 035301. arXiv:2410.23439<\/a>.<\/li>\n
    2. Miriam Backens and Thomas Perez (2025), Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow<\/a>. In Proceedings of the 22nd International Conference on Quantum Physics and Logic<\/i> (QPL 2025), EPTCS<\/i> 426, pp. 100-126. arXiv:2508.14671<\/a>.<\/li>\n
    3. Miriam Backens and Kostia Chardonnet (2025), L’informatique quantique et le ZX. In: Informatique fondamentale et ses Mathématiques : Une photographie en 2025<\/i><\/a>,<\/li>\n<\/ol>\n","protected":false},"author":5,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"page-fullwidth.php","meta":{"footnotes":""},"class_list":["post-13","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/members.loria.fr\/MBackens\/wp-json\/wp\/v2\/pages\/13","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/members.loria.fr\/MBackens\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/members.loria.fr\/MBackens\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/MBackens\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/members.loria.fr\/MBackens\/wp-json\/wp\/v2\/comments?post=13"}],"version-history":[{"count":56,"href":"https:\/\/members.loria.fr\/MBackens\/wp-json\/wp\/v2\/pages\/13\/revisions"}],"predecessor-version":[{"id":447,"href":"https:\/\/members.loria.fr\/MBackens\/wp-json\/wp\/v2\/pages\/13\/revisions\/447"}],"wp:attachment":[{"href":"https:\/\/members.loria.fr\/MBackens\/wp-json\/wp\/v2\/media?parent=13"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}