{
  "annotation_id": "19279df0-6fad-43b0-9480-fa8c7cf70b2c",
  "date_created": "2026-03-02T18:02:00.201000Z",
  "date_modified": "2026-03-02T18:02:00.201000Z",
  "file_hash": "df0da809641f4d61f2a109a2c8b87c084d9122d2264df127b7fbe24695031cfd",
  "private": false,
  "record": {
    "abstract": "We analyze the ground state entanglement in a quantum adiabatic evolution\nalgorithm designed to solve the NP-complete Exact Cover problem. The entropy of\nentanglement seems to obey linear and universal scaling at the point where the\nmass gap becomes small, suggesting that the system passes near a quantum phase\ntransition. Such a large scaling of entanglement suggests that the effective\nconnectivity of the system diverges as the number of qubits goes to infinity\nand that this algorithm cannot be efficiently simulated by classical means. On\nthe other hand, entanglement in Grover\u0027s algorithm is bounded by a constant.",
    "arxiv_id": "quant-ph/0308042",
    "authors": [
      "Jose Ignacio Latorre",
      "Roman Orus"
    ],
    "categories": [
      "quant-ph",
      "cond-mat"
    ],
    "doi": "10.1103/PhysRevA.69.062302",
    "journal_ref": "Physical Review A 69, 062302 (2004)",
    "title": "Adiabatic quantum computation and quantum phase transitions",
    "url": "https://arxiv.org/abs/quant-ph/0308042"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "dbd41214-55ce-4db4-8d79-d1d6ddaa2089",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}