64 citations · 183 across the 20 of their papers we have counts for
4 papers · 1 filter
Separating quantum communication and approximate rank
Anurag Anshu, Shalev Ben-David, Ankit Garg +3
One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the c…
Rank bounds for design matrices with block entries and geometric applications
Zeev Dvir, Ankit Garg, Rafael Oliveira +1
Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point…
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling
Ankit Garg, Leonid Gurvits, Rafael Oliveira +1
The celebrated Brascamp-Lieb (BL) inequalities (and their extensions) are an important mathematical tool, unifying and generalizing numerous inequalities in analysis, convex geomet…
Expected communication cost of distributed quantum tasks
Anurag Anshu, Ankit Garg, Aram Harrow +1
A central question in classical information theory is that of source compression, which is the task where Alice receives a sample from a known probability distribution and needs to…