Efficient implementations of the quantum Fourier transform

dc.contributor.authorSuter, Dieter
dc.contributor.authorDorai, Kavita
dc.date.accessioned2008-06-02T09:43:40Z
dc.date.available2008-06-02T09:43:40Z
dc.date.issued2005-06
dc.description.abstractThe 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.en
dc.identifier.citationDorai, 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.de
dc.identifier.doi10.1142/S0219749905000967
dc.identifier.urihttp://hdl.handle.net/2003/25387
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-2457
dc.identifier.urlhttp://dx.doi.org/10.1142/S0219749905000967
dc.language.isoende
dc.publisherWorld Scientificen
dc.rightsCopyright World Scientific Publishing Companyen
dc.subject.ddc530
dc.titleEfficient implementations of the quantum Fourier transformen
dc.title.alternativean experimental perspectiveen
dc.typeTextde
dc.type.publicationtypearticlede
dcterms.accessRightsrestricted
eldorado.identifier.urlhttp://e3.physik.tu-dortmund.de/~suter/eprints/QFT.pdf

Files

License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.11 KB
Format:
Item-specific license agreed upon to submission
Description: