{
  "annotation_id": "b51967fe-a68d-4221-bf6a-0742af35a27a",
  "date_created": "2026-03-02T18:01:39.322000Z",
  "date_modified": "2026-03-02T18:01:39.322000Z",
  "file_hash": "13c98abc3d1248d17f3586891def716e83fa1a05d64f0882721e8515e151fad0",
  "private": false,
  "record": {
    "abstract": "The phenomenon of quantum entanglement is fundamental to the implementation\nof quantum computation, and requires at least two qubits for its demonstration.\nHowever, both Deutsch algorithm and Grover\u0027s search algorithm for two bits do\nnot use entanglement. We develop a Deutsch-like problem, where we consider all\npossible binary functions for two bit inputs and distinguish their even or odd\nnature. The quantum algorithm to solve this problem requires entanglement at\nthe level of two qubits. The final solution suggests that an NMR implementation\nof the problem would lead to interesting results.",
    "arxiv_id": "quant-ph/0006069",
    "authors": [
      "Arvind",
      "N. Mukunda"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A two-qubit algorithm involving quantum entanglement",
    "url": "https://arxiv.org/abs/quant-ph/0006069"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b0cd44da-bd3d-4eea-8f1e-c81d830fedf3",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}