{
  "annotation_id": "2e3b704d-db1c-46dc-9b63-55331ced2419",
  "date_created": "2026-03-02T18:01:49.063000Z",
  "date_modified": "2026-03-02T18:01:49.063000Z",
  "file_hash": "6caf9ce4058943732c241fb99de52fae6bbe43ee8006a7851d61a30eaafcf650",
  "private": false,
  "record": {
    "abstract": "The scheduling problem consists of finding a common 1 in two remotely located\nN bit strings. Denote the number of 1s in the string with the fewer 1s by\nepsilon*N. Classically, it needs at least O(epsilon*N) bits of communication to\nfind the common 1 (ignoring logarithmic factors). The best known quantum\nalgorithm would require O(sqrt(N)) qubits of communication. This paper gives a\nmodified quantum algorithm to find the common 1 with only O(sqrt(epsilon*N))\nqubits of communication.",
    "arxiv_id": "quant-ph/0202033",
    "authors": [
      "Lov K. Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "An Improved Quantum Scheduling Algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0202033"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9c79ec82-40bd-44a4-ac5b-0e0c0b4f9ed6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}