# Pranab Sen

According to our database

Collaborative distances:

^{1}, Pranab Sen authored at least 33 papers between 2000 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Approximate Unitary n

^{2/3}-Designs Give Rise to Quantum Channels with Super Additive Classical Holevo Capacity.
Proceedings of the 14th Conference on the Theory of Quantum Computation, 2019

2018

A one-shot quantum joint typicality lemma.

CoRR, 2018

Inner bounds via simultaneous decoding in quantum network information theory.

CoRR, 2018

2016

Quantum Algorithm for the Discrete Logarithm Problem.

Encyclopedia of Algorithms, 2016

One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel.

IEEE Trans. Information Theory, 2016

2014

Hidden Translation and Translating Coset in Quantum Computing.

SIAM J. Comput., 2014

2013

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

J. ACM, 2013

2012

Classical Communication Over a Quantum Interference Channel.

IEEE Trans. Information Theory, 2012

Achieving the Han-Kobayashi inner bound for the quantum interference channel.

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

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

CoRR, 2011

Quantum interference channels.

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Limitations of quantum coset states for graph isomorphism.

J. ACM, 2010

2009

A property of quantum relative entropy with an application to privacy in quantum communication.

J. ACM, 2009

Quantum Testers for Hidden Group Properties.

Fundam. Inform., 2009

Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.

Algorithmica, 2009

2008

Quantum Algorithm for the Discrete Logarithm Problem.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Lower bounds for predecessor searching in the cell probe model.

J. Comput. Syst. Sci., 2008

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

CoRR, 2008

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Invertible quantum operations and perfect encryption of quantum states.

Quantum Information & Computation, 2007

2006

Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.

Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006

2005

On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group.

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Prior Entanglement, Message Compression and Privacy in Quantum Communication.

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2003

Hidden translation and orbit coset in quantum computing.

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

A Direct Sum Theorem in Communication Complexity via Message Compression.

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

Lower bounds for predecessor searching in the cell probe model.

Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002

The Quantum Complexity of Set Membership.

Algorithmica, 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

2001

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

CoRR, 2001

Lower Bounds in the Quantum Cell Probe Model.

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000