51 citations · 129 across the 16 of their papers we have counts for
7 papers · 2 filters
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…
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…
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…
Quantum state redistribution with local coherence
Anurag Anshu, Rahul Jain, Alexander Streltsov
Quantum entanglement and coherence are two fundamental resources for quantum information processing. Recent results clearly demonstrate their relevance in quantum technological tas…
Noisy quantum state redistribution with promise and the Alpha-bit
Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain
We consider a variation of the well-studied quantum state redistribution task, in which the starting state is known only to the receiver Bob and not to the sender Alice. We refer t…