131 citations · 1.1k across the 58 of their papers we have counts for
9 papers · 1 filter
Quantum Log-Approximate-Rank Conjecture is also False
Anurag Anshu, Naresh Goud Boddu, Dave Touchette
In a recent breakthrough result, Chattopadhyay, Mande and Sherif [ECCC TR18-17] showed an exponential separation between the log approximate rank and randomized communication compl…
One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh +2
We study the communication capabilities of a quantum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to tr…
Efficient methods for one-shot quantum communication
Anurag Anshu, Rahul Jain
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce…
On the compression of messages in the multi-party setting
Anurag Anshu, Penghui Yao
We consider the following communication task in the multi-party setting, which involves a joint random variable with the property that is independent of condition…
Partially smoothed information measures
Anurag Anshu, Mario Berta, Rahul Jain +1
Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information theory and cryptography. In typical bi- and multi-partite problems, however, some of the su…
On the near-optimality of one-shot classical communication over quantum channels
Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
We study the problem of transmission of classical messages through a quantum channel in several network scenarios in the one-shot setting. We consider both the entanglement assiste…