{
  "id": "quant-ph/0211030",
  "version": "v1",
  "published": "2002-11-06T19:28:00.000Z",
  "updated": "2002-11-06T19:28:00.000Z",
  "title": "Efficient implementations of the Quantum Fourier Transform: an experimental perspective",
  "authors": [
    "Kavita Dorai",
    "Dieter Suter"
  ],
  "journal": "Intl. J. Qtm. Info. , Vol. 3, 413 (2005)",
  "categories": [
    "quant-ph"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2002-11-06T19:28:00.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum fourier transform",
      "efficient implementations",
      "experimental perspective",
      "two-qubit nmr quantum information processor",
      "standard quantum state tomography techniques"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2002quant.ph.11030D"
    }
  }
}