Better Lower Bounds for Locally Decodable Codes. - Amit Deshpande 001; Rahul Jain 001; Telikepalli Kavitha; Jaikumar Radhakrishnan; Satyanarayana V. Lokam (CCC, 2002)

Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. - Rahul Jain 001; Jaikumar Radhakrishnan; Pranab Sen (FOCS, 2002)

The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. - Rahul Jain 001; Jaikumar Radhakrishnan; Pranab Sen (FSTTCS, 2002)

A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. - Rahul Jain 001; Jaikumar Radhakrishnan; Pranab Sen (FOCS, 2003)

A Direct Sum Theorem in Communication Complexity via Message Compression. - Rahul Jain 001; Jaikumar Radhakrishnan; Pranab Sen (ICALP, 2003)

Prior Entanglement, Message Compression and Privacy in Quantum Communication. - Rahul Jain 001; Jaikumar Radhakrishnan; Pranab Sen (CCC, 2005)

Lower bounds for adaptive locally decodable codes. - Amit Deshpande 001; Rahul Jain 001; Telikepalli Kavitha; Satyanarayana V. Lokam; Jaikumar Radhakrishnan (Random Struct. Algorithms, 2005)

Towards a classical proof of exponential lower bound for 2-probe smooth codes - Rahul Jain 001 (CoRR, 2006)

The communication complexity of correlation. - Prahladh Harsha; Rahul Jain 001; David A. McAllester; Jaikumar Radhakrishnan (Electron. Colloquium Comput. Complex., 2006)

Communication complexity of remote state preparation with entanglement. - Rahul Jain 001 (Quantum Inf. Comput., 2006)

Direct Product Theorems for Communication Complexity via Subdistribution Bounds. - Rahul Jain 001; Hartmut Klauck; Ashwin Nayak 001 (Electron. Colloquium Comput. Complex., 2007)

Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. - Rahul Jain 001; Hartmut Klauck; Ashwin Nayak 001 (STOC, 2008)

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity - Rahul Jain 001; Pranab Sen; Jaikumar Radhakrishnan (CoRR, 2008)

New Binding-Concealing Trade-Offs for Quantum String Commitment. - Rahul Jain 001 (J. Cryptol., 2008)

Teleportation of Quantum States. - Rahul Jain 001 (Encyclopedia of Algorithms, 2008)

New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. - Rahul Jain 001; Hartmut Klauck (CCC, 2009)

Parallel Approximation of Non-interactive Zero-sum Quantum Games. - Rahul Jain 001; John Watrous (CCC, 2009)

Two-Message Quantum Interactive Proofs Are in PSPACE. - Rahul Jain 001; Sarvagya Upadhyay; John Watrous (FOCS, 2009)

New Results in the Simultaneous Message Passing Model - Rahul Jain 001; Hartmut Klauck (CoRR, 2009)

A property of quantum relative entropy with an application to privacy in quantum communication. - Rahul Jain 001; Jaikumar Radhakrishnan; Pranab Sen (J. ACM, 2009)

Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. - Richard Cleve; Dmitry Gavinsky; Rahul Jain 001 (Quantum Inf. Comput., 2009)

On parallel composition of zero-knowledge proofs with black-box quantum simulators. - Rahul Jain 001; Alexandra Kolla; Gatis Midrijanis; Ben W. Reichardt (Quantum Inf. Comput., 2009)

New bounds on classical and quantum one-way communication complexity. - Rahul Jain 001; Shengyu Zhang 002 (Theor. Comput. Sci., 2009)

The Partition Bound for Classical Communication Complexity and Query Complexity. - Rahul Jain 001; Hartmut Klauck (CCC, 2010)

Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. - Rahul Jain 001; Hartmut Klauck; Shengyu Zhang 002 (COCOON, 2010)

QIP = PSPACE. - Rahul Jain 001; Zhengfeng Ji; Sarvagya Upadhyay; John Watrous (Commun. ACM, 2010)

Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity - Rahul Jain 001 (CoRR, 2010)

A strong direct product theorem for two-way public coin communication complexity - Rahul Jain 001 (CoRR, 2010)

The space complexity of recognizing well-parenthesized expressions. - Rahul Jain 001; Ashwin Nayak 001 (Electron. Colloquium Comput. Complex., 2010)

Optimal direct sum results for deterministic and randomized decision tree complexity. - Rahul Jain 001; Hartmut Klauck; Miklos Santha (Inf. Process. Lett., 2010)

A separation between divergence and Holevo information for ensembles. - Rahul Jain 001; Ashwin Nayak 001; Yi Su (Math. Struct. Comput. Sci., 2010)

A Parallel Approximation Algorithm for Positive Semidefinite Programming. - Rahul Jain 001; Penghui Yao (FOCS, 2011)

A short proof of the Quantum Substate Theorem - Rahul Jain 001; Ashwin Nayak 001 (CoRR, 2011)

New strong direct product results in communication complexity. - Rahul Jain 001 (Electron. Colloquium Comput. Complex., 2011)

The influence lower bound via query elimination. - Rahul Jain 001; Shengyu Zhang 002 (Electron. Colloquium Comput. Complex., 2011)

A direct product theorem for bounded-round public-coin randomized communication complexity - Rahul Jain 001; Attila Pereszlényi; Penghui Yao (CoRR, 2012)

A parallel approximation algorithm for mixed packing and covering semidefinite programs - Rahul Jain 001; Penghui Yao (CoRR, 2012)

Correlation/Communication complexity of generating bipartite states - Rahul Jain 001; Yaoyun Shi; Zhaohui Wei; Shengyu Zhang 002 (CoRR, 2012)

A strong direct product theorem in terms of the smooth rectangle bound - Rahul Jain 001; Penghui Yao (CoRR, 2012)

Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation. - Rahul Jain 001 (J. Cryptol., 2012)

Short Proofs of the Quantum Substate Theorem. - Rahul Jain 001; Ashwin Nayak 001 (IEEE Trans. Inf. Theory, 2012)

On the Power of a Unique Quantum Witness. - Rahul Jain 001; Iordanis Kerenidis; Greg Kuperberg; Miklos Santha; Or Sattath; Shengyu Zhang 002 (Theory Comput., 2012)

A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound. - Prahladh Harsha; Rahul Jain 001 (FSTTCS, 2013)

Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States. - Rahul Jain 001; Yaoyun Shi; Zhaohui Wei; Shengyu Zhang 002 (IEEE Trans. Inf. Theory, 2013)

Unidirectional Input/Output Streaming Complexity of Reversal and Sorting. - Nathanaël François; Rahul Jain 001; Frédéric Magniez (APPROX-RANDOM, 2014)

A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. - Rahul Jain 001; Attila Pereszlényi; Penghui Yao (CCC, 2014)

Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution. - Anurag Anshu; Vamsi Krishna Devabathini; Rahul Jain 001 (CoRR, 2014)

A new operational interpretation of relative entropy and trace distance between quantum states. - Anurag Anshu; Rahul Jain 001; Priyanka Mukhopadhyay; Ala Shayeghi; Penghui Yao (CoRR, 2014)

A quadratically tight partition bound for classical communication complexity and query complexity. - Rahul Jain 001; Troy Lee; Nisheeth K. Vishnoi (CoRR, 2014)

Approximate and Multipartite Quantum Correlation (Communication) Complexity. - Rahul Jain 001; Zhaohui Wei; Penghui Yao; Shengyu Zhang 002 (CoRR, 2014)

The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited. - Rahul Jain 001; Ashwin Nayak 001 (IEEE Trans. Inf. Theory, 2014)

Relative Discrepancy does not separate Information and Communication Complexity. - Lila Fontes; Rahul Jain 001; Iordanis Kerenidis; Sophie Laplante; Mathieu Laurière; Jérémie Roland (Electron. Colloquium Comput. Complex., 2015)

Relaxed partition bound is quadratically tight for product distributions. - Prahladh Harsha; Rahul Jain 001; Jaikumar Radhakrishnan (Electron. Colloquium Comput. Complex., 2015)

Partition Bound Is Quadratically Tight for Product Distributions. - Prahladh Harsha; Rahul Jain 001; Jaikumar Radhakrishnan (ICALP, 2016)

A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. - Rahul Jain 001; Attila Pereszlényi; Penghui Yao (Algorithmica, 2016)

Separations in communication complexity using cheat sheets and information complexity. - Anurag Anshu; Aleksandrs Belovs; Shalev Ben-David; Mika Göös; Rahul Jain 001; Robin Kothari; Troy Lee; Miklos Santha (Electron. Colloquium Comput. Complex., 2016)

New One Shot Quantum Protocols With Application to Communication Complexity. - Anurag Anshu; Rahul Jain 001; Priyanka Mukhopadhyay; Ala Shayeghi; Penghui Yao (IEEE Trans. Inf. Theory, 2016)

Teleportation of Quantum States. - Anurag Anshu; Vamsi Krishna Devabathini; Rahul Jain 001; Priyanka Mukhopadhyay (Encyclopedia of Algorithms, 2016)

Separating Quantum Communication and Approximate Rank. - Anurag Anshu; Shalev Ben-David; Ankit Garg; Rahul Jain 001; Robin Kothari; Troy Lee (CCC, 2017)

Achievability bounds on quantum state redistribution using convex split and position based decoding. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (ITW, 2017)

Matching Multiplications in Bit-Vector Formulas. - Supratik Chakraborty; Ashutosh Gupta 001; Rahul Jain 001 (VMCAI, 2017)

Information-theoretic approximations of the nonnegative rank. - Gábor Braun; Rahul Jain 001; Troy Lee; Sebastian Pokutta (Comput. Complex., 2017)

Multipartite Quantum Correlation and Communication Complexities. - Rahul Jain 001; Zhaohui Wei; Penghui Yao; Shengyu Zhang 002 (Comput. Complex., 2017)

Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (CoRR, 2017)

One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (CoRR, 2017)

A unified approach to source and message compression. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (CoRR, 2017)

Measurement compression with quantum side information using shared randomness. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (CoRR, 2017)

A Composition Theorem for Randomized Query complexity. - Anurag Anshu; Dmitry Gavinsky; Rahul Jain 001; Srijita Kundu; Troy Lee; Priyanka Mukhopadhyay; Miklos Santha; Swagato Sanyal (Electron. Colloquium Comput. Complex., 2017)

Lifting randomized query complexity to randomized communication complexity. - Anurag Anshu; Naresh B. Goud; Rahul Jain 001; Srijita Kundu; Priyanka Mukhopadhyay (Electron. Colloquium Comput. Complex., 2017)

Quadratically Tight Relations for Randomized Query Complexity. - Dmitry Gavinsky; Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Electron. Colloquium Comput. Complex., 2017)

Special issue on the conference Theory and Applications of Models of Computation. - Rahul Jain 001; Sanjay Jain 001; Frank Stephan 001 (Inf. Comput., 2017)

Building Blocks for Communication Over Noisy Quantum Nerworks. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (ISIT, 2018)

One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels. - Farzin Salek; Anurag Anshu; Min-Hsiu Hsieh; Rahul Jain 001; Javier R. Fonollosa (ISIT, 2018)

Extension Complexity of Independent Set Polytopes. - Mika Göös; Rahul Jain 001; Thomas Watson 001 (SIAM J. Comput., 2018)

A One-Shot Achievability Result for Quantum State Redistribution. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (IEEE Trans. Inf. Theory, 2018)

A Generalized Quantum Slepian-Wolf. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (IEEE Trans. Inf. Theory, 2018)

Second-Order Characterizations via Partial Smoothing. - Anurag Anshu; Mario Berta; Rahul Jain 001; Marco Tomamichel (ISIT, 2019)

Building Blocks for Communication Over Noisy Quantum Networks. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (IEEE Trans. Inf. Theory, 2019)

A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (IEEE Trans. Inf. Theory, 2019)

Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction. - Anurag Anshu; Rahul Jain 001; Naqueeb Ahmad Warsi (IEEE Trans. Inf. Theory, 2019)

A Direct Product Theorem for One-Way Quantum Communication. - Rahul Jain 001; Srijita Kundu (Electron. Colloquium Comput. Complex., 2020)

Quadratically Tight Relations for Randomized Query Complexity. - Rahul Jain 001; Hartmut Klauck; Srijita Kundu; Troy Lee; Miklos Santha; Swagato Sanyal; Jevgenijs Vihrovs (Theory Comput. Syst., 2020)

Partially Smoothed Information Measures. - Anurag Anshu; Mario Berta; Rahul Jain 001; Marco Tomamichel (IEEE Trans. Inf. Theory, 2020)

Noisy Quantum State Redistribution With Promise and the Alpha-Bit. - Anurag Anshu; Min-Hsiu Hsieh; Rahul Jain 001 (IEEE Trans. Inf. Theory, 2020)

Parallel Device-Independent Quantum Key Distribution. - Rahul Jain 001; Carl A. Miller; Yaoyun Shi (IEEE Trans. Inf. Theory, 2020)

One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information. - Farzin Salek; Anurag Anshu; Min-Hsiu Hsieh; Rahul Jain 001; Javier Rodríguez Fonollosa (IEEE Trans. Inf. Theory, 2020)

Chain-Rules for Channel Capacity. - Rahul Jain 001 (ISIT, 2021)

Quantum secure non-malleable-extractors. - Naresh Goud Boddu; Rahul Jain 001; Upendra Kapshikar (CoRR, 2021)

A direct product theorem for quantum communication complexity with applications to device-independent QKD. - Rahul Jain 001; Srijita Kundu (Electron. Colloquium Comput. Complex., 2021)

Quantum secure non-malleable-codes in the split-state model. - Naresh Goud Boddu; Rahul Jain 001 (CoRR, 2022)

One-Shot Non-Catalytic Distributed Purity Distillation. - Sayantan Chakraborty 002; Rahul Jain 001; Pranab Sen (Allerton, 2023)

Area law for the maximally mixed ground state in degenerate 1D gapped systems. - Itai Arad; Raz Firanko; Rahul Jain 001 (CoRR, 2023)

On relating one-way classical and quantum communication complexities. - Naresh Goud Boddu; Rahul Jain 001; Han-Hsuan Lin (Quantum, 2023)

One-Shot Quantum State Redistribution and Quantum Markov Chains. - Anurag Anshu; Shima Bab Hadiashar; Rahul Jain 001; Ashwin Nayak 001; Dave Touchette (IEEE Trans. Inf. Theory, 2023)

Commitments are Equivalent to Statistically-Verifiable One-Way State Generators. - Rishabh Batra; Rahul Jain 001 (FOCS, 2024)

Quantum Channel Simulation in Fidelity is No More Difficult than State Splitting. - Michael X. Cao; Rahul Jain 001; Marco Tomamichel (ISIT, 2024)

An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP. - Itai Arad; Raz Firanko; Rahul Jain 001 (STOC, 2024)

Quantum Channel Simulation under Purified Distance is no more difficult than State Splitting. - Michael X. Cao; Rahul Jain 001; Marco Tomamichel (CoRR, 2024)

Commitments are equivalent to one-way state generators. - Rishabh Batra; Rahul Jain 001 (CoRR, 2024)

Quantum Secure Non-Malleable Codes in the Split-State Model. - Divesh Aggarwal; Naresh Goud Boddu; Rahul Jain 001 (IEEE Trans. Inf. Theory, 2024)

Quantum Measurement Adversary. - Divesh Aggarwal; Naresh Goud Boddu; Rahul Jain 001; Maciej Obremski (IEEE Trans. Inf. Theory, 2024)

Quantum Secure Non-Malleable Randomness Encoder and Its Applications. - Rishabh Batra; Naresh Goud Boddu; Rahul Jain 001 (IEEE Trans. Inf. Theory, 2025)

Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages. - Naresh Goud Boddu; Vipul Goyal; Rahul Jain 001; João Ribeiro 002 (IEEE Trans. Inf. Theory, 2025)