Quantum algorithms a decade after Shor. (English) Zbl 1192.81049
Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 111, electronic only (2004).
MSC:
| 81P68 | Quantum computation |
| 68Q05 | Models of computation (Turing machines, etc.) (MSC2010) |
References:
| [1] | Ambainis. Quantum query algorithms and lower bounds, Trends in Logic, to appear. Also available from http://www. cs. berkeley. edu/ ambainis/ps/qs. ps. Surveys results in the field until 2001. |
| [2] | A. Ambainis. Polynomial degree vs. quantum query complexity. Proceedings of FOCS’03, pp. 230-239. |
| [3] | A. Ambainis. Quantum walk algorithm for element distinctness. arxiv e-print, http://www. arxiv. org/abs/quant-ph/0311001. |
| [4] | H. Buhrman, C. Durr, M. Heiligman, P. Hoyer, F. Magniez, M. Santha, R. de Wolf. Quantum algorithms for element distinctness. Proceedings of Complexity’01, pp. 131-137. |
| [5] | G. Brassard, P. Hoyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. Quantum computation and information (Washington, DC, 2000), volume 305 of Contemporary Mathematics, pages 53-74. AMS, 2002. · Zbl 1063.81024 |
| [6] | L. Grover. A fast quantum mechanical algorithm for database search. Proceedings of STOC’96, pp. 212-219. 10.1145/237814.237866 |
| [7] | F. Magniez, M. Santha, and M. Szegedy. Quantum algorithms for the triangle problem. arxiv e-print, http://www. arxiv. org/abs/quant-ph/0310134. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
