default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRahul Jain 0001
Person information
- affiliation: National University of Singapore, Centre for Quantum Technologies (CQT), Singapore
- affiliation (2006 - 2008): University of Waterloo, Computer Science Department, Institute for Quantum Computing, ON, Canada
- affiliation (2004 - 2006): University of California at Berkeley, CA, USA
Other persons with the same name
- Rahul Jain — disambiguation page
- Rahul Jain 0002
![[0000-0003-3786-8682]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-3786-8682")
— University of Southern California, Los Angeles, CA, USA (and 2 more) - Rahul Jain 0003 — Indian Institute of Technology Kharagpur, India
- Rahul Jain 0004 — Indian Institute of Technology Delhi
- Rahul Jain 0006 — IBM, San Francisco, USA (and 1 more)
- Rahul Jain 0007 — Deep Impact, Winterthur, Switzerland (and 1 more)
- Rahul Jain 0008 — IIIT-Hyderabad, Center for Visual Information Technology, India
- Rahul Jain 0009 — Numerify, Bangalore, India (and 1 more)
- Rahul Jain 0010 — Indian Institute of Science, TIFR Centre, Bangalore, India
- Rahul Jain 0011 — New Jersey Institute of Technology, Newark, NJ, USA
- Rahul Jain 0012 — Indian Institute of Technology, Roorkee, India
- Rahul Jain 0013 — Hindustan Institute of Technology and Management, Agra, India
- Rahul Jain 0014 — University of Iowa, Iowa City, IA, USA
- Rahul Jain 0015 — Indian Institute of Technology Kanpur, India
- Rahul Jain 0016 — Maulana Azad National Institute of Technology, Bhopal, India (and 1 more)
- Rahul Jain 0017 — National Institute of Technology, NIT, Speech and Image Processing Group, Electronics and Communication Engineering Department, Silchar, India
- Rahul Jain 0018 — Purdue University, West Lafayette, IN, USA
- Rahul Jain 0019 — Rajasthan Technical University, Department of Mechanical Engineering, Kota, Rajasthan, India
- Rahul Jain 0020 — Goldman Sachs, Bangalore
Other persons with a similar name
- Rahul Kumar Jain 0001 — Ritsumeikan University, Shiga, Japan
SPARQL queries 
🛈 Please note that only 58% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j40]Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski:
Quantum Measurement Adversary. IEEE Trans. Inf. Theory 70(1): 318-335 (2024)- [j39]Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain:
Quantum Secure Non-Malleable Codes in the Split-State Model. IEEE Trans. Inf. Theory 70(1): 349-371 (2024) - [c44]Rishabh Batra, Rahul Jain:
Commitments are Equivalent to Statistically-Verifiable One-Way State Generators. FOCS 2024: 1178-1192 - [c43]Michael X. Cao, Rahul Jain, Marco Tomamichel:
Quantum Channel Simulation in Fidelity is No More Difficult than State Splitting. ISIT 2024: 1421-1425 - [c42]Itai Arad, Raz Firanko, Rahul Jain:
An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP. STOC 2024: 1311-1322 - [c41]Naresh Goud Boddu, Vipul Goyal, Rahul Jain, João Ribeiro:
Split-State Non-malleable Codes and Secret Sharing Schemes for Quantum Messages. TCC (2) 2024: 60-93 - [i68]Michael X. Cao, Rahul Jain, Marco Tomamichel:
Quantum Channel Simulation under Purified Distance is no more difficult than State Splitting. CoRR abs/2403.14416 (2024) - [i67]Rishabh Batra, Rahul Jain:
Commitments are equivalent to one-way state generators. CoRR abs/2404.03220 (2024) - [i66]Naresh Goud Boddu, Vipul Goyal, Rahul Jain, João Ribeiro:
Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages. IACR Cryptol. ePrint Arch. 2024: 335 (2024) - 2023
- [j38]Naresh Goud Boddu, Rahul Jain, Han-Hsuan Lin:
On relating one-way classical and quantum communication complexities. Quantum 7: 1010 (2023) - [j37]Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-Shot Quantum State Redistribution and Quantum Markov Chains. IEEE Trans. Inf. Theory 69(9): 5788-5804 (2023) - [c40]Sayantan Chakraborty, Rahul Jain, Pranab Sen:
One-Shot Non-Catalytic Distributed Purity Distillation. Allerton 2023: 1-8 - [i65]Naresh Goud Boddu, Vipul Goyal, Rahul Jain, João Ribeiro:
Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages. CoRR abs/2308.06466 (2023) - [i64]Rishabh Batra, Naresh Goud Boddu, Rahul Jain:
Quantum secure non-malleable randomness encoder and its applications. CoRR abs/2308.07340 (2023) - [i63]Itai Arad, Raz Firanko, Rahul Jain:
Area law for the maximally mixed ground state in degenerate 1D gapped systems. CoRR abs/2310.19028 (2023) - 2022
- [i62]Naresh Goud Boddu, Rahul Jain:
Quantum secure non-malleable-codes in the split-state model. CoRR abs/2202.13354 (2022) - 2021
- [c39]Rahul Jain, Srijita Kundu:
A Direct Product Theorem for One-Way Quantum Communication. CCC 2021: 27:1-27:28 - [c38]Rahul Jain, Srijita Kundu:
A direct product theorem for quantum communication complexity with applications to device-independent QKD. FOCS 2021: 1285-1295 - [c37]Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-Shot Quantum State Redistribution and Quantum Markov Chains. ISIT 2021: 130-135 - [c36]Rahul Jain:
Chain-Rules for Channel Capacity. ISIT 2021: 262-267 - [i61]Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-shot quantum state redistribution and quantum Markov chains. CoRR abs/2104.08753 (2021) - [i60]Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski:
Quantum Measurement Adversary. CoRR abs/2106.02766 (2021) - [i59]Rahul Jain, Srijita Kundu:
A direct product theorem for quantum communication complexity with applications to device-independent QKD. CoRR abs/2106.04299 (2021) - [i58]Naresh Goud Boddu, Rahul Jain, Han-Hsuan Lin:
On relating one-way classical and quantum communication complexities. CoRR abs/2107.11623 (2021) - [i57]Naresh Goud Boddu, Rahul Jain, Upendra Kapshikar:
Quantum secure non-malleable-extractors. CoRR abs/2109.03097 (2021) - [i56]Rahul Jain, Srijita Kundu:
A direct product theorem for quantum communication complexity with applications to device-independent QKD. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j36]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64(1): 101-119 (2020) - [j35]Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier Rodríguez Fonollosa:
One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information. IEEE Trans. Inf. Theory 66(4): 2141-2164 (2020) - [j34]Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel:
Partially Smoothed Information Measures. IEEE Trans. Inf. Theory 66(8): 5022-5036 (2020) - [j33]Rahul Jain, Carl A. Miller, Yaoyun Shi:
Parallel Device-Independent Quantum Key Distribution. IEEE Trans. Inf. Theory 66(9): 5567-5584 (2020) - [j32]Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain:
Noisy Quantum State Redistribution With Promise and the Alpha-Bit. IEEE Trans. Inf. Theory 66(12): 7772-7786 (2020) - [i55]Rahul Jain, Srijita Kundu:
A Direct Product Theorem for One-Way Quantum Communication. CoRR abs/2008.08963 (2020) - [i54]Rahul Jain, Srijita Kundu:
A Direct Product Theorem for One-Way Quantum Communication. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j31]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Building Blocks for Communication Over Noisy Quantum Networks. IEEE Trans. Inf. Theory 65(2): 1287-1306 (2019) - [j30]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel. IEEE Trans. Inf. Theory 65(4): 2623-2636 (2019) - [j29]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction. IEEE Trans. Inf. Theory 65(9): 5905-5924 (2019) - [c35]Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel:
Second-Order Characterizations via Partial Smoothing. ISIT 2019: 937-941 - 2018
- [j28]Mika Göös, Rahul Jain, Thomas Watson:
Extension Complexity of Independent Set Polytopes. SIAM J. Comput. 47(1): 241-269 (2018) - [j27]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A One-Shot Achievability Result for Quantum State Redistribution. IEEE Trans. Inf. Theory 64(3): 1425-1435 (2018) - [j26]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Generalized Quantum Slepian-Wolf. IEEE Trans. Inf. Theory 64(3): 1436-1453 (2018) - [c34]Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CSR 2018: 207-219 - [c33]Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier R. Fonollosa:
One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels. ISIT 2018: 296-300 - [c32]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Building Blocks for Communication Over Noisy Quantum Nerworks. ISIT 2018: 1789-1793 - [c31]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum Channel. ISIT 2018: 1794-1798 - [i53]Anurag Anshu, Mario Berta, Rahul Jain, Marco Tomamichel:
Partially smoothed information measures. CoRR abs/1807.05630 (2018) - [i52]Farzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain, Javier R. Fonollosa:
One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information. CoRR abs/1809.07104 (2018) - 2017
- [j25]Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta:
Information-theoretic approximations of the nonnegative rank. Comput. Complex. 26(1): 147-197 (2017) - [j24]Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang:
Multipartite Quantum Correlation and Communication Complexities. Comput. Complex. 26(1): 199-228 (2017) - [j23]Rahul Jain, Sanjay Jain, Frank Stephan:
Special issue on the conference Theory and Applications of Models of Computation. Inf. Comput. 256: 148 (2017) - [c30]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating Quantum Communication and Approximate Rank. CCC 2017: 24:1-24:33 - [c29]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13 - [c28]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Achievability bounds on quantum state redistribution using convex split and position based decoding. ITW 2017: 474-478 - [c27]Supratik Chakraborty, Ashutosh Gupta, Rahul Jain:
Matching Multiplications in Bit-Vector Formulas. VMCAI 2017: 131-150 - [i51]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach. CoRR abs/1702.01940 (2017) - [i50]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution. CoRR abs/1702.02396 (2017) - [i49]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Measurement compression with quantum side information using shared randomness. CoRR abs/1703.02342 (2017) - [i48]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A generalized quantum Slepian-Wolf. CoRR abs/1703.09961 (2017) - [i47]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. CoRR abs/1706.00335 (2017) - [i46]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A hypothesis testing approach for communication over entanglement assisted compound quantum channel. CoRR abs/1706.08286 (2017) - [i45]Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A unified approach to source and message compression. CoRR abs/1707.03619 (2017) - [i44]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CoRR abs/1708.00822 (2017) - [i43]Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i42]Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay:
Lifting randomized query complexity to randomized communication complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i41]Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j22]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica 76(3): 720-748 (2016) - [j21]Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao:
New One Shot Quantum Protocols With Application to Communication Complexity. IEEE Trans. Inf. Theory 62(12): 7566-7577 (2016) - [j20]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy Does Not Separate Information and Communication Complexity. ACM Trans. Comput. Theory 9(1): 4:1-4:15 (2016) - [c26]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564 - [c25]Mika Göös, Rahul Jain, Thomas Watson:
Extension Complexity of Independent Set Polytopes. FOCS 2016: 565-572 - [c24]Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Partition Bound Is Quadratically Tight for Product Distributions. ICALP 2016: 135:1-135:13 - [r2]Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain, Priyanka Mukhopadhyay:
Teleportation of Quantum States. Encyclopedia of Algorithms 2016: 2205-2209 - [i40]Mika Göös, Rahul Jain, Thomas Watson:
Extension Complexity of Independent Set Polytopes. CoRR abs/1604.07062 (2016) - [i39]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. CoRR abs/1605.01142 (2016) - [i38]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating quantum communication and approximate rank. CoRR abs/1611.05754 (2016) - [i37]Supratik Chakraborty, Ashutosh Gupta, Rahul Jain:
Matching Multiplications in Bit-Vector Formulas. CoRR abs/1611.10146 (2016) - [i36]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i35]Mika Göös, Rahul Jain, Thomas Watson:
Extension Complexity of Independent Set Polytopes. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j19]Rahul Jain:
New Strong Direct Product Results in Communication Complexity. J. ACM 62(3): 20:1-20:27 (2015) - [c23]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy Does not Separate Information and Communication Complexity. ICALP (1) 2015: 506-516 - [e1]Rahul Jain, Sanjay Jain, Frank Stephan:
Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings. Lecture Notes in Computer Science 9076, Springer 2015, ISBN 978-3-319-17141-8 [contents] - [i34]Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. CoRR abs/1512.01968 (2015) - [i33]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy does not separate Information and Communication Complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - [i32]Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j18]Rahul Jain, Ashwin Nayak:
The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited. IEEE Trans. Inf. Theory 60(10): 6646-6668 (2014) - [c22]Nathanaël François, Rahul Jain, Frédéric Magniez:
Unidirectional Input/Output Streaming Complexity of Reversal and Sorting. APPROX-RANDOM 2014: 654-668 - [c21]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions. CCC 2014: 209-216 - [i31]Rahul Jain, Troy Lee, Nisheeth K. Vishnoi:
A quadratically tight partition bound for classical communication complexity and query complexity. CoRR abs/1401.4512 (2014) - [i30]Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao:
A new operational interpretation of relative entropy and trace distance between quantum states. CoRR abs/1404.1366 (2014) - [i29]Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang:
Approximate and Multipartite Quantum Correlation (Communication) Complexity. CoRR abs/1405.6015 (2014) - [i28]Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain:
Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution. CoRR abs/1410.3031 (2014) - 2013
- [j17]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States. IEEE Trans. Inf. Theory 59(8): 5171-5178 (2013) - [c20]Prahladh Harsha, Rahul Jain:
A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound. FSTTCS 2013: 141-152 - [c19]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Efficient protocols of generating bipartite classical distributions and quantum states. SODA 2013: 1503-1512 - [i27]Prahladh Harsha, Rahul Jain:
A strong direct product theorem for the tribes function via the smooth-rectangle bound. CoRR abs/1302.0275 (2013) - [i26]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A parallel repetition theorem for entangled two-player one-round games under product distributions. CoRR abs/1311.6309 (2013) - [i25]Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta:
Information-theoretic approximations of the nonnegative rank. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j16]Rahul Jain:
Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation. J. Cryptol. 25(1): 1-13 (2012) - [j15]Rahul Jain, Ashwin Nayak:
Short Proofs of the Quantum Substate Theorem. IEEE Trans. Inf. Theory 58(6): 3664-3669 (2012) - [j14]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. Theory Comput. 8(1): 375-400 (2012) - [c18]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity. FOCS 2012: 167-176 - [i24]Rahul Jain, Attila Pereszlényi, Penghui Yao:
A direct product theorem for bounded-round public-coin randomized communication complexity. CoRR abs/1201.1666 (2012) - [i23]Rahul Jain, Penghui Yao:
A parallel approximation algorithm for mixed packing and covering semidefinite programs. CoRR abs/1201.6090 (2012) - [i22]Rahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang:
Correlation/Communication complexity of generating bipartite states. CoRR abs/1203.1153 (2012) - [i21]Rahul Jain, Penghui Yao:
A strong direct product theorem in terms of the smooth rectangle bound. CoRR abs/1209.0263 (2012) - 2011
- [j13]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. J. ACM 58(6): 30:1-30:27 (2011) - [j12]Rahul Jain, Shengyu Zhang:
The Influence Lower Bound Via Query Elimination. Theory Comput. 7(1): 147-153 (2011) - [c17]Rahul Jain, Penghui Yao:
A Parallel Approximation Algorithm for Positive Semidefinite Programming. FOCS 2011: 463-471 - [i20]Rahul Jain, Shengyu Zhang:
The influence lower bound via query elimination. CoRR abs/1102.4699 (2011) - [i19]Rahul Jain, Ashwin Nayak:
A short proof of the Quantum Substate Theorem. CoRR abs/1103.6067 (2011) - [i18]Rahul Jain, Penghui Yao:
A Parallel Approximation Algorithm for Positive Semidefinite Programming. CoRR abs/1104.2502 (2011) - [i17]Rahul Jain:
New strong direct product results in communication complexity. Electron. Colloquium Comput. Complex. TR11 (2011) - [i16]Rahul Jain, Shengyu Zhang:
The influence lower bound via query elimination. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j11]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. Commun. ACM 53(12): 102-109 (2010) - [j10]Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. 110(20): 893-897 (2010) - [j9]Rahul Jain, Ashwin Nayak, Yi Su:
A separation between divergence and Holevo information for ensembles. Math. Struct. Comput. Sci. 20(5): 977-993 (2010) - [j8]Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The communication complexity of correlation. IEEE Trans. Inf. Theory 56(1): 438-449 (2010) - [c16]Rahul Jain, Hartmut Klauck:
The Partition Bound for Classical Communication Complexity and Query Complexity. CCC 2010: 247-258 - [c15]Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON 2010: 54-59 - [c14]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. ICS 2010: 470-481 - [c13]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. STOC 2010: 573-582 - [i15]Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity. CoRR abs/1004.0105 (2010) - [i14]Rahul Jain, Ashwin Nayak:
The space complexity of recognizing well-parenthesized expressions. CoRR abs/1004.3165 (2010) - [i13]Rahul Jain:
Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity. CoRR abs/1010.0522 (2010) - [i12]Rahul Jain:
A strong direct product theorem for two-way public coin communication complexity. CoRR abs/1010.0846 (2010) - [i11]Rahul Jain, Ashwin Nayak:
The space complexity of recognizing well-parenthesized expressions. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j7]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56(6): 33:1-33:32 (2009) - [j6]Rahul Jain, Alexandra Kolla, Gatis Midrijanis, Ben W. Reichardt:
On parallel composition of zero-knowledge proofs with black-box quantum simulators. Quantum Inf. Comput. 9(5&6): 513-532 (2009) - [j5]Richard Cleve, Dmitry Gavinsky, Rahul Jain:
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Quantum Inf. Comput. 9(7&8): 648-656 (2009) - [j4]Rahul Jain, Shengyu Zhang:
New bounds on classical and quantum one-way communication complexity. Theor. Comput. Sci. 410(26): 2463-2477 (2009) - [c12]Rahul Jain, John Watrous:
Parallel Approximation of Non-interactive Zero-sum Quantum Games. CCC 2009: 243-253 - [c11]Rahul Jain, Hartmut Klauck:
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. CCC 2009: 369-378 - [c10]Rahul Jain, Sarvagya Upadhyay, John Watrous:
Two-Message Quantum Interactive Proofs Are in PSPACE. FOCS 2009: 534-543 - [i10]Rahul Jain, Hartmut Klauck:
New Results in the Simultaneous Message Passing Model. CoRR abs/0902.3056 (2009) - [i9]Rahul Jain, Sarvagya Upadhyay, John Watrous:
Two-message quantum interactive proofs are in PSPACE. CoRR abs/0905.1300 (2009) - [i8]Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas. CoRR abs/0908.4453 (2009) - [i7]Rahul Jain, Hartmut Klauck:
The Partition Bound for Classical Communication Complexity and Query Complexity. CoRR abs/0910.4266 (2009) - 2008
- [j3]Rahul Jain:
New Binding-Concealing Trade-Offs for Quantum String Commitment. J. Cryptol. 21(4): 579-592 (2008) - [c9]Rahul Jain, Hartmut Klauck, Ashwin Nayak:
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC 2008: 599-608 - [c8]Rahul Jain, Ashwin Nayak, Yi Su:
A Separation between Divergence and Holevo Information for Ensembles. TAMC 2008: 526-541 - [r1]Rahul Jain:
Teleportation of Quantum States. Encyclopedia of Algorithms 2008 - [i6]Rahul Jain, Shengyu Zhang:
New bounds on classical and quantum one-way communication complexity. CoRR abs/0802.4101 (2008) - [i5]Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan:
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity. CoRR abs/0807.1267 (2008) - 2007
- [c7]Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The Communication Complexity of Correlation. CCC 2007: 10-23 - [i4]Rahul Jain, Hartmut Klauck, Ashwin Nayak:
Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Rahul Jain:
Communication complexity of remote state preparation with entanglement. Quantum Inf. Comput. 6(4): 461-464 (2006) - [i3]Rahul Jain:
Towards a classical proof of exponential lower bound for 2-probe smooth codes. CoRR abs/cs/0607042 (2006) - [i2]Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan:
The communication complexity of correlation. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j1]Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Satyanarayana V. Lokam, Jaikumar Radhakrishnan:
Lower bounds for adaptive locally decodable codes. Random Struct. Algorithms 27(3): 358-378 (2005) - [c6]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
Prior Entanglement, Message Compression and Privacy in Quantum Communication. CCC 2005: 285-296 - 2003
- [c5]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS 2003: 220-229 - [c4]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP 2003: 300-315 - [i1]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
A direct sum theorem in communication complexity via message compression. CoRR cs.CC/0304020 (2003) - 2002
- [c3]Amit Deshpande, Rahul Jain, Telikepalli Kavitha, Jaikumar Radhakrishnan, Satyanarayana V. Lokam:
Better Lower Bounds for Locally Decodable Codes. CCC 2002: 184-193 - [c2]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States. FOCS 2002: 429-438 - [c1]Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen:
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS 2002: 218-229
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
