Authors: Suter, Dieter
Dorai, Kavita
Title: Efficient implementations of the quantum Fourier transform
Other Titles: an experimental perspective
Language (ISO): en
Abstract: 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.
URI: http://hdl.handle.net/2003/25387
http://dx.doi.org/10.17877/DE290R-2457
Publishers Link: http://e3.physik.tu-dortmund.de/~suter/eprints/QFT.pdf
Issue Date: 2005-06
Provenance: World Scientific
URL: http://dx.doi.org/10.1142/S0219749905000967
Citation: Dorai, Kavita; Suter, Dieter: Efficient implementations of the quantum Fourier transform : an experimental perspective. In: International Journal of Quantum Information Nr. 2, Jg. 3(2005), S. 413-424.
Appears in Collections:Suter, Dieter Prof. Dr.

Files in This Item:
There are no files associated with this item.


This item is protected by original copyright



All resources in the repository are protected by copyright.