Abelian Hidden Subgroup Problem
Voronoi Diagrams 5 A 2. Cheung K, Mosca M (2001) Decomposing finite Abelian groups. Quantum Inf Comput 1(2):26 32 3. Childs AM, Ivanyos G (2014) Quantum computation of discrete logarithms in semigroups. J Math Cryptol 8(4):405 416 4. Childs AM, Jao D, Soukharev V (2010) Constructing elliptic curve isogenies in quantum subexponential time. preprint. arXiv:1012.4019 5. Cleve R, Ekert A, Macchiavello C, Mosca M (1998) Quantum algorithms revisited. Proc R Soc Lond A 454:339 354 6. Deutsch D (1985) Quantum theory, the ChurchTuring principle and the universal quantum computer. Proc R Soc Lond A 400:97 117 7. Deutsch D, Jozsa R (1992) Rapid solutions of problems by quantum computation. Proc R Soc Lond Ser A 439:553 558 8. Ettinger M, Hoyer P, Knill E (2004) The quantum query complexity of the hidden subgroup problem is polynomial. Inf Process Lett 91:43 48 9. Friedl K, Ivanyos G, Santha M (2005) Efficient testing of groups. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC'05) Baltimore, pp 157 166 10. Grigoriev D (1997) Testing shift equivalence of polynomials by deterministic, probabilistic and quantum machines. Theor Comput Sci 180: 217 228 11. Hoyer P (1999) Conjugated operators in quantum algorithms. Phys Rev A 59(5):3280 3289 12. Kaye P, Laflamme R, Mosca M (2007) An introduction to quantum computation. Oxford University Press, Oxford, UK 13. Kedlaya KS (2006) Quantum computation of zeta functions of curves. Comput Complex 15:1 19 14. Kitaev A (1995) Quantum measurements and the Abelian stabilizer problem. quant ph/9511026 15. Kitaev A (1996) Quantum measurements and the Abelian stabilizer problem. In: Electronic Colloquium on Computational Complexity (ECCC) vol 3. http:/eccc.hpi web.de/report/1996/003/ 16. Kitaev A. Yu (1997) Quantum computations: algorithms and error correction. Russ Math Surv 52(6):1191 1249 17. Mosca M, Ekert A (1998) The hidden subgroup problem and eigenvalue estimation on a quantum computer. In: Proceedings 1st NASA International Conference on Quantum Computing Quantum Communications, Palm Springs. Lecture notes in computer science, vol 1509. Springer, Berlin, pp 174 188 18. Shor P (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS'94) Santa Fe, pp 124 134 19. Shor P (1997) Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26:1484 1509 20. Simon D (1994) On the power of quantum computation. In: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science (FOCS'94) Santa Fe, pp 116 123 21. Simon D (1997) On the power of quantum computation. SIAM J Comput 26:1474 1483 22. Watrous J (2000) Quantum algorithms for solvable groups. In: Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC'00) Portland, pp 60 67 23. Vazirani U (1997) Berkeley lecture notes. Fall. Lecture 8. http:/www.cs.berkeley.edu/~vazirani/qc.html Abstract Voronoi DiagramsVoronoi Diagrams Rolf Klein Institute for Computer Science, University of Bonn, Bonn, Germany
Encyclopedia of Algorithms