{
  "annotation_id": "eeec1d7c-ea1c-4c0b-8169-1b5534966068",
  "date_created": "2026-03-02T18:02:27.289000Z",
  "date_modified": "2026-03-02T18:02:27.289000Z",
  "file_hash": "0b95ae3ff4851bbb06df0ddf42bc6c244b9ce3b09ef723e02bd253a386a5e56d",
  "private": false,
  "record": {
    "abstract": "Quantum computation has attracted much attention since it was shown by Shor\nand Grover the possibility to implement quantum algorithms able to realize,\nrespectively, factoring and searching in a faster way than any other known\nclassical algorithm. It is possible to use Grover algorithm, taking profit of\nits ability to find a specific value in a unordered database, to find, for\nexample, the zero of a logical function; the minimal or maximal value in a\ndatabase or to recognize if an odd number is prime or not. Here we show quantum\nalgorithms to solve those cited mathematical problems. The solution requires\nthe use of a quantum bit string comparator being used as oracle. This quantum\ncircuit compares two quantum states and identifies if they are equal or,\notherwise, which of them is the largest. Moreover, we also show the quantum bit\nstring comparator allow us to implement conditional statements in quantum\ncomputation, a fundamental structure for designing of algorithms.",
    "arxiv_id": "quant-ph/0605003",
    "authors": [
      "Rubens Viana Ramos",
      "Paulo Benicio de Sousa",
      "David Sena Oliveira"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Solving mathematical problems with quantum search algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0605003"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4aaaccf2-fff1-42fe-aff6-09e03c962b61",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}