{
  "annotation_id": "c8eaf8d7-d048-4374-b750-7031be2c4be8",
  "date_created": "2026-03-02T18:02:44.851000Z",
  "date_modified": "2026-03-02T18:02:44.851000Z",
  "file_hash": "4fbd3b93c76cbe30979e303a180fc2ef467fe1e37ab463807b6b254d5cc68c8a",
  "private": false,
  "record": {
    "abstract": "Entanglement of quantum variables is usually thought to be a prerequisite for\nobtaining quantum speed-ups of information processing tasks such as searching\ndatabases. This paper presents methods for quantum search that give a speed-up\nover classical methods, but that do not require entanglement. These methods\nrely instead on interference to provide a speed-up. Search without entanglement\ncomes at a cost: although they outperform analogous classical devices, the\nquantum devices that perform the search are not universal quantum computers and\nrequire exponentially greater overhead than a quantum computer that operates\nusing entanglement. Quantum search without entanglement is compared to\nclassical search using waves.",
    "arxiv_id": "quant-ph/9903057",
    "authors": [
      "Seth Lloyd"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.61.010301",
    "title": "Quantum search without entanglement",
    "url": "https://arxiv.org/abs/quant-ph/9903057"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "99bbfb81-56aa-4dc8-80d5-fdd9182ff222",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}