| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7788396 (Why is no real title available?)
| 2024-01-15 | Paper |
Quantum weak coin flipping
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Relative discrepancy does not separate information and communication complexity
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Information-theoretic lower bounds for quantum sorting
| 2019-02-18 | Paper |
Robust Bell inequalities from communication complexity
| 2017-07-19 | Paper |
A universal adiabatic quantum query algorithm
| 2017-07-12 | Paper |
Explicit relation between all lower bound techniques for quantum query complexity
| 2017-01-30 | Paper |
Quantum rejection sampling
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Quantum walks can find a marked element on any graph
Algorithmica | 2016-03-29 | Paper |
Lower bounds on information complexity via zero-communication protocols and applications
SIAM Journal on Computing | 2015-11-04 | Paper |
Relative discrepancy does not separate information and communication complexity
Automata, Languages, and Programming | 2015-10-27 | Paper |
Explicit relation between all lower bound techniques for quantum query complexity
| 2015-10-09 | Paper |
Quantum rejection sampling
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Classical and quantum partition bound and detector inefficiency
Automata, Languages, and Programming | 2013-08-12 | Paper |
A strong direct product theorem for quantum query complexity
Computational Complexity | 2013-07-19 | Paper |
Non-local box complexity and secure function evaluation
| 2012-10-24 | Paper |
The communication complexity of non-signaling distributions
| 2011-12-19 | Paper |
Noise resistance of adiabatic quantum computation using random matrix theory
Physical Review A | 2011-12-04 | Paper |
Non-local box complexity and secure function evaluation
| 2011-10-05 | Paper |
Quantum Algorithm for the Boolean Hidden Shift Problem
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Search via Quantum Walk
SIAM Journal on Computing | 2011-05-17 | Paper |
Anderson localization makes adiabatic quantum optimization fail
Proceedings of the National Academy of Sciences | 2011-02-12 | Paper |
Finding Is as Easy as Detecting for Quantum Walks
Automata, Languages and Programming | 2010-09-07 | Paper |
The Communication Complexity of Non-signaling Distributions
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Amortized Communication Complexity of Distributions
Automata, Languages and Programming | 2009-07-14 | Paper |
scientific article; zbMATH DE number 5485493 (Why is no real title available?)
| 2009-01-05 | Paper |
Exploring scalar quantum walks on Cayley graphs
| 2008-11-24 | Paper |
Optimal finite measurements and Gauss quadratures
Physics Letters. A | 2008-09-05 | Paper |
INFORMATION TRANSMISSION VIA ENTANGLED QUANTUM STATES IN GAUSSIAN CHANNELS WITH MEMORY
International Journal of Quantum Information | 2006-08-21 | Paper |
