Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits

Fijany, A.; Williams, C. P.

dc.contributor.author	Fijany, A.	en_US
dc.contributor.author	Williams, C. P.	en_US
dc.date.accessioned	2004-09-25
dc.date.available	2004-09-25
dc.date.issued	1998-02-17	en_US
dc.identifier.citation	NASA Conference on Quantum Computing and Communication	en_US
dc.identifier.citation	Palm Springs, CA, U.S.A.	en_US
dc.identifier.clearanceno	98-1520	en_US
dc.identifier.uri	http://hdl.handle.net/2014/20528
dc.description.abstract	The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms.	en_US
dc.format.extent	1960027 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en_US
dc.subject.other	wavelet transforms quantum computing quantum algorithms and circuits image processing quantum circuts	en_US
dc.title	Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits	en_US