{
  "annotation_id": "6cc93c73-46b8-4b51-9cbc-b1a00de19e7b",
  "date_created": "2026-03-02T18:01:52.030000Z",
  "date_modified": "2026-03-02T18:01:52.030000Z",
  "file_hash": "962b3b418dfbf4698133ca5cd726ef1b90303e033a126181553dbe207c3715a1",
  "private": false,
  "record": {
    "abstract": "We present an idealized quantum continuous variable analog of the\nDeutsch-Jozsa algorithm which can be implemented on a perfect continuous\nvariable quantum computer. Using the Fourier transformation and XOR gate\nappropriate for continuous spectra we show that under ideal operation to\ninfinite precision that there is an infinite reduction in number of query calls\nin this scheme.",
    "arxiv_id": "quant-ph/0207108",
    "authors": [
      "Arun K. Pati",
      "Samuel L. Braunstein"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Deutsch-Jozsa algorithm for continuous variables",
    "url": "https://arxiv.org/abs/quant-ph/0207108"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "41d267f3-78ea-4d0e-8a32-4173d65f8f4d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}