| Hidden translation and orbit coset in quantum computing K Friedl, G Ivanyos, F Magniez, M Santha, P Sen Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 1-9, 2003 | 152 | 2003 |
| Limitations of quantum coset states for graph isomorphism S Hallgren, C Moore, M Rötteler, A Russell, P Sen Journal of the ACM (JACM) 57 (6), 1-33, 2010 | 141 | 2010 |
| A direct sum theorem in communication complexity via message compression R Jain, J Radhakrishnan, P Sen International Colloquium on Automata, Languages, and Programming, 300-315, 2003 | 135 | 2003 |
| Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states R Jain, J Radhakrishnan, P Sen The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002 | 92 | 2002 |
| Achieving the Han-Kobayashi inner bound for the quantum interference channel P Sen 2012 IEEE International Symposium on Information Theory Proceedings, 736-740, 2012 | 87* | 2012 |
| A lower bound for the bounded round quantum communication complexity of set disjointness R Jain, J Radhakrishnan 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 86 | 2003 |
| Lower bounds for predecessor searching in the cell probe model P Sen 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003 | 84 | 2003 |
| Prior entanglement, message compression and privacy in quantum communication R Jain, J Radhakrishnan, P Sen 20th Annual IEEE Conference on Computational Complexity (CCC'05), 285-296, 2005 | 79 | 2005 |
| From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking O Fawzi, P Hayden, P Sen Journal of the ACM (JACM) 60 (6), 1-61, 2013 | 73 | 2013 |
| A property of quantum relative entropy with an application to privacy in quantum communication R Jain, J Radhakrishnan, P Sen Journal of the ACM (JACM) 56 (6), 1-32, 2009 | 72* | 2009 |
| Classical communication over a quantum interference channel O Fawzi, P Hayden, I Savov, P Sen, MM Wilde IEEE Transactions on Information Theory 58 (6), 3670-3691, 2012 | 63* | 2012 |
| Invertible quantum operations and perfect encryption of quantum states A Nayak, P Sen arXiv preprint quant-ph/0605041, 2006 | 61 | 2006 |
| Random measurement bases, quantum state distinction and applications to the hidden subgroup problem P Sen 21st Annual IEEE Conference on Computational Complexity (CCC'06), 14 pp.-287, 2006 | 52 | 2006 |
| One-shot Marton inner bound for classical-quantum broadcast channel J Radhakrishnan, P Sen, N Warsi IEEE Transactions on Information Theory 62 (5), 2836-2848, 2016 | 41 | 2016 |
| Unions, intersections and a one-shot quantum joint typicality lemma P Sen Sādhanā 46 (1), 57, 2021 | 38 | 2021 |
| Optimal direct sum and privacy trade-off results for quantum and classical communication complexity R Jain, P Sen, J Radhakrishnan arXiv preprint arXiv:0807.1267, 2008 | 37 | 2008 |
| Random measurement bases, quantum state distinction and applications to the hidden subgroup problem J Radhakrishnan, M Rötteler, P Sen Algorithmica 55 (3), 490-516, 2009 | 36 | 2009 |
| Hidden translation and orbit coset in quantum computing K Friedl, G Ivanyos, F Magniez, M Santha, P Sen Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 1-9, 2003 | 36* | 2003 |
| On the power of random bases in Fourier sampling: Hidden subgroup problem in the Heisenberg group J Radhakrishnan, M Rötteler, P Sen International Colloquium on Automata, Languages, and Programming, 1399-1411, 2005 | 34 | 2005 |
| Inner bounds via simultaneous decoding in quantum network information theory P Sen Sādhanā 46 (1), 18, 2021 | 25 | 2021 |
Jaikumar RadhakrishnanProfessor at Tata Institute of Fundamental Research, MumbaiVerified email at tifr.res.in
