Paper
22 May 2002 Quantum computing and a unified approach to fast unitary transforms
Sos S. Agaian, Andreas Klappenecker
Author Affiliations +
Proceedings Volume 4667, Image Processing: Algorithms and Systems; (2002) https://doi.org/10.1117/12.467967
Event: Electronic Imaging, 2002, San Jose, California, United States
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.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sos S. Agaian and Andreas Klappenecker "Quantum computing and a unified approach to fast unitary transforms", Proc. SPIE 4667, Image Processing: Algorithms and Systems, (22 May 2002); https://doi.org/10.1117/12.467967
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Transform theory

Quantum communications

Quantum computing

Fourier transforms

Signal processing

Quantum information

Matrices

RELATED CONTENT

Study of the effect of quantum noise on the accuracy...
Proceedings of SPIE (January 30 2022)
Quantum models of Parrondo's games
Proceedings of SPIE (November 13 2002)
Quantum simulator review
Proceedings of SPIE (April 25 2007)

Back to Top