This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scaling and Better Approximating Quantum Fourier Transform by Higher Radices
February 2007 (vol. 56 no. 2)
pp. 202-207
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently be built is limited, while many quantum technologies are inherently three (or more) valued, we consider extending the reach of the realistic quantum systems by building a QFT over ternary quantum digits. Compared to traditional binary QFT, the q{\hbox{-}}\rm valued transform improves approximation properties and increases the state space by a factor of (q/2)^{n}. Further, we use nonbinary QFT derivation to generalize and improve the approximation bounds for QFT.
Index Terms:
Fourier transform, quantum computing, multivalued logic circuits, multivariable systems, Walsh functions.
Citation:
Zeljko Zilic, Katarzyna Radecka, "Scaling and Better Approximating Quantum Fourier Transform by Higher Radices," IEEE Transactions on Computers, vol. 56, no. 2, pp. 202-207, Feb. 2007, doi:10.1109/TC.2007.35
Usage of this product signifies your acceptance of the Terms of Use.