52 search results - page 2 / 11 » Fast parallel circuits for the quantum Fourier transform |
ICS
2000
Tsinghua U.
13 years 11 months ago
2000
Tsinghua U.
SPAA
2000
ACM
14 years 2 days ago
2000
ACM
CORR
2000
Springer
13 years 7 months ago
2000
Springer
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 ...
PACT
2009
Springer
14 years 2 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...