{
  "annotation_id": "dab672cd-0cf7-4a6f-bb24-d98fa5fa6e40",
  "date_created": "2026-03-02T18:02:15.899000Z",
  "date_modified": "2026-03-02T18:02:15.899000Z",
  "file_hash": "1c3f11d9529fa4d46a06b6214b39fc6d9321fcecfc512c8db45007873dfef1d4",
  "private": false,
  "record": {
    "abstract": "We study a quantum small-world network with disorder and show that the system\nexhibits a delocalization transition. A quantum algorithm is built up which\nsimulates the evolution operator of the model in a polynomial number of gates\nfor exponential number of vertices in the network. The total computational gain\nis shown to depend on the parameters of the network and a larger than quadratic\nspeed-up can be reached.\n  We also investigate the robustness of the algorithm in presence of\nimperfections.",
    "arxiv_id": "quant-ph/0503188",
    "authors": [
      "O. Giraud",
      "B. Georgeot",
      "D. L. Shepelyansky"
    ],
    "categories": [
      "quant-ph",
      "cond-mat.dis-nn",
      "cond-mat.stat-mech",
      "nlin.AO"
    ],
    "doi": "10.1103/PhysRevE.72.036203",
    "journal_ref": "Phys. Rev. E 72, 036203 (2005)",
    "title": "Quantum computing of delocalization in small-world networks",
    "url": "https://arxiv.org/abs/quant-ph/0503188"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "feb88502-a4f8-4b33-95dd-786310741f75",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}