Quantum algorithms: Entanglement-enhanced information processing

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 356, Issue 1743, 1998, Pages 1769-1782

  Ekert, Artur ^a   Jozsa, Richard ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF PLYMOUTH   (United Kingdom)

Author keywords

Abelian groups; Algorithms; Fast fourier transform; Fourier transform; Periodicity determination; Quantum computational speed up

Indexed keywords

EID: 3042911492     PISSN: 1364503X     EISSN: None     Source Type: Journal    
DOI: 10.1098/rsta.1998.0248     Document Type: Article

References (22)

1. Bernstein, E. & Vazirani, U. 1993 Proc. 25th A. Symp. on the Theory of Computing, pp. 11-20. New York: ACM.
2. Brassard, G. & Hoyer, P. 1997 An exact polynomial-time algorithm for Simon's problem. quant-ph/9704027.
3. Cleve, R., Ekert, A., Macchiavello, C. & Mosca, M. 1998 Proc. R. Soc. Lond. A 454, 339-354.
4. Cooley, J. W. & Tukey, J. W. 1965 Math. Comp. 19, 297.
5. Cover, T. & Thomas, J. 1991 Elements of information theory. New York: Wiley.
6. Deutsch, D. 1985 Proc. R. Soc. Lond. A 400, 97.
7. Deutsch, D. & Jozsa, R. 1992 Proc. R. Soc. Lond. A 439, 553-558.
8. Ekert, A. & Jozsa, R. 1996 Rev. Mod. Phys. 68, 733.
9. Feynman, R. P. 1982 Int. J. Theor. Phys. 21, 467.
10. Fraleigh, J. B. 1994 A first course in abstract algebra, 5th edn. Reading, MA: Addison-Wesley.
11. Fuchs, C. & Peres, A. 1996 Phys. Rev. A 53, 2038-2045.
12. Fulton, W. & Harris, J. 1991 Representation theory: a first course, ch. 1, 2. New York: Springer.
13. Gauss, C. F. 1886 Theoria interpolations methodo nova tractata. Gauss' collected works vol. 3.
14. Grover, L. 1996 Proc. 28th A. Symp. on the Theory of Computing, pp. 212-219. New York: ACM.
15. Holevo, A. S. 1973 Probl. Inf. Transm. 9, 177.
16. Jozsa, R. 1998a Entanglement and quantum computation. In The geometric universe (ed. S. Huggett, L. Mason, K. P. Tod, S. T. Tsou & N. M. J. Woodhouse), pp. 369-379. Oxford University Press.
17. Jozsa, R. 1998b Quantum algorithms and the Fourier transform. Proc. R. Soc. Lond. A 454, 323-337.
18. Kitaev, A. 1995 Quantum measurements and the Abelian stabiliser problem. quant-ph/9511026.
19. Maslen, D. K. & Rockmore, D. N. 1995 Generalised FFTs: a survey of some recent results. In Proc. DIMACS Workshop on Groups and Computation (ed. L. Finkelstein & W. Kantor). DIMACS Series in Disc. Math. and Comp. Sci., vol. 28, pp. 183-238.
20. Papadimitriou, C. H. 1994 Computational complexity Reading, MA: Addison-Wesley.
21. Shor, P. 1994 Proc. 35th A. Symp. on the Foundations of Computer Science, p. 124. Los Alamitos, CA: IEEE Computer Society.
22. Simon, D. 1994 Proc. 35th A. Symp. on the Foundations of Computer Science, p. 116. Los Alamitos, CA: IEEE Computer Society.