64 citations · 183 across the 20 of their papers we have counts for
Showing 2016 · quant-phShow all
2 papers · 2 filters
quant-ph2016★ 1 cited
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…
quant-ph2016★ 1 cited
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…