{
  "annotation_id": "31f155fc-e0f3-45c4-8508-2d6cce6fa3e9",
  "date_created": "2026-03-02T18:01:46.124000Z",
  "date_modified": "2026-03-02T18:01:46.124000Z",
  "file_hash": "06eb5a50de7e9de5b6f9aac20589120240d0c4b6acff42952e6fbfeb51e8a7e3",
  "private": false,
  "record": {
    "abstract": "Suppose Alice wants to perform some computation that could be done quickly on\na quantum computer, but she cannot do universal quantum computation. Bob can do\nuniversal quantum computation and claims he is willing to help, but Alice wants\nto be sure that Bob cannot learn her input, the result of her calculation, or\nperhaps even the function she is trying to compute. We describe a simple,\nefficient protocol by which Bob can help Alice perform the computation, but\nthere is no way for him to learn anything about it. We also discuss techniques\nfor Alice to detect whether Bob is honestly helping her or if he is introducing\nerrors.",
    "arxiv_id": "quant-ph/0111046",
    "authors": [
      "Andrew M. Childs"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.26421/QIC5.6",
    "journal_ref": "Quantum Information and Computation 5, 456 (2005)",
    "title": "Secure assisted quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0111046"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "215331e6-4782-4e9b-ae96-ee04e449bc32",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}