Efficient implementations of the Quantum Fourier Transform: an experimental perspective

Details Efficient implementations of the Quantum Fourier Transform: an experimental perspective Efficient implementations of the Quantum Fourier Transform: an experimental perspective

2002-11-06

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

Physics

Quantum Physics

Scientific paper

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits $n$. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

Affiliated with

Also associated with

No associations

Rating

Efficient implementations of the Quantum Fourier Transform: an experimental perspective 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 Efficient implementations of the Quantum Fourier Transform: an experimental perspective, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient implementations of the Quantum Fourier Transform: an experimental perspective will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-448566