{
  "annotation_id": "899e80f8-ced0-4397-98e1-35bd9d45cdea",
  "date_created": "2026-03-02T18:02:26.461000Z",
  "date_modified": "2026-03-02T18:02:26.461000Z",
  "file_hash": "a2ad5ec3d615ed11a67407e505d2fa307f64768a0337da247e4cbf56f82044ce",
  "private": false,
  "record": {
    "abstract": "In this summary we discuss two new algorithms for Grover\u0027s unsorted database\nsearch problem that claimed to have reached exponential speedup over Grover\u0027s\noriginal algorithm. One is in the quantum setting with \"power queries\" that\nallow for exponential reduction in the number of queries over Grover\u0027s original\nalgorithm with \"bit queries\". The other is to use \"dubit queries\" on a duality\ncomputer - a new computing model uses a quantum system\u0027s wave-particle duality,\nwhich is able to achieve even greater computing power and better capability\nthan existent quantum computers we have been discussing. We discuss the\nshortages and difficulties of both schemes as well.",
    "arxiv_id": "quant-ph/0603210",
    "authors": [
      "Bin Shang"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A summary on two new algorithms for Grover\u0027s unsorted database search   problem",
    "url": "https://arxiv.org/abs/quant-ph/0603210"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "bb12d810-52f8-4f7a-ae48-2407a0921fc1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}