The Universality of the Quantum Fourier Transform in Forming the Basis of Quantum Computing Algorithms

Details The Universality of the Quantum Fourier Transform in Forming the Basis of Quantum Computing Algorithms The Universality of the Quantum Fourier Transform in Forming the Basis of Quantum Computing Algorithms

2000-07-31

arxiv.org/abs/quant-ph/0007122v1

Physics

Quantum Physics

12 pages, 3 figures, submitted to SIAM Journal on Computing

Scientific paper

The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the two-dimensional 1-qubit space. In this paper, we show that H and P(.) suffice to generate the unitary group U(2) and, consequently, through controlled-U operations and their concatenations, the entire unitary group U(2^n) on n-qubits can be generated. Since any quantum computing algorithm in an n-qubit quantum computer is based on operations by matrices in U(2^n), in this sense we have the universality of the QFT.

Affiliated with

Also associated with

No associations

Rating

The Universality of the Quantum Fourier Transform in Forming the Basis of Quantum Computing Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Universality of the Quantum Fourier Transform in Forming the Basis of Quantum Computing Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Universality of the Quantum Fourier Transform in Forming the Basis of Quantum Computing Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302021