3 citations · 3 across the 2 of their papers we have counts for
1 paper · 1 filter
Stephen Fenner, Frederic Green, Steven Homer +1
It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also a…