66 citations · 461 across the 28 of their papers we have counts for
1 paper · 1 filter
Gorjan Alagic, Catharine Lo
The computational complexity class #P captures the difficulty of counting the satisfying assignments to a boolean formula. In this work, we use basic tools from quantum computation…