{
  "annotation_id": "f2e20420-615f-4fbe-9135-2dfc9fbbfabd",
  "date_created": "2026-03-02T18:02:47.709000Z",
  "date_modified": "2026-03-02T18:02:47.709000Z",
  "file_hash": "0b70953be782690cf79b6f66830448d6323814987b9bbeb3a8cc403fcd2fe963",
  "private": false,
  "record": {
    "abstract": "We give the first quantum circuit for computing $f(0)$ OR $f(1)$ more\nreliably than is classically possible with a single evaluation of the function.\nOR therefore joins XOR (i.e. parity, $f(0) \\oplus f(1)$) to give the full set\nof logical connectives (up to relabeling of inputs and outputs) for which there\nis quantum speedup. The XOR algorithm is of fundamental importance in quantum\ncomputation; our OR algorithm (found with the aid of genetic programming), may\nrepresent a new quantum computational effect, also useful as a ``subroutine\u0027\u0027.",
    "arxiv_id": "quant-ph/9907056",
    "authors": [
      "Howard Barnum",
      "Herbert J. Bernstein",
      "Lee Spector"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A quantum circuit for OR",
    "url": "https://arxiv.org/abs/quant-ph/9907056"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d1df632f-7627-4041-85b3-dd4a2f7798f1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}