116 citations · 420 across the 22 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
quant-ph2022★ 11 cited
Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
Tommy McElvanney, Miriam Backens
In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via measurements on some standard resource state. So-called flow conditions ensure that t…
cs.CC2022★ 8 cited
A full dichotomy for Holant, inspired by quantum computation
Miriam Backens
Holant problems are a family of counting problems parameterised by sets of algebraic-complex valued constraint functions, and defined on graphs. They arise from the theory of holog…