Generic quantum Fourier transforms

ACM Transactions on Algorithms

Volumn 2, Issue 4, 2006, Pages 707-723

  Moore, Cristopher ^a,d   Rockmore, Daniel ^b   Russell, Alexander ^c  

^a UNIVERSITY OF NEW MEXICO   (United States)

^b DARTMOUTH COLLEGE   (United States)

^c UNIVERSITY OF CONNECTICUT   (United States)

^d MSC01 1070   (United States)

Author keywords

Group theory; Quantum computation

Indexed keywords

GROUP THEORY; QUANTUM COMPUTATION; QUANTUM FOURIER TRANSFORM (QFT);

ALGORITHMS; COMPUTATION THEORY; FOURIER TRANSFORMS;

QUANTUM THEORY;

EID: 33846646884     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1198513.1198525     Document Type: Conference Paper

References (27)

1. BARENCO, A., BENNETT, C. H., CLEVE, R., DIVINCENZO, D. P., MARGOLUS, N., SHOR, P., SLEATOR, T., SMOLIN, J., AND WEINFURTER, H. 1995. Elementary gates for quantum computation. Phys. Rev. A 52, 3457-3467.
2. BEALS, R. 1997. Quantum Computation of Fourier transforms over symmetric groups. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (El Paso, TX, May 4-6). ACM, New York, 48-53.
3. BETH, T. 1987. On the computational complexity of the general discrete Fourier transform. Theoret. Comput. Sci. 51, 3, 331-339.
4. CLAUSEN, M. 1989. Fast generalized Fourier transforms. Theoret. Comput. Sci. 67, 1, 55-63.
5. CLIFFORD, A. 1937. Representations induced in an invariant subgroup. Ann. Math. 38, 533-550.
6. COOLEY, J. W., AND TUKEY, J. W. 1965. An algorithm for the machine calculating of complex Fourier series. Math. Comput. 19, 297-301.
7. COPPERSMITH, D. 1994. An approximate Fourier transform useful in quantum factoring. Tech. Rep. RC19642, IBM. Quantum Physics e-Print Archive, quant-ph/0201067.
8. DIACONIS, P., AND ROCKMORE, D. 1990. Efficient computation of the Fourier transform on finite groups. J. Amer. Math. Soc. 3, 2, 297-332.
9. GRIGNI, M., SCHULMAN, L., VAZIRANI, M., AND VAZIRANI, U. 2001. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (Hersonissos, Crete, Greece, July 6-8). ACM, New York, 68-74.
10. HALES, L., AND HALLOREN, S. 2000. An improved quantum Fourier transform algorithm and applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, Nov. 12-14). IEEE Computer Society Press, Silver Spring, MD, 515-525. (IEEE Computer Society Order Number PR00850.)
11. HALLGREN, S., RUSSELL, A., AND TA-S HMA, A. 2000. Normal subgroup reconstruction and quantum computation using group representations. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Portland, OR, May 21-23). ACM Press, New York, 627-635.
12. HARARY, E 1969. Graph Theory. Addison-Wesley, Reading, MA.
13. HØYER, P. 1997. Efficient quantum transforms. Tech. Rep. quant-ph/9702028, Quantum Physics e-Print Archive.
14. IVANYOS, G., MAGNIEZ, F., AND SANTHA, M. 2001. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (Heraklion, Crete Island, Greece). ACM, New York, 263-270.
15. KERBER, A. 1971 and 1975. Representations of Permutation Groups I, II. Lecture Notes in Mathematics, vol. 240 and 495. Springer-Verlag, Berlin, Germany.
16. KITAEV, A. 1995. Quantum measurements and the abelian stabilizer problem. Tech. Rep. quantph/9511026, Quantum Physics e-Print Archive.
17. MASLEN, D., AND ROCKMORE, D. 1997. Separation of variables and the computation of Fourier transforms on finite groups, I. J. Amer. Math Soc. 10, 1, 169-214.
18. MASLEN, D., AND ROCKMORE, D. 2001. The Cooley-Tukey FFT and group theory. Notices Amer. Math. Soc. 48, 10, 1151-1160.
19. MASLEN, D. K., AND ROCKMORE, D. N. 1995. Adapted diameters and the efficient computation of Fourier transforms on finite groups. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA). ACM, New York, 253-262.
20. MOORE, C., ROCKMORE, D., RUSSELL, A., AND SCHULMAN, L. 2004. The value of basis selection in Fourier sampling: Hidden subgroup problems in affine groups. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 1106-1115.
21. PÜSCHEL, M., RÖTTELER, M., AND BETH, T. 1999. Fast quantum Fourier transforms for a class of non-Abelian groups. In Proceedings of Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (AAECC-13). Lecture Notes in Computer Science, vol. 1719. Springer-Verlag, New York, 148-159.
22. ROCKMORE, D. 1990. Fast Fourier analysis for Abelian group extensions. Adv. Appl. Math. 11, 164-204.
23. ROCKMORE, D. 1995. Fast Fourier transforms for wreath products. J. Appl. Comput. Harmon. Anal. 2, 279-292.
24. SERRE, J.-P. 1977. Linear Representations of Finite Groups. Springer-Verlag, New York.
25. SHOR, P. W. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5 (Oct.), 1484-1509.
26. SIMON, B. 1996. Representations of Finite and Compact Groups. Graduate Studies in Mathematics, vol. 10. American Mathematical Society.
27. WATROUS, J. 2001. Quantum algorithms for solvable groups. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (Hersonissos, Crete, Greece, July 6-8). ACM, New York, 60-67.