116 citations · 420 across the 22 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
quant-ph2017★ 6 cited
Towards a Minimal Stabilizer ZX-calculus
Miriam Backens, Simon Perdrix, Quanlong Wang
The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram int…
quant-ph2017★ 3 cited
A complete dichotomy for complex-valued Holant^c
Miriam Backens
Holant problems are a family of counting problems on graphs, parametrised by sets of complex-valued functions of Boolean inputs. Holant^c denotes a subfamily of those problems, whe…
quant-ph2017
A new Holant dichotomy inspired by quantum computation
Miriam Backens
Holant problems are a framework for the analysis of counting complexity problems on graphs. This framework is simultaneously general enough to encompass many other counting problem…