63 citations · 63 across the 2 of their papers we have counts for
1 paper · 1 filter
William Kretschmer
We prove a query complexity lower bound for QMA protocols that solve approximate counting: estimating the size of a set given a membership oracle. This gives rise to an…