Scaling and better approximating quantum fourier transform by higher radices

IEEE Transactions on Computers

Volumn 56, Issue 2, 2007, Pages 202-207

  Zilic, Zelkjo ^a   Radecka, Katarzyna ^b  

^a MCGILL UNIVERSITY   (Canada)

^b Dept of Electrical and Computer Engineering   (Canada)

Author keywords

Fourier transform; Multivalued logic circuits; Multivariable systems; Quantum computing; Walsh functions

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FOURIER TRANSFORMS; LOGIC CIRCUITS; MULTIVARIABLE SYSTEMS; QUANTUM EFFICIENCY; WALSH TRANSFORMS;

QUANTUM ALGORITHM; QUANTUM COMPUTING; QUANTUM FOURIER TRANSFORM;

QUANTUM THEORY;

EID: 33846036154     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2007.35     Document Type: Article

References (18)

1. T. Baba, "Development of Quantum Functional Devices for Multiple-Valued Logic Circuits," Proc. Int'l Symp. Multiple-Valued Logic, pp. 2-9, 1999.
2. I.L. Chuang, N. Gershenfeld, and M. Kubinec, "Experimental Implementation of Fast Quantum Searching," Physical Rev. Letters, vol. 80, no. 15, pp. 3408-3411, 1998.
3. R. Cleve and J. Watrous, "Fast Parallel Circuits for the Quantum Fourier Transform," Proc. IEEE Symp. Theory of Computing, pp. 526-535, 2000.
4. W. Cooley and J. Tukey, "An Algorithm for the Machine Calculation of Complex Fourier Series," Math. Computation, vol. 19, pp. 297-301, 1965.
5. D. Coppersmith, "An Approximate Fourier Transform Useful in Quantum Factoring," IBM Research Report RC 19642, 1994.
6. X. Deng, T. Hanyu, and M. Kameyama, "Quantum Device Model Based Super Pass Gate for Multiple-Valued Digital Systems," Proc. Int'l Symp. Multiple-Valued Logic, pp. 130-138, 1995.
7. D. Deutsch, "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer," Proc. Royal Soc. A, vol. 400, pp. 97-117, 1985.
8. N. Gershenfeld and I.L. Chuang, "Bulk Spin-Resonance Quantum Computing," Nature, vol. 404, pp. 350-356, 1997.
9. R. Duan, Z. Ji, Y. Feng, and M. Ying, "A Relation between Quantum Operations and the Quantum Fourier Transform," Quantum Physics Archive, arxiv:qUant-ph/0304145, Dec. 2003.
10. L. Hales, "Quantum Fourier Transform and Extensions of the Abelian Hidden Subgroup Problem," PhD dissertation, Univ. of California, Berkeley, 2002.
11. S.L. Hurst, D.M. Miller, and J. Muzio, Spectral Techniques in Digital Logic. Academic Press, 1985.
12. R. Jozsa, "Quantum Algorithms and the Fourier Transform," Proc. Royal Soc. London, vol. 454, pp. 323-337, 1997.
13. A. Muthukrishnan and C. Stroud Jr., "Quantum Fast Fourier Transform Using Multilevel Atoms," J. Modern Optics, vol. 49, pp. 2115-2127, 2002.
14. Z. Zilic and K. Radecka, "The Role of Super-Fast Transforms in Speeding up Quantum Computation," Proc. 32nd Int'l Symp. Multiple-Valued Logic, pp. 89-95, 2002.
15. M.L. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information. Cambridge Univ. Press, 2000.
16. P.W. Shor, "Polynomial Time Algorithms for Prime Factorization and Discrete Logarithm," SIAM J. Computing, vol. 26, no. 5, pp. 1484-1509, 1997.
17. M. Steffen, L.M.K. Vandersypen, and I.L. Chuang, "Toward Quantum Computation: A Five-Qubit Quantum Processor," IEEE Micro, vol. 27, no. 1, pp. 24-34, Jan./Feb. 2001.
18. A. Barenco, A. Ekert, K.-A. Suominen, and P. Torma, "Approximate Quantum Fourier Transform and Decoherence," Physics Rev. A, 1999.