Share Email Print

Proceedings Paper

Quantum computing and a unified approach to fast unitary transforms
Author(s): Sos S. Agaian; Andreas Klappenecker
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-known in classical signal processing applications. We show how fast quantum algorithms can be derived for the discrete Fourier transform, the Walsh-Hadamard transform, the Slant transform, and the Hartley transform. All these algorithms use at most O(log2 N) operations to transform a state vector of a quantum computer of length N.

Paper Details

Date Published: 22 May 2002
PDF: 11 pages
Proc. SPIE 4667, Image Processing: Algorithms and Systems, (22 May 2002); doi: 10.1117/12.467967
Show Author Affiliations
Sos S. Agaian, City Univ. of New York and Univ. of Texas/San Antonio (United States)
Andreas Klappenecker, Texas A&M Univ. (United States)

Published in SPIE Proceedings Vol. 4667:
Image Processing: Algorithms and Systems
Edward R. Dougherty; Jaakko T. Astola; Karen O. Egiazarian, Editor(s)

© SPIE. Terms of Use
Back to Top