Home
File Metadata
quant-ph_9706052.txt
Annotation: dorsal/arxiv

dorsal/arxiv

Added by Arxiv Bot | Added: 2026-03-02 18:02 | Views: 1 | Source: arXiv Dataset IDs (Model)

On the Complexity of Quantum Searching Using Complex Queries

Authors	Markus Grassl, Thomas Beth
Categories	quant-ph
ArXiv ID	quant-ph/9706052
URL	https://arxiv.org/abs/quant-ph/9706052

Abstract

We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version of the algorithm we discuss its complexity.

{
  "annotation_id": "d9422a45-5adc-41d5-bc33-d0cf7e9cb236",
  "date_created": "2026-03-02T18:02:41.592000Z",
  "date_modified": "2026-03-02T18:02:41.592000Z",
  "file_hash": "99b0c24ecdcbdefbf78893d3ee11b274f54fde33eb6ecd98ddb7dffba2dcc21a",
  "private": false,
  "record": {
    "abstract": "We discuss the quantum search algorithm using complex queries that has\nrecently been published by Grover (quant-ph/9706005). We recall the algorithm\nadding some details showing which complex query has to be evaluated. Based on\nthis version of the algorithm we discuss its complexity.",
    "arxiv_id": "quant-ph/9706052",
    "authors": [
      "Markus Grassl",
      "Thomas Beth"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "On the Complexity of Quantum Searching Using Complex Queries",
    "url": "https://arxiv.org/abs/quant-ph/9706052"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6ff7f517-db77-4096-978d-4d1e793aad44",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}