91 citations · 766 across the 68 of their papers we have counts for
36 papers · 1 filter
Parallel Repetition for Entangled Games via Conditional Relative Entropy
Rahul Jain
We give a proof of the cubic parallel-repetition bound for finite two-player entangled games using quantum conditional relative entropy. For a game with entangled value $1-\varepsi…
A direct product theorem for quantum communication complexity with applications to device-independent cryptography
Rahul Jain, Srijita Kundu
We give a direct product theorem for the entanglement-assisted interactive quantum communication complexity of an -player predicate . In particular we show that for…
One-shot quantum state redistribution and quantum Markov chains
Anurag Anshu, Shima Bab Hadiashar, Rahul Jain +2
We revisit the task of quantum state redistribution in the one-shot setting, and design a protocol for this task with communication cost in terms of a measure of distance from quan…
A minimax approach to one-shot entropy inequalities
Anurag Anshu, Mario Berta, Rahul Jain +1
One-shot information theory entertains a plethora of entropic quantities, such as the smooth max-divergence, hypothesis testing divergence and information spectrum divergence, that…
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…
Quantifying resource in catalytic resource theory
Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain
We consider a general resource theory that allows the use of free resource as a catalyst. We show that the amount of `resource' contained in a given state, in the asymptotic scenar…
A hypothesis testing approach for communication over entanglement assisted compound quantum channel
Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically such channels are modeled as a collection of conditional probabil…
A generalized quantum Slepian-Wolf
Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
In this work we consider a quantum generalization of the task considered by Slepian and Wolf [1973] regarding distributed source compression. In our task Alice, Bob, Charlie and Re…
Parallel Device-Independent Quantum Key Distribution
Rahul Jain, Carl A. Miller, Yaoyun Shi
A prominent application of quantum cryptography is the distribution of cryptographic keys that are provably secure. Recently, such security proofs were extended by Vazirani and Vid…
Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
We consider the problem of quantum measurement compression with side information in the one-shot setting with shared randomness. In this problem, Alice shares a pure state with Ref…
One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi
Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studi…
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…
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…
Quantum message compression with applications
Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain
We present a new scheme for the compression of one-way quantum messages, in the setting of coherent entanglement assisted quantum communication. For this, we present a new technica…
Communication tasks with infinite quantum-classical separation
Christopher Perry, Rahul Jain, Jonathan Oppenheim
Quantum resources can be more powerful than classical resources - a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a func…
Multipartite Quantum Correlation and Communication Complexities
Rahul Jain, Zhaohui Wei, Penghui Yao +1
The concepts of quantum correlation complexity and quantum communication complexity were recently proposed to quantify the minimum amount of resources needed in generating bipartit…
New one shot quantum protocols with application to communication complexity
Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay +2
In this paper we present the following quantum compression protocol: P : Let be quantum states such that , the relative entropy betwe…
A parallel repetition theorem for entangled two-player one-round games under product distributions
Rahul Jain, Attila Pereszlényi, Penghui Yao
We show a parallel repetition theorem for the entangled value of any two-player one-round game where the questions to Alice an…
Conclusive Exclusion of Quantum States
Somshubhro Bandyopadhyay, Rahul Jain, Jonathan Oppenheim +1
In the task of quantum state exclusion we consider a quantum system, prepared in a state chosen from a known set. The aim is to perform a measurement on the system which can conclu…
Short proofs of the Quantum Substate Theorem
Rahul Jain, Ashwin Nayak
The Quantum Substate Theorem due to Jain, Radhakrishnan, and Sen (2002) gives us a powerful operational interpretation of relative entropy, in fact, of the observational divergence…
QIP = PSPACE
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay +1
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a pa…