AbstractThe quantum Fourier transform (QFT) is a key subroutine of quantum algorithms for factoring and simulation and is the heart of the hidden-subgroup problem, the solution of which is expected to lead to the development of new quantum algorithms. The QFT acts on the Hilbert space and alters the quantum mechanical phases and probability amplitudes. Unlike its classical counterpart its schematic representation and visualization are very dif.cult. The aim of this work is to develop a schematic representation and visualization of the QFT by running it on a quantum computer simulator which has been constructed in the framework of this research. Base states, superpositions of base states and entangled states are transformed and the corresponding schematic representations are presented. The visualization of the QFT presented here and the quantum computer simulator developed for this purpose may become a useful tool for introducing the QFT to students and researches without a strong background in quantum mechanics or Fourier analysis.
PACS: 03.67.-a, 03.67.Lx
[1]
Peter W. Shor,et al.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
,
1995,
SIAM Rev..
[2]
Seth Lloyd,et al.
Universal Quantum Simulators
,
1996,
Science.
[3]
Arthur O. Pittenger,et al.
An Introduction to Quantum Computing Algorithms
,
2000
.
[4]
David A. Meyer,et al.
Physical quantum algorithms
,
2002
.
[5]
E M Fortunato,et al.
Implementation of the quantum Fourier transform.
,
2001,
Physical review letters.
[6]
Jeffrey Yepez.
Quantum computation for physical modeling
,
2002
.
[7]
R. Jozsa,et al.
Quantum Computation and Shor's Factoring Algorithm
,
1996
.