|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15 occurrences of 14 keywords
|
|
|
|
|
Results
Found 34 publication records. Showing 34 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Omar Fawzi, Patrick Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde |
Classical Communication Over a Quantum Interference Channel.  |
IEEE Transactions on Information Theory  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranab Sen |
Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Omar Fawzi, Patrick Hayden, Ivan Savov, Pranab Sen, Mark M. Wilde |
Classical communication over a quantum interference channel  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Omar Fawzi, Patrick Hayden, Pranab Sen |
From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking.  |
STOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen |
Limitations of quantum coset states for graph isomorphism.  |
J. ACM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Omar Fawzi, Patrick Hayden, Pranab Sen |
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Martin Rötteler, Pranab Sen |
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Random orthonormal measurement bases, Ensemble quantum state distinction, Hidden subgroup problem, Frobenius distance, Quantum Fourier transforms, Gel’fand pairs, Quantum algorithms |
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A property of quantum relative entropy with an application to privacy in quantum communication.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
quantum communication complexity, Privacy, quantum information theory |
| 1 | Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen |
Quantum Testers for Hidden Group Properties.  |
Fundam. Inform.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan |
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Pranab Sen, Srinivasan Venkatesh |
Lower bounds for predecessor searching in the cell probe model.  |
J. Comput. Syst. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranab Sen |
Quantum Algorithm for the Discrete Logarithm Problem.  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang |
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashwin Nayak, Pranab Sen |
Invertible quantum operations and perfect encryption of quantum states.  |
Quantum Information & Computation  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Pranab Sen |
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem.  |
IEEE Conference on Computational Complexity  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen |
Limitations of quantum coset states for graph isomorphism.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
hidden subgroup problem, graph isomorphism, quantum algorithms |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
Prior Entanglement, Message Compression and Privacy in Quantum Communication.  |
IEEE Conference on Computational Complexity  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A direct sum theorem in communication complexity via message compression  |
CoRR  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Pranab Sen, Srinivasan Venkatesh |
Lower bounds for predecessor searching in the cell probe model  |
CoRR  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A Direct Sum Theorem in Communication Complexity via Message Compression.  |
ICALP  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen |
Quantum Testers for Hidden Group Properties.  |
MFCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness.  |
FOCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranab Sen |
Lower bounds for predecessor searching in the cell probe model.  |
IEEE Conference on Computational Complexity  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen |
Hidden translation and orbit coset in quantum computing.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh |
The Quantum Complexity of Set Membership.  |
Algorithmica  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen |
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version.  |
FSTTCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan |
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem  |
CoRR  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Pranab Sen, Srinivasan Venkatesh |
Lower bounds in the quantum cell probe model  |
CoRR  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Pranab Sen, Srinivasan Venkatesh |
Lower Bounds in the Quantum Cell Probe Model.  |
ICALP  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh |
The Quantum Complexity of Set Membership  |
CoRR  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh |
The Quantum Complexity of Set Membership.  |
FOCS  |
2000 |
DBLP DOI BibTeX RDF |
quantum complexity, static set membership problem, bit table, quantum bit-probe model, black-box unitary transform, oracle calls, basis state superposition, space-probe tradeoff, computational complexity, query processing, lower bounds, quantum computing, upper bounds, linear algebra, linear algebra, set theory, probes, query answering, query algorithm |
| 1 | Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan |
Depth-3 Arithmetic Circuits for Sn2(X) and Extensions of the Graham-Pollack Theorem.  |
FSTTCS  |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #34 of 34 (100 per page; Change: )
|
|