@inproceedings{faa80b6dac944afda301daccfa8449a2,
title = "Recent developments in quantum algorithms and complexity",
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].",
author = "Andris Ambainis",
year = "2014",
doi = "10.1007/978-3-319-09704-6\_1",
language = "English",
isbn = "9783319097039",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--4",
booktitle = "Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Proceedings",
address = "Germany",
note = "16th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2014 ; Conference date: 05-08-2014 Through 08-08-2014",
}