Pranab Sen

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 16

Top Topics

Probability Mass

Information Theory

Quantum Computing

Top Venues

IEEE Trans. Inf. Theory

Publications

Aditya Nema, Pranab Sen
High Probability Decoupling via Approximate Unitary Designs and Efficient Relative Thermalization. IEEE Trans. Inf. Theory 70 (4) (2024)
Sayantan Chakraborty, Rahul Jain, Pranab Sen
One-Shot Non-Catalytic Distributed Purity Distillation. Allerton (2023)
Sayantan Chakraborty, Arun Padakandla, Pranab Sen
Centralised multi link measurement compression with side information. ISIT (2022)
Aditya Nema, Pranab Sen
Approximate Unitary Designs Give Rise to Quantum Channels With Super Additive Classical Holevo Capacity. IEEE Trans. Inf. Theory 68 (9) (2022)
Sayantan Chakraborty, Arun Padakandla, Pranab Sen
Centralised multi link measurement compression with side information. CoRR (2022)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting. CoRR (2021)
Pranab Sen
An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary t-designs. Quantum Inf. Process. 20 (9) (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC. ISIT (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting. ISIT (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
One-shot multi-sender decoupling and simultaneous decoding for the quantum MAC. CoRR (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
One-shot inner bounds for sending private classical information over a quantum MAC. ITW (2021)
Sayantan Chakraborty, Aditya Nema, Pranab Sen
One-shot inner bounds for sending private classical information over a quantum MAC. CoRR (2021)
Aditya Nema, Pranab Sen
-Designs Give Rise to Quantum Channels with Super Additive Classical Holevo Capacity. TQC (2019)
Pranab Sen
A one-shot quantum joint typicality lemma. CoRR (2018)
Pranab Sen
Inner bounds via simultaneous decoding in quantum network information theory. CoRR (2018)
Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Ahmad Warsi
One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel. IEEE Trans. Inf. Theory 62 (5) (2016)
Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
Hidden Translation and Translating Coset in Quantum Computing. SIAM J. Comput. 43 (1) (2014)
Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Warsi
One-shot Marton inner bound for classical-quantum broadcast channel. CoRR (2014)
Omar Fawzi, Patrick M. Hayden, Pranab Sen
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking. J. ACM 60 (6) (2013)
Omar Fawzi, Patrick M. Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde
Classical Communication Over a Quantum Interference Channel. IEEE Trans. Inf. Theory 58 (6) (2012)
Pranab Sen
Achieving the Han-Kobayashi inner bound for the quantum interference channel. ISIT (2012)
Omar Fawzi, Patrick M. Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde
Quantum interference channels. Allerton (2011)
Ivan Savov, Omar Fawzi, Mark M. Wilde, Pranab Sen, Patrick M. Hayden
Quantum interference channels. CoRR (2011)
Omar Fawzi, Patrick M. Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde
Classical communication over a quantum interference channel CoRR (2011)
Pranab Sen
Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding CoRR (2011)
Omar Fawzi, Patrick M. Hayden, Pranab Sen
From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking. STOC (2011)
Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen
Limitations of quantum coset states for graph isomorphism. J. ACM 57 (6) (2010)
Omar Fawzi, Patrick M. Hayden, Pranab Sen
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking CoRR (2010)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56 (6) (2009)
Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. Algorithmica 55 (3) (2009)
Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen
Quantum Testers for Hidden Group Properties. Fundam. Informaticae 91 (2) (2009)
Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity CoRR (2008)
Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. ICALP (2) (2008)
Pranab Sen, Srinivasan Venkatesh
Lower bounds for predecessor searching in the cell probe model. J. Comput. Syst. Sci. 74 (3) (2008)
Ashwin Nayak, Pranab Sen
Invertible quantum operations and perfect encryption of quantum states. Quantum Inf. Comput. 7 (1) (2007)
Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen
Limitations of quantum coset states for graph isomorphism. STOC (2006)
Pranab Sen
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem. Computational Complexity Conference (2006)
Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen
On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group. ICALP (2005)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
Prior Entanglement, Message Compression and Privacy in Quantum Communication. Computational Complexity Conference (2005)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A Direct Sum Theorem in Communication Complexity via Message Compression. ICALP (2003)
Pranab Sen
Lower bounds for predecessor searching in the cell probe model. Computational Complexity Conference (2003)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A direct sum theorem in communication complexity via message compression CoRR (2003)
Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
Hidden translation and orbit coset in quantum computing. STOC (2003)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. FOCS (2003)
Pranab Sen, Srinivasan Venkatesh
Lower bounds for predecessor searching in the cell probe model CoRR (2003)
Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen
Quantum Testers for Hidden Group Properties. MFCS (2003)
Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
The Quantum Complexity of Set Membership. Algorithmica 34 (4) (2002)
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version. FSTTCS (2002)
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)
Pranab Sen, Srinivasan Venkatesh
Lower bounds in the quantum cell probe model CoRR (2001)
Pranab Sen, Srinivasan Venkatesh
Lower Bounds in the Quantum Cell Probe Model. ICALP (2001)
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem CoRR (2001)
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
(X) and Extensions of the Graham-Pollack Theorem. FSTTCS (2000)
Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
The Quantum Complexity of Set Membership. FOCS (2000)
Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
The Quantum Complexity of Set Membership CoRR (2000)