Scaling and Better Approximating Quantum Fourier Transform by Higher Radices

Author

Zilic, Zeljko ; Radecka, Katarzyna

Author_Institution

McGill Univ., Montreal, Que.

Volume

56

Issue

2

fYear

2007

Firstpage

202

Lastpage

207

Abstract

Quantum Fourier transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can be built is limited, while many quantum technologies are inherently three (or more) valued, we consider extending the reach of the realistic quantum systems by building a QFT over ternary quantum digits. Compared to traditional binary QFT, the q-valued transform improves approximation properties and increases the state space by a factor of (q/2)ⁿ. Further, we use nonbinary QFT derivation to generalize and improve the approximation bounds for QFT

Keywords

Fourier transforms; quantum computing; Walsh functions; higher radices; multivalued logic circuits; multivariable systems; nonbinary QFT derivation; q-valued transform; quantum Fourier transform approximation; quantum Fourier transform scaling; quantum computing; ternary quantum digits; Circuits; Fourier transforms; MIMO; Multivalued logic; Quantum computing; Quantum dots; Quantum mechanics; Space technology; State-space methods; Vectors; Fourier transform; Walsh functions.; multivalued logic circuits; multivariable systems; quantum computing;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.2007.35

Filename

4042680