| Publication | Date of Publication | Type |
|---|
Optimal lower bounds for quantum learning via information theory
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
One-shot quantum state redistribution and quantum Markov chains
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding
IEEE Transactions on Information Theory | 2024-03-21 | Paper |
Quantum distributed complexity of set disjointness on a line
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Online learning of quantum states
Journal of Statistical Mechanics: Theory and Experiment | 2021-03-16 | Paper |
Recognizing well-parenthesized expressions in the streaming model
SIAM Journal on Computing | 2020-05-31 | Paper |
Augmented index and quantum streaming algorithms for \textsc{Dyck}(2)
(available as arXiv preprint) | 2020-05-26 | Paper |
Noisy interactive quantum communication
SIAM Journal on Computing | 2019-09-02 | Paper |
Capacity approaching coding for low noise interactive quantum communication
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| On the hitting times of quantum versus random walks | 2019-05-06 | Paper |
Communication Complexity of One-Shot Remote State Preparation
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Short Proofs of the Quantum Substate Theorem
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
The quantum query complexity of approximating the median and related statistics
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Dense quantum coding and a lower bound for 1-way quantum automata
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Improved bounds for the randomized decision tree complexity of recursive majority
Random Structures & Algorithms | 2016-06-10 | Paper |
A search for quantum coin-flipping protocols using optimization techniques
Mathematical Programming. Series A. Series B | 2016-04-04 | Paper |
Dense quantum coding and quantum finite automata
Journal of the ACM | 2015-12-07 | Paper |
One-dimensional quantum walks
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
On the hitting times of quantum versus random walks
Algorithmica | 2012-04-26 | Paper |
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
Automata, Languages and Programming | 2011-07-06 | Paper |
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
Automata, Languages and Programming | 2011-07-06 | Paper |
Inverting a permutation is as hard as unordered search
Theory of Computing | 2011-05-24 | Paper |
Search via Quantum Walk
SIAM Journal on Computing | 2011-05-17 | Paper |
Search via Quantum Walk
SIAM Journal on Computing | 2011-05-17 | Paper |
A separation between divergence and Holevo information for ensembles
Mathematical Structures in Computer Science | 2010-12-01 | Paper |
On communication over an entanglement-assisted quantum channel
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
On communication over an entanglement-assisted quantum channel
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Weak coin flipping with small bias
Information Processing Letters | 2009-07-09 | Paper |
| scientific article; zbMATH DE number 5485493 (Why is no real title available?) | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485573 (Why is no real title available?) | 2009-01-05 | Paper |
Limits on the ability of quantum states to convey classical messages
Journal of the ACM | 2008-12-21 | Paper |
Interaction in Quantum Communication
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A Separation between Divergence and Holevo Information for Ensembles
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Approximate Randomization of Quantum States With Fewer Bits of Key
AIP Conference Proceedings | 2008-01-02 | Paper |
Quantum complexity of testing group commutativity
Algorithmica | 2007-08-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 1303607 (Why is no real title available?) | 1999-08-16 | Paper |
