most citedA Quantum Time-Space Lower Bound for the Counting Hierarchy

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

quant-ph2007★ 4 cited

A Quantum Time-Space Lower Bound for the Counting Hierarchy

Dieter van Melkebeek, Thomas Watson

We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are comple…