On the Irresistible Efficiency of Signal Processing Methods in Quantum Computing
<|reference_start|>On the Irresistible Efficiency of Signal Processing Methods in Quantum Computing: We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits for the Discrete Cosine and Sine Transforms, and for the Discrete Hartley transform. We show that at most O(log^2 N) elementary quantum gates are necessary to implement any of those transforms for input sequences of length N.<|reference_end|>
@article{klappenecker2001on,
    title={On the Irresistible Efficiency of Signal Processing Methods in Quantum
  Computing},
    author={Andreas Klappenecker (Texas A&M University), Martin Roetteler
  (Universitaet Karlsruhe)},
    journal={Proceedings of the First International Workshop on Spectral
  Techniques and Logic Design (SPECLOG 2000), pp. 483-497, 2000},
    year={2001},
    archivePrefix={arXiv},
    eprint={quant-ph/0111039},
    primaryClass={quant-ph cs.ET}
}