Abstract
We represent and analyze two important quantumalgorithms – Finding the hidden subgroup and Grover search. As theanalysis goes on, we mention some pieces of ``Fact'' and ``Folklore''associated to quantum computing.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beals R, Buhrman H, Cleve R, Mosca M and de Wolf R (1998) Quantum lower bounds by polynomials. Proceedings of the 39th IEEE Conference on Foundations of Computer Science, pp. 352-361
Bennett CH, Bernstein E, Brassard G and Vazirani UV (1997) Strengths and weaknesses of quantum computation. SIAM Journal of Computing 26(5): 1510-1523
Grover LK (1996) A fast quantum mechanical algorithm for database search. Proceedings of STOC, pp. 212-219
Hirvensalo M (2001) Quantum Computing. Springer
Shor PW (1994) Algorithms for quantum computation: Discrete log and factoring. Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, pp. 20-22
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hirvensalo, M. Quantum computing – Facts and folklore. Natural Computing 1, 135–155 (2002). https://doi.org/10.1023/A:1015065426649
Issue Date:
DOI: https://doi.org/10.1023/A:1015065426649