{
  "annotation_id": "b94187ee-509e-4654-9a70-a1db0affe682",
  "date_created": "2026-03-02T18:01:48.270000Z",
  "date_modified": "2026-03-02T18:01:48.270000Z",
  "file_hash": "a69b7a77ed0a6badd67fc63b22929c541930f8fdf93250dc618cc96b06936c06",
  "private": false,
  "record": {
    "abstract": "We apply majorization theory to study the quantum algorithms known so far and\nfind that there is a majorization principle underlying the way they operate.\nGrover\u0027s algorithm is a neat instance of this principle where majorization\nworks step by step until the optimal target state is found. Extensions of this\nsituation are also found in algorithms based in quantum adiabatic evolution and\nthe family of quantum phase-estimation algorithms, including Shor\u0027s algorithm.\nWe state that in quantum algorithms the time arrow is a majorization arrow.",
    "arxiv_id": "quant-ph/0111146",
    "authors": [
      "J. I. Latorre",
      "M. A. Martin-Delgado"
    ],
    "categories": [
      "quant-ph",
      "cond-mat",
      "hep-th"
    ],
    "doi": "10.1103/PhysRevA.66.022305",
    "title": "The Majorization Arrow in Quantum Algorithm Design",
    "url": "https://arxiv.org/abs/quant-ph/0111146"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b62b6da7-a090-4461-9402-aa55344d96ab",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}