| Publication | Date of Publication | Type |
|---|
| Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states | 2026-05-29 | Paper |
| The quantum complexity of set membership | 2026-05-08 | Paper |
Matrix Chernoff concentration bounds for multipartite soft covering and expander walks (available as arXiv preprint) | 2025-01-01 | Paper |
Classical Communication Over a Quantum Interference Channel IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A property of quantum relative entropy with an application to privacy in quantum communication Journal of the ACM | 2015-11-11 | Paper |
Limitations of quantum coset states for graph isomorphism Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Hidden translation and translating coset in quantum computing SIAM Journal on Computing | 2014-06-04 | Paper |
Hidden translation and translating coset in quantum computing SIAM Journal on Computing | 2014-06-04 | Paper |
From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking Journal of the ACM | 2014-02-17 | Paper |
From low-distortion norm embeddings to explicit uncertainty relations and efficient information locking Journal of the ACM | 2014-02-17 | Paper |
Limitations of quantum coset states for graph isomorphism Journal of the ACM | 2011-05-16 | Paper |
Hidden translation and orbit coset in quantum computing Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem Algorithmica | 2009-08-31 | Paper |
Quantum Testers for Hidden Group Properties Fundamenta Informaticae | 2009-06-23 | Paper |
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks Automata, Languages and Programming | 2008-08-19 | Paper |
Mathematical Foundations of Computer Science 2003 Lecture Notes in Computer Science | 2007-12-07 | Paper |
On the power of random bases in Fourier sampling: Hidden subgroup problem in the Heisenberg group Lecture Notes in Computer Science | 2006-01-10 | Paper |
Depth-3 arithmetic circuits for S_n^2(X) and extensions of the Graham-Pollack theorem Lecture Notes in Computer Science | 2004-08-04 | Paper |
Depth-3 arithmetic circuits for S_n^2(X) and extensions of the Graham-Pollack theorem Lecture Notes in Computer Science | 2004-08-04 | Paper |
A direct sum theorem in communication complexity via message compression Lecture Notes in Computer Science | 2004-02-08 | Paper |
The quantum communication complexity of the pointer chasing problem: The bit version Lecture Notes in Computer Science | 2003-07-28 | Paper |
The quantum complexity of set membership Algorithmica | 2003-05-04 | Paper |
Lower bounds in the quantum cell probe model Lecture Notes in Computer Science | 2002-06-12 | Paper |