{
  "annotation_id": "8be19820-3982-48a1-8726-125a5755be74",
  "date_created": "2026-03-02T18:01:42.251000Z",
  "date_modified": "2026-03-02T18:01:42.251000Z",
  "file_hash": "a1af08b8e03a1f5727bbfb95238501b7a95f26b9491a7130a70586473d39270a",
  "private": false,
  "record": {
    "abstract": "The existence of entangled quantum states gives extra power to quantum\ncomputers over their classical counterparts. Quantum entanglement shows up\nqualitatively at the level of two qubits. We show that if no entanglement is\nenvolved then whatever one can do with qubits can also be done with classical\noptical systems. We demonstrate that the one- and the two-bit Deutsch-Jozsa\nalgorithm does not require entanglement and can be mapped onto a classical\noptical scheme. It is only for three and more input bits that the DJ algorithm\nrequires the implementation of entangling transformations and in these cases it\nis impossible to implement this algorithm classically.",
    "arxiv_id": "quant-ph/0012116",
    "authors": [
      "Arvind"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s12043-001-0130-9",
    "journal_ref": "Pramana Jr. of Physics 56, 357-365 (2001)",
    "title": "Quantum Entanglement and Quantum Computational Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0012116"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2e6c6d7c-fdab-4e5c-a57d-83d7f93248ce",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}