Author:
Ambainis Andris,de Wolf Ronald
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley-Interscience, 1992.
2. L. Alonso, E. M. Reingold, and R. Schott. The average-case complexity of determining the majority. SIAM Journal on Computing, 26(1):1–14, 1997.
3. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. In Proceedings of 39th FOCS, pages 352–361, 1998. http://xxx.lanl.gov/abs/quant-ph/9802049 .
4. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5):1510–1523, 1997. quant-ph/9701001.
5. M. Boyer, G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte der Physik, 46(4–5):493–505, 1998. Earlier version in Physcomp’96. quant-ph/9605034.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Beyond Quadratic Speedups in Quantum Attacks on Symmetric Schemes;Advances in Cryptology – EUROCRYPT 2022;2022
2. Quantum Queries on Permutations;Descriptional Complexity of Formal Systems;2015
3. Quantum Queries on Permutations with a Promise;Implementation and Application of Automata;2009