{
  "annotation_id": "b4873512-d3c4-46f8-8c42-ca8365501ac7",
  "date_created": "2026-03-02T18:02:38.140000Z",
  "date_modified": "2026-03-02T18:02:38.140000Z",
  "file_hash": "b5fda484b5629cd622d4cc8c8d41479605eb5372d160c16bfe4bd3cd1157bda6",
  "private": false,
  "record": {
    "abstract": "We discuss the advantages of using the approximate quantum Fourier transform\n(AQFT) in algorithms which involve periodicity estimations. We analyse quantum\nnetworks performing AQFT in the presence of decoherence and show that extensive\napproximations can be made before the accuracy of AQFT (as compared with\nregular quantum Fourier transform) is compromised. We show that for some\ncomputations an approximation may imply a better performance.",
    "arxiv_id": "quant-ph/9601018",
    "authors": [
      "Adriano Barenco",
      "Artur Ekert",
      "Kalle-Antti Suominen",
      "P\u00e4ivi T\u00f6rm\u00e4"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.54.139",
    "title": "Approximate Quantum Fourier Transform and Decoherence",
    "url": "https://arxiv.org/abs/quant-ph/9601018"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b4decbb1-0ae9-4598-9402-d9484f10bde1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}