{
  "annotation_id": "2f4ac34e-4a1a-4453-a583-7ef8edb4d20f",
  "date_created": "2026-03-02T18:01:37.944000Z",
  "date_modified": "2026-03-02T18:01:37.944000Z",
  "file_hash": "6f7eeee9f151357a0b09216e26b669c802d0e522e53875f6abb73dec3b46ad5f",
  "private": false,
  "record": {
    "abstract": "A fast quantum search algorithm for continuous variables is presented. The\nresult is the quantum continuous variable analog of Grover\u0027s algorithm\noriginally proposed for qubits. A continuous variable analog of the Hadamard\n(i.e., Fourier transform) operation is used in conjunction with inversion about\nthe average of quantum states to allow the approximate identification of an\nunknown quantum state in a way that gives a square-root speed-up over search\nalgorithms using classical continuous variables. Also, we show that this\nquantum search algorithm is robust for a generalised Fourier transformation on\ncontinuous variables.",
    "arxiv_id": "quant-ph/0002082",
    "authors": [
      "Arun K. Pati",
      "Samuel L. Braunstein",
      "Seth Lloyd"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum searching with continuous variables",
    "url": "https://arxiv.org/abs/quant-ph/0002082"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ecbf7412-8c1b-4577-a38e-26326e93e711",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}