activity
20152026
most citedHow symmetric is too symmetric for large quantum speedups?

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

collaborators
Showing 2018Show all

1 paper · 1 filter

quant-ph2018

Classical lower bounds from quantum upper bounds

Shalev Ben-David, Adam Bouland, Ankit Garg +1

We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove t…