dorsal/arxiv
View SchemaEfficient implementations of the Quantum Fourier Transform: an experimental perspective
| Authors | Kavita Dorai, Dieter Suter |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0211030 |
| URL | https://arxiv.org/abs/quant-ph/0211030 |
| Journal | Intl. J. Qtm. Info. , Vol. 3, 413 (2005) |
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.
{
"annotation_id": "a974023f-3b95-4765-9e0d-ee8d46dae164",
"date_created": "2026-03-02T18:01:56.443000Z",
"date_modified": "2026-03-02T18:01:56.443000Z",
"file_hash": "58bcaa631cc35a0ac9e47961044d51ff3d21e520f9fbc30ead98aaef909a528e",
"private": false,
"record": {
"abstract": "The Quantum Fourier transform (QFT) is a key ingredient in most quantum\nalgorithms. We have compared various spin-based quantum computing schemes to\nimplement the QFT from the point of view of their actual time-costs and the\naccuracy of the implementation. We focus here on an interesting decomposition\nof the QFT as a product of the non-selective Hadamard transformation followed\nby multiqubit gates corresponding to square- and higher-roots of controlled-NOT\ngates. This decomposition requires only O(n) operations and is thus linear in\nthe number of qubits $n$. The schemes were implemented on a two-qubit NMR\nquantum information processor and the resultant density matrices reconstructed\nusing standard quantum state tomography techniques. Their experimental\nfidelities have been measured and compared.",
"arxiv_id": "quant-ph/0211030",
"authors": [
"Kavita Dorai",
"Dieter Suter"
],
"categories": [
"quant-ph"
],
"journal_ref": "Intl. J. Qtm. Info. , Vol. 3, 413 (2005)",
"title": "Efficient implementations of the Quantum Fourier Transform: an experimental perspective",
"url": "https://arxiv.org/abs/quant-ph/0211030"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9d68383e-5810-478b-9064-c0530e29556e",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}