Rahul Jain
Principal Investigator
Centre for Quantum Technologies
Professor
Department of Computer Science, School of Computing, National University of Singapore
S15-04-01
Rahul Jain has been promoted to full Professor from 1 January 2020. He was an Associate Professor at the Computer Science Department of the National University of Singapore (NUS) from July 2013 (Assistant Professor Nov 2008 – July 2013). He obtained his PhD from Tata Institute of Fundamental Research, Mumbai, India in 2003. He was a post doctoral researcher at the University of California at Berkeley, USA from 2004-2006 and at the Institute for Quantum Computing (IQC), University of Waterloo, Canada from 2006-2008. He obtained Bachelor’s degree (B-Tech) in Electrical and Electronics Engineering from Indian Institute of Technology, Mumbai (IIT-B), India in 1997. He is a Principle Investigator at the Centre for Quantum Technologies (CQT), Singapore from Nov. 2008.
Preprints & Publications
A direct product theorem for quantum communication complexity with applications to device-independent QKD
Quantum secure non-malleable randomness encoder and its applications
Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages
A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model
Area laws and tensor networks for maximally mixed ground states
Quantum Measurement Adversary
Quantum secure non-malleable-extractors
Quantum Channel Simulation under Purified Distance is no more difficult than State Splitting
Commitments are Equivalent to Statistically-Verifiable One-Way State Generators
Area law for the maximally mixed ground state in degenerate 1D gapped systems.
Quantum Secure Non-Malleable Codes in the Split-State Model
One-shot non-catalytic distributed purity distillation
One-shot quantum state redistribution and quantum Markov chains
Quantum secure non-malleable codes in the split-state model
On relating one-way classical and quantum communication complexities
A note on the partition bound for one-way classical communication complexity
Efficient methods for one-shot quantum communication
Matrix Multiplicative Weights Updates in Quantum Zero-Sum Games: Conservation Laws & Recurrence
Quantum decoupling via efficient `classical’ operations and the entanglement cost of one-shot quantum protocols
A Direct Product Theorem for One-Way Quantum Communication
Chain-rules for channel capacity
Parallel Device-Independent Quantum Key Distribution
Noisy quantum state redistribution with promise and the Alpha-bit
Partially smoothed information measures
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction
A hypothesis testing approach for communication over entanglement assisted compound quantum channel
Building blocks for communication over noisy quantum networks
On the near-optimality of one-shot classical communication over quantum channels
One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
A minimax approach to one-shot entropy inequalities
Second-Order Characterizations via Partial Smoothing
Extension Complexity of Independent Set Polytopes
A one-shot achievability result for quantum state redistribution
A generalized quantum Slepian-Wolf
Quadratically Tight Relations for Randomized Query Complexity
Quantifying resource in catalytic resource theory
Multipartite Quantum Correlation and Communication
Separating quantum communication and approximate rank
Quantum Communication Using Coherent Rejection Sampling
A Composition Theorem for Randomized Query Complexity
Separations in communication complexity using cheat sheets and information complexity
Information-theoretic approximations of the nonnegative rank
Partition bound is quadratically tight for product distributions
New One Shot Quantum Protocols With Application to Communication Complexity
New one-shot quantum protocols with application to communication complexity
New strong direct product results in communication complexity
Relative discrepancy does not separate information and communication complexity
Communication tasks with infinite quantum-classical separation
Conclusive Exclusion of Quantum States
The space complexity of recognizing well-parenthesized expressions in the streaming model: the Index function revisited
A parallel repetition theorem for entangled two-player one-round games under product distributions
Input/Output Streaming Complexity of Reversal and Sorting
A strong direct product theorem for the tribes function via the smooth-rectangle bound
Efficient protocols for generating bipartite classical distributions and quantum states
Resource requirements of private quantum channels and consequences for oblivious remote state preparation
A short proof of the Quantum Substate Theorem
A direct product theorem for bounded-round public-coin randomized communication complexity
Correlation/Communication complexity of generating bipartite states
On the power of a unique quantum witness
Short proofs of the quantum Substate Theorem
A Parallel Approximation Algorithm for Positive Semidefinite Programming
The influence lower bound via query elimination
Depth-Independent Lower bounds on Communication Complexity of Read-Once Boolean Functions
The Partition Bound for Classical Communication Complexity and Query Complexity
QIP = PSPACE
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
Two-message quantum interactive proofs are in PSPACE
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
Parallel approximation of non-interactive zero-sum quantum games
On parallel composition of zero-knowledge proofs with black-box quantum simulators
A new information-theoretic property about quantum states with an application to privacy in quantum communication
Entanglement-resistant two-prover interactive proof systems and non-adaptive private information retrieval systems
New bounds on classical and quantum one-way communication complexity
The communication complexity of correlation
Direct product theorems for classical communication complexity via subdistribution bounds
A separation between divergence and Holevo information for ensembles
New binding-concealing trade-offs for quantum string commitment
Communication complexity of remote state preparation with entanglement
Prior entanglement, message compression and privacy in quantum communication
A lower bound for bounded round quantum communication complexity of set disjointness
A direct sum theorem in communication complexity via message compression
Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states
Improved lower bounds for locally decodable codes
The quantum communication complexity of the pointer chasing problem: the bit version
A parallel approximation algorithm for mixed packing and covering semidefinite programs
A strong direct product theorem in terms of the smooth rectangle bound
A quadratically tight partition bound for classical communication complexity and query complexity
A unified approach to source and message compression
Quantum state redistribution with local coherence
Matrix Multiplicative Weights Updates in Quantum Zero-Sum Games: Conservation Laws & Recurrence
