Rahul Jain
Orcid: 0000-0002-3649-6576Affiliations:
- National University of Singapore, Centre for Quantum Technologies (CQT), Singapore
- University of Waterloo, Computer Science Department, Institute for Quantum Computing, ON, Canada (2006 - 2008)
- University of California at Berkeley, CA, USA (2004 - 2006)
According to our database1,
Rahul Jain
authored at least 99 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
IEEE Trans. Inf. Theory, January, 2024
IACR Cryptol. ePrint Arch., 2024
Quantum Channel Simulation under Purified Distance is no more difficult than State Splitting.
CoRR, 2024
2023
IEEE Trans. Inf. Theory, September, 2023
Quantum, May, 2023
CoRR, 2023
Proceedings of the 59th Annual Allerton Conference on Communication, 2023
2022
2021
A direct product theorem for quantum communication complexity with applications to device-independent QKD.
Electron. Colloquium Comput. Complex., 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information.
IEEE Trans. Inf. Theory, 2020
IEEE Trans. Inf. Theory, 2020
Theory Comput. Syst., 2020
Electron. Colloquium Comput. Complex., 2020
2019
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction.
IEEE Trans. Inf. Theory, 2019
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel.
IEEE Trans. Inf. Theory, 2019
IEEE Trans. Inf. Theory, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
IEEE Trans. Inf. Theory, 2018
One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
2017
Inf. Comput., 2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
CoRR, 2017
One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach.
CoRR, 2017
Smooth min-max relative entropy based bounds for one-shot classical and quantum state redistribution.
CoRR, 2017
Comput. Complex., 2017
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017
Achievability bounds on quantum state redistribution using convex split and position based decoding.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017
Proceedings of the 32nd Computational Complexity Conference, 2017
2016
IEEE Trans. Inf. Theory, 2016
Electron. Colloquium Comput. Complex., 2016
Separations in communication complexity using cheat sheets and information complexity.
Electron. Colloquium Comput. Complex., 2016
A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity.
Algorithmica, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
2014
The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited.
IEEE Trans. Inf. Theory, 2014
CoRR, 2014
A quadratically tight partition bound for classical communication complexity and query complexity.
CoRR, 2014
A new operational interpretation of relative entropy and trace distance between quantum states.
CoRR, 2014
Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution.
CoRR, 2014
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions.
Proceedings of the IEEE 29th Conference on Computational Complexity, 2014
Proceedings of the Approximation, 2014
2013
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States.
IEEE Trans. Inf. Theory, 2013
A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013
2012
Resource Requirements of Private Quantum Channels and Consequences for Oblivious Remote State Preparation.
J. Cryptol., 2012
A parallel approximation algorithm for mixed packing and covering semidefinite programs
CoRR, 2012
A direct product theorem for bounded-round public-coin randomized communication complexity
CoRR, 2012
2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2010
Math. Struct. Comput. Sci., 2010
Optimal direct sum results for deterministic and randomized decision tree complexity.
Inf. Process. Lett., 2010
Electron. Colloquium Comput. Complex., 2010
CoRR, 2010
Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity
CoRR, 2010
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010
2009
Theor. Comput. Sci., 2009
Quantum Inf. Comput., 2009
Quantum Inf. Comput., 2009
A property of quantum relative entropy with an application to privacy in quantum communication.
J. ACM, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
CoRR, 2008
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
2007
Electron. Colloquium Comput. Complex., 2007
2006
Quantum Inf. Comput., 2006
Electron. Colloquium Comput. Complex., 2006
CoRR, 2006
2005
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005
2003
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
2002
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002
Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002