{
  "aviso": "speedup_declarado es lo que declara la fuente citada, NO una medición de Rosetta. Lo que Rosetta midió va en evidencia_rosetta, y para la mayoría del catálogo está vacío.",
  "procedencia": {
    "fuente": "Quantum Algorithm Zoo",
    "fuente_url": "https://quantumalgorithmzoo.org/",
    "instantanea_sha256": "dee7e76b5f19096ed329c88714744b93babf7b7d0296eb97e357b2582d16b75e",
    "generado_at": "2026-08-09"
  },
  "id": "ordered-search",
  "nombre": "Ordered Search",
  "categoria": "Oracular Algorithms",
  "categoria_id": "oracular",
  "problema": "Buscar en una lista ordenada. El margen cuantico aqui es solo un factor constante, no un cambio de orden.",
  "speedup_declarado": "Constant factor",
  "declarado_por": "Quantum Algorithm Zoo",
  "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
  "implementaciones": [],
  "referencias": [
    {
      "n": 10,
      "cita": "Michael Ben-Or and Avinatan Hassidim Quantum search in an ordered list via adaptive learning. arXiv:quant-ph/0703231 , 2007.",
      "url": "http://arxiv.org/abs/quant-ph/0703231"
    },
    {
      "n": 24,
      "cita": "Andrew Childs and Troy Lee Optimal quantum adversary lower bounds for ordered search. Proceedings of ICALP 2008 [ arXiv:0708.3396 ]",
      "url": "http://arxiv.org/abs/0708.3396"
    },
    {
      "n": 39,
      "cita": "Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser Invariant quantum algorithms for insertion into an ordered list. arXiv:quant-ph/9901059 , 1999.",
      "url": "http://arxiv.org/abs/quant-ph/9901059"
    },
    {
      "n": 103,
      "cita": "A. M. Childs, A. J. Landahl, and P. A. Parrilo Quantum algorithms for the ordered search problem via semidefinite programming. Physical Review A , 75 032335, 2007. [ arXiv:quant-ph/0608161 ]",
      "url": "http://arxiv.org/abs/quant-ph/0608161"
    },
    {
      "n": 219,
      "cita": "Peter Høyer, Jan Neerbek, and Yaoyun Shi Quantum complexities of ordered searching, sorting, and element distinctness In Proceedings of ICALP pg. 346-357, 2001 [ arXiv:quant-ph/0102078 ]",
      "url": "http://arxiv.org/abs/quant-ph/0102078"
    }
  ],
  "n_referencias": 5,
  "remisiones": [],
  "evidencia_rosetta": {
    "medido": false,
    "lectura": "Rosetta no tiene ninguna corrida sellada sobre este algoritmo. Que esté catalogado no significa que lo hayamos medido ni que lo ofrezcamos."
  }
}