Additional Metadata
THEME Life Sciences (theme 5), Logistics (theme 3)
Series quant-ph
Project Quantum Computing: algorithms, proofs and tradeoffs , Quantum computing: fault-tolerance, communication, and classical spin-offs
Note preprint van Proceedings of 30th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2013)
Citation
Ambainis, A, Backurs, A, Smotrovs, J, & de Wolf, R. M. (2012). Optimal quantum query bounds for almost all Boolean functions. quant-ph.