Discrete cosine transforms on quantum computers

A classical computer does not allow the calculation of a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and interference principles. In fact, we show that it is possible to realize the discrete cosine transforms and the discrete sine transforms of size N/spl times/N and types I, II, III and IV with as little as O(log/sup 2/N) operations on a quantum computer; whereas the known fast algorithms on a classical computer need O(N logN) operations.