Fast quantum fourier transforms for a class of non-abelian groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1719, Issue , 1999, Pages 148-159

  Püschel, Markus ^a   Rötteler, Martin ^b   Beth, Thomas ^b  

^a DREXEL UNIVERSITY   (United States)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; GROUP THEORY; QUANTUM COMPUTERS; QUANTUM OPTICS;

NON-ABELIAN GROUPS; ORDER 2; QUANTUM CIRCUIT; QUANTUM FOURIER TRANSFORMS; RECURSION FORMULAS; SOLVABLE GROUP; SPECIAL STRUCTURE;

FAST FOURIER TRANSFORMS;

EID: 52649099822     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46796-3_15     Document Type: Conference Paper

References (27)

1. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter. Elementary gates for quantum computation. Physical Review A, 52(5):3457-3467, November 1995.
2. R. Beals. Quantum computation of Fourier transforms over the symmetric groups. In Proc. STOC 97, El Paso, Texas, 1997.
3. T. Beth. Verfahren der Schnellen Fouriertransformation. Teubner, 1984.
4. T. Beth. On the computational complexity of the general discrete Fourier transform. Theoretical Computer Science, 51:331-339, 1987.
5. M. Clausen. Fast generalized Fourier transforms. Theoretical Computer Science, 67:55-63, 1989.
6. M. Clausen and U. Baum. Fast Fourier Transforms. BI-Verlag, 1993.
7. James W. Cooley and John W. Tukey. An Algorithm for the Machine Calculation of Complex Fourier Series. Mathematics of Computation, 19:297-301, 1965.
8. D. Coppersmith. An Approximate Fourier Transform Useful for Quantum Factoring. Technical Report RC 19642, IBM Research Division, 1994.
9. W.C. Curtis and I. Reiner. Methods of Representation Theory, volume 1. Interscience, 1981.
10. P. Diaconis and D. Rockmore. Efficient computation of the Fourier transform on finite groups. Amer. Math. Soc., 3(2):297-332, 1990.
11. S. Egner. Zur Algorithmischen Zerlegungstheorie Linearer Transformationen mit Symmetrie. PhD thesis, Universität Karlsruhe, Informatik, 1997.
12. S. Egner and M. Puschel. AREP - A Package for Constructive Representation Theory and Fast Signal Transforms. GAP share package, 1998. http://avalon.ira.uka.de/home/pueschel/arep/arep.html.
13. A. Fijany and C. P. Williams. Quantum Wavelet Transfoms: Fast Algorithms and Complete Circuits. In Proc. NASA conference QCQC 98, LNCS vol. 1509, 1998.
14. The GAP Team, Lehrstuhl D fur Mathematik, RWTH Aachen, Germany and School of Mathematical and Computational Sciences, U. St. Andrews, Scotland. GAP - Groups, Algorithms, and Programming, Version 4, 1997.
15. M. Grassl, W. Geiselmann, and T. Beth. Quantum Reed-Solomon Codes. In Proc. of the AAECC-13 (this volume), 1999.
16. P. Høyer. Efficient Quantum Transforms. LANL preprint quant-ph/9702028, February 1997.
17. B. Huppert. Endliche Gruppen, volume I. Springer, 1983.
18. A. Y. Kitaev. Quantum Measurements and the Abelian Stabilizer Problem. LANL preprint quant-ph/9511026, November 1995.
19. D. Maslen and D. Rockmore. Generalized FFTs - A survey of some recent results. In Proceedings of IMACS Workshop in Groups and Computation, volume 28, pages 182-238, 1995.
20. T. Minkwitz. Algorithmensynthese fur lineare Systeme mit Symmetrie. PhD thesis, Universitat Karlsruhe, Informatik, 1993.
21. T. Minkwitz. Extension of Irreducible Representations. AAECC, 7:391-399, 1996.
22. C. Moore and M. Nilsson. Some notes on parallel quantum computation. LANL preprint quant-ph/9804034, April 1998.
23. M. Puschel. Konstruktive Darstellungstheorie und Algorithmengenerierung. PhD thesis, Universitat Karlsruhe, Informatik, 1998. Translated in [24].
24. M. Puschel. Constructive representation theory and fast signal transforms. Technical Report Drexel-MCS-1999-1, Drexel University, Philadelphia, 1999. Translation of [23].
25. D. Rockmore. Some applications of generalized FFT's. In Proceedings of DIMACS Workshop in Groups and Computation, volume 28, pages 329-370, 1995.
26. J. P. Serre. Linear Representations of Finite Groups. Springer, 1977.
27. P. W. Shor. Algorithms for Quantum Computation: Discrete Logarithm and Factoring. In Proc. FOCS 94, pages 124-134. IEEE Computer Society Press, 1994.