#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2013

2018

- This year (10)
- Last 5 years (34)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
- ArXiv
- 2014

In this paper we present a new operational interpretation of relative-entropy between quantum states in the form of the following protocol. P: Alice gets to know the eigen-decomposition of a quantum… (More)

- Anurag Anshu, Aleksandrs Belovs, +5 authors Miklos Santha
- 2016 IEEE 57th Annual Symposium on Foundations of…
- 2016

While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC 1999), the best known separation between these measures for a total… (More)

- Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay
- Electronic Colloquium on Computational Complexity
- 2017

We show that for any (partial) query function f : {0, 1} → {0, 1}, the randomized communication complexity of f composed with Indexm (with m = poly(n)) is at least the randomized query complexity of… (More)

- Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
- IEEE Transactions on Information Theory
- 2018

We study the problem of entanglement-assisted quantum state redistribution in the one-shot setting and provide a new achievability result on the quantum communication required. Our bounds are in… (More)

Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution

- Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
- ArXiv
- 2017

We study the problem of state redistribution both in the classical (shared randomness assisted) and quantum (entanglement assisted) one-shot settings and provide new upper bounds on the communication… (More)

- Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
- IEEE Transactions on Information Theory
- 2016

In this paper, we present the following quantum compression protocol `P': Let ρ,σ be quantum states, such that S (ρ∥σ) <sup>def</sup>= Tr(ρ log ρ - ρ log σ), the relative entropy between ρ and σ, is… (More)

Data compression is a fundamental problem in quantum and classical information theory. A typical version of the problem is that the sender Alice receives a (classical or quantum) state from some… (More)

The detectability lemma is a useful tool for probing the structure of gapped ground states of frustration-free Hamiltonians of lattice spin models. The lemma provides an estimate on the error… (More)

- Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
- ArXiv
- 2017

We consider the problem of measurement compression with side information in the one-shot setting with shared randomness. In this problem, Alice shares a pure state with Referee and Bob and she… (More)

- Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
- IEEE Transactions on Information Theory
- 2018

In this paper, we consider a quantum generalization of the task considered by Slepian and Wolf regarding distributed source compression. In our task, Alice, Bob, Charlie, and Reference share a joint… (More)