NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (22)

quant-ph2018

A quantum Johnson-Lindenstrauss lemma via unitary t-designs

Pranab Sen

cs.DM2001

Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem

Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan

cs.CC2003

Lower bounds for predecessor searching in the cell probe model

Pranab Sen, S. Venkatesh

quant-ph2001

Lower bounds in the quantum cell probe model

Pranab Sen, S. Venkatesh

quant-ph2017

One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma

Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Ahmad Warsi

quant-ph2002

Quantum testers for hidden group properties

Katalin Friedl, Frederic Magniez, Miklos Santha +1

quant-ph2006

Invertible Quantum Operations and Perfect Encryption of Quantum States

Ashwin Nayak, Pranab Sen

cs.IT2015

One-shot Marton inner bound for classical-quantum broadcast channel

Jaikumar Radhakrishnan, Pranab Sen, Naqueeb Warsi

quant-ph2001

The Quantum Complexity of Set Membership

Jaikumar Radhakrishnan, Pranab Sen, S. Venkatesh

quant-ph2007

A theorem about relative entropy of quantum states with an application to privacy in quantum communication

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

quant-ph2005

Random measurement bases, quantum state distinction and applications to the hidden subgroup problem

Pranab Sen

quant-ph2019

Efficiently estimating average fidelity of a quantum logic gate using few classical random bits

Aditya Nema, Pranab Sen

quant-ph2018

Efficient quantum tensor product expanders and unitary t-designs via the zigzag product

Pranab Sen

cs.DC2008

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan

cs.CC2003

A direct sum theorem in communication complexity via message compression

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

quant-ph2003

A lower bound for bounded round quantum communication complexity of set disjointness

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

quant-ph2013

From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking

Omar Fawzi, Patrick Hayden, Pranab Sen

quant-ph2012

Classical communication over a quantum interference channel

Omar Fawzi, Patrick Hayden, Ivan Savov +2

quant-ph2005

On divergence, relative entropy and the substate property

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

quant-ph2011

Quantum interference channels

Ivan Savov, Omar Fawzi, Mark M. Wilde +2

quant-ph2011

Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding

Pranab Sen

quant-ph2005

A note on the power of quantum fingerprinting

Alexander Golynski, Pranab Sen