Sciweavers

5 search results - page 1 / 1
» Quantum Wavelet Transforms: Fast Algorithms and Complete Cir...
Sort
View
QCQC
1998
Springer
173views Communications» more  QCQC 1998»
13 years 9 months ago
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
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. However, in classi...
Amir Fijany, Colin P. Williams
FOCS
2000
IEEE
13 years 9 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 5 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
CVPR
2008
IEEE
14 years 7 months ago
An efficient algorithm for compressed MR imaging using total variation and wavelets
Compressed sensing, an emerging multidisciplinary field involving mathematics, probability, optimization, and signal processing, focuses on reconstructing an unknown signal from a...
Shiqian Ma, Wotao Yin, Yin Zhang, Amit Chakraborty
ICIP
2009
IEEE
13 years 3 months ago
A multi-modal automatic image registration technique based on complex wavelets
Image registration is considered one of the most fundamental and crucial pre-processing tasks in digital imaging. This paper describes a fast multimodal automatic image registrati...
Milad Ghantous, Soumik Ghosh, Magdy Bayoumi