{
  "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": "optimization-by-decoded-quantum-interferometry",
  "nombre": "Optimization by Decoded Quantum Interferometry",
  "categoria": "Optimization, Numerics, and Machine Learning",
  "categoria_id": "ONML",
  "problema": "Reducir ciertos problemas de optimizacion a un problema de decodificacion, y resolver ese.",
  "speedup_declarado": "Superpolynomial",
  "declarado_por": "Quantum Algorithm Zoo",
  "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
  "implementaciones": [
    {
      "nombre": "Classiq",
      "url": "https://short.classiq.io/dqi"
    }
  ],
  "referencias": [
    {
      "n": 5,
      "cita": "Dorit Aharonov and Amnon Ta-Shma Adiabatic quantum state generation and statistical zero knowledge. In Proceedings of the 35th ACM Symposium on Theory of Computing , 2003. [ arXiv:quant-ph/0301023 ]",
      "url": "http://arxiv.org/abs/quant-ph/0301023"
    },
    {
      "n": 78,
      "cita": "Oded Regev Quantum computation and lattice problems. In Proceedings of the 43rd Symposium on Foundations of Computer Science , 2002. [ arXiv:cs/0304005 ]",
      "url": "http://arxiv.org/abs/cs/0304005"
    },
    {
      "n": 453,
      "cita": "Stephen P. Jordan, Noah Shutty, Mary Wootters, Adam Zalcman, Alexander Schmidhuber, Robbie King, Sergei V. Isakov, and Ryan Babbush Optimization by Decoded Quantum Interferometry Nature 646:831-836, 2025. [ arXiv:2408.08292 ].",
      "url": "https://arxiv.org/abs/2408.08292"
    },
    {
      "n": 454,
      "cita": "Alexander Schmidhuber, Ryan O'Donnell, Robin Kothari, Ryan Babbush Quartic quantum speedups for planted inference arXiv:2406.19378 , 2024.",
      "url": "https://arxiv.org/abs/2406.19378"
    },
    {
      "n": 455,
      "cita": "Takashi Yamakawa and Mark Zhandry Verifiable Quantum Advantage without Structure Journal of the ACM 71(3):1-50. [ arXiv:2204.02063 ]",
      "url": "https://arxiv.org/abs/2204.02063"
    },
    {
      "n": 534,
      "cita": "André Chailloux and Jean-Pierre Tillich Quantum advantage from soft decoders arXiv:2411.12553 , 2024.",
      "url": "https://arxiv.org/abs/2411.12553"
    },
    {
      "n": 544,
      "cita": "Daniel Cohen Hillel Optimization of Quadratic Constraints by Decoded Quantum Interferometry arXiv:2510.08061 , 2025.",
      "url": "https://arxiv.org/abs/2510.08061"
    },
    {
      "n": 545,
      "cita": "Ojas Parekh No Quantum Advantage in Decoded Quantum Interferometry for MaxCut arXiv:2509.19966 , 2025.",
      "url": "https://arxiv.org/abs/2509.19966"
    },
    {
      "n": 546,
      "cita": "Alexander Schmidhuber, Jonathan Z. Lu, Noah Shutty, Stephen Jordan, Alexander Poremba, and Yihui Quek Hamiltonian Decoded Quantum Interferometry arXiv:2510.07913 , 2025.",
      "url": "https://arxiv.org/abs/2510.07913"
    },
    {
      "n": 548,
      "cita": "André Chailloux and Jean-Pierre Tillich The Quantum Decoding Problem arXiv:2310.20651 , 2023.",
      "url": "https://arxiv.org/abs/2310.20651"
    },
    {
      "n": 549,
      "cita": "Agathe Blanvillain, André Chailloux, and Jean-Pierre Tillich The Quantum Decoding Problem : Tight Achievability Bounds and Application to Regev's Reduction arXiv:2509.24796 , 2025.",
      "url": "https://arxiv.org/abs/2509.24796"
    },
    {
      "n": 550,
      "cita": "André Chailloux and Paul Hermouet On the Quantum Equivalence between \\( \\textrm{S} | \\textrm{LWE} \\rangle \\) and ISIS arXiv:2510.06097 , 2025.",
      "url": "https://arxiv.org/abs/2510.06097"
    },
    {
      "n": 551,
      "cita": "Quentin Buzet and André Chailloux Fine-Grained Unambiguous Measurements arXiv:2510.07298 , 2025.",
      "url": "https://arxiv.org/abs/2510.07298"
    }
  ],
  "n_referencias": 13,
  "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."
  }
}