{
  "annotation_id": "1bb70329-e872-4e3e-bef7-98be8c23fbb6",
  "date_created": "2026-03-02T18:02:27.702000Z",
  "date_modified": "2026-03-02T18:02:27.702000Z",
  "file_hash": "496501efd2b892d46bfed9f978e098931e38c2019329db449da74df0a76d67e8",
  "private": false,
  "record": {
    "abstract": "We find that generic entanglement is physical, in the sense that it can be\ngenerated in polynomial time from two-qubit gates picked at random. We prove as\nthe main result that such a process generates the average entanglement of the\nuniform (Haar) measure in at most $O(N^3)$ steps for $N$ qubits. This is\ndespite an exponentially growing number of such gates being necessary for\ngenerating that measure fully on the state space. Numerics furthermore show a\nvariation cut-off allowing one to associate a specific time with the\nachievement of the uniform measure entanglement distribution. Various\nextensions of this work are discussed. The results are relevant to entanglement\ntheory and to protocols that assume generic entanglement can be achieved\nefficiently.",
    "arxiv_id": "quant-ph/0605126",
    "authors": [
      "R. Oliveira",
      "O. C. O. Dahlsten",
      "M. B. Plenio"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.98.130502",
    "journal_ref": "Phys. Rev. Lett. 98, 130502 (2007)",
    "title": "Efficient Generation of Generic Entanglement",
    "url": "https://arxiv.org/abs/quant-ph/0605126"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0c8ab347-d7c9-42f3-ad40-be42e6dc85fa",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}