Publications

  1. Piotr Mitosek and Miriam Backens (2024), An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms. arXiv:2410.23439.
  2. Tommy McElvanney and Miriam Backens (2023), Flow-preserving ZX-calculus rewrite rules for optimisation and obfuscation. In Proceedings of the 20th Workshop on Quantum Physics and Logic (QPL 2023), EPTCS 384, 2023, pp. 203-219. arXiv:2304.08166.
  3. Miriam Backens (2022), Co-creating an ‘EDI in Computer Science University Teaching’ Toolkit with a Focus on LGBTQIA+ Issues (abstract). In Proceedings of the 54th ACM Technical Symposium on Computer Science Education (SIGCSE 2023), vol. 2, p. 1266.
  4. Tommy McElvanney and Miriam Backens (2022), Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements. In Proceedings of the 19th Workshop on Quantum Physics and Logic (QPL 2022), EPTCS 394, 2023, pp. 66-82. arXiv:2205.02009.
  5. Miriam Backens (2021), A full dichotomy for Holantc, inspired by quantum computation. SIAM Journal on Computing 50(6), pp. 1739-1799. arXiv:2201.03375.
  6. Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell, John van de Wetering, and Sal Wolffs (2023), Completeness of the ZH-calculus, Compositionality 5, p. 5. arXiv:2103.06610.
  7. Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice, Leo Lobski, and John van de Wetering (2021), There and back again: A circuit extraction tale. Quantum 5, p. 421. arXiv:2003.01664.
  8. Miriam Backens and Leslie Ann Goldberg (2020), Holant clones and the approximability of conservative holant problems. ACM Transactions on Algorithms 16(2), pp. 23:1-23:55. arXiv:1811.00817.
  9. Miriam Backens and Aleks Kissinger (2018), ZH: A complete graphical calculus for quantum computations involving classical non-linearity. In Proceedings of the 15th Workshop on Quantum Physics and Logic (QPL 2018), EPTCS 287, 2019, pp. 23-42. arXiv:1805.02175.
  10. Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan and Stanislav Živný (2020), Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. Journal of Computer and Systems Sciences 109, pp. 95-125. arXiv:1804.04993.
  11. Miriam Backens, Simon Perdrix, and Quanlong Wang (2020), Towards a Minimal Stabilizer ZX-calculus. Logical Methods in Computer Science 16(4), pp. 19:1-19:30. arXiv:1709.08903.
  12. Miriam Backens (2018), A complete dichotomy for complex-valued Holantc. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), LIPIcs 107, pp. 12:1-12:14. arXiv:1704.05798.
  13. Miriam Backens (2017), A new Holant dichotomy inspired by quantum computation. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), LIPIcs 80, pp. 16:1-16:14. arXiv:1702.00767.
  14. Miriam Backens (2017), Number of superclasses of four-qubit entangled states under the inductive entanglement classification. Physical Review A 95, p. 022329. arXiv:1611.02076.
  15. Miriam Backens, Simon Perdrix and Quanlong Wang (2016), A Simplified Stabilizer ZX-calculus. In Proceedings of the 13th Workshop on Quantum Physics and Logic (QPL 2016), EPTCS 236, pp. 1-20. arXiv:1602.04744.
  16. Miriam Backens (2015), Making the stabilizer ZX-calculus complete for scalars. In Proceedings of the 12th Workshop on Quantum Physics and Logic (QPL 2015), EPTCS 195, pp. 17-32. arXiv:1507.03854.
  17. Miriam Backens (2015), The ZX-calculus is complete for the single-qubit Clifford+T group. In Proceedings of the 11th Workshop on Quantum Physics and Logic (QPL 2014), EPTCS 172, pp. 293-303. arXiv:1412.8553.
  18. Miriam Backens and Ali Nabi Duman (2015), A complete graphical calculus for Spekkens’ toy bit theory. Foundations of Physics 46(1), pp. 70-103. arXiv:1411.1618.
  19. Miriam Backens (2014), The ZX-calculus is complete for stabilizer quantum mechanics. New Journal of Physics 16(9), p. 093021. arXiv:1307.7025.