Tight Quantum Lower Bound for Approximate Counting with Quantum States

Cited by: 0|Bibtex|Views2|Links

Abstract:

We prove tight lower bounds for the following variant of the counting problem considered by Aaronson et al. The task is to distinguish whether an input set $x\subseteq [n]$ has size either $k$ or $k'=(1+\epsilon)k$. We assume the algorithm has access to * the membership oracle, which, for each $i\in [n]$, can answer whether $i\in x$, ...More

Code:

Data:

Your rating :
0

 

Tags
Comments