Abstract
We survey several recent developments in quantum algorithms and complexity: - Reichardt's characterization of quantum query algorithms via span programs [15]; - New bounds on the number of queries that are necessary for simulating a quantum algorithm that makes a very small number of queries [2]; - Exact quantum algorithms with superlinear advantage over the best classical algorithm [4]. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Ambainis, A. (2014). Recent developments in quantum algorithms and complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8614 LNCS, pp. 1–4). Springer Verlag. https://doi.org/10.1007/978-3-319-09704-6_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
