Discrete Cosine Transforms on Quantum Computers
<|reference_start|>Discrete Cosine Transforms on Quantum Computers: A classical computer does not allow to calculate 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 NxN and types I,II,III, and IV with as little as O(log^2 N) operations on a quantum computer, whereas the known fast algorithms on a classical computer need O(N log N) operations.<|reference_end|>
@article{klappenecker2001discrete,
    title={Discrete Cosine Transforms on Quantum Computers},
    author={Andreas Klappenecker (Texas A&M University), Martin Roetteler
  (Universitaet Karlsruhe)},
    journal={IEEE R8-EURASIP Symposium on Image and Signal Processing and
  Analysis, pp. 464-468, Pula, Croatia, 2001},
    year={2001},
    archivePrefix={arXiv},
    eprint={quant-ph/0111038},
    primaryClass={quant-ph cs.ET}
}