131 citations · 1.1k across the 58 of their papers we have counts for
8 papers · 1 filter
An upper bound on quantum capacity of unital channels
Anurag Anshu
We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on t…
Exponential Separation of Quantum Communication and Classical Information
Anurag Anshu, Dave Touchette, Penghui Yao +1
We exhibit a Boolean function for which the quantum communication complexity is exponentially larger than the classical information complexity. An exponential separation in the oth…
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…
Contextuality in multipartite pseudo-telepathy graph games
Anurag Anshu, Peter Hoyer, Mehdi Mhalla +1
Analyzing pseudo-telepathy graph games, we propose a way to build contextuality scenarios exhibiting the quantum supremacy using graph states. We consider the combinatorial structu…
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…
Separations in communication complexity using cheat sheets and information complexity
Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David +5
While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these meas…