{
  "annotation_id": "7a2a5d1a-caa5-40b9-aadd-77f089dff67b",
  "date_created": "2026-03-02T18:02:12.850000Z",
  "date_modified": "2026-03-02T18:02:12.850000Z",
  "file_hash": "420815e66d80fdf4d87d1a5ee31e34c50cc0976f63c0b03692d3dbd986723999",
  "private": false,
  "record": {
    "abstract": "With a combination of the quantum repeater and the cluster state approaches,\nwe show that efficient quantum computation can be constructed even if all the\nentangling quantum gates only succeed with an arbitrarily small probability\n$p$. The required computational overhead scales efficiently both with $1/p$ and\n$n$, where $n$ is the number of qubits in the computation. This approach\nprovides an efficient way to combat noise in a class of quantum computation\nimplementation schemes, where the dominant noise leads to probabilistic\nsignaled errors with an error probability $1-p$ far beyond any threshold\nrequirement.",
    "arxiv_id": "quant-ph/0502120",
    "authors": [
      "L. -M. Duan",
      "R. Raussendorf"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.95.080503",
    "journal_ref": "Phys. Rev. Lett. 95, 080503 (2005).",
    "title": "Efficient quantum computation with probabilistic quantum gates",
    "url": "https://arxiv.org/abs/quant-ph/0502120"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c4641df6-a706-4017-9816-4942dc85300a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}