Seguir
Pranab Sen
Pranab Sen
Professor, School of Technology and Computer Science, Tata Institute of Fundamental
Dirección de correo verificada de tifr.res.in - Página principal
Título
Citado por
Citado por
Año
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
1482003
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
1282010
A direct sum theorem in communication complexity via message compression
R Jain, J Radhakrishnan, P Sen
Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003
1152003
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
872002
A lower bound for the bounded round quantum communication complexity of set disjointness
R Jain, J Radhakrishnan, P Sen
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
852003
Lower bounds for predecessor searching in the cell probe model
P Sen
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings …, 2003
802003
Achieving the Han-Kobayashi inner bound for the quantum interference channel
P Sen
2012 IEEE International Symposium on Information Theory Proceedings, 736-740, 2012
75*2012
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
752005
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
70*2009
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
662013
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
56*2012
Invertible quantum operations and perfect encryption of quantum states
A Nayak, P Sen
arXiv preprint quant-ph/0605041, 2006
482006
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
442006
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
342008
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
322016
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
322009
Unions, intersections and a one-shot quantum joint typicality lemma
P Sen
Sādhanā 46 (1), 57, 2021
292021
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
29*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
282005
Quantum testers for hidden group properties
K Friedl, M Santha, F Magniez, P Sen
Fundamenta Informaticae 91 (2), 325-340, 2009
23*2009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20