{
  "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": "adiabatic-algorithms",
  "nombre": "Adiabatic Algorithms",
  "categoria": "Optimization, Numerics, and Machine Learning",
  "categoria_id": "ONML",
  "problema": "Resolver un problema partiendo de un hamiltoniano facil y deformandolo despacio hasta uno cuyo estado fundamental codifica la solucion. Es el modelo detras del recocido cuantico.",
  "speedup_declarado": "A plausible example of superpolynomial speedup appears in [ 530 ]",
  "declarado_por": "Quantum Algorithm Zoo",
  "fuente_url": "https://quantumalgorithmzoo.org/#adiabatic",
  "implementaciones": [
    {
      "nombre": "Classiq (Linear Solver)",
      "url": "https://short.classiq.io/adiabatic_qlsp"
    }
  ],
  "referencias": [
    {
      "n": 85,
      "cita": "M. Szegedy Quantum speed-up of Markov chain based algorithms. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science , pg. 32, 2004.",
      "url": null
    },
    {
      "n": 96,
      "cita": "Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106 , 2000.",
      "url": "http://arxiv.org/abs/quant-ph/0001106"
    },
    {
      "n": 97,
      "cita": "Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. SIAM Journal on Computing , 37(1):166-194, 2007. [ arXiv:quant-ph/0405098 ]",
      "url": "http://arxiv.org/abs/quant-ph/0405098"
    },
    {
      "n": 98,
      "cita": "Jérémie Roland and Nicolas J. Cerf Quantum search by local adiabatic evolution. Physical Review A , 65(4):042308, 2002. [ arXiv:quant-ph/0107015 ]",
      "url": "http://arxiv.org/abs/quant-ph/0107015"
    },
    {
      "n": 176,
      "cita": "Silvano Garnerone, Paolo Zanardi, and Daniel A. Lidar Adiabatic quantum algorithm for search engine ranking. Physical Review Letters 108:230506, 2012.",
      "url": null
    },
    {
      "n": 179,
      "cita": "Boris Altshuler, Hari Krovi, and Jérémie Roland Anderson localization casts clouds over adiabatic quantum optimization. Proceedings of the National Academy of Sciences 107(28):12446-12450, 2010. [ arXiv:0912.0746 ]",
      "url": "http://arxiv.org/abs/0912.0746"
    },
    {
      "n": 180,
      "cita": "Ben Reichardt The quantum adiabatic optimization algorithm and local minima. In Proceedings of STOC 2004 , pg. 502-510. [ Erratum ].",
      "url": "http://www-bcf.usc.edu/~breichar/Correction.txt"
    },
    {
      "n": 181,
      "cita": "Edward Farhi, Jeffrey Goldstone, and Sam Gutmann Quantum adiabatic evolution algorithms versus simulated annealing. arXiv:quant-ph/0201031 , 2002.",
      "url": "http://arxiv.org/abs/quant-ph/0201031"
    },
    {
      "n": 182,
      "cita": "E. Farhi, J. Goldstone, D. Gosset, S. Gutmann, H. B. Meyer, and P. Shor Quantum adiabatic algorithms, small gaps, and different paths. Quantum Information and Computation , 11(3/4):181-214, 2011. [ arXiv:0909.4766 ]",
      "url": "http://arxiv.org/abs/0909.4766"
    },
    {
      "n": 183,
      "cita": "Sergey Bravyi, David P. DiVincenzo, Roberto I. Oliveira, and Barbara M. Terhal The Complexity of Stoquastic Local Hamiltonian Problems. Quantum Information and Computation , 8(5):361-385, 2008. [ arXiv:quant-ph/0606140 ]",
      "url": "http://arxiv.org/abs/quant-ph/0606140"
    },
    {
      "n": 184,
      "cita": "Rolando D. Somma and Sergio Boixo Spectral gap amplification. SIAM Journal on Computing , 42:593-610, 2013. [ arXiv:1110.2494 ]",
      "url": "http://arxiv.org/abs/1110.2494"
    },
    {
      "n": 185,
      "cita": "Sabine Jansen, Mary-Beth Ruskai, Ruedi Seiler Bounds for the adiabatic approximation with applications to quantum computation. Journal of Mathematical Physics , 48:102111, 2007. [ arXiv:quant-ph/0603175 ]",
      "url": "http://arxiv.org/abs/quant-ph/0603175"
    },
    {
      "n": 186,
      "cita": "E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem. Science , 292(5516):472-475, 2001. [ arXiv:quant-ph/0104129 ]",
      "url": "http://arxiv.org/abs/quant-ph/0104129"
    },
    {
      "n": 187,
      "cita": "Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Daniel Nagaj How to make the quantum adiabatic algorithm fail. International Journal of Quantum Information , 6(3):503-516, 2008. [ arXiv:quant-ph/0512159 ]",
      "url": "http://arxiv.org/abs/quant-ph/0512159"
    },
    {
      "n": 188,
      "cita": "Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Daniel Nagaj Unstructured randomness, small gaps, and localization. Quantum Information and Computation , 11(9/10):840-854, 2011. [ arXiv:1010.0009 ]",
      "url": "http://arxiv.org/abs/1010.0009"
    },
    {
      "n": 189,
      "cita": "Edward Farhi, Jeffrey Goldstone, Sam Gutmann Quantum adiabatic evolution algorithms with different paths. arXiv:quant-ph/0208135 , 2002.",
      "url": "http://arxiv.org/abs/quant-ph/0208135"
    },
    {
      "n": 190,
      "cita": "Wim van Dam, Michele Mosca, and Umesh Vazirani How powerful is adiabatic quantum computation? In Proceedings of FOCS 2001 , pg. 279-287. arXiv:quant-ph/0206003 [See also this .]",
      "url": "http://arxiv.org/abs/quant-ph/0206003"
    },
    {
      "n": 191,
      "cita": "E. Farhi, D. Gosset, I. Hen, A. W. Sandvik, P. Shor, A. P. Young, and F. Zamponi The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs. Physical Review A , 86:052334, 2012. [ arXiv:1208.3757 ]",
      "url": "http://arxiv.org/abs/1208.3757"
    },
    {
      "n": 192,
      "cita": "Kristen L. Pudenz and Daniel A. Lidar Quantum adiabatic machine learning. Quantum Information Processing , 12:2027, 2013. [ arXiv:1109.0325 ]",
      "url": "http://arxiv.org/abs/1109.0325"
    },
    {
      "n": 193,
      "cita": "Frank Gaitan and Lane Clark Ramsey numbers and adiabatic quantum computing. Physical Review Letters , 108:010501, 2012. [ arXiv:1103.1345 ]",
      "url": "http://arxiv.org/abs/1103.1345"
    },
    {
      "n": 194,
      "cita": "Frank Gaitan and Lane Clark Graph isomorphism and adiabatic quantum computing. Physical Review A , 89(2):022342, 2014. [ arXiv:1304.5773 ]",
      "url": "http://arxiv.org/abs/1304.5773"
    },
    {
      "n": 195,
      "cita": "Hartmut Neven, Vasil S. Denchev, Geordie Rose, and William G. Macready Training a binary classifier with the quantum adiabatic algorithm. arXiv:0811.0416 , 2008.",
      "url": "http://arxiv.org/abs/0811.0416"
    },
    {
      "n": 198,
      "cita": "S. Morita, H. Nishimori Mathematical foundation of quantum annealing. Journal of Methematical Physics , 49(12):125210, 2008.",
      "url": null
    },
    {
      "n": 199,
      "cita": "A. B. Finnila, M. A. Gomez, C. Sebenik, C. Stenson, J. D. Doll Quantum annealing: a new method for minimizing multidimensional functions. Chemical Physics Letters , 219:343-348, 1994.",
      "url": null
    },
    {
      "n": 225,
      "cita": "Lawrence M. Ioannou and Michele Mosca Limitations on some simple adiabatic quantum algorithms International Journal of Quantum Information, 6(3):419-426, 2008. [ arXiv:quant-ph/0702241 ]",
      "url": "http://arxiv.org/abs/quant-ph/0702241"
    },
    {
      "n": 247,
      "cita": "Alexander Elgart and George A. Hagedorn A note on the switching adiabatic theorem Journal of Mathematical Physics 53(10):102202, 2012. [ arXiv:1204.2318 ]",
      "url": "http://arxiv.org/abs/1204.2318"
    },
    {
      "n": 406,
      "cita": "Andriyan Bayo Suksmono and Yuichiro Minato Finding Hadamard matrices by a quantum annealing machine Scientific Reports 9:14380, 2019. [ arXiv:1902.07890 ]",
      "url": "https://arxiv.org/abs/1902.07890"
    },
    {
      "n": 429,
      "cita": "Matthew B. Hastings The power of adiabatic quantum computation with no sign problem arXiv:2005.03791",
      "url": "https://arxiv.org/abs/2005.03791"
    },
    {
      "n": 508,
      "cita": "Bin Yan and Nikolai A. Sinitsyn Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian Nature Communications , 13:2212, 2022.",
      "url": null
    },
    {
      "n": 509,
      "cita": "Tadashi Kadowaki and Hidetoshi Nishimori Quantum Annealing in the Transverse Ising Model Physical Review E , 58:5355, 1998. [ arXiv:cond-mat/9804280 ]",
      "url": "https://arxiv.org/abs/cond-mat/9804280"
    },
    {
      "n": 517,
      "cita": "Dong An and Lin Lin Quantum Linear System Solver Based on Time-optimal Adiabatic Quantum Computing and Quantum Approximate Optimization Algorithm ACM Transactions on Quantum Computing , 3(2):1–28, 2022. [ arXiv:1909.05500 ]",
      "url": "https://arxiv.org/abs/1909.05500"
    },
    {
      "n": 518,
      "cita": "Pedro C. S. Costa, Dong An, Yuval R. Sanders, Yuan Su, Ryan Babbush, and Dominic W. Berry Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem PRX Quantum , 3:040303, 2022. [ arXiv:2111.08152 ]",
      "url": "https://arxiv.org/abs/2111.08152"
    },
    {
      "n": 529,
      "cita": "Jiaqi Leng, Ethan Hickman, Joseph Li, and Xiaodi Wu Quantum Hamiltonian descent arXiv:2303.04171 , 2023.",
      "url": "https://arxiv.org/abs/2303.01471"
    },
    {
      "n": 530,
      "cita": "Jiaqi Leng, Yufan Zheng, and Xiaodi Wu A quantum-classical performance separation in nonconvex optimization arXiv:2311.00811 , 2023.",
      "url": "https://arxiv.org/abs/2311.00811"
    }
  ],
  "n_referencias": 34,
  "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."
  }
}