{
  "total": 74,
  "devueltos": 74,
  "total_catalogo": 74,
  "filtro": {
    "categoria": null,
    "q": null,
    "limit": 100
  },
  "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",
    "como_reconstruir": "Baja https://quantumalgorithmzoo.org/, recomputa su sha256 y corre scripts/build-quantum-catalog.mjs"
  },
  "items": [
    {
      "id": "factoring",
      "nombre": "Factoring",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Descomponer un entero de n bits en sus factores primos. Es el problema sobre el que descansa RSA.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/shor"
        },
        {
          "nombre": "Cirq",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/shor.py"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/codebook/shors-algorithm"
        },
        {
          "nombre": "Qrisp",
          "url": "https://qrisp.eu/reference/Algorithms/Shor.html#shor"
        }
      ],
      "referencias": [
        {
          "n": 82,
          "cita": "Peter W. Shor Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing , 26(5):1484-1509, 1997. [ arXiv:quant-ph/9508027 ]",
          "url": "http://arxiv.org/abs/quant-ph/9508027"
        },
        {
          "n": 125,
          "cita": "Peter Shor Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Proceedings of FOCS 1994 , pg. 124-134.",
          "url": null
        },
        {
          "n": 248,
          "cita": "Daniel J. Bernstein, Johannes Buchmann, and Erik Dahmen, Eds. Post-Quantum Cryptography Springer , 2009.",
          "url": "http://www.springer.com/mathematics/numbers/book/978-3-540-88701-0"
        },
        {
          "n": 252,
          "cita": "J. M. Pollard Theorems on factorization and primality testing Proceedings of the Cambridge Philosophical Society. 76:521-228, 1974.",
          "url": null
        },
        {
          "n": 253,
          "cita": "L. Babai, R. Beals, and A. Seress Polynomial-time theory of matrix groups In Proceedings of STOC 2009 , pg. 55-64.",
          "url": null
        },
        {
          "n": 254,
          "cita": "Neil J. Ross and Peter Selinger Optimal ancilla-free Clifford+T approximations of z-rotations arXiv:1403.2975 , 2014.",
          "url": "http://arxiv.org/abs/1403.2975"
        },
        {
          "n": 271,
          "cita": "Frédéric Grosshans, Thomas Lawson, François Morain, and Benjamin Smith Factoring safe semiprimes with a single quantum query arXiv:1511.04385 , 2015.",
          "url": "http://arxiv.org/abs/1511.04385"
        },
        {
          "n": 362,
          "cita": "Volker Strassen Einige Resultate über Berechnungskomplexität In Jahresbericht der Deutschen Mathematiker-Vereinigung , 78(1):1-8, 1976/1977.",
          "url": null
        },
        {
          "n": 366,
          "cita": "D. J. Bernstein, N. Heninger, P. Lou, and L. Valenta Post-quantum RSA IACR e-print 2017/351 , 2017.",
          "url": "https://eprint.iacr.org/2017/351"
        },
        {
          "n": 384,
          "cita": "M. Ekerå and J. Håstad Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers Proceedings of PQCrypto 2017 , pg. 347-363. (LNCS Volume 10346), 2017.",
          "url": "https://link.springer.com/chapter/10.1007/978-3-319-59879-6_20"
        },
        {
          "n": 386,
          "cita": "D. J. Bernstein, J.-F. Biasse, and M. Mosca A low-resource quantum factoring algorithm Proceedings of PQCrypto 2017 , pg. 330-346 (LNCS Volume 10346), 2017.",
          "url": "https://link.springer.com/chapter/10.1007/978-3-319-59879-6_19"
        },
        {
          "n": 431,
          "cita": "Craig Gidney and Martin Ekera How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits Quantum 5:433, 2021. [ arXiv:1905.09749 ]",
          "url": "https://arxiv.org/abs/1905.09749"
        },
        {
          "n": 542,
          "cita": "David Harvey and Markus Hittmeir A log-log speedup for exponent one-fifth deterministic integer factorization arXiv:2105.11105 , 2021.",
          "url": "https://arxiv.org/abs/2105.11105"
        }
      ],
      "n_referencias": 13,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "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."
      }
    },
    {
      "id": "discrete-log",
      "nombre": "Discrete-log",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Dado b = a^s mod N, encontrar s. Sostiene DSA, ECDSA y el intercambio de claves Diffie-Hellman.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/discrete_log"
        },
        {
          "nombre": "Qrisp",
          "url": "https://github.com/diehoq/quantum-elliptic-curve-logarithm"
        }
      ],
      "referencias": [
        {
          "n": 14,
          "cita": "D. Boneh and R. J. Lipton Quantum cryptanalysis of hidden linear functions. In Don Coppersmith, editor, CRYPTO '95 , Lecture Notes in Computer Science, pages 424-437. Springer-Verlag, 1995.",
          "url": null
        },
        {
          "n": 82,
          "cita": "Peter W. Shor Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing , 26(5):1484-1509, 1997. [ arXiv:quant-ph/9508027 ]",
          "url": "http://arxiv.org/abs/quant-ph/9508027"
        },
        {
          "n": 109,
          "cita": "John Proos and Christof Zalka Shor's discrete logarithm quantum algorithm for elliptic curves. Quantum Information and Computation , Vol. 3, No. 4, pg.317-344, 2003. [ arXiv:quant-ph/0301141 ]",
          "url": "http://arxiv.org/abs/quant-ph/0301141"
        },
        {
          "n": 203,
          "cita": "Andrew Childs and Gábor Ivanyos Quantum computation of discrete logarithms in semigroups. arXiv:1310.6238 , 2013.",
          "url": "http://arxiv.org/abs/1310.6238"
        },
        {
          "n": 204,
          "cita": "Matan Banin and Boaz Tsaban A reduction of semigroup DLP to classic DLP. arXiv:1310.7903 , 2013.",
          "url": "http://arxiv.org/abs/1310.7903"
        },
        {
          "n": 385,
          "cita": "M. Ekerå On post-processing in the quantum algorithm for computing short discrete logarithms IACR ePrint Archive Report 2017/1122 , 2017.",
          "url": "https://eprint.iacr.org/2017/1122"
        },
        {
          "n": 432,
          "cita": "Martin Roetteler, Michael Naehrig, Krysta M. Svore, and Kristin Lauter Quantum resource estimates for computing elliptic curve discrete logarithms Proceedings of ASIACRYPT 2017 [ arXiv:1706.06752 ]",
          "url": "https://arxiv.org/abs/1706.06752"
        }
      ],
      "n_referencias": 7,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "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."
      }
    },
    {
      "id": "pell-s-equation",
      "nombre": "Pell's Equation",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Resolver la ecuacion de Pell x^2 - d*y^2 = 1 sobre los enteros. Romperla quiebra el criptosistema de Buchmann-Williams.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 49,
          "cita": "Sean Hallgren Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proceedings of the 34th ACM Symposium on Theory of Computing , 2002.",
          "url": null
        }
      ],
      "n_referencias": 1,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "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."
      }
    },
    {
      "id": "principal-ideal",
      "nombre": "Principal Ideal",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Decidir si un ideal de un cuerpo de numeros es principal, y en ese caso hallar su generador. Es al menos tan dificil como factorizar.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 49,
          "cita": "Sean Hallgren Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. In Proceedings of the 34th ACM Symposium on Theory of Computing , 2002.",
          "url": null
        },
        {
          "n": 131,
          "cita": "Arthur Schmidt Quantum Algorithms for many-to-one Functions to Solve the Regulator and the Principal Ideal Problem. arXiv:0912.4807 , 2009.",
          "url": "http://arxiv.org/abs/0912.4807"
        },
        {
          "n": 329,
          "cita": "Jean-François Biasse and Fang Song Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '16) , pg. 893-902, 2016.",
          "url": null
        }
      ],
      "n_referencias": 3,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "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."
      }
    },
    {
      "id": "unit-group",
      "nombre": "Unit Group",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Calcular el grupo de unidades del anillo de enteros de un cuerpo de numeros.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 50,
          "cita": "Sean Hallgren Fast quantum algorithms for computing the unit group and class group of a number field. In Proceedings of the 37th ACM Symposium on Theory of Computing , 2005.",
          "url": null
        },
        {
          "n": 116,
          "cita": "Arthur Schmidt and Ulrich Vollmer Polynomial time quantum algorithm for the computation of the unit group of a number field. In Proceedings of the 37th Symposium on the Theory of Computing , pg. 475-480, 2005.",
          "url": null
        },
        {
          "n": 213,
          "cita": "Kirsten Eisenträger, Sean Hallgren, Alexei Kitaev, and Fang Song A quantum algorithm for computing the unit group of an arbitrary degree number field In Proceedings of STOC 2014 pg. 293-302.",
          "url": null
        },
        {
          "n": 329,
          "cita": "Jean-François Biasse and Fang Song Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '16) , pg. 893-902, 2016.",
          "url": null
        }
      ],
      "n_referencias": 4,
      "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."
      }
    },
    {
      "id": "class-group",
      "nombre": "Class Group",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Calcular el grupo de clases de un cuerpo de numeros, un invariante central de la teoria algebraica de numeros.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 50,
          "cita": "Sean Hallgren Fast quantum algorithms for computing the unit group and class group of a number field. In Proceedings of the 37th ACM Symposium on Theory of Computing , 2005.",
          "url": null
        },
        {
          "n": 329,
          "cita": "Jean-François Biasse and Fang Song Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '16) , pg. 893-902, 2016.",
          "url": null
        }
      ],
      "n_referencias": 2,
      "remisiones": [
        {
          "ancla": "abelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#abelian_HSP"
        }
      ],
      "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."
      }
    },
    {
      "id": "gauss-sums",
      "nombre": "Gauss Sums",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Estimar sumas de Gauss sobre cuerpos finitos, objeto basico de la teoria de numeros.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 47,
          "cita": "Joseph Geraci and Daniel A. Lidar On the exact evaluation of certain instances of the Potts partition function by quantum computers. Comm. Math. Phys. Vol. 279, pg. 735, 2008. [ arXiv:quant-ph/0703023 ]",
          "url": "http://arxiv.org/abs/quant-ph/0703023"
        },
        {
          "n": 90,
          "cita": "Wim van Dam and Gadiel Seroussi Efficient quantum algorithms for estimating Gauss sums. arXiv:quant-ph/0207131 , 2002.",
          "url": "http://arxiv.org/abs/quant-ph/0207131"
        }
      ],
      "n_referencias": 2,
      "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."
      }
    },
    {
      "id": "primality-proving",
      "nombre": "Primality Proving",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Certificar que un numero es primo, no solo probablemente primo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 393,
          "cita": "Qi Cheng Primality Proving via One Round in ECPP and One Iteration in AKS Journal of Cryptology , Volume 20, Issue 3, pg. 375-387, July 2007.",
          "url": null
        },
        {
          "n": 394,
          "cita": "Daniel J. Bernstein Proving primality in essentially quartic random time Mathematics of Computation , Vol. 76, pg. 389-403, 2007.",
          "url": null
        },
        {
          "n": 395,
          "cita": "F. Morain Implementing the asymptotically fast version of the elliptic curve primality proving algorithm Mathematics of Computation , Vol. 76, pg. 493-505, 2007.",
          "url": null
        },
        {
          "n": 396,
          "cita": "Alvaro Donis-Vela and Juan Carlos Garcia-Escartin A quantum primality test with order finding arXiv:1711.02616 , 2017.",
          "url": "https://arxiv.org/abs/1711.02616"
        },
        {
          "n": 397,
          "cita": "H. F. Chau and H.-K. Lo Primality test via quantum factorization International Journal of Modern Physics C , Vol. 8, No. 2, pg. 131-138, 1997. [ arXiv:quant-ph/9508005 ]",
          "url": "https://arxiv.org/abs/quant-ph/9508005"
        },
        {
          "n": 398,
          "cita": "David Harvey and Joris Van Der Hoeven Integer multiplication in time \\( O(n \\log \\ n) \\) hal-02070778 , 2019.",
          "url": "https://hal.archives-ouvertes.fr/hal-02070778"
        },
        {
          "n": 399,
          "cita": "Charles Greathouse personal communication , 2019.",
          "url": null
        }
      ],
      "n_referencias": 7,
      "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."
      }
    },
    {
      "id": "solving-exponential-congruences",
      "nombre": "Solving Exponential Congruences",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Resolver congruencias con incognitas en el exponente.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 111,
          "cita": "Wim van Dam and Igor Shparlinski Classical and quantum algorithms for exponential congruences. Proceedings of TQC 2008 , pg. 1-10. [ arXiv:0804.1109 ]",
          "url": "http://arxiv.org/abs/0804.1109"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "matrix-elements-and-multiplicity-coefficients-of-group-repre",
      "nombre": "Matrix Elements and Multiplicity Coefficients of Group Representations",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Estimar elementos de matriz y coeficientes de multiplicidad de representaciones de grupos, incluidos los coeficientes de Clebsch-Gordan.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 106,
          "cita": "Stephen P. Jordan Fast quantum algorithms for approximating the irreducible representations of groups. arXiv:0811.0562 , 2008.",
          "url": "http://arxiv.org/abs/0811.0562"
        },
        {
          "n": 196,
          "cita": "Robert Beals Quantum computation of Fourier transforms over symmetric groups. In Proceedings of STOC 1997 , pg. 48-53.",
          "url": null
        },
        {
          "n": 197,
          "cita": "Dave Bacon, Isaac L. Chuang, and Aram W. Harrow The quantum Schur transform: I. efficient qudit circuits. In Proceedings of SODA 2007 , pg. 1235-1244. [ arXiv:quant-ph/0601001 ]",
          "url": "http://arxiv.org/abs/quant-ph/0601001"
        },
        {
          "n": 460,
          "cita": "Sergey Bravyi, Anirban Chowdhury, David Gosset, Vojtěch Havlíček, and Guanyu Zhu Quantum complexity of the Kronecker coefficients PRX Quantum 5(1):010329, 2023. [ arXiv:2302.11454 ]",
          "url": "https://arxiv.org/abs/2302.11454"
        },
        {
          "n": 515,
          "cita": "Greta Panova Polynomial time classical versus quantum algorithms for representation theoretic multiplicities arXiv:2502.20253 , 2025.",
          "url": "https://arxiv.org/abs/2502.20253"
        },
        {
          "n": 516,
          "cita": "Martin Larocca and Vojtech Havlicek Quantum Algorithms for Representation-Theoretic Multiplicities arXiv:2407.17649 , 2024.",
          "url": "https://arxiv.org/abs/2407.17649"
        }
      ],
      "n_referencias": 6,
      "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."
      }
    },
    {
      "id": "verifying-matrix-products",
      "nombre": "Verifying Matrix Products",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Comprobar si el producto de dos matrices es una tercera, mas rapido que multiplicarlas.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 6,
          "cita": "A. Ambainis, H. Buhrman, P. Høyer, M. Karpinizki, and P. Kurur Quantum matrix verification. Unpublished Manuscript, 2002.",
          "url": null
        },
        {
          "n": 19,
          "cita": "Harry Buhrman and Robert Špalek Quantum verification of matrix products. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms , pages 880-889, 2006. [ arXiv:quant-ph/0409035 ]",
          "url": "http://arxiv.org/abs/quant-ph/0409035"
        },
        {
          "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_referencias": 3,
      "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."
      }
    },
    {
      "id": "subset-sum",
      "nombre": "Subset-sum",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Dado un conjunto de numeros, hallar un subconjunto que sume un valor objetivo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 7,
          "cita": "Andris Ambainis Quantum walk algorithm for element distinctness. SIAM Journal on Computing , 37:210-239, 2007. [ arXiv:quant-ph/0311001 ]",
          "url": "http://arxiv.org/abs/quant-ph/0311001"
        },
        {
          "n": 178,
          "cita": "Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, and Alexander Meurer Quantum algorithms for the subset-sum problem. from cr.yp.to .",
          "url": null
        },
        {
          "n": 404,
          "cita": "Anja Becker, Jean-Sebastien Coron, and Antoine Joux Improved generic algorithms for hard knapsacks Proceedings of Eurocrypt 2011 pg. 364-385 [ IACR eprint 2011/474 ]",
          "url": "http://eprint.iacr.org/2011/474"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "decoding",
      "nombre": "Decoding",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Decodificar un codigo corrector de errores lineal, problema duro que sostiene la criptografia basada en codigos.",
      "speedup_declarado": "Varies",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 238,
          "cita": "Jon R. Grice and David A. Meyer A quantum algorithm for Viterbi decoding of classical convolutional codes arXiv:1405.7479",
          "url": "http://arxiv.org/abs/1405.7479"
        },
        {
          "n": 239,
          "cita": "Alexander Barg and Shiyu Zhou A quantum decoding algorithm of the simplex code Proceedings of the 36th Annual Allerton Conference, 1998 Available at author's homepage .",
          "url": "http://www.ece.umd.edu/~abarg/reprints/rm1dq.pdf"
        }
      ],
      "n_referencias": 2,
      "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."
      }
    },
    {
      "id": "quantum-cryptanalysis",
      "nombre": "Quantum Cryptanalysis",
      "categoria": "Algebraic and Number Theoretic Algorithms",
      "categoria_id": "algebraic",
      "problema": "Atacar primitivas criptograficas concretas con recursos cuanticos, mas alla de Shor y Grover.",
      "speedup_declarado": "Various",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#algebraic",
      "implementaciones": [],
      "referencias": [
        {
          "n": 14,
          "cita": "D. Boneh and R. J. Lipton Quantum cryptanalysis of hidden linear functions. In Don Coppersmith, editor, CRYPTO '95 , Lecture Notes in Computer Science, pages 424-437. Springer-Verlag, 1995.",
          "url": null
        },
        {
          "n": 82,
          "cita": "Peter W. Shor Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing , 26(5):1484-1509, 1997. [ arXiv:quant-ph/9508027 ]",
          "url": "http://arxiv.org/abs/quant-ph/9508027"
        },
        {
          "n": 109,
          "cita": "John Proos and Christof Zalka Shor's discrete logarithm quantum algorithm for elliptic curves. Quantum Information and Computation , Vol. 3, No. 4, pg.317-344, 2003. [ arXiv:quant-ph/0301141 ]",
          "url": "http://arxiv.org/abs/quant-ph/0301141"
        },
        {
          "n": 125,
          "cita": "Peter Shor Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In Proceedings of FOCS 1994 , pg. 124-134.",
          "url": null
        },
        {
          "n": 262,
          "cita": "T. Laarhoven, M. Mosca, and J. van de Pol Solving the shortest vector problem in lattices faster using quantum search Proceedings of PQCrypto13 , pp. 83-101, 2013. [ arXiv:1301.6176 ]",
          "url": "http://arxiv.org/abs/1301.6176"
        },
        {
          "n": 283,
          "cita": "Andrew M. Childs, David Jao, and Vladimir Soukharev Constructing elliptic curve isogenies in quantum subexponential time Journal of Mathematical Cryptology , 8(1):1-29 (2014) [ arXiv:1012.4019 ]",
          "url": "http://arxiv.org/abs/1012.4019"
        },
        {
          "n": 284,
          "cita": "Markus Grassl, Brandon Langenberg, Martin Roetteler, and Rainer Steinwandt Applying Grover's algorithm to AES: quantum resource estimates arXiv:1512.04965 , 2015.",
          "url": "http://arxiv.org/abs/1512.04965"
        },
        {
          "n": 285,
          "cita": "M. Ami, O. Di Matteo, V. Gheorghiu, M. Mosca, A. Parent, and J. Schanck Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3 arXiv:1603.09383 , 2016.",
          "url": "http://arxiv.org/abs/1603.09383"
        },
        {
          "n": 286,
          "cita": "Marc Kaplan, Gaetan Leurent, Anthony Leverrier, and Maria Naya-Plasencia Quantum differential and linear cryptanalysis arXiv:1510.05836 , 2015.",
          "url": "http://arxiv.org/abs/1510.05836"
        },
        {
          "n": 287,
          "cita": "Scott Fluhrer Quantum Cryptanalysis of NTRU Cryptology ePrint Archive: Report 2015/676 , 2015.",
          "url": "https://eprint.iacr.org/2015/676"
        },
        {
          "n": 288,
          "cita": "Marc Kaplan Quantum attacks against iterated block ciphers arXiv:1410.1434 , 2014.",
          "url": "http://arxiv.org/abs/1410.1434"
        },
        {
          "n": 289,
          "cita": "H. Kuwakado and M. Morii Quantum distinguisher between the 3-round Feistel cipher and the random permutation In Proceedings of IEEE International Symposium on Information Theory (ISIT) , pg. 2682-2685, 2010.",
          "url": null
        },
        {
          "n": 290,
          "cita": "H. Kuwakado and M. Morii Security on the quantum-type Even-Mansour cipher In Proceedings of International Symposium on Information Theory and its Applications (ISITA) , pg. 312-316, 2012.",
          "url": null
        },
        {
          "n": 291,
          "cita": "Martin Roetteler and Rainer Steinwandt A note on quantum related-key attacks arXiv:1306.2301 , 2013.",
          "url": "http://arxiv.org/abs/1306.2301"
        },
        {
          "n": 292,
          "cita": "Thomas Santoli and Christian Schaffner Using Simon's algorithm to attack symmetric-key cryptographic primitives arXiv:1603.07856 , 2016.",
          "url": "http://arxiv.org/abs/1603.07856"
        },
        {
          "n": 315,
          "cita": "Gilles Brassard, Peter Høyer, and Alain Tapp Quantum cryptanalysis of hash and claw-free functions In Proceedings of the 3rd Latin American symposium on Theoretical Informatics (LATIN'98) , pg. 163-169, 1998.",
          "url": null
        },
        {
          "n": 316,
          "cita": "Daniel J. Bernstein Cost analysis of hash collisions: Will quantum computers make SHARCS obsolete? In Proceedings of the 4th Workshop on Special-purpose Hardware for Attacking Cryptographic Systems (SHARCS'09) , pg. 105-116, 2009. [available here ]",
          "url": "https://cr.yp.to/hash/collisioncost-20090517.pdf"
        },
        {
          "n": 536,
          "cita": "André Chailloux and Johanna Loyer Lattice Sieving via Quantum Random Walks In Proceedings of Asiacrypt , pg. 63-91, 2021. [ arXiv:2105.05608 ]",
          "url": "https://arxiv.org/abs/2105.05608"
        },
        {
          "n": 537,
          "cita": "Lior Eldar and Sean Hallgren An efficient quantum algorithm for lattice problems achieving subexponential approximation factor arXiv:2201.13450 , 2022.",
          "url": "https://arxiv.org/abs/2201.13450"
        },
        {
          "n": 538,
          "cita": "Leo Ducas and Wessel van Woerden A note on a Claim of Eldar and Hallgren: LLL already solves it github , 2021.",
          "url": "https://github.com/lducas/BDD-note"
        },
        {
          "n": 539,
          "cita": "Yu-Ao Chen and Xiao-Shan Gao Quantum Algorithm for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems Journal of Systems Science and Complexity 35, 373-412, 2022. [ arXiv:1712.06239 ]",
          "url": "https://arxiv.org/abs/1712.06239"
        },
        {
          "n": 540,
          "cita": "Yu-Ao Chen, Xiao-Shan Gao, and Chun-Ming Yuan Quantum Algorithm for Optimization and Polynomial System Solving over Finite Field and Application to Cryptanalysis Journal of Systems Science and Complexity , 2025. [ arXiv:1802.03856 ]",
          "url": "https://arxiv.org/abs/1802.03856"
        },
        {
          "n": 541,
          "cita": "Jintai Ding, Vlad Gheorghiu, András Gilyén, Sean Hallgren, and Jianqiang Li Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems Quantum 7, 1069, 2023. [ arXiv:2111.00405 ]",
          "url": "https://arxiv.org/abs/2111.00405"
        }
      ],
      "n_referencias": 23,
      "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."
      }
    },
    {
      "id": "searching",
      "nombre": "Searching",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Encontrar la aguja en un pajar sin estructura: buscar un elemento marcado entre N con solo un oraculo que responde si/no. Es Grover.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/quantum_counting"
        },
        {
          "nombre": "Cirq",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/grover.py"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/qml/demos/tutorial_grovers_algorithm"
        },
        {
          "nombre": "Cirq",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/grover.py"
        },
        {
          "nombre": "Qrisp (Grover)",
          "url": "https://qrisp.eu/reference/Algorithms/Grover.html"
        },
        {
          "nombre": "Qrisp (Quantum Counting)",
          "url": "https://qrisp.eu/reference/Algorithms/quantum_counting.html"
        },
        {
          "nombre": "Qrisp (Amplitude Amplification)",
          "url": "https://qrisp.eu/reference/Primitives/amplitude_amplification.html"
        }
      ],
      "referencias": [
        {
          "n": 15,
          "cita": "M. Boyer, G. Brassard, P. Høyer, and A. Tapp Tight bounds on quantum searching. Fortschritte der Physik , 46:493-505, 1998.",
          "url": null
        },
        {
          "n": 16,
          "cita": "G. Brassard, P. Høyer, and A. Tapp Quantum counting. arXiv:quant-ph/9805082 , 1998.",
          "url": "http://arxiv.org/abs/quant-ph/9805082"
        },
        {
          "n": 17,
          "cita": "Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp Quantum amplitude amplification and estimation. In Samuel J. Lomonaco Jr. and Howard E. Brandt, editors, Quantum Computation and Quantum Information: A Millennium Volume , volume 305 of AMS Contemporary Mathematics Series . American Mathematical Society, 2002. [ arXiv:quant-ph/0005055 ]",
          "url": "http://arxiv.org/abs/quant-ph/0005055"
        },
        {
          "n": 35,
          "cita": "Christoph Dürr and Peter Høyer A quantum algorithm for finding the minimum. arXiv:quant-ph/9607014 , 1996.",
          "url": "http://arxiv.org/abs/quant-ph/9607014"
        },
        {
          "n": 48,
          "cita": "Lov K. Grover Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters , 79(2):325-328, 1997. [ arXiv:quant-ph/9605043 ]",
          "url": "http://arxiv.org/abs/quant-ph/9605043"
        },
        {
          "n": 73,
          "cita": "M. Mosca Quantum searching, counting, and amplitude amplification by eigenvector analysis. In R. Freivalds, editor, Proceedings of International Workshop on Randomized Algorithms , pages 90-100, 1998.",
          "url": null
        },
        {
          "n": 75,
          "cita": "Ashwin Nayak and Felix Wu The quantum query complexity of approximating the median and related statistics. In Proceedings of 31st ACM Symposium on the Theory of Computing , 1999. [ arXiv:quant-ph/9804066 ]",
          "url": "http://arxiv.org/abs/quant-ph/9804066"
        },
        {
          "n": 77,
          "cita": "Erich Novak Quantum complexity of integration. Journal of Complexity , 17:2-16, 2001. [ arXiv:quant-ph/0008124 ]",
          "url": "http://arxiv.org/abs/quant-ph/0008124"
        },
        {
          "n": 100,
          "cita": "Eli Biham, Ofer Biham, David Biron, Markus Grassl, and Daniel Lidar Grover's quantum search algorithm for an arbitrary initial amplitude distribution. Physical Review A , 60(4):2742, 1999. [ arXiv:quant-ph/9807027 and arXiv:quant-ph/0010077 ]",
          "url": "http://arxiv.org/abs/quant-ph/9807027"
        },
        {
          "n": 123,
          "cita": "Ashley Montanaro Quantum search with advice. In Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography (TQC 2010) [ arXiv:0908.3066 ]",
          "url": "http://arxiv.org/abs/0908.3066"
        },
        {
          "n": 133,
          "cita": "Andris Ambainis Quantum Search Algorithms. SIGACT News , 35 (2):22-35, 2004. [ arXiv:quant-ph/0504012 ]",
          "url": "http://arxiv.org/abs/quant-ph/0504012"
        },
        {
          "n": 134,
          "cita": "Nicolas J. Cerf, Lov K. Grover, and Colin P. Williams Nested quantum search and NP-hard problems. Applicable Algebra in Engineering, Communication and Computing , 10 (4-5):311-338, 2000.",
          "url": null
        },
        {
          "n": 138,
          "cita": "Andris Ambainis Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations. arXiv:1010.4458 , 2010.",
          "url": "http://arxiv.org/abs/1010.4458"
        },
        {
          "n": 208,
          "cita": "Lov Grover Fixed-point quantum search. Phys. Rev. Lett. 95(15):150501, 2005. [ arXiv:quant-ph/0503205 ]",
          "url": "http://arxiv.org/abs/quant-ph/0503205"
        },
        {
          "n": 209,
          "cita": "Tathagat Tulsi, Lov Grover, and Apoorva Patel A new algorithm for fixed point quantum search. Quantum Information and Computation 6(6):483-494, 2005. [ arXiv:quant-ph/0505007 ]",
          "url": "http://arxiv.org/abs/quant-ph/0505007"
        },
        {
          "n": 216,
          "cita": "Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani Strengths and weaknesses of quantum computing SIAM J. Comput. 26(5):1524-1540, 1997 [ arXiv:quant-ph/9701001 ]",
          "url": "http://arxiv.org/abs/quant-ph/9701001"
        },
        {
          "n": 255,
          "cita": "L. A. B. Kowada, C. Lavor, R. Portugal, and C. M. H. de Figueiredo A new quantum algorithm for solving the minimum searching problem International Journal of Quantum Information, Vol. 6, No. 3, pg. 427-436 , 2008.",
          "url": null
        },
        {
          "n": 261,
          "cita": "David Cornwell Amplified Quantum Transforms arXiv:1406.0190 , 2015.",
          "url": "http://arxiv.org/abs/1406.0190"
        },
        {
          "n": 262,
          "cita": "T. Laarhoven, M. Mosca, and J. van de Pol Solving the shortest vector problem in lattices faster using quantum search Proceedings of PQCrypto13 , pp. 83-101, 2013. [ arXiv:1301.6176 ]",
          "url": "http://arxiv.org/abs/1301.6176"
        },
        {
          "n": 274,
          "cita": "Andrew Childs and Jeffrey Goldstone Spatial search by quantum walk Physical Review A , 70:022314, 2004. [ arXiv:quant-ph/0306054 ]",
          "url": "http://arxiv.org/abs/quant-ph/0306054"
        },
        {
          "n": 275,
          "cita": "Shantanav Chakraborty, Leonardo Novo, Andris Ambainis, and Yasser Omar Spatial search by quantum walk is optimal for almost all graphs arXiv:1508.01327 , 2015.",
          "url": "http://arxiv.org/abs/1508.01327"
        },
        {
          "n": 303,
          "cita": "Thomas G. Wong Quantum walk search on Johnson graphs arXiv:1601.04212 , 2016.",
          "url": "http://arxiv.org/abs/1601.04212"
        },
        {
          "n": 304,
          "cita": "Jonatan Janmark, David A. Meyer, and Thomas G. Wong Global symmetry is unnecessary for fast quantum search Physical Review Letters 112:210502, 2014. [ arXiv:1403.2228 ]",
          "url": "http://arxiv.org/abs/1403.2228"
        },
        {
          "n": 305,
          "cita": "David A. Meyer and Thomas G. Wong Connectivity is a poor indicator of fast quantum search Physical Review Letters 114:110503, 2014. [ arXiv:1409.5876 ]",
          "url": "http://arxiv.org/abs/1409.5876"
        },
        {
          "n": 306,
          "cita": "Thomas G. Wong Spatial search by continuous-time quantum walk with multiple marked vertices Quantum Information Processing 15(4):1411-1443, 2016. [ arXiv:1501.07071 ]",
          "url": "http://arxiv.org/abs/1409.5876"
        },
        {
          "n": 330,
          "cita": "Peter Høyer and Mojtaba Komeili Efficient quantum walk on the grid with multiple marked elements Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) , 42, 2016. [ arXiv:1612.08958 ]",
          "url": "https://arxiv.org/abs/1612.08958"
        },
        {
          "n": 405,
          "cita": "Kun Zhang and Vladimir E. Korepin Low depth quantum search algorithm arXiv:1908.04171 , 2019.",
          "url": "https://arxiv.org/abs/1908.04171"
        },
        {
          "n": 433,
          "cita": "András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics Proceedings of STOC 2019 , pg. 193-204 [ arXiv:1806.01838 ]",
          "url": "https://arxiv.org/abs/1806.01838"
        },
        {
          "n": 465,
          "cita": "Robin Kothari and Ryan O'Donnell Mean estimation when you have the source code; or, quantum Monte Carlo methods Proceedings of SODA23 , 1186-1215, 2023. [ arXiv:2208.07544 ]",
          "url": "https://arxiv.org/abs/2208.07544"
        },
        {
          "n": 472,
          "cita": "Arjan Cornelissen, Yassine Hamoudi, Sofiene Jerbi Near-optimal quantum algorithms for multivariate mean estimation Proceedings of STOC22 , 33-43, 2022. [ arXiv:2111.09787 ]",
          "url": "https://arxiv.org/abs/2111.09787"
        },
        {
          "n": 492,
          "cita": "Alexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, and Fernando G.S.L. Brandão Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end Proceedings of STOC23 , 1131 - 1144, 2023. [ arXiv:2212.01513 ]",
          "url": "https://arxiv.org/abs/2212.01513"
        },
        {
          "n": 493,
          "cita": "M. B. Hastings A short path quantum algorithm for exact optimization Quantum , 2:78, 2018. [ arXiv:1802.10124 ]",
          "url": "https://arxiv.org/abs/1802.10124"
        }
      ],
      "n_referencias": 32,
      "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."
      }
    },
    {
      "id": "abelian-hidden-subgroup",
      "nombre": "Abelian Hidden Subgroup",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Hallar un subgrupo oculto de un grupo conmutativo consultando una funcion que es constante en cada coclase. Es el patron comun detras de Shor: factorizar, logaritmo discreto y Pell se reducen todos a esto.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#abelian_HSP",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/simon"
        },
        {
          "nombre": "Cirq",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/simon_algorithm.py"
        }
      ],
      "referencias": [
        {
          "n": 14,
          "cita": "D. Boneh and R. J. Lipton Quantum cryptanalysis of hidden linear functions. In Don Coppersmith, editor, CRYPTO '95 , Lecture Notes in Computer Science, pages 424-437. Springer-Verlag, 1995.",
          "url": null
        },
        {
          "n": 30,
          "cita": "J. Niel de Beaudrap, Richard Cleve, and John Watrous Sharp quantum versus classical query complexity separations. Algorithmica , 34(4):449-461, 2002. [ arXiv:quant-ph/0011065v2 ]",
          "url": "http://arxiv.org/abs/quant-ph/0011065"
        },
        {
          "n": 76,
          "cita": "Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information . Cambridge University Press, Cambridge, UK, 2000.",
          "url": null
        },
        {
          "n": 108,
          "cita": "D. Simon On the Power of Quantum Computation. In Proceedings of the 35th Symposium on Foundations of Computer Science , pg. 116-123, 1994.",
          "url": null
        },
        {
          "n": 388,
          "cita": "Lisa Hales and Sean Hallgren An improved quantum Fourier transform algorithm and applications. In Proceedings of FOCS 2000 , pg. 515-525.",
          "url": null
        },
        {
          "n": 389,
          "cita": "Igor Shparlinski and Arne Winterhof Quantum period reconstruction of approximate sequences Information Processing Letters , 103:211-215, 2007.",
          "url": null
        }
      ],
      "n_referencias": 6,
      "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."
      }
    },
    {
      "id": "non-abelian-hidden-subgroup",
      "nombre": "Non-Abelian Hidden Subgroup",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "El mismo problema sobre grupos no conmutativos. Resolverlo en general daria ataque a isomorfismo de grafos y a reticulos, y sigue abierto.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#nonabelian_HSP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 9,
          "cita": "Dave Bacon, Andrew M. Childs, and Wim van Dam From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science , pages 469-478, 2005. [ arXiv:quant-ph/0504083 ]",
          "url": "http://arxiv.org/abs/quant-ph/0504083"
        },
        {
          "n": 22,
          "cita": "Dong Pyo Chi, Jeong San Kim, and Soojoon Lee Notes on the hidden subgroup problem on some semi-direct product groups. Phys. Lett. A 359(2):114-116, 2006. [ arXiv:quant-ph/0604172 ]",
          "url": "http://arxiv.org/abs/quant-ph/0604172"
        },
        {
          "n": 28,
          "cita": "Andrew M. Childs and Wim van Dam Quantum algorithm for a generalized hidden shift problem. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms , pages 1225-1232, 2007. [ arXiv:quant-ph/0507190 ]",
          "url": "http://arxiv.org/abs/quant-ph/0507190"
        },
        {
          "n": 37,
          "cita": "Mark Ettinger, Peter Høyer, and Emanuel Knill The quantum query complexity of the hidden subgroup problem is polynomial. Information Processing Letters , 91(1):43-48, 2004. [ arXiv:quant-ph/0401083 ]",
          "url": "http://arxiv.org/abs/quant-ph/0401083"
        },
        {
          "n": 43,
          "cita": "K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen Hidden translation and translating coset in quantum computing. SIAM Journal on Computing Vol. 43, pp. 1-24, 2014. Appeared earlier in Proceedings of the 35th ACM Symposium on Theory of Computing , pages 1-9, 2003. [ arXiv:quant-ph/0211091 ]",
          "url": "http://arxiv.org/abs/quant-ph/0211091"
        },
        {
          "n": 44,
          "cita": "D. Gavinsky Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian-groups. Quantum Information and Computation , 4:229-235, 2004.",
          "url": null
        },
        {
          "n": 51,
          "cita": "Sean Hallgren, Alexander Russell, and Amnon Ta-Shma Normal subgroup reconstruction and quantum computation using group representations. SIAM Journal on Computing , 32(4):916-934, 2003.",
          "url": null
        },
        {
          "n": 53,
          "cita": "Yoshifumi Inui and François Le Gall Efficient quantum algorithms for the hidden subgroup problem over a class of semi-direct product groups. Quantum Information and Computation , 7(5/6):559-570, 2007. [ arXiv:quant-ph/0412033 ]",
          "url": "http://arxiv.org/abs/quant-ph/0412033"
        },
        {
          "n": 55,
          "cita": "Gábor Ivanyos, Frédéric Magniez, and Miklos Santha Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures , pages 263-270, 2001. [ arXiv:quant-ph/0102014 ]",
          "url": "http://arxiv.org/abs/quant-ph/0102014"
        },
        {
          "n": 56,
          "cita": "Gábor Ivanyos, Luc Sanselme, and Miklos Santha An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups. In Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science , 2007. [ arXiv:quant-ph/0701235 ]",
          "url": "http://arxiv.org/abs/quant-ph/0701235"
        },
        {
          "n": 57,
          "cita": "Gábor Ivanyos, Luc Sanselme, and Miklos Santha An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. In LATIN 2008: Theoretical Informatics , pg. 759-771, Springer (LNCS 4957). [ arXiv:0707.1260 ]",
          "url": "http://arxiv.org/abs/0707.1260"
        },
        {
          "n": 66,
          "cita": "Greg Kuperberg A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM Journal on Computing , 35(1):170-188, 2005. [ arXiv:quant-ph/0302112 ]",
          "url": "http://arxiv.org/abs/quant-ph/0302112"
        },
        {
          "n": 69,
          "cita": "Chris Lomont The hidden subgroup problem - review and open problems. arXiv:quant-ph/0411037 , 2004.",
          "url": "http://arxiv.org/abs/quant-ph/0411037"
        },
        {
          "n": 71,
          "cita": "Carlos Magno, M. Cosme, and Renato Portugal Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups. arXiv:quant-ph/0703223 , 2007.",
          "url": "http://arxiv.org/abs/quant-ph/0703223"
        },
        {
          "n": 72,
          "cita": "Cristopher Moore, Daniel Rockmore, Alexander Russell, and Leonard Schulman The power of basis selection in Fourier sampling: the hidden subgroup problem in affine groups. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms , pages 1113-1122, 2004. [ arXiv:quant-ph/0211124 ]",
          "url": "http://arxiv.org/abs/quant-ph/0211124"
        },
        {
          "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": 79,
          "cita": "Oded Regev A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space. arXiv:quant-ph/0406151 , 2004.",
          "url": "http://arxiv.org/abs/quant-ph/0406151"
        },
        {
          "n": 81,
          "cita": "Martin Roetteler and Thomas Beth Polynomial-time solution to the hidden subgroup problem for a class of non-abelian groups. arXiv:quant-ph/9812070 , 1998.",
          "url": "http://arxiv.org/abs/quant-ph/9812070"
        },
        {
          "n": 126,
          "cita": "Aaron Denney, Cristopher Moore, and Alex Russell Finding conjugate stabilizer subgroups in PSL(2;q) and related groups. Quantum Information and Computation 10(3):282-291, 2010. [ arXiv:0809.2445 ]",
          "url": "http://arxiv.org/abs/0809.2445"
        },
        {
          "n": 207,
          "cita": "Nolan Wallach A quantum polylog algorithm for non-normal maximal cyclic hidden subgroups in the affine group of a finite field. arXiv:1308.1415 , 2013.",
          "url": "http://arxiv.org/abs/1308.1415"
        },
        {
          "n": 218,
          "cita": "Greg Kuperberg Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem In Proceedings of TQC pg. 20-34, 2013 [ arXiv:1112.3333 ]",
          "url": "http://arxiv.org/abs/1112.3333"
        },
        {
          "n": 273,
          "cita": "Juan Bermejo-Vega and Kevin C. Zatloukal Abelian hypergroups and quantum computation arXiv:1509.05806 , 2015.",
          "url": "http://arxiv.org/abs/1509.05806"
        },
        {
          "n": 311,
          "cita": "Aram W. Harrow and Ashley Montanaro Sequential measurements, disturbance, and property testing arXiv:1607.03236 , 2016.",
          "url": "http://arxiv.org/abs/1607.03236"
        },
        {
          "n": 312,
          "cita": "Martin Roetteler Quantum algorithms for abelian difference sets and applications to dihedral hidden subgroups arXiv:1608.02005 , 2016.",
          "url": "http://arxiv.org/abs/1608.02005"
        }
      ],
      "n_referencias": 24,
      "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."
      }
    },
    {
      "id": "bernstein-vazirani",
      "nombre": "Bernstein-Vazirani",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Recuperar una cadena secreta oculta en una funcion lineal, consultandola lo menos posible.",
      "speedup_declarado": "Polynomial Directly, Superpolynomial Recursively",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/bernstein_vazirani"
        },
        {
          "nombre": "Cirq",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/bernstein_vazirani.py"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/qml/demos/tutorial_qutrits_bernstein_vazirani"
        }
      ],
      "referencias": [
        {
          "n": 11,
          "cita": "Ethan Bernstein and Umesh Vazirani Quantum complexity theory. In Proceedings of the 25th ACM Symposium on the Theory of Computing , pages 11-20, 1993.",
          "url": null
        },
        {
          "n": 256,
          "cita": "Sean Hallgren and Aram Harrow Superpolynomial speedups based on almost any quantum circuit Proceedings of ICALP 2008 , pg. 782-795. [ arXiv:0805.0007 ]",
          "url": "http://arxiv.org/abs/0805.0007"
        },
        {
          "n": 257,
          "cita": "Fernando G.S.L. Brandao and Michal Horodecki Exponential quantum speed-ups are generic Quantum Information and Computation , Vol. 13, Pg. 0901, 2013 [ arXiv:1010.3654 ]",
          "url": "http://arxiv.org/abs/1010.3654"
        },
        {
          "n": 258,
          "cita": "Scott Aaronson and Andris Ambainis Forrelation: A problem that optimally separates quantum from classical computing. arXiv:1411.5729 , 2014.",
          "url": "http://arxiv.org/abs/1411.5729"
        },
        {
          "n": 270,
          "cita": "Scott Aaronson, Shalev Ben-David, and Robin Kothari Separations in query complexity using cheat sheets arXiv:1511.01937 , 2015.",
          "url": "http://arxiv.org/abs/1511.01937"
        }
      ],
      "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."
      }
    },
    {
      "id": "deutsch-jozsa",
      "nombre": "Deutsch-Jozsa",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Decidir si una funcion booleana es constante o balanceada con una sola consulta. Es el primer separador historico entre cuantico y clasico.",
      "speedup_declarado": "Exponential over P, none over BPP",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/deutsch_josza"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/codebook/basic-quantum-algorithms/deutsch-jozsa"
        }
      ],
      "referencias": [
        {
          "n": 32,
          "cita": "David Deutsch Quantum theory, the Church-Turing principle, and the universal quantum computer. Proceedings of the Royal Society of London Series A , 400:97-117, 1985.",
          "url": null
        },
        {
          "n": 33,
          "cita": "David Deutsch and Richard Jozsa Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London Series A , 493:553-558, 1992.",
          "url": null
        },
        {
          "n": 259,
          "cita": "Z. Gedik Computational speedup with a single qutrit arXiv:1403.5861 , 2014.",
          "url": "http://arxiv.org/abs/1403.5861"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "formula-evaluation",
      "nombre": "Formula Evaluation",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Evaluar el valor de una formula booleana (AND/OR/NOT) accediendo a sus entradas por oraculo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 8,
          "cita": "Andris Ambainis, Andrew M. Childs, Ben W.Reichardt, Robert Špalek, and Shengyu Zheng Every AND-OR formula of size N can be evaluated in time \\( n^{1/2+o(1)} \\) on a quantum computer. In Proceedings of the 48th IEEE Symposium on the Foundations of Computer Science , pages 363-372, 2007. [ arXiv:quant-ph/0703015 and arXiv:0704.3628 ]",
          "url": "http://arxiv.org/abs/quant-ph/0703015"
        },
        {
          "n": 27,
          "cita": "Andrew M. Childs, Richard Cleve, Stephen P. Jordan, and David Yonge-Mallo Discrete-query quantum algorithm for NAND trees. Theory of Computing , 5:119-123, 2009. [ arXiv:quant-ph/0702160 ]",
          "url": "http://arxiv.org/abs/quant-ph/0702160"
        },
        {
          "n": 29,
          "cita": "Richard Cleve, Dmitry Gavinsky, and David L. Yonge-Mallo Quantum algorithms for evaluating MIN-MAX trees. In Theory of Quantum Computation, Communication, and Cryptography , pages 11-15, Springer, 2008. (LNCS Vol. 5106) [ arXiv:0710.5794 ]",
          "url": "http://arxiv.org/abs/0710.5794"
        },
        {
          "n": 38,
          "cita": "Edward Farhi, Jeffrey Goldstone, and Sam Gutmann A quantum algorithm for the Hamiltonian NAND tree. Theory of Computing 4:169-190, 2008. [ arXiv:quant-ph/0702144 ]",
          "url": "http://arxiv.org/abs/quant-ph/0702144"
        },
        {
          "n": 80,
          "cita": "Ben Reichardt and Robert Špalek Span-program-based quantum algorithm for evaluating formulas. Proceedings of STOC 2008 [ arXiv:0710.2630 ]",
          "url": "http://arxiv.org/abs/0710.2630"
        },
        {
          "n": 101,
          "cita": "Andrew Childs, Shelby Kimmel, and Robin Kothari The quantum query complexity of read-many formulas In Proceedings of ESA 2012 , pg. 337-348, Springer. (LNCS 7501) [ arXiv:1112.0548 ]",
          "url": "http://arxiv.org/abs/1112.0548"
        },
        {
          "n": 149,
          "cita": "Ben Reichardt Span programs and quantum query complexity: The general adversary bound is nearly tight for every Boolean function. In Proceedings of the 50th IEEE Symposium on Foundations of Computer Science (FOCS '09) , pg. 544-551, 2009. [ arXiv:0904.2759 ]",
          "url": "http://arxiv.org/abs/0904.2759"
        },
        {
          "n": 158,
          "cita": "Ben W. Reichardt Reflections for quantum query algorithms. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA) , pg. 560-569, 2011. [ arXiv:1005.1601 ]",
          "url": "http://arxiv.org/abs/1005.1601"
        },
        {
          "n": 159,
          "cita": "Ben W. Reichardt Span-program-based quantum algorithm for evaluating unbalanced formulas. arXiv:0907.1622 , 2009.",
          "url": "http://arxiv.org/abs/0907.1622"
        },
        {
          "n": 160,
          "cita": "Ben W. Reichardt Faster quantum algorithm for evaluating game trees. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA) , pg. 546-559, 2011. [ arXiv:0907.1623 ]",
          "url": "http://arxiv.org/abs/0907.1623"
        },
        {
          "n": 164,
          "cita": "Bohua Zhan, Shelby Kimmel, and Avinatan Hassidim Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure. ITCS 2012: Proceedings of the 3rd Innovations in Theoretical Computer Science , ACM, pg. 249-265. [ arXiv:1101.0796 ]",
          "url": "http://arxiv.org/abs/1101.0796"
        },
        {
          "n": 165,
          "cita": "Shelby Kimmel Quantum adversary (upper) bound. 39th International Colloquium on Automata, Languages and Programming - ICALP 2012 Volume 7391, p. 557-568. [ arXiv:1101.0797 ]",
          "url": "http://arxiv.org/abs/1101.0797"
        },
        {
          "n": 269,
          "cita": "Stacey Jeffery and Shelby Kimmel NAND-trees, average choice complexity, and effective resistance arXiv:1511.02235 , 2015.",
          "url": "http://arxiv.org/abs/1511.02235"
        }
      ],
      "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."
      }
    },
    {
      "id": "hidden-shift",
      "nombre": "Hidden Shift",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Dadas dos funciones que difieren por un corrimiento desconocido, hallar ese corrimiento.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/hidden_shift"
        },
        {
          "nombre": "Cirq",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/hidden_shift_algorithm.py"
        }
      ],
      "referencias": [
        {
          "n": 43,
          "cita": "K. Friedl, G. Ivanyos, F. Magniez, M. Santha, and P. Sen Hidden translation and translating coset in quantum computing. SIAM Journal on Computing Vol. 43, pp. 1-24, 2014. Appeared earlier in Proceedings of the 35th ACM Symposium on Theory of Computing , pages 1-9, 2003. [ arXiv:quant-ph/0211091 ]",
          "url": "http://arxiv.org/abs/quant-ph/0211091"
        },
        {
          "n": 66,
          "cita": "Greg Kuperberg A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM Journal on Computing , 35(1):170-188, 2005. [ arXiv:quant-ph/0302112 ]",
          "url": "http://arxiv.org/abs/quant-ph/0302112"
        },
        {
          "n": 86,
          "cita": "Wim van Dam Quantum algorithms for weighing matrices and quadratic residues. Algorithmica , 34(4):413-428, 2002. [ arXiv:quant-ph/0008059 ]",
          "url": "http://arxiv.org/abs/quant-ph/0008059"
        },
        {
          "n": 88,
          "cita": "Wim van Dam and Sean Hallgren Efficient quantum algorithms for shifted quadratic character problems. arXiv:quant-ph/0011067 , 2000.",
          "url": "http://arxiv.org/abs/quant-ph/0011067"
        },
        {
          "n": 89,
          "cita": "Wim van Dam, Sean Hallgren, and Lawrence Ip Quantum algorithms for some hidden shift problems. SIAM Journal on Computing , 36(3):763-778, 2006. [ arXiv:quant-h/0211140 ]",
          "url": "http://arxiv.org/abs/quant-ph/0211140"
        },
        {
          "n": 105,
          "cita": "Martin Roetteler Quantum algorithms for highly non-linear Boolean functions. Proceedings of SODA 2010 [ arXiv:0811.3208 ]",
          "url": "http://arxiv.org/abs/0811.3208"
        },
        {
          "n": 130,
          "cita": "Martin Rötteler Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm. In Proceedings of MFCS 2009 , pg 663-674. [ arXiv:0911.4724 ]",
          "url": "http://arxiv.org/abs/0911.4724"
        },
        {
          "n": 142,
          "cita": "Dmitry Gavinsky, Martin Roetteler, and Jérémy Roland Quantum algorithm for the Boolean hidden shift problem. In Proceedings of the 17th annual international conference on Computing and combinatorics (COCOON '11) , 2011. [ arXiv:1103.3017 ]",
          "url": "http://arxiv.org/abs/1103.3017"
        },
        {
          "n": 143,
          "cita": "Mark Ettinger and Peter Høyer On quantum algorithms for noncommutative hidden subgroups. Advances in Applied Mathematics , Vol. 25, No. 3, pg. 239-251, 2000. [ arXiv:quant-ph/9807029 ]",
          "url": "http://arxiv.org/abs/quant-ph/9807029"
        },
        {
          "n": 312,
          "cita": "Martin Roetteler Quantum algorithms for abelian difference sets and applications to dihedral hidden subgroups arXiv:1608.02005 , 2016.",
          "url": "http://arxiv.org/abs/1608.02005"
        },
        {
          "n": 407,
          "cita": "Gábor Ivanyos, Anupam Prakash, and Miklos Santha On learning linear functions from subset and its applications in quantum computing 26th Annual European Symposium on Algorithms (ESA 2018) , LIPIcs volume 112, 2018. [ arXiv:1806.09660 ]",
          "url": "https://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16083"
        },
        {
          "n": 408,
          "cita": "Gábor Ivanyos On solving systems of random linear disequations Quantum Information and Computation , 8(6):579-594, 2008. [ arXiv:0704.2988 ]",
          "url": "https://arxiv.org/abs/0704.2988"
        }
      ],
      "n_referencias": 12,
      "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."
      }
    },
    {
      "id": "polynomial-interpolation",
      "nombre": "Polynomial interpolation",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Reconstruir los coeficientes de un polinomio consultandolo en puntos.",
      "speedup_declarado": "Varies",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 89,
          "cita": "Wim van Dam, Sean Hallgren, and Lawrence Ip Quantum algorithms for some hidden shift problems. SIAM Journal on Computing , 36(3):763-778, 2006. [ arXiv:quant-h/0211140 ]",
          "url": "http://arxiv.org/abs/quant-ph/0211140"
        },
        {
          "n": 360,
          "cita": "Dan Boneh and Mark Zhandry Quantum-secure message authentication codes In Proceedings of Eurocrypt , pg. 592-608, 2013.",
          "url": null
        },
        {
          "n": 361,
          "cita": "A. M. Childs, W. van Dam, S-H Hung, and I. E. Shparlinski Optimal quantum algorithm for polynomial interpolation In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP) , pg. 16:1-16:13, 2016. [ arXiv:1509.09271 ]",
          "url": "https://arxiv.org/abs/1509.09271"
        },
        {
          "n": 387,
          "cita": "Jianxin Chen, Andrew M. Childs, and Shih-Han Hung Quantum algorithm for multivariate polynomial interpolation Proceedings of the Royal Society A , 474:20170480, 2017. arXiv:1701.03990",
          "url": "http://arxiv.org/abs/1701.03990"
        },
        {
          "n": 390,
          "cita": "Alexander Russell and Igor E. Shparlinski Classical and quantum function reconstruction via character evaluation Journal of Complexity , 20:404-422, 2004.",
          "url": null
        },
        {
          "n": 391,
          "cita": "Sean Hallgren, Alexander Russell, and Igor Shparlinski Quantum noisy rational function reconstruction Proceedings of COCOON 2005 , pg. 420-429.",
          "url": null
        },
        {
          "n": 392,
          "cita": "G. Ivanyos, M. Karpinski, M. Santha, N. Saxena, and I. Shparlinski Polynomial interpolation and identity testing from high powers over finite fields Algorithmica , 80:560-575, 2017.",
          "url": null
        }
      ],
      "n_referencias": 7,
      "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."
      }
    },
    {
      "id": "pattern-matching",
      "nombre": "Pattern matching",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Localizar un patron dentro de un texto largo.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 66,
          "cita": "Greg Kuperberg A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM Journal on Computing , 35(1):170-188, 2005. [ arXiv:quant-ph/0302112 ]",
          "url": "http://arxiv.org/abs/quant-ph/0302112"
        },
        {
          "n": 215,
          "cita": "Ashley Montanaro Quantum pattern matching fast on average arXiv:1408.1816",
          "url": "http://arxiv.org/abs/1408.1816"
        },
        {
          "n": 216,
          "cita": "Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani Strengths and weaknesses of quantum computing SIAM J. Comput. 26(5):1524-1540, 1997 [ arXiv:quant-ph/9701001 ]",
          "url": "http://arxiv.org/abs/quant-ph/9701001"
        },
        {
          "n": 217,
          "cita": "H. Ramesh and V. Vinay String matching in \\( \\widetilde{O}(\\sqrt{n} + \\sqrt{m}) \\) quantum time Journal of Discrete Algorithms 1:103-110, 2003 [ arXiv:quant-ph/0011049 ]",
          "url": "http://arxiv.org/abs/quant-ph/0011049"
        },
        {
          "n": 435,
          "cita": "Pradeep Niroula and Yunseong Nam A quantum algorithm for string matching NPJ Quantum Information , 7:37, 2021.",
          "url": null
        }
      ],
      "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."
      }
    },
    {
      "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."
      }
    },
    {
      "id": "graph-properties-in-the-adjacency-matrix-model",
      "nombre": "Graph Properties in the Adjacency Matrix Model",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Decidir propiedades de un grafo (conectividad, bipartito, ciclos) consultando su matriz de adyacencia.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 13,
          "cita": "A. Berzina, A. Dubrovsky, R. Frivalds, L. Lace, and O. Scegulnaja Quantum query complexity for some graph problems. In Proceedings of the 30th Conference on Current Trends in Theory and Practive of Computer Science , pages 140-150, 2004.",
          "url": null
        },
        {
          "n": 21,
          "cita": "Harry Burhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, and Ronald de Wolf Quantum algorithms for element distinctness. In Proceedings of the 16th IEEE Annual Conference on Computational Complexity , pages 131-137, 2001. [ arXiv:quant-ph/0007016 ]",
          "url": "http://arxiv.org/abs/quant-ph/0007016"
        },
        {
          "n": 34,
          "cita": "Christoph Dürr, Mark Heiligman, Peter Høyer, and Mehdi Mhalla Quantum query complexity of some graph problems. SIAM Journal on Computing , 35(6):1310-1328, 2006. [ arXiv:quant-ph/0401091 ]",
          "url": "http://arxiv.org/abs/quant-ph/0401091"
        },
        {
          "n": 35,
          "cita": "Christoph Dürr and Peter Høyer A quantum algorithm for finding the minimum. arXiv:quant-ph/9607014 , 1996.",
          "url": "http://arxiv.org/abs/quant-ph/9607014"
        },
        {
          "n": 36,
          "cita": "Christoph Dürr, Mehdi Mhalla, and Yaohui Lei Quantum query complexity of graph connectivity. arXiv:quant-ph/0303169 , 2003.",
          "url": "http://arxiv.org/abs/quant-ph/0303169"
        },
        {
          "n": 52,
          "cita": "Mark Heiligman Quantum algorithms for lowest weight paths and spanning trees in complete graphs. arXiv:quant-ph/0303131 , 2003.",
          "url": "http://arxiv.org/abs/quant-ph/0303131"
        },
        {
          "n": 70,
          "cita": "Frédéric Magniez, Miklos Santha, and Mario Szegedy Quantum algorithms for the triangle problem. SIAM Journal on Computing , 37(2):413-424, 2007. [ arXiv:quant-ph/0310134 ]",
          "url": "http://arxiv.org/abs/quant-ph/0310134"
        },
        {
          "n": 140,
          "cita": "Andrew Childs and Robin Kothari Quantum query complexity of minor-closed graph properties. In Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science (STACS 2011) , pg. 661-672 [ arXiv:1011.1443 ]",
          "url": "http://arxiv.org/abs/1011.1443"
        },
        {
          "n": 141,
          "cita": "Frédéric Magniez, Ashwin Nayak, Jérémie Roland, and Miklos Santha Search via quantum walk. In Proceedings STOC 2007 , pg. 575-584. [ arXiv:quant-ph/0608026 ]",
          "url": "http://arxiv.org/abs/quant-ph/0608026"
        },
        {
          "n": 152,
          "cita": "Aleksandrs Belovs Span programs for functions with constant-sized 1-certificates. In Proceedings of STOC 2012 , pg. 77-84. [ arXiv:1105.4024 ]",
          "url": "http://arxiv.org/abs/1105.4024"
        },
        {
          "n": 153,
          "cita": "Troy Lee, Frédéric Magniez, and Mikos Santha A learning graph based quantum query algorithm for finding constant-size subgraphs. Chicago Journal of Theoretical Computer Science , Vol. 2012, Article 10, 2012. [ arXiv:1109.5135 ]",
          "url": "http://arxiv.org/abs/1109.5135"
        },
        {
          "n": 171,
          "cita": "Stacey Jeffery, Robin Kothari, and Frédéric Magniez Nested quantum walks with quantum data structures. In Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA'13) , pg. 1474-1485, 2013. [ arXiv:1210.1199 ]",
          "url": "http://arxiv.org/abs/1210.1199"
        },
        {
          "n": 175,
          "cita": "Troy Lee, Frédéric Magniez, and Miklos Santha Improved quantum query algorithms for triangle finding and associativity testing. arXiv:1210.1014 , 2012.",
          "url": "http://arxiv.org/abs/1210.1014"
        },
        {
          "n": 240,
          "cita": "Guoming Wang Span-program-based quantum algorithm for tree detection arXiv:1309.7713 , 2013.",
          "url": "http://arxiv.org/abs/1309.7713"
        },
        {
          "n": 241,
          "cita": "François Le Gall, Harumichi Nishimura, and Seiichiro Tani Quantum algorithm for finding constant-sized sub-hypergraphs over 3-uniform hypergraphs In Proceedings of COCOON, 2014. pg. 429-440 [ arXiv:1310.4127 ]",
          "url": "http://arxiv.org/abs/1310.4127"
        },
        {
          "n": 272,
          "cita": "Agnis Āriņš Span-program-based quantum algorithms for graph bipartiteness and connectivity arXiv:1510.07825 , 2015.",
          "url": "http://arxiv.org/abs/1510.07825"
        },
        {
          "n": 276,
          "cita": "François Le Gall Improved quantum algorithm for triangle finding via combinatorial arguments In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science (FOCS) , pg. 216-225, 2014. [ arXiv:1407.0085 ]",
          "url": "http://arxiv.org/abs/1407.0085"
        },
        {
          "n": 317,
          "cita": "Chris Cade, Ashley Montanaro, and Aleksandrs Belovs Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness arXiv:1610.00581 , 2016.",
          "url": "http://arxiv.org/abs/1610.00581"
        },
        {
          "n": 318,
          "cita": "A. Belovs and B. Reichardt Span programs and quantum algorithms for st-connectivity and claw detection In European Symposium on Algorithms (ESA'12) , pg. 193-204, 2012. [ arXiv:1203.2603 ]",
          "url": "http://arxiv.org/abs/1203.2603"
        },
        {
          "n": 319,
          "cita": "Titouan Carette, Mathieu Laurière, and Frédéric Magniez Extended learning graphs for triangle finding arXiv:1609.07786 , 2016.",
          "url": "http://arxiv.org/abs/1609.07786"
        },
        {
          "n": 320,
          "cita": "F. Le Gall and N. Shogo Quantum algorithm for triangle finding in sparse graphs In Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC'15) , pg. 590-600, 2015.",
          "url": null
        }
      ],
      "n_referencias": 21,
      "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."
      }
    },
    {
      "id": "graph-properties-in-the-adjacency-list-model",
      "nombre": "Graph Properties in the Adjacency List Model",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Lo mismo, pero accediendo al grafo por listas de vecinos: el modelo cambia el costo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 34,
          "cita": "Christoph Dürr, Mark Heiligman, Peter Høyer, and Mehdi Mhalla Quantum query complexity of some graph problems. SIAM Journal on Computing , 35(6):1310-1328, 2006. [ arXiv:quant-ph/0401091 ]",
          "url": "http://arxiv.org/abs/quant-ph/0401091"
        },
        {
          "n": 144,
          "cita": "Andris Ambainis, Andrew Childs, and Yi-Kai Liu Quantum property testing for bounded-degree graphs. In Proceedings of RANDOM '11 : Lecture Notes in Computer Science 6845, pp. 365-376, 2011. [ arXiv:1012.3174 ]",
          "url": "http://arxiv.org/abs/1012.3174"
        },
        {
          "n": 317,
          "cita": "Chris Cade, Ashley Montanaro, and Aleksandrs Belovs Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness arXiv:1610.00581 , 2016.",
          "url": "http://arxiv.org/abs/1610.00581"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "welded-tree",
      "nombre": "Welded Tree",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Atravesar dos arboles binarios unidos por las hojas. Es el ejemplo limpio de separacion exponencial por caminata cuantica.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/glued_trees"
        }
      ],
      "referencias": [
        {
          "n": 26,
          "cita": "Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A. Spielman Exponential algorithmic speedup by quantum walk. In Proceedings of the 35th ACM Symposium on Theory of Computing , pages 59-68, 2003. [ arXiv:quant-ph/0209131 ]",
          "url": "http://arxiv.org/abs/quant-ph/0209131"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "collision-finding-and-element-distinctness",
      "nombre": "Collision Finding and Element Distinctness",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Hallar dos entradas con la misma salida, o decidir si todos los elementos de una lista son distintos.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 7,
          "cita": "Andris Ambainis Quantum walk algorithm for element distinctness. SIAM Journal on Computing , 37:210-239, 2007. [ arXiv:quant-ph/0311001 ]",
          "url": "http://arxiv.org/abs/quant-ph/0311001"
        },
        {
          "n": 18,
          "cita": "Gilles Brassard, Peter Høyer, and Alain Tapp Quantum algorithm for the collision problem. ACM SIGACT News , 28:14-19, 1997. [ arXiv:quant-ph/9705002 ]",
          "url": "http://arxiv.org/abs/quant-ph/9705002"
        },
        {
          "n": 21,
          "cita": "Harry Burhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, and Ronald de Wolf Quantum algorithms for element distinctness. In Proceedings of the 16th IEEE Annual Conference on Computational Complexity , pages 131-137, 2001. [ arXiv:quant-ph/0007016 ]",
          "url": "http://arxiv.org/abs/quant-ph/0007016"
        },
        {
          "n": 154,
          "cita": "Aleksandrs Belovs and Troy Lee Quantum algorithm for k-distinctness with prior knowledge on the input. arXiv:1108.3022 , 2011.",
          "url": "http://arxiv.org/abs/1108.3022"
        },
        {
          "n": 172,
          "cita": "Aleksandrs Belovs Learning-graph-based quantum algorithm for k-distinctness. Proceedings of STOC 2012 , pg. 77-84. [ arXiv:1205.1534 ]",
          "url": "http://arxiv.org/abs/1205.1534"
        },
        {
          "n": 173,
          "cita": "Andrew Childs, Stacey Jeffery, Robin Kothari, and Frédéric Magniez A time-efficient quantum walk for 3-distinctness using nested updates. arXiv:1302.7316 , 2013.",
          "url": "http://arxiv.org/abs/1302.7316"
        },
        {
          "n": 277,
          "cita": "Ashley Montanaro The quantum complexity of approximating the frequency moments arXiv:1505.00113 , 2015.",
          "url": "http://arxiv.org/abs/1505.00113"
        },
        {
          "n": 315,
          "cita": "Gilles Brassard, Peter Høyer, and Alain Tapp Quantum cryptanalysis of hash and claw-free functions In Proceedings of the 3rd Latin American symposium on Theoretical Informatics (LATIN'98) , pg. 163-169, 1998.",
          "url": null
        },
        {
          "n": 363,
          "cita": "Stacey Jeffery Frameworks for Quantum Algorithms PhD thesis, U. Waterloo, 2014.",
          "url": "http://uwspace.uwaterloo.ca/handle/10012/8710"
        },
        {
          "n": 364,
          "cita": "Seiichiro Tani An improved claw finding algorithm using quantum walk In Mathematical Foundations of Computer Science (MFCS) , pg. 536-547, 2007. [ arXiv:0708.2584 ]",
          "url": "https://arxiv.org/abs/0708.2584"
        },
        {
          "n": 365,
          "cita": "K. Iwama and A. Kawachi A new quantum claw-finding algorithm for three functions New Generation Computing , 21(4):319-327, 2003.",
          "url": null
        },
        {
          "n": 374,
          "cita": "Renato Portugal Element distinctness revisited arXiv:1711.11336 , 2017.",
          "url": "https://arxiv.org/abs/1711.11336"
        },
        {
          "n": 464,
          "cita": "Stacey Jeffery and Sebastian Zur Multidimensional quantum walks Proceedings of STOC23 , 1125-1130, 2023. [ arXiv:2208.13492 ]",
          "url": "https://arxiv.org/abs/2208.13492"
        },
        {
          "n": 535,
          "cita": "Xavier Bonnetain, André Chailloux, André Schrottenloher, and Yixin Shen Finding Many Collisions via Reusable Quantum Walks: Application to Lattice Sieving In Proceedings of Eurocrypt , pg. 221-251, 2022. [ arXiv:2205.14023 ]",
          "url": "https://arxiv.org/abs/2205.14023"
        }
      ],
      "n_referencias": 14,
      "remisiones": [
        {
          "ancla": "graph_collision",
          "url": "https://quantumalgorithmzoo.org/#graph_collision"
        }
      ],
      "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."
      }
    },
    {
      "id": "graph-collision",
      "nombre": "Graph Collision",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Decidir si existe un par de vertices vecinos marcados con 1, consultando el etiquetado por oraculo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#graph_collision",
      "implementaciones": [],
      "referencias": [
        {
          "n": 70,
          "cita": "Frédéric Magniez, Miklos Santha, and Mario Szegedy Quantum algorithms for the triangle problem. SIAM Journal on Computing , 37(2):413-424, 2007. [ arXiv:quant-ph/0310134 ]",
          "url": "http://arxiv.org/abs/quant-ph/0310134"
        },
        {
          "n": 161,
          "cita": "Stacey Jeffery, Robin Kothari, and Frédéric Magniez Improving quantum query complexity of Boolean matrix multiplication using graph collision. In Proceedings of ICALP 2012 , pg. 522-532. [ arXiv:1112.5855 ]",
          "url": "http://arxiv.org/abs/1112.5855"
        },
        {
          "n": 172,
          "cita": "Aleksandrs Belovs Learning-graph-based quantum algorithm for k-distinctness. Proceedings of STOC 2012 , pg. 77-84. [ arXiv:1205.1534 ]",
          "url": "http://arxiv.org/abs/1205.1534"
        },
        {
          "n": 200,
          "cita": "D. Gavinsky and T. Ito A quantum query algorithm for the graph collision problem. arXiv:1204.1527 , 2012.",
          "url": "http://arxiv.org/abs/1204.1527"
        },
        {
          "n": 201,
          "cita": "Andris Ambainis, Kaspars Balodis, Jānis Iraids, Raitis Ozols, and Juris Smotrovs Parameterized quantum query complexity of graph collision. arXiv:1305.1021 , 2013.",
          "url": "http://arxiv.org/abs/1305.1021"
        }
      ],
      "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."
      }
    },
    {
      "id": "matrix-commutativity",
      "nombre": "Matrix Commutativity",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Decidir si un conjunto de matrices conmuta entre si.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 54,
          "cita": "Yuki Kelly Itakura Quantum algorithm for commutativity testing of a matrix set. Master's thesis, University of Waterloo, 2005. [ arXiv:quant-ph/0509206 ]",
          "url": "http://arxiv.org/abs/quant-ph/0509206"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "group-commutativity",
      "nombre": "Group Commutativity",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Decidir si un grupo dado por sus generadores es conmutativo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 139,
          "cita": "Frédéric Magniez and Ashwin Nayak Quantum complexity of testing group commutativity. In Proceedings of 32nd International Colloquium on Automata, Languages and Programming. LNCS 3580, pg. 1312-1324, 2005. [ arXiv:quant-ph/0506265 ]",
          "url": "http://arxiv.org/abs/quant-ph/0506265"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "hidden-nonlinear-structures",
      "nombre": "Hidden Nonlinear Structures",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Hallar estructuras ocultas que no son subgrupos, sino objetos no lineales como esferas o conos.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 23,
          "cita": "A. M. Childs, L. J. Schulman, and U. V. Vazirani Quantum algorithms for hidden nonlinear structures. In Proceedings of the 48th IEEE Symposium on Foundations of Computer Science , pages 395-404, 2007. [ arXiv:0705.2784 ]",
          "url": "http://arxiv.org/abs/0705.2784"
        },
        {
          "n": 31,
          "cita": "Thomas Decker, Jan Draisma, and Pawel Wocjan Quantum algorithm for identifying hidden polynomials. Quantum Information and Computation , 9(3):215-230, 2009. [ arXiv:0706.1219 ]",
          "url": "http://arxiv.org/abs/0706.1219"
        },
        {
          "n": 212,
          "cita": "Thomas Decker, Peter Høyer, Gabor Ivanyos, and Miklos Santha Polynomial time quantum algorithms for certain bivariate hidden polynomial problems arXiv:1305.1543",
          "url": "http://arxiv.org/abs/1305.1543"
        }
      ],
      "n_referencias": 3,
      "remisiones": [
        {
          "ancla": "nonabelian_HSP",
          "url": "https://quantumalgorithmzoo.org/#nonabelian_HSP"
        }
      ],
      "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."
      }
    },
    {
      "id": "center-of-radial-function",
      "nombre": "Center of Radial Function",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Localizar el centro de una funcion con simetria radial consultandola por puntos.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 110,
          "cita": "Yi-Kai Liu Quantum algorithms using the curvelet transform. Proceedings of STOC 2009 , pg. 391-400. [ arXiv:0810.4968 ]",
          "url": "http://arxiv.org/abs/0810.4968"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "group-order-and-membership",
      "nombre": "Group Order and Membership",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Calcular el orden de un grupo y decidir si un elemento pertenece a el.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 74,
          "cita": "Michele Mosca Quantum Computer Algorithms . PhD thesis, University of Oxford, 1999.",
          "url": "http://www.iqc.ca/~mmosca/web/papers/moscathesis.pdf"
        },
        {
          "n": 91,
          "cita": "John Watrous Quantum algorithms for solvable groups. In Proceedings of the 33rd ACM Symposium on Theory of Computing , pages 60-67, 2001. [ arXiv:quant-ph/0011023 ]",
          "url": "http://arxiv.org/abs/quant-ph/0011023"
        },
        {
          "n": 124,
          "cita": "Laszlo Babai, Robert Beals, and Akos Seress Polynomial-time theory of matrix groups. In Proceedings of STOC 2009 , pg. 55-64.",
          "url": null
        }
      ],
      "n_referencias": 3,
      "remisiones": [
        {
          "ancla": "group_isomorphism",
          "url": "https://quantumalgorithmzoo.org/#group_isomorphism"
        }
      ],
      "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."
      }
    },
    {
      "id": "group-isomorphism",
      "nombre": "Group Isomorphism",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Decidir si dos grupos finitos dados por oraculo y generadores son el mismo grupo con otros nombres.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#group_isomorphism",
      "implementaciones": [],
      "referencias": [
        {
          "n": 127,
          "cita": "Kevin K. H. Cheung and Michele Mosca Decomposing finite Abelian groups. Quantum Information and Computation 1(2):26-32, 2001. [ arXiv:cs/0101004 ]",
          "url": "http://arxiv.org/abs/cs/0101004"
        },
        {
          "n": 128,
          "cita": "François Le Gall An efficient quantum algorithm for some instances of the group isomorphism problem. In Proceedings of STACS 2010 . [ arXiv:1001.0608 ]",
          "url": "http://arxiv.org/abs/1001.0608"
        },
        {
          "n": 202,
          "cita": "Kevin C. Zatloukal Classical and quantum algorithms for testing equivalence of group extensions. arXiv:1305.1327 , 2013.",
          "url": "http://arxiv.org/abs/1305.1327"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "statistical-difference",
      "nombre": "Statistical Difference",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Estimar cuanto se diferencian dos distribuciones de probabilidad a las que solo se accede por muestreo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 16,
          "cita": "G. Brassard, P. Høyer, and A. Tapp Quantum counting. arXiv:quant-ph/9805082 , 1998.",
          "url": "http://arxiv.org/abs/quant-ph/9805082"
        },
        {
          "n": 117,
          "cita": "Sergey Bravyi, Aram Harrow, and Avinatan Hassidim Quantum algorithms for testing properties of distributions. IEEE Transactions on Information Theory 57(6):3971-3981, 2011. [ arXiv:0907.3920 ]",
          "url": "http://arxiv.org/abs/0907.3920"
        },
        {
          "n": 265,
          "cita": "Ashley Montanaro Quantum speedup of Monte Carlo methods arXiv:1504.06987 , 2015.",
          "url": "http://arxiv.org/abs/1504.06987"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "finite-rings-and-ideals",
      "nombre": "Finite Rings and Ideals",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Calcular estructura de anillos finitos y de sus ideales.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 118,
          "cita": "Pawel M. Wocjan, Stephen P. Jordan, Hamed Ahmadi, and Joseph P. Brennan Efficient quantum processing of ideals in finite rings. arXiv:0908.0022 , 2009.",
          "url": "http://arxiv.org/abs/0908.0022"
        },
        {
          "n": 119,
          "cita": "V. Arvind, Bireswar Das, and Partha Mukhopadhyay The complexity of black-box ring problems. In Proceedings of COCCOON 2006 , pg 126-145.",
          "url": null
        },
        {
          "n": 120,
          "cita": "V. Arvind and Partha Mukhopadhyay Quantum query complexity of multilinear identity testing. In Proceedings of STACS 2009 , pg. 87-98.",
          "url": null
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "counterfeit-coins",
      "nombre": "Counterfeit Coins",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Identificar monedas falsas con la menor cantidad de pesajes: el problema clasico de acertijo, en version de consultas.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 136,
          "cita": "Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Junichi Teruyama Quantum Counterfeit Coin Problems. In Proceedings of 21st International Symposium on Algorithms and Computation (ISAAC2010) , LNCS 6506, pp.73-84, 2010. [ arXiv:1009.0416 ]",
          "url": "http://arxiv.org/abs/1009.0416"
        },
        {
          "n": 137,
          "cita": "Barbara Terhal and John Smolin Single quantum querying of a database. Physical Review A 58:1822, 1998. [ arXiv:quant-ph/9705041 ]",
          "url": "http://arxiv.org/abs/quant-ph/9705041"
        }
      ],
      "n_referencias": 2,
      "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."
      }
    },
    {
      "id": "matrix-rank",
      "nombre": "Matrix Rank",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Calcular el rango de una matriz accediendo a sus entradas por oraculo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 149,
          "cita": "Ben Reichardt Span programs and quantum query complexity: The general adversary bound is nearly tight for every Boolean function. In Proceedings of the 50th IEEE Symposium on Foundations of Computer Science (FOCS '09) , pg. 544-551, 2009. [ arXiv:0904.2759 ]",
          "url": "http://arxiv.org/abs/0904.2759"
        },
        {
          "n": 150,
          "cita": "Aleksandrs Belovs Span-program-based quantum algorithm for the rank problem. arXiv:1103.0842 , 2011.",
          "url": "http://arxiv.org/abs/1103.0842"
        },
        {
          "n": 151,
          "cita": "Sebastian Dörn and Thomas Thierauf The quantum query complexity of the determinant. Information Processing Letters Vol. 109, No. 6, pg. 305-328, 2009.",
          "url": null
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "matrix-multiplication-over-semirings",
      "nombre": "Matrix Multiplication over Semirings",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Multiplicar matrices sobre semianillos (por ejemplo min-plus), que es el nucleo de varios problemas de caminos minimos.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 19,
          "cita": "Harry Buhrman and Robert Špalek Quantum verification of matrix products. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms , pages 880-889, 2006. [ arXiv:quant-ph/0409035 ]",
          "url": "http://arxiv.org/abs/quant-ph/0409035"
        },
        {
          "n": 155,
          "cita": "François Le Gall Improved output-sensitive quantum algorithms for Boolean matrix multiplication. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '12) , 2012.",
          "url": null
        },
        {
          "n": 157,
          "cita": "Virginia Vassilevska Williams and Ryan Williams Subcubic equivalences between path, matrix, and triangle problems. In 51st IEEE Symposium on Foundations of Computer Science (FOCS '10) pg. 645 - 654, 2010.",
          "url": null
        },
        {
          "n": 161,
          "cita": "Stacey Jeffery, Robin Kothari, and Frédéric Magniez Improving quantum query complexity of Boolean matrix multiplication using graph collision. In Proceedings of ICALP 2012 , pg. 522-532. [ arXiv:1112.5855 ]",
          "url": "http://arxiv.org/abs/1112.5855"
        },
        {
          "n": 206,
          "cita": "François Le Gall and Harumichi Nishimura Quantum algorithms for matrix products over semirings. arXiv:1310.3898 , 2013.",
          "url": "http://arxiv.org/abs/1310.3898"
        }
      ],
      "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."
      }
    },
    {
      "id": "subset-finding",
      "nombre": "Subset finding",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Hallar un subconjunto de k elementos que cumpla una propiedad dada.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 7,
          "cita": "Andris Ambainis Quantum walk algorithm for element distinctness. SIAM Journal on Computing , 37:210-239, 2007. [ arXiv:quant-ph/0311001 ]",
          "url": "http://arxiv.org/abs/quant-ph/0311001"
        },
        {
          "n": 162,
          "cita": "Andrew M. Childs and Jason M. Eisenberg Quantum algorithms for subset finding. Quantum Information and Computation 5(7):593-604, 2005. [ arXiv:quant-ph/0311038 ]",
          "url": "http://arxiv.org/abs/quant-ph/0311038"
        },
        {
          "n": 163,
          "cita": "Aleksandrs Belovs and Robert Špalek Adversary lower bound for the k-sum problem. In Proceedings of ITCS 2013 , pg. 323-328. [ arXiv:1206.6528 ]",
          "url": "http://arxiv.org/abs/1206.6528"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "search-with-wildcards",
      "nombre": "Search with Wildcards",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Recuperar una cadena oculta cuando las consultas pueden dejar posiciones sin especificar.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 167,
          "cita": "Andris Ambainis and Ashley Montanaro Quantum algorithms for search with wildcards and combinatorial group testing. arXiv:1210.1148 , 2012.",
          "url": "http://arxiv.org/abs/1210.1148"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "network-flows",
      "nombre": "Network flows",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Calcular el flujo maximo o el flujo de costo minimo en una red con capacidades por arista.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 168,
          "cita": "Andris Ambainis and Robert Špalek Quantum algorithms for matching and network flows. Proceedings of STACS 2007 , pg. 172-183. [ arXiv:quant-ph/0508205 ]",
          "url": "http://arxiv.org/abs/quant-ph/0508205"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "electrical-resistance",
      "nombre": "Electrical Resistance",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Calcular la resistencia efectiva entre dos nodos de un grafo con pesos leidos como resistencias.",
      "speedup_declarado": "Exponential",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 104,
          "cita": "Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd Quantum algorithm for solving linear systems of equations. Physical Review Letters 15(103):150502, 2009. [ arXiv:0811.3171 ]",
          "url": "http://arxiv.org/abs/0811.3171"
        },
        {
          "n": 210,
          "cita": "Guoming Wang Quantum algorithms for approximating the effective resistances of electrical networks. arXiv:1311.1851",
          "url": "http://arxiv.org/abs/1311.1851"
        },
        {
          "n": 280,
          "cita": "Tsuyoshi Ito and Stacey Jeffery Approximate span programs arXiv:1507.00432 , 2015.",
          "url": "http://arxiv.org/abs/1507.00432"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "junta-testing-and-group-testing",
      "nombre": "Junta Testing and Group Testing",
      "categoria": "Oracular Algorithms",
      "categoria_id": "oracular",
      "problema": "Decidir si una funcion depende a lo mas de k de sus n bits de entrada. Emparentado con el problema de testeo por grupos.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
      "implementaciones": [],
      "referencias": [
        {
          "n": 167,
          "cita": "Andris Ambainis and Ashley Montanaro Quantum algorithms for search with wildcards and combinatorial group testing. arXiv:1210.1148 , 2012.",
          "url": "http://arxiv.org/abs/1210.1148"
        },
        {
          "n": 266,
          "cita": "Andris Ambainis, Aleksandrs Belovs, Oded Regev, and Ronald de Wolf Efficient quantum algorithms for (gapped) group testing and junta testing arXiv:1507.03126 , 2015.",
          "url": "http://arxiv.org/abs/1507.03126"
        },
        {
          "n": 267,
          "cita": "A. Atici and R. A. Servedio Quantum algorithms for learning and testing juntas Quantum Information Processing , 6(5):323-348, 2007. [ arXiv:0707.3479 ]",
          "url": "http://arxiv.org/abs/0707.3479"
        },
        {
          "n": 268,
          "cita": "Aleksandrs Belovs Quantum algorithms for learning symmetric juntas via the adversary bound Computational Complexity , 24(2):255-293, 2015. (Also appears in proceedings of CCC'14). [ arXiv:1311.6777 ]",
          "url": "http://arxiv.org/abs/1311.6777"
        }
      ],
      "n_referencias": 4,
      "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."
      }
    },
    {
      "id": "simulating-quantum-hamiltonian-dynamics",
      "nombre": "Simulating Quantum Hamiltonian Dynamics",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Simular como evoluciona en el tiempo un sistema cuantico dado su hamiltoniano. Es la aplicacion original de Feynman y la mejor candidata a utilidad real.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [
        {
          "nombre": "Classiq (Hamiltonian)",
          "url": "https://short.classiq.io/simulation"
        },
        {
          "nombre": "Classiq (Thermal)",
          "url": "https://short.classiq.io/thermal_state_preparation"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/codebook/hamiltonian-simulation"
        },
        {
          "nombre": "Qrisp",
          "url": "https://qrisp.eu/general/tutorial/H2.html#ham-sim-fundamentals"
        }
      ],
      "referencias": [
        {
          "n": 1,
          "cita": "Daniel S. Abrams and Seth Lloyd Simulation of many-body Fermi systems on a universal quantum computer. Physical Review Letters , 79(13):2586-2589, 1997. [ arXiv:quant-ph/9703054 ]",
          "url": "http://arxiv.org/abs/quant-ph/9703054"
        },
        {
          "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": 12,
          "cita": "D.W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders Efficient quantum algorithms for simulating sparse Hamiltonians. Communications in Mathematical Physics , 270(2):359-371, 2007. [ arXiv:quant-ph/0508139 ]",
          "url": "http://arxiv.org/abs/quant-ph/0508139"
        },
        {
          "n": 25,
          "cita": "Andrew M. Childs Quantum information processing in continuous time . PhD thesis, MIT, 2004.",
          "url": "http://www.math.uwaterloo.ca/~amchilds/papers/thesis.pdf"
        },
        {
          "n": 40,
          "cita": "Richard P. Feynman Simulating physics with computers. International Journal of Theoretical Physics , 21(6/7):467-488, 1982.",
          "url": null
        },
        {
          "n": 63,
          "cita": "Ivan Kassal, Stephen P. Jordan, Peter J. Love, Masoud Mohseni, and Alán Aspuru-Guzik Quantum algorithms for the simulation of chemical dynamics. Proc. Natl. Acad. Sci. Vol. 105, pg. 18681, 2008. [ arXiv:0801.2986 ]",
          "url": "http://arxiv.org/abs/0801.2986"
        },
        {
          "n": 68,
          "cita": "Daniel A. Lidar and Haobin Wang Calculating the thermal rate constant with exponential speedup on a quantum computer. Physical Review E , 59(2):2429-2438, 1999. [ arXiv:quant-ph/9807009 ]",
          "url": "http://arxiv.org/abs/quant-ph/9807009"
        },
        {
          "n": 92,
          "cita": "Stephen Wiesner Simulations of many-body quantum systems by a quantum computer. arXiv:quant-ph/9603028 , 1996.",
          "url": "http://arxiv.org/abs/quant-ph/9603028"
        },
        {
          "n": 95,
          "cita": "Christof Zalka Efficient simulation of quantum systems by quantum computers. Proceedings of the Royal Society of London Series A , 454:313, 1996. [ arXiv:quant-ph/9603026 ]",
          "url": "http://arxiv.org/abs/quant-ph/9603026"
        },
        {
          "n": 99,
          "cita": "L.-A. Wu, M.S. Byrd, and D. A. Lidar Polynomial-Time Simulation of Pairing Models on a Quantum Computer. Physical Review Letters , 89(6):057904, 2002. [ arXiv:quant-ph/0108110 ]",
          "url": "http://arxiv.org/abs/quant-ph/0108110"
        },
        {
          "n": 107,
          "cita": "Tim Byrnes and Yoshihisa Yamamoto Simulating lattice gauge theories on a quantum computer. Physical Review A , 73, 022328, 2006. [ arXiv:quant-ph/0510027 ]",
          "url": "http://arxiv.org/abs/quant-ph/0510027"
        },
        {
          "n": 145,
          "cita": "G. Ortiz, J.E. Gubernatis, E. Knill, and R. Laflamme Quantum algorithms for Fermionic simulations. Physical Review A 64: 022319, 2001. [ arXiv:cond-mat/0012334 ]",
          "url": "http://arxiv.org/abs/cond-mat/0012334"
        },
        {
          "n": 166,
          "cita": "Stephen Jordan, Keith Lee, and John Preskill Quantum algorithms for quantum field theories. Science , Vol. 336, pg. 1130-1133, 2012. [ arXiv:1111.3633 ]",
          "url": "http://arxiv.org/abs/1111.3633"
        },
        {
          "n": 170,
          "cita": "Andrew Childs and Nathan Wiebe Hamiltonian simulation using linear combinations of unitary operations. Quantum Information and Computation 12, 901-924, 2012. [ arXiv:1202.5822 ]",
          "url": "http://arxiv.org/abs/1202.5822"
        },
        {
          "n": 205,
          "cita": "D. W. Berry, R. Cleve, and R. D. Somma Exponential improvement in precision for Hamiltonian-evolution simulation. arXiv:1308.5424 , 2013.",
          "url": "http://arxiv.org/abs/1308.5424"
        },
        {
          "n": 211,
          "cita": "Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma Exponential improvement in precision for simulating sparse Hamiltonians arXiv:1312.1414",
          "url": "http://arxiv.org/abs/1312.1414"
        },
        {
          "n": 227,
          "cita": "Matthew B. Hastings, Dave Wecker, Bela Bauer, and Matthias Troyer Improving quantum algorithms for quantum chemistry Quantum Information and Computation, 15(1/2):0001-0021, 2015. [ arXiv:1403.1539 ]",
          "url": "http://arxiv.org/abs/1403.1539"
        },
        {
          "n": 228,
          "cita": "Stephen P. Jordan, Keith S. M. Lee, and John Preskill Quantum simulation of scattering in scalar quantum field theories Quantum Information and Computation, 14(11/12):1014-1080, 2014. [ arXiv:1112.4833 ]",
          "url": "http://arxiv.org/abs/1112.4833"
        },
        {
          "n": 229,
          "cita": "Stephen P. Jordan, Keith S. M. Lee, and John Preskill Quantum algorithms for fermionic quantum field theories arXiv:1404.7115",
          "url": "http://arxiv.org/abs/1404.7115"
        },
        {
          "n": 230,
          "cita": "Gavin K. Brennen, Peter Rohde, Barry C. Sanders, and Sukhi Singh Multi-scale quantum simulation of quantum field theory using wavelets arXiv:1412.0750",
          "url": "http://arxiv.org/abs/1412.0750"
        },
        {
          "n": 244,
          "cita": "Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma Simulating Hamiltonian dynamics with a truncated Taylor series arXiv:1412.4687 , 2014.",
          "url": "http://arxiv.org/abs/1412.4687"
        },
        {
          "n": 245,
          "cita": "Dominic W. Berry, Andrew M. Childs, and Robin Kothari Hamiltonian simulation with nearly optimal dependence on all parameters arXiv:1501.01715 , 2015.",
          "url": "http://arxiv.org/abs/1501.01715"
        },
        {
          "n": 278,
          "cita": "Rolando D. Somma Quantum simulations of one dimensional quantum systems arXiv:1503.06319 , 2015.",
          "url": "http://arxiv.org/abs/1503.06319"
        },
        {
          "n": 293,
          "cita": "Rolando D. Somma A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation arXiv:1512.03416 , 2015.",
          "url": "http://arxiv.org/abs/1512.03416"
        },
        {
          "n": 294,
          "cita": "Guang Hao Low and Isaac Chuang Optimal Hamiltonian simulation by quantum signal processing arXiv:1606.02685 , 2016.",
          "url": "http://arxiv.org/abs/1606.02685"
        },
        {
          "n": 295,
          "cita": "Dominic W. Berry and Leonardo Novo Corrected quantum walk for optimal Hamiltonian simulation arXiv:1606.03443 , 2016.",
          "url": "http://arxiv.org/abs/1606.03443"
        },
        {
          "n": 310,
          "cita": "Markus Reiher, Nathan Wiebe, Krysta M. Svore, Dave Wecker, and Matthias Troyer Elucidating reaction mechanisms on quantum computers arXiv:1605.03590 , 2016.",
          "url": "http://arxiv.org/abs/1605.03590"
        },
        {
          "n": 367,
          "cita": "Francois Fillion-Gourdeau, Steve MacLean, and Raymond Laflamme Quantum algorithm for the solution of the Dirac equation arXiv:1611.05484 , 2016.",
          "url": "https://arxiv.org/abs/1611.05484"
        },
        {
          "n": 368,
          "cita": "Ali Hamed Moosavian and Stephen Jordan Faster quantum algorithm to simulate Fermionic quantum field theory arXiv:1711.04006 , 2017.",
          "url": "https://arxiv.org/abs/1711.04006"
        },
        {
          "n": 369,
          "cita": "Pedro C.S. Costa, Stephen Jordan, and Aaron Ostrander Quantum algorithm for simulating the wave equation arXiv:1711.05394 , 2017.",
          "url": "https://arxiv.org/abs/1711.05394"
        },
        {
          "n": 370,
          "cita": "Jeffrey Yepez Highly covariant quantum lattice gas model of the Dirac equation arXiv:1106.0739 , 2011.",
          "url": "https://arxiv.org/abs/1711.05394"
        },
        {
          "n": 371,
          "cita": "Jeffrey Yepez Quantum lattice gas model of Dirac particles in 1+1 dimensions arXiv:1307.3595 , 2013.",
          "url": "https://arxiv.org/abs/1307.3595"
        },
        {
          "n": 372,
          "cita": "Bruce M. Boghosian and Washington Taylor Simulating quantum mechanics on a quantum computer Physica D 120:30-42, 1998. [ arXiv:quant-ph/9701019 ]",
          "url": "https://arxiv.org/abs/quant-ph/9701019"
        },
        {
          "n": 375,
          "cita": "Kanav Setia and James D. Whitfield Bravyi-Kitaev superfast simulation of fermions on a quantum computer arXiv:1712.00446 , 2017.",
          "url": "https://arxiv.org/abs/1712.00446"
        },
        {
          "n": 376,
          "cita": "Richard Cleve and Chunhao Wang Efficient quantum algorithms for simulating Lindblad evolution arXiv:1612.09512 , 2016.",
          "url": "https://arxiv.org/abs/1612.09512"
        },
        {
          "n": 377,
          "cita": "M. Kliesch, T. Barthel, C. Gogolin, M. Kastoryano, and J. Eisert Dissipative quantum Church-Turing theorem Physical Review Letters 107(12):120501, 2011. [ arXiv:1105.3986 ]",
          "url": "https://arxiv.org/abs/1105.3986"
        },
        {
          "n": 378,
          "cita": "A. M. Childs and T. Li Efficient simulation of sparse Markovian quantum dynamics arXiv:1611.05543 , 2016.",
          "url": "https://arxiv.org/abs/1611.05543"
        },
        {
          "n": 379,
          "cita": "R. Di Candia, J. S. Pedernales, A. del Campo, E. Solano, and J. Casanova Quantum simulation of dissipative processes without reservoir engineering Scientific Reports 5:9981, 2015.",
          "url": null
        },
        {
          "n": 382,
          "cita": "Guang Hao Low and Isaac Chuang Hamiltonian simulation by qubitization arXiv:1610.06546 , 2016.",
          "url": "https://arxiv.org/abs/1610.06546"
        },
        {
          "n": 458,
          "cita": "Dong An, Jin-Peng Liu and Lin Lin Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost Physical Review Letters 131(15):150603, 2023. [ arXiv:2303.01029 ]",
          "url": "https://arxiv.org/abs/2303.01029"
        },
        {
          "n": 466,
          "cita": "Kaoru Mizuta and Keisuke Fujii Optimal Hamiltonian simulation for time-periodic systems Quantum , 7:962, 2023. [ arXiv:2209.05048 ]",
          "url": "https://arxiv.org/abs/2209.05048"
        },
        {
          "n": 467,
          "cita": "Dominic W. Berry, Andrew M. Childs, Yuan Su, Xin Wang, and Nathan Wiebe Time-dependent Hamiltonian simulation with L1-norm scaling Quantum , 4:254, 2020. [ arXiv:1906.07115 ]",
          "url": "https://arxiv.org/abs/1906.07115"
        },
        {
          "n": 468,
          "cita": "David Poulin, Angie Qarry, Rolando Somma, and Frank Verstraete Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space Physical Review Letters , 106(17):170501, 2011. [ arXiv:1102.1360 ]",
          "url": "https://arxiv.org/abs/1102.1360"
        },
        {
          "n": 469,
          "cita": "Mária Kieferová, Artur Scherer, and Dominic W. Berry Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series Physical Review A , 99(4):042314, 2019. [ arXiv:1805.00582 ]",
          "url": "https://arxiv.org/abs/1805.00582"
        },
        {
          "n": 470,
          "cita": "Guang Hao Low and Nathan Wiebe Hamiltonian simulation in the interaction picture arXiv:1805.00675 , 2018.",
          "url": "https://arxiv.org/abs/1805.00675"
        },
        {
          "n": 478,
          "cita": "Jeongwan Haah, Matthew B. Hastings, Robin Kothari, and Guang Hao Low Quantum algorithm for simulating real time evolution of lattice Hamiltonians SIAM Journal on Computing , 52(6):10.1137, 2018. [ arXiv:1801.03922 ]",
          "url": "https://arxiv.org/abs/1801.03922"
        },
        {
          "n": 479,
          "cita": "Andrew M. Childs and Yuan Su Nearly optimal lattice simulation by product formulas Physical Review Letters , 123(5):050503, 2019. [ arXiv:1901.00564 ]",
          "url": "https://arxiv.org/abs/1901.00564"
        },
        {
          "n": 480,
          "cita": "Tomotaka Kuwahara, Tan Van Vu, and Keiji Saito Effective light cone and digital quantum simulation of interacting bosons Nature Communications , 15:2520, 2024. [ arXiv:2206.14736 ]",
          "url": "https://arxiv.org/abs/2206.14736"
        },
        {
          "n": 481,
          "cita": "Burak Şahinoğlu and Rolando D. Somma Hamiltonian simulation in the low-energy subspace npj Quantum Information , 7:119, 2021. [ arXiv:2006.02660 ]",
          "url": "https://arxiv.org/abs/2006.02660"
        },
        {
          "n": 482,
          "cita": "Weiyuan Gong, Shuo Zhou3, and Tongyang Li Complexity of digital quantum simulation in the low-energy subspace: applications and a lower bound Quantum , 8:1409, 2024. [ arXiv:2312.08867 ]",
          "url": "https://arxiv.org/abs/2312.08867"
        },
        {
          "n": 483,
          "cita": "Kasra Hejazi, Modjtaba Shokrian Zini, and Juan Miguel Arrazola Better bounds for low-energy product formulas arXiv:2402.10362 , 2024.",
          "url": "https://arxiv.org/abs/2402.10362"
        },
        {
          "n": 484,
          "cita": "Yu Tong, Victor V. Albert, Jarrod R. McClean, John Preskill, and Yuan Su Provably accurate simulation of gauge theories and bosonic systems Quantum , 6:816, 2022. [ arXiv:2110.06942 ]",
          "url": "https://arxiv.org/abs/2110.06942"
        },
        {
          "n": 495,
          "cita": "Tobias J. Osborne and Alexander Stottmeister Quantum simulation of conformal field theory arXiv:2109.14214 , 2021.",
          "url": "https://arxiv.org/abs/2109.14214"
        },
        {
          "n": 496,
          "cita": "Changhao Yi and Elizabeth Crosson Spectral analysis of product formulas for quantum simulation npj Quantum Information , 8:38, 2022. [ arXiv:2102.12655 ]",
          "url": "https://arxiv.org/abs/2102.12655"
        },
        {
          "n": 499,
          "cita": "Xiang Li, Su-Xiang Lyu, Yao Wang, Rui-Xue Xu, Xiao Zheng, and YiJing Yan Towards Quantum Simulation of Non-Markovian Open Quantum Dynamics: A Universal and Compact Theory Physical Review A , 110:03620, 2024. [ arXiv:2401.17255 ]",
          "url": "https://arxiv.org/abs/2401.17255"
        },
        {
          "n": 501,
          "cita": "Peter L. Walters and Fei Wang Path integral quantum algorithm for simulating non-Markovian quantum dynamics in open quantum systems Physical Review Research , 6:013135, 2024.",
          "url": null
        },
        {
          "n": 503,
          "cita": "Matthew Pocrnic, Dvira Segal, and Nathan Wiebe Quantum Simulation of Lindbladian Dynamics via Repeated Interactions arXiv:2312.05371 , 2023.",
          "url": "https://arxiv.org/abs/2312.05371"
        },
        {
          "n": 504,
          "cita": "Mekena Metcalf, Emma Stone, Katherine Klymko, Alexander F Kemper, Mohan Sarovar, and Wibe A de Jong Quantum Markov chain Monte Carlo with digital dissipative dynamics on quantum computers Quantum Science and Technology , 7(2):025017, 2022.",
          "url": null
        },
        {
          "n": 505,
          "cita": "Dhrumil Patel and Mark M. Wilde Wave Matrix Lindbladization I: Quantum Programs for Simulating Markovian Dynamics Open Systems & Information Dynamics , 30(2):2350010, 2023.",
          "url": null
        },
        {
          "n": 506,
          "cita": "Dhrumil Patel and Mark M. Wilde Wave Matrix Lindbladization II: General Lindbladians, Linear Combinations, and Polynomials Open Systems & Information Dynamics , 30(2):2350014, 2023.",
          "url": null
        },
        {
          "n": 507,
          "cita": "Xiantao Li and Chunhao Wang Succinct Description and Efficient Simulation of Non-Markovian Open Quantum Systems Communications in Mathematical Physics , 401:147-183, 2023.",
          "url": null
        }
      ],
      "n_referencias": 61,
      "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."
      }
    },
    {
      "id": "preparing-eigenstates-and-thermal-states",
      "nombre": "Preparing Eigenstates and Thermal States",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Preparar el estado fundamental o un estado termico de un hamiltoniano, punto de partida de casi toda simulacion de materiales y quimica.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 102,
          "cita": "Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon Simulated quantum computation of molecular energies. Science , 309(5741):1704-1707, 2005. [ arXiv:quant-ph/0604193 ]",
          "url": "http://arxiv.org/abs/quant-ph/0604193"
        },
        {
          "n": 121,
          "cita": "David Poulin and Pawel Wocjan Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer. Physical Review Letters 103:220502, 2009. [ arXiv:0905.2199 ]",
          "url": "http://arxiv.org/abs/0905.2199"
        },
        {
          "n": 132,
          "cita": "K. Temme, T.J. Osborne, K.G. Vollbrecht, D. Poulin, and F. Verstraete Quantum Metropolis Sampling. Nature , Vol. 471, pg. 87-90, 2011. [ arXiv:0911.3635 ]",
          "url": "http://arxiv.org/abs/0911.3635"
        },
        {
          "n": 231,
          "cita": "Hefeng Wang, Sabre Kais, Alán Aspuru-Guzik, and Mark R. Hoffmann. Quantum algorithm for obtaining the energy spectrum of molecular systems Physical Chemistry Chemical Physics, 10(35):5388-5393, 2008. [ arXiv:0907.0854 ]",
          "url": "http://arxiv.org/abs/0907.0854"
        },
        {
          "n": 232,
          "cita": "Ivan Kassal and Alán Aspuru-Guzik Quantum algorithm for molecular properties and geometry optimization Journal of Chemical Physics, 131(22), 2009. [ arXiv:0908.1921 ]",
          "url": "http://arxiv.org/abs/0908.1921"
        },
        {
          "n": 233,
          "cita": "James D. Whitfield, Jacob Biamonte, and Alán Aspuru-Guzik Simulation of electronic structure Hamiltonians using quantum computers Molecular Physics, 109(5):735-750, 2011. [ arXiv:1001.3855 ]",
          "url": "http://arxiv.org/abs/1001.3855"
        },
        {
          "n": 234,
          "cita": "Borzu Toloui and Peter J. Love Quantum algorithms for quantum chemistry based on the sparsity of the CI-matrix arXiv:1312.2529",
          "url": "http://arxiv.org/abs/1312.2579"
        },
        {
          "n": 235,
          "cita": "James D. Whitfield Spin-free quantum computational simulations and symmetry adapted states Journal of Chemical Physics, 139(2):021105, 2013. [ arXiv:1306.1147 ]",
          "url": "http://arxiv.org/abs/1306.1147"
        },
        {
          "n": 281,
          "cita": "Arnau Riera, Christian Gogolin, and Jens Eisert Thermalization in nature and on a quantum computer Physical Review Letters , 108:080402 (2012) [ arXiv:1102.2389 ]",
          "url": "http://arxiv.org/abs/1102.2389"
        },
        {
          "n": 282,
          "cita": "Michael J. Kastoryano and Fernando G. S. L. Brandao Quantum Gibbs Samplers: the commuting case Communications in Mathematical Physics , 344(3):915-957 (2016) [ arXiv:1409.3435 ]",
          "url": "http://arxiv.org/abs/1409.3435"
        },
        {
          "n": 307,
          "cita": "Anirban Naryan Chowdhury and Rolando D. Somma Quantum algorithms for Gibbs sampling and hitting-time estimation arXiv:1603.02940 , 2016.",
          "url": "http://arxiv.org/abs/1603.02940"
        },
        {
          "n": 308,
          "cita": "Edward Farhi, Shelby Kimmel, and Kristan Temme A quantum version of Schoning's algorithm applied to quantum 2-SAT arXiv:1603.06985 , 2016.",
          "url": "http://arxiv.org/abs/1603.06985"
        },
        {
          "n": 321,
          "cita": "Or Sattath and Itai Arad A constructive quantum Lovász local lemma for commuting projectors Quantum Information and Computation , 15(11/12)987-996pg, 2015. [ arXiv:1310.7766 ]",
          "url": "http://arxiv.org/abs/1310.7766"
        },
        {
          "n": 322,
          "cita": "Martin Schwarz, Toby S. Cubitt, and Frank Verstraete An information-theoretic proof of the constructive commutative quantum Lovász local lemma arXiv:1311.6474",
          "url": "http://arxiv.org/abs/1311.6474"
        },
        {
          "n": 323,
          "cita": "C. Shoen, E. Solano, F. Verstraete, J. I. Cirac, and M. M. Wolf Sequential generation of entangled multi-qubit states Physical Review Letters , 95:110503, 2005. [ arXiv:quant-ph/0501096 ]",
          "url": "http://arxiv.org/abs/quant-ph/0501096"
        },
        {
          "n": 324,
          "cita": "C. Shoen, K. Hammerer, M. M. Wolf, J. I. Cirac, and E. Solano Sequential generation of matrix-product states in cavity QED Physical Review A , 75:032311, 2007. [ arXiv:quant-ph/0612101 ]",
          "url": "http://arxiv.org/abs/quant-ph/0612101"
        },
        {
          "n": 325,
          "cita": "Yimin Ge, András Molnár, and J. Ignacio Cirac Rapid adiabatic preparation of injective PEPS and Gibbs states Physical Review Letters , 116:080503, 2016. [ arXiv:1508.00570 ]",
          "url": "http://arxiv.org/abs/1508.00570"
        },
        {
          "n": 326,
          "cita": "Martin Schwarz, Kristan Temme, and Frank Verstraete Preparing projected entangled pair states on a quantum computer Physical Review Letters , 108:110502, 2012. [ arXiv:1104.1410 ]",
          "url": "http://arxiv.org/abs/1104.1410"
        },
        {
          "n": 327,
          "cita": "Martin Schwarz, Toby S. Cubitt, Kristan Temme, Frank Verstraete, and David Perez-Garcia Preparing topological PEPS on a quantum computer Physical Review A , 88:032321, 2013. [ arXiv:1211.4050 ]",
          "url": "http://arxiv.org/abs/1211.4050"
        },
        {
          "n": 328,
          "cita": "M. Schwarz, O. Buerschaper, and J. Eisert Approximating local observables on projected entangled pair states arXiv:1606.06301 , 2016.",
          "url": "http://arxiv.org/abs/1606.06301"
        },
        {
          "n": 373,
          "cita": "Yimin Ge, Jordi Tura, and J. Ignacio Cirac Faster ground state preparation and high-precision ground energy estimation on a quantum computer arXiv:1712.03193 , 2017.",
          "url": "https://arxiv.org/abs/1712.03193"
        },
        {
          "n": 380,
          "cita": "R. Babbush, D. Berry, M. Kieferová, G. H. Low, Y. Sanders, A. Sherer, and N. Wiebe Improved techniques for preparing eigenstates of Fermionic Hamiltonians arXiv:1711.10460 , 2017.",
          "url": "https://arxiv.org/abs/1711.10460"
        },
        {
          "n": 381,
          "cita": "D. Poulin, A. Kitaev, D. S. Steiger, M. B. Hasting, and M. Troyer Fast quantum algorithm for spectral properties arXiv:1711.11025 , 2017.",
          "url": "https://arxiv.org/abs/1711.11025"
        },
        {
          "n": 430,
          "cita": "Nathan Ramusat and Vincenzo Savona A quantum algorithm for the direct estimation of the steady state of open quantum systems arXiv:2008.07133",
          "url": "https://arxiv.org/abs/2008.07133"
        },
        {
          "n": 433,
          "cita": "András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics Proceedings of STOC 2019 , pg. 193-204 [ arXiv:1806.01838 ]",
          "url": "https://arxiv.org/abs/1806.01838"
        },
        {
          "n": 457,
          "cita": "Chi-Fang Chen, Michael J. Kastoryano, Fernando G.S.L. Brandão, András Gilyén Quantum Thermal State Preparation arXiv:2303.18224 .",
          "url": "https://arxiv.org/abs/2303.18224"
        },
        {
          "n": 463,
          "cita": "Chi-Fang Chen, Alexander M. Dalzell, Mario Berta, Fernando G. S. L. Brandão, and Joel A. Tropp Sparse random Hamiltonians are quantumly easy Physical Review X 14(1):011014, 2024. [ arXiv:2302.03394 ]",
          "url": "https://arxiv.org/abs/2302.03394"
        },
        {
          "n": 491,
          "cita": "Zoe Holmes, Gopikrishnan Muraleedharan, Rolando D. Somma, Yigit Subasi, and Burak Şahinoğlu Quantum algorithms from fluctuation theorems: Thermal-state preparation Quantum , 6:825, 2022. [ arXiv:2203.08882 ]",
          "url": "https://arxiv.org/abs/2203.08882"
        },
        {
          "n": 500,
          "cita": "Chi-Fang Chen, Michael J. Kastoryano, and András Gilyén An efficient and exact noncommutative quantum Gibbs sampler arXiv:2311.09207 , 2023.",
          "url": "https://arxiv.org/abs/2311.09207"
        },
        {
          "n": 502,
          "cita": "Jiaqing Jiang and Sandy Irani Quantum Metropolis Sampling via Weak Measurement arXiv:2406.16023 , 2024.",
          "url": "https://arxiv.org/abs/2406.16023"
        },
        {
          "n": 533,
          "cita": "Mario Motta, Chong Sun, Adrian Teck Keng Tan, Matthew J. O' Rourke, Erika Ye, Austin J. Minnich, Fernando G. S. L. Brandao, and Garnet Kin-Lic Chan Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution Nature Physics 16, 205-210, 2020. [ arXiv:1901.07653 ]",
          "url": "https://arxiv.org/abs/1901.07653"
        }
      ],
      "n_referencias": 31,
      "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."
      }
    },
    {
      "id": "knot-invariants",
      "nombre": "Knot Invariants",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Aproximar el polinomio de Jones y otros invariantes de nudos, problema BQP-duro.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 2,
          "cita": "Dorit Aharonov and Itai Arad The BQP-hardness of approximating the Jones polynomial. New Journal of Physics 13:035019, 2011. [ arXiv:quant-ph/0605181 ]",
          "url": "http://arxiv.org/abs/quant-ph/0605181"
        },
        {
          "n": 3,
          "cita": "Dorit Aharonov, Itai Arad, Elad Eban, and Zeph Landau Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane. arXiv:quant-ph/0702008 , 2007.",
          "url": "http://arxiv.org/abs/quant-ph/0702008"
        },
        {
          "n": 4,
          "cita": "Dorit Aharonov, Vaughan Jones, and Zeph Landau A polynomial quantum algorithm for approximating the Jones polynomial. In Proceedings of the 38th ACM Symposium on Theory of Computing , 2006. [ arXiv:quant-ph/0511096 ]",
          "url": "http://arxiv.org/abs/quant-ph/0511096"
        },
        {
          "n": 41,
          "cita": "Michael Freedman, Alexei Kitaev, and Zhenghan Wang Simulation of topological field theories by quantum computers. Communications in Mathematical Physics , 227:587-603, 2002.",
          "url": null
        },
        {
          "n": 42,
          "cita": "Michael Freedman, Michael Larsen, and Zhenghan Wang A modular functor which is universal for quantum computation. Comm. Math. Phys. 227(3):605-622, 2002. [ arXiv:quant-ph/0001108 ]",
          "url": "http://arxiv.org/abs/quant-ph/0001108"
        },
        {
          "n": 83,
          "cita": "Peter W. Shor and Stephen P. Jordan Estimating Jones polynomials is a complete problem for one clean qubit. Quantum Information and Computation , 8(8/9):681-714, 2008. [ arXiv:0707.2831 ]",
          "url": "http://arxiv.org/abs/0707.2831"
        },
        {
          "n": 93,
          "cita": "Pawel Wocjan and Jon Yard The Jones polynomial: quantum algorithms and applications in quantum complexity theory. Quantum Information and Computation 8(1/2):147-180, 2008. [ arXiv:quant-ph/0603069 ]",
          "url": "http://arxiv.org/abs/quant-ph/0603069"
        },
        {
          "n": 174,
          "cita": "Hari Krovi and Alexander Russell Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups. Commun. Math. Phys. 334, 743-777, 2015 [ arXiv:1210.1550 ]",
          "url": "http://arxiv.org/abs/1210.1550"
        },
        {
          "n": 510,
          "cita": "Chris Cade and P. Marcos Crichigno Complexity of Supersymmetric Systems and the Cohomology Problem Quantum , 8:1325, 2024. [ arXiv:2107.00011 ]",
          "url": "https://arxiv.org/abs/2107.00011"
        },
        {
          "n": 511,
          "cita": "Alexander Schmidhuber, Michele Reilly, Paolo Zanardi, Seth Lloyd, and Aaron Lauda A quantum algorithm for Khovanov homology arXiv:2501.12378 , 2025.",
          "url": "https://arxiv.org/abs/2501.12378"
        }
      ],
      "n_referencias": 10,
      "remisiones": [
        {
          "ancla": "ML",
          "url": "https://quantumalgorithmzoo.org/#ML"
        },
        {
          "ancla": "part_func",
          "url": "https://quantumalgorithmzoo.org/#part_func"
        }
      ],
      "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."
      }
    },
    {
      "id": "three-manifold-invariants",
      "nombre": "Three-manifold Invariants",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Aproximar invariantes topologicos de variedades de tres dimensiones.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 114,
          "cita": "Silvano Garnerone, Annalisa Marzuoli, and Mario Rasetti Efficient quantum processing of 3-manifold topological invariants. Advances in Theoretical and Mathematical Physics , 13(6):1601-1652, 2009. [ arXiv:quant-ph/0703037 ]",
          "url": "http://arxiv.org/abs/quant-ph/0703037"
        },
        {
          "n": 115,
          "cita": "Louis H. Kauffman and Samuel J. Lomonaco Jr. q-deformed spin networks, knot polynomials and anyonic topological quantum computation. Journal of Knot Theory , Vol. 16, No. 3, pg. 267-332, 2007. [ arXiv:quant-ph/0606114 ]",
          "url": "http://arxiv.org/abs/quant-ph/0606114"
        },
        {
          "n": 129,
          "cita": "Gorjan Alagic, Stephen Jordan, Robert Koenig, and Ben Reichardt Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation. Physical Review A 82, 040302(R), 2010. [ arXiv:1003.0923 ]",
          "url": "http://arxiv.org/abs/1003.0923"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "partition-functions",
      "nombre": "Partition Functions",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Estimar la funcion de particion de un sistema clasico, de la que se derivan practicamente todas sus magnitudes termodinamicas.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#part_func",
      "implementaciones": [],
      "referencias": [
        {
          "n": 3,
          "cita": "Dorit Aharonov, Itai Arad, Elad Eban, and Zeph Landau Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane. arXiv:quant-ph/0702008 , 2007.",
          "url": "http://arxiv.org/abs/quant-ph/0702008"
        },
        {
          "n": 45,
          "cita": "Joseph Geraci A new connection between quantum circuits, graphs and the Ising partition function Quantum Information Processing , 7(5):227-242, 2008. [ arXiv:0801.4833 ]",
          "url": "http://arxiv.org/abs/0801.4833"
        },
        {
          "n": 47,
          "cita": "Joseph Geraci and Daniel A. Lidar On the exact evaluation of certain instances of the Potts partition function by quantum computers. Comm. Math. Phys. Vol. 279, pg. 735, 2008. [ arXiv:quant-ph/0703023 ]",
          "url": "http://arxiv.org/abs/quant-ph/0703023"
        },
        {
          "n": 67,
          "cita": "Daniel A. Lidar On the quantum computational complexity of the Ising spin glass partition function and of knot invariants. New Journal of Physics Vol. 6, pg. 167, 2004. [ arXiv:quant-ph/0309064 ]",
          "url": "http://arxiv.org/abs/quant-ph/0309064"
        },
        {
          "n": 112,
          "cita": "Itai Arad and Zeph Landau Quantum computation and the evaluation of tensor networks. SIAM Journal on Computing , 39(7):3089-3121, 2010. [ arXiv:0805.0040 ]",
          "url": "http://arxiv.org/abs/0805.0040"
        },
        {
          "n": 113,
          "cita": "M. Van den Nest, W. Dür, R. Raussendorf, and H. J. Briegel Quantum algorithms for spin models and simulable gate sets for quantum computation. Physical Review A , 80:052334, 2009. [ arXiv:0805.1214 ]",
          "url": "http://arxiv.org/abs/0805.1214"
        },
        {
          "n": 121,
          "cita": "David Poulin and Pawel Wocjan Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer. Physical Review Letters 103:220502, 2009. [ arXiv:0905.2199 ]",
          "url": "http://arxiv.org/abs/0905.2199"
        },
        {
          "n": 122,
          "cita": "Pawel Wocjan, Chen-Fu Chiang, Anura Abeyesinghe, and Daniel Nagaj Quantum speed-up for approximating partition functions. Physical Review A 80:022340, 2009. [ arXiv:0811.0596 ]",
          "url": "http://arxiv.org/abs/0811.0596"
        },
        {
          "n": 265,
          "cita": "Ashley Montanaro Quantum speedup of Monte Carlo methods arXiv:1504.06987 , 2015.",
          "url": "http://arxiv.org/abs/1504.06987"
        },
        {
          "n": 471,
          "cita": "Arjan Cornelissen and Yassine Hamoudi A sublinear-time quantum algorithm for approximating partition functions Proceedings of SODA23 , 1245-1264, 2023. [ arXiv:2207.08643 ]",
          "url": "https://arxiv.org/abs/2207.08643"
        }
      ],
      "n_referencias": 10,
      "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."
      }
    },
    {
      "id": "zeta-functions",
      "nombre": "Zeta Functions",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Calcular funciones zeta de curvas sobre cuerpos finitos, con uso directo en criptografia de curvas elipticas.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 64,
          "cita": "Kiran S. Kedlaya Quantum computation of zeta functions of curves. Computational Complexity , 15:1-19, 2006. [ arXiv:math/0411623 ]",
          "url": "http://arxiv.org/abs/math/0411623"
        },
        {
          "n": 87,
          "cita": "Wim van Dam Quantum computing and zeros of zeta functions. arXiv:quant-ph/0405081 , 2004.",
          "url": "http://arxiv.org/abs/quant-ph/0405081"
        }
      ],
      "n_referencias": 2,
      "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."
      }
    },
    {
      "id": "weight-enumerators",
      "nombre": "Weight Enumerators",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Calcular enumeradores de peso de codigos, que describen la distribucion de distancias de un codigo corrector.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 45,
          "cita": "Joseph Geraci A new connection between quantum circuits, graphs and the Ising partition function Quantum Information Processing , 7(5):227-242, 2008. [ arXiv:0801.4833 ]",
          "url": "http://arxiv.org/abs/0801.4833"
        },
        {
          "n": 46,
          "cita": "Joseph Geraci and Frank Van Bussel A theorem on the quantum evaluation of weight enumerators for a certain class of cyclic Codes with a note on cyclotomic cosets. arXiv:cs/0703129 , 2007.",
          "url": "http://arxiv.org/abs/cs/0703129"
        },
        {
          "n": 65,
          "cita": "E. Knill and R. Laflamme Quantum computation and quadratically signed weight enumerators. Information Processing Letters , 79(4):173-179, 2001. [ arXiv:quant-ph/9909094 ]",
          "url": "http://arxiv.org/abs/quant-ph/9909094"
        },
        {
          "n": 67,
          "cita": "Daniel A. Lidar On the quantum computational complexity of the Ising spin glass partition function and of knot invariants. New Journal of Physics Vol. 6, pg. 167, 2004. [ arXiv:quant-ph/0309064 ]",
          "url": "http://arxiv.org/abs/quant-ph/0309064"
        }
      ],
      "n_referencias": 4,
      "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."
      }
    },
    {
      "id": "simulated-annealing",
      "nombre": "Simulated Annealing",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Acelerar el recocido simulado: llegar al estado de equilibrio de una cadena de Markov en menos pasos.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 84,
          "cita": "R. D. Somma, S. Boixo, and H. Barnum Quantum simulated annealing. arXiv:0712.1008 , 2007.",
          "url": "http://arxiv.org/abs/0712.1008"
        },
        {
          "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": 135,
          "cita": "Mario Szegedy Spectra of Quantized Walks and a \\( \\sqrt{\\delta \\epsilon} \\) rule. arXiv:quant-ph/0401053 , 2004.",
          "url": "http://arxiv.org/abs/quant-ph/0401053"
        },
        {
          "n": 177,
          "cita": "R. D. Somma, S. Boixo, H. Barnum, and E. Knill Quantum simulations of classical annealing. Physical Review Letters 101:130504, 2008. [ arXiv:0804.1571 ]",
          "url": "http://arxiv.org/abs/0804.1571"
        },
        {
          "n": 265,
          "cita": "Ashley Montanaro Quantum speedup of Monte Carlo methods arXiv:1504.06987 , 2015.",
          "url": "http://arxiv.org/abs/1504.06987"
        }
      ],
      "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."
      }
    },
    {
      "id": "string-rewriting",
      "nombre": "String Rewriting",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Decidir problemas de palabras en sistemas de reescritura de cadenas.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 58,
          "cita": "Dominik Janzing and Pawel Wocjan BQP-complete problems concerning mixing properties of classical random walks on sparse graphs. arXiv:quant-ph/0610235 , 2006.",
          "url": "http://arxiv.org/abs/quant-ph/0610235"
        },
        {
          "n": 59,
          "cita": "Dominik Janzing and Pawel Wocjan A promiseBQP-complete string rewriting problem. Quantum Information and Computation , 10(3/4):234-257, 2010. [ arXiv:0705.1180 ]",
          "url": "http://arxiv.org/abs/0705.1180"
        }
      ],
      "n_referencias": 2,
      "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."
      }
    },
    {
      "id": "matrix-powers",
      "nombre": "Matrix Powers",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Estimar entradas de potencias altas de una matriz, sin calcular la matriz completa.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 60,
          "cita": "Dominik Janzing and Pawel Wocjan A simple promiseBQP-complete matrix problem. Theory of Computing , 3:61-79, 2007. [ arXiv:quant-ph/0606229 ]",
          "url": "http://arxiv.org/abs/quant-ph/0606229"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "probabilistic-sampling",
      "nombre": "Probabilistic Sampling",
      "categoria": "Approximation and Simulation Algorithms",
      "categoria_id": "BQP",
      "problema": "Muestrear de distribuciones que un computador clasico no sabe muestrear eficientemente.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#BQP",
      "implementaciones": [],
      "referencias": [
        {
          "n": 473,
          "cita": "Scott Aaronson and Alex Arkhipov The computational complexity of linear optics Proceedings of STOC11 , 333-342, 2011. [ arXiv:1011.3245 ]",
          "url": "https://arxiv.org/abs/1011.3245"
        },
        {
          "n": 474,
          "cita": "Dan Shepherd and Michael J. Bremner Temporally unstructured quantum computation Proceedings of the Royal Society A , 465(2105):1413-1439, 2009. [ arXiv:0809.0847 ]",
          "url": "https://arxiv.org/abs/0809.0847"
        },
        {
          "n": 475,
          "cita": "Andrew M. Childs, Tongyang Li, Jin-Peng Liu, Chunhao Wang, Ruizhe Zhang Quantum algorithms for sampling log-concave distributions and estimating normalizing constants Advances in Neural Information Processing Systems (NeurIPS) , 35:23205-23217, 2022. [ arXiv:2210.06539 ]",
          "url": "https://arxiv.org/abs/2210.06539"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "polynomial-quantum-speedups-for-constraint-satisfaction-prob",
      "nombre": "Polynomial Quantum Speedups for Constraint Satisfaction Problems",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Resolver problemas de satisfaccion de restricciones (SAT y familia) con una mejora polinomica sobre el mejor backtracking clasico.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/grover"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/qml/demos/tutorial_QUBO"
        },
        {
          "nombre": "Qrisp (Quantum Backtracking)",
          "url": "https://qrisp.eu/reference/Algorithms/QuantumBacktrackingTree.html"
        }
      ],
      "referencias": [
        {
          "n": 133,
          "cita": "Andris Ambainis Quantum Search Algorithms. SIGACT News , 35 (2):22-35, 2004. [ arXiv:quant-ph/0504012 ]",
          "url": "http://arxiv.org/abs/quant-ph/0504012"
        },
        {
          "n": 134,
          "cita": "Nicolas J. Cerf, Lov K. Grover, and Colin P. Williams Nested quantum search and NP-hard problems. Applicable Algebra in Engineering, Communication and Computing , 10 (4-5):311-338, 2000.",
          "url": null
        },
        {
          "n": 264,
          "cita": "Ashley Montanaro Quantum walk speedup of backtracking algorithms arXiv:1509.02374 , 2015.",
          "url": "http://arxiv.org/abs/1509.02374"
        },
        {
          "n": 298,
          "cita": "Salvatore Mandra, Gian Giacomo Guerreschi, and Alan Aspuru-Guzik Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems arXiv:1512.00859 , 2015.",
          "url": "http://arxiv.org/abs/1512.00859"
        },
        {
          "n": 422,
          "cita": "Andris Ambainis and Martins Kokainis Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games Proceedings of STOC 2017 , pg. 989-1002 [ arXiv:1704.06774 ]",
          "url": "https://arxiv.org/abs/1704.06774"
        },
        {
          "n": 423,
          "cita": "Fernando G.S L. Brandão, Richard Kueng, Daniel Stilck França Faster quantum and classical SDP approximations for quadratic binary optimization arXiv:1909.04613",
          "url": "https://arxiv.org/abs/1909.04613"
        },
        {
          "n": 492,
          "cita": "Alexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, and Fernando G.S.L. Brandão Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end Proceedings of STOC23 , 1131 - 1144, 2023. [ arXiv:2212.01513 ]",
          "url": "https://arxiv.org/abs/2212.01513"
        },
        {
          "n": 493,
          "cita": "M. B. Hastings A short path quantum algorithm for exact optimization Quantum , 2:78, 2018. [ arXiv:1802.10124 ]",
          "url": "https://arxiv.org/abs/1802.10124"
        }
      ],
      "n_referencias": 8,
      "remisiones": [
        {
          "ancla": "adiabatic",
          "url": "https://quantumalgorithmzoo.org/#adiabatic"
        }
      ],
      "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."
      }
    },
    {
      "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."
      }
    },
    {
      "id": "quantum-approximate-optimization",
      "nombre": "Quantum Approximate Optimization",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Buscar buenas soluciones aproximadas a problemas combinatorios con un circuito parametrizado corto. Es QAOA, y es la familia sobre la que descansa casi toda la promesa comercial de optimizacion cuantica.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/qaoa"
        },
        {
          "nombre": "Cirq",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/qaoa.py"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/qml/demos/tutorial_qaoa_intro"
        },
        {
          "nombre": "Qrisp",
          "url": "https://qrisp.eu/reference/Algorithms/qaoa/QAOA.html#qaoa"
        }
      ],
      "referencias": [
        {
          "n": 242,
          "cita": "Edward Farhi, Jeffrey Goldstone, and Sam Gutmann A quantum approximate optimization algorithm arXiv:1411.4028 , 2014.",
          "url": "http://arxiv.org/abs/1411.4028"
        },
        {
          "n": 243,
          "cita": "Edward Farhi, Jeffrey Goldstone, and Sam Gutmann A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem arXiv:1412.6062 , 2014.",
          "url": "http://arxiv.org/abs/1412.6062"
        },
        {
          "n": 260,
          "cita": "Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, and John Wright Beating the random assignment on constraint satisfaction problems of bounded degree arXiv:1505.03424 , 2015.",
          "url": "http://arxiv.org/abs/1505.03424"
        },
        {
          "n": 300,
          "cita": "Cedric Yen-Yu Lin and Yechao Zhu Performance of QAOA on typical instances of constraint satisfaction problems with bounded degree arXiv:1601.01744 , 2016.",
          "url": "http://arxiv.org/abs/1601.01744"
        },
        {
          "n": 301,
          "cita": "Dave Wecker, Matthew B. Hastings, and Matthias Troyer Training a quantum optimizer arXiv:1605.05370 , 2016.",
          "url": "http://arxiv.org/abs/1605.05370"
        },
        {
          "n": 302,
          "cita": "Edward Farhi and Aram W. Harrow Quantum supremacy through the quantum approximate optimization algorithm arXiv:1602.07674 , 2016.",
          "url": "http://arxiv.org/abs/1602.07674"
        },
        {
          "n": 314,
          "cita": "Z-C Yang, A. Rahmani, A. Shabani, H. Neven, and C. Chamon Optimizing variational quantum algorithms using Pontryagins's minimum principle arXiv:1607.06473 , 2016.",
          "url": "http://arxiv.org/abs/1607.06473"
        },
        {
          "n": 451,
          "cita": "R. Shaydulin, C. Li, S. Chakrabarti, M. DeCross, D. Herman, N. Kumar, J. Larson, D. Lykov, P. Minssen, Y. Sun, Y. Alexeev, J. M. Dreiling, J. P. Gaebler, T. M. Gatterman, J. A. Gerber, K. Gilmore, D. Gresh, N. Hewitt, C. V. Horst, S. Hu, J. Johansen, M. Matheny, T. Mengle, M. Mills, S. A. Moses, B. Neyenhuis, P. Siegfried, R. Yalovetzky, and M. Pistoia Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem Science Advances 10(22):eadm6761, 2024. [ arXiv:2308.02342 ]",
          "url": "https://arxiv.org/abs/2308.02342"
        },
        {
          "n": 452,
          "cita": "Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, and Leo Zhou The Quantum Approximate Optimization Algorithm at high depth for MaxCut on large-girth regular graphs and the Sherrington-Kirkpatrick model Proceedings of TQC22 7:1-7:21, 2022. [ arXiv:2110.14206 ]",
          "url": "https://arxiv.org/abs/2110.14206"
        },
        {
          "n": 476,
          "cita": "Sami Boulebnane and Ashley Montanaro Solving boolean satisfiability problems with the quantum approximate optimization algorithm arXiv:2208.06909 , 2022.",
          "url": "https://arxiv.org/abs/2208.06909"
        },
        {
          "n": 531,
          "cita": "Edward Farhi, Sam Gutmann, Daniel Ranard, and Benjamin Villalonga Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA arXiv:2503.12789 , 2023.",
          "url": "https://arxiv.org/abs/2503.12789"
        },
        {
          "n": 532,
          "cita": "Sami Boulebnane, Abid Khan, Minzhao Liu, Jeffrey Larson, Dylan Herman, Ruslan Shaydulin, and Marco Pistoia Evidence that the Quantum Approximate Optimization Algorithm Optimizes the Sherrington-Kirkpatrick Model Efficiently in the Average Case arXiv:2505.07929 , 2023.",
          "url": "https://arxiv.org/abs/2505.07929"
        }
      ],
      "n_referencias": 12,
      "remisiones": [],
      "evidencia_rosetta": {
        "medido": true,
        "recetas": [
          {
            "recipe_id": "RQ-0012",
            "nota": "Compresion de portafolio con restricciones (Finanzas)",
            "estado": "measuring"
          },
          {
            "recipe_id": "RQ-0019",
            "nota": "Ruteo de flota bajo incertidumbre (Mineria)",
            "estado": "in test"
          },
          {
            "recipe_id": "RQ-0033",
            "nota": "Expansion de red electrica bajo estres (Energia)",
            "estado": "measuring"
          }
        ],
        "donde": "https://rosettaquantum.com/v1/runs?recipe=RQ-0012"
      }
    },
    {
      "id": "gradient-estimation-and-learning-polynomials",
      "nombre": "Gradient Estimation and Learning Polynomials",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Estimar el gradiente de una funcion suave en un punto, o aprender los coeficientes de un polinomio, consultando un oraculo.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#gradients",
      "implementaciones": [],
      "referencias": [
        {
          "n": 20,
          "cita": "David Bulger Quantum basin hopping with gradient-based local optimisation. arXiv:quant-ph/0507193 , 2005.",
          "url": "http://arxiv.org/abs/quant-ph/0507193"
        },
        {
          "n": 61,
          "cita": "Stephen P. Jordan Fast quantum algorithm for numerical gradient estimation. Physical Review Letters , 95:050501, 2005. [ arXiv:quant-ph/0405146 ]",
          "url": "http://arxiv.org/abs/quant-ph/0405146"
        },
        {
          "n": 62,
          "cita": "Stephen P. Jordan Quantum Computation Beyond the Circuit Model . PhD thesis, Massachusetts Institute of Technology, 2008. [ arXiv:0809.2307 ]",
          "url": "http://arxiv.org/abs/0809.2307"
        },
        {
          "n": 94,
          "cita": "Andrew Yao On computing the minima of quadratic forms. In Proceedings of the 7th ACM Symposium on Theory of Computing , pages 23-26, 1975.",
          "url": null
        },
        {
          "n": 436,
          "cita": "András Gilyén, Srininvasan Arunachalam, and Nathan Wiebe Optimizing quantum optimization algorithms via faster quantum gradient computation Proceedings SODA 2019 , pp. 1425-1444 [ arXiv:1711.00465 ]",
          "url": "https://arxiv.org/abs/1711.00465"
        },
        {
          "n": 437,
          "cita": "Arjan Cornelissen Quantum gradient estimation of Gevrey functions arXiv:1909.13528 , 2019.",
          "url": "https://arxiv.org/abs/1909.13528"
        },
        {
          "n": 438,
          "cita": "Pan Gao, Keren Li, Shijie Wei, Jiancun Gao, and Guilu Long Quantum gradient algorithm for general polynomials Physical Review A 103:042403, 2021. [ arXiv:2004.11086 ]",
          "url": "https://arxiv.org/abs/2004.11086"
        },
        {
          "n": 439,
          "cita": "Yuxin Zhang and Changpeng Shao Quantum spectral method for gradient and Hessian estimation arXiv:2407.03833 , 2024.",
          "url": "https://arxiv.org/abs/2407.03833"
        }
      ],
      "n_referencias": 8,
      "remisiones": [
        {
          "ancla": "convex_optimization",
          "url": "https://quantumalgorithmzoo.org/#convex_optimization"
        }
      ],
      "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."
      }
    },
    {
      "id": "semidefinite-programming",
      "nombre": "Semidefinite Programming",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Optimizar una funcion lineal sobre matrices semidefinidas positivas sujetas a restricciones lineales. Es el caballo de batalla de la relajacion convexa.",
      "speedup_declarado": "Polynomial (with some exceptions)",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#semidefinite",
      "implementaciones": [],
      "referencias": [
        {
          "n": 121,
          "cita": "David Poulin and Pawel Wocjan Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer. Physical Review Letters 103:220502, 2009. [ arXiv:0905.2199 ]",
          "url": "http://arxiv.org/abs/0905.2199"
        },
        {
          "n": 307,
          "cita": "Anirban Naryan Chowdhury and Rolando D. Somma Quantum algorithms for Gibbs sampling and hitting-time estimation arXiv:1603.02940 , 2016.",
          "url": "http://arxiv.org/abs/1603.02940"
        },
        {
          "n": 313,
          "cita": "Fernando G.S.L. Brandao and Krysta Svore Quantum speed-ups for semidefinite programming arXiv:1609.05537 , 2016.",
          "url": "http://arxiv.org/abs/1609.05537"
        },
        {
          "n": 383,
          "cita": "F.G.S.L. Brandão, A. Kalev, T. Li, C. Y.-Y. Lin, K. M. Svore, and X. Wu Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning Proceedings of ICALP 2019 [ arXiv:1710.02581 ]",
          "url": "https://arxiv.org/abs/1710.02581"
        },
        {
          "n": 421,
          "cita": "Nai-Hui Chia, Andráas Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, and Chunhao Wang Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning Proceedings of STOC 2020 , pg. 387-400 [ arXiv:1910.06151 ]",
          "url": "https://arxiv.org/abs/1910.06151"
        },
        {
          "n": 425,
          "cita": "Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf Quantum SDP-Solvers: Better upper and lower bounds Quantum 4:230, 2020. [ arXiv:1705.01843 ]",
          "url": "https://arxiv.org/abs/1705.01843"
        }
      ],
      "n_referencias": 6,
      "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."
      }
    },
    {
      "id": "convex-optimization",
      "nombre": "Convex Optimization",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Optimizar sobre cuerpos convexos y estimar sus volumenes, con acceso al cuerpo por oraculo de pertenencia.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#convex_optimization",
      "implementaciones": [],
      "referencias": [
        {
          "n": 130,
          "cita": "Martin Rötteler Quantum algorithms to solve the hidden shift problem for quadratics and for functions of large Gowers norm. In Proceedings of MFCS 2009 , pg 663-674. [ arXiv:0911.4724 ]",
          "url": "http://arxiv.org/abs/0911.4724"
        },
        {
          "n": 146,
          "cita": "Ashley Montanaro The quantum query complexity of learning multilinear polynomials. Information Processing Letters , 112(11):438-442, 2012. [ arXiv:1105.3310 ]",
          "url": "http://arxiv.org/abs/1105.3310"
        },
        {
          "n": 147,
          "cita": "Tad Hogg Highly structured searches with quantum computers. Physical Review Letters 80: 2473, 1998.",
          "url": null
        },
        {
          "n": 148,
          "cita": "Markus Hunziker and David A. Meyer Quantum algorithms for highly structured search problems. Quantum Information Processing , Vol. 1, No. 3, pg. 321-341, 2002.",
          "url": null
        },
        {
          "n": 223,
          "cita": "David A. Meyer and James Pommersheim Single-query learning from abelian and non-abelian Hamming distance oracles arXiv:0912.0583",
          "url": "http://arxiv.org/abs/0912.0583"
        },
        {
          "n": 418,
          "cita": "Shouvanik Chakrabarti, Andrew M. Childs, Tongyang Li, and Xiaodi Wu Quantum algorithms and lower bounds for convex optimization arXiv:1809.01731",
          "url": "https://arxiv.org/abs/1809.01731"
        },
        {
          "n": 419,
          "cita": "S. Chakrabarti, A. M. Childs, S.-H. Hung, T. Li, C. Wang, and X. Wu Quantum algorithm for estimating volumes of convex bodies arXiv:1908.03903",
          "url": "https://arxiv.org/abs/1908.03903"
        },
        {
          "n": 420,
          "cita": "Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf Convex optimization using quantum oracles arXiv:1809.00643",
          "url": "https://arxiv.org/abs/1809.00643"
        },
        {
          "n": 461,
          "cita": "Simon Apers and Sander Gribling Quantum speedups for linear programming via interior point methods arXiv:2311.03215 , 2023.",
          "url": "https://arxiv.org/abs/2311.03215"
        },
        {
          "n": 477,
          "cita": "Ankit Garg, Robin Kothari, Praneeth Netrapalli, and Suhail Sherif No quantum speedup over gradient descent for non-smooth convex optimization arXiv:2010.01801 , 2020.",
          "url": "https://arxiv.org/abs/2010.01801"
        },
        {
          "n": 497,
          "cita": "Yanlin Chen and Ronald de Wolf Quantum algorithms and lower bounds for linear regression with norm constraints arXiv:2110.13086 , 2021.",
          "url": "https://arxiv.org/abs/2110.13086"
        }
      ],
      "n_referencias": 11,
      "remisiones": [
        {
          "ancla": "gradients",
          "url": "https://quantumalgorithmzoo.org/#gradients"
        },
        {
          "ancla": "semidefinite",
          "url": "https://quantumalgorithmzoo.org/#semidefinite"
        }
      ],
      "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."
      }
    },
    {
      "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."
      }
    },
    {
      "id": "linear-systems",
      "nombre": "Linear Systems",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Resolver Ax = b. Es HHL, y el asterisco importa: entrega un estado cuantico que codifica la solucion, no el vector de respuesta.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [
        {
          "nombre": "Classiq (HHL)",
          "url": "https://short.classiq.io/hhl"
        },
        {
          "nombre": "Classiq (QSVT)",
          "url": "https://short.classiq.io/qsvt_inversion"
        },
        {
          "nombre": "Cirq (HHL)",
          "url": "https://github.com/quantumlib/Cirq/blob/main/examples/grover.py"
        },
        {
          "nombre": "Qrisp/Pennylane (HHL)",
          "url": "https://pennylane.ai/qml/demos/linear_equations_hhl_qrisp_catalyst"
        }
      ],
      "referencias": [
        {
          "n": 104,
          "cita": "Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd Quantum algorithm for solving linear systems of equations. Physical Review Letters 15(103):150502, 2009. [ arXiv:0811.3171 ]",
          "url": "http://arxiv.org/abs/0811.3171"
        },
        {
          "n": 138,
          "cita": "Andris Ambainis Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations. arXiv:1010.4458 , 2010.",
          "url": "http://arxiv.org/abs/1010.4458"
        },
        {
          "n": 156,
          "cita": "Dominic Berry Quantum algorithms for solving linear differential equations. J. Phys. A: Math. Theor. 47, 105301, 2014. [ arXiv:1010.2745 ].",
          "url": "http://arxiv.org/abs/1010.2745"
        },
        {
          "n": 169,
          "cita": "Nathan Wiebe, Daniel Braun, and Seth Lloyd Quantum data-fitting. Physical Review Letters 109, 050505, 2012. [ arXiv:1204.5242 ]",
          "url": "http://arxiv.org/abs/1204.5242"
        },
        {
          "n": 210,
          "cita": "Guoming Wang Quantum algorithms for approximating the effective resistances of electrical networks. arXiv:1311.1851",
          "url": "http://arxiv.org/abs/1311.1851"
        },
        {
          "n": 214,
          "cita": "Seth Lloyd, Masoud Mohseni, and Patrick Robentrost Quantum algorithms for supervised and unsupervised machine learning arXiv:1307.0411",
          "url": "http://arxiv.org/abs/1307.0411"
        },
        {
          "n": 220,
          "cita": "Amnon Ta-Shma Inverting well conditioned matrices in quantum logspace In Proceedings of STOC 2013 pg. 881-890.",
          "url": null
        },
        {
          "n": 222,
          "cita": "Seth Lloyd, Silvano Garnerone, and Paolo Zanardi Quantum algorithms for topological and geometric analysis of big data arXiv:1408.3106",
          "url": "http://arxiv.org/abs/1408.3106"
        },
        {
          "n": 246,
          "cita": "Scott Aaronson Read the fine print Nature Physics 11:291-293, 2015. [ fulltext ]",
          "url": "http://www.scottaaronson.com/papers/qml.pdf"
        },
        {
          "n": 249,
          "cita": "B. D. Clader, B. C. Jacobs, and C. R. Sprouse Preconditioned quantum linear system algorithm Phys. Rev. Lett. 110:250504, 2013. [ arXiv:1301.2340 ]",
          "url": "http://arxiv.org/abs/1301.2340"
        },
        {
          "n": 250,
          "cita": "S. Lloyd, M. Mohseni, and P. Rebentrost Quantum principal component analysis Nature Physics. 10(9):631, 2014. [ arXiv:1307.0401 ]",
          "url": "http://arxiv.org/abs/1307.0401"
        },
        {
          "n": 251,
          "cita": "Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd Quantum support vector machine for big data classification Phys. Rev. Lett. 113, 130503, 2014. [ arXiv:1307.0471 ]",
          "url": "http://arxiv.org/abs/1307.0471"
        },
        {
          "n": 263,
          "cita": "Andrew M. Childs, Robin Kothari, and Rolando D. Somma Quantum linear systems algorithm with exponentially improved dependence on precision arXiv:1511.02306 , 2015.",
          "url": "http://arxiv.org/abs/1511.02306"
        },
        {
          "n": 279,
          "cita": "Bill Fefferman and Cedric Yen-Yu Lin A complete characterization of unitary quantum space arXiv:1604.01384 , 2016.",
          "url": "http://arxiv.org/abs/1604.01384"
        },
        {
          "n": 296,
          "cita": "Ashley Montanaro and Sam Pallister Quantum algorithms and the finite element method arXiv:1512.05903 , 2015.",
          "url": "http://arxiv.org/abs/1512.05903"
        },
        {
          "n": 297,
          "cita": "Lin-Chun Wan, Chao-Hua Yu, Shi-Jie Pan, Fei Gao, and Qiao-Yan Wen Quantum algorithm for the Toeplitz systems arXiv:1608.02184 , 2016.",
          "url": "http://arxiv.org/abs/1608.02184"
        },
        {
          "n": 309,
          "cita": "Iordanis Kerenidis and Anupam Prakash Quantum recommendation systems Innovations in Theoretical Computer Science (ITCS 2017) , LIPIcs, vol. 67 , pg. 1868-8969 . [ arXiv:1603.08675 ]",
          "url": "http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16054"
        },
        {
          "n": 369,
          "cita": "Pedro C.S. Costa, Stephen Jordan, and Aaron Ostrander Quantum algorithm for simulating the wave equation arXiv:1711.05394 , 2017.",
          "url": "https://arxiv.org/abs/1711.05394"
        },
        {
          "n": 400,
          "cita": "Ewin Tang A quantum-inspired classical algorithm for recommendation systems In Proceedings of STOC 2019 , pg. 217-228. [ arXiv:1807.04271 ]",
          "url": "https://arxiv.org/abs/1807.04271"
        },
        {
          "n": 401,
          "cita": "Ewin Tang Quantum-inspired classical algorithms for principal component analysis and supervised clustering arXiv:1811.00414 , 2018.",
          "url": "https://arxiv.org/abs/1811.00414"
        },
        {
          "n": 402,
          "cita": "L. Wossnig, Z. Zhao, and A. Prakash A quantum linear system algorithm for dense matrices Physical Review Letters vol. 120, no. 5, pg. 050502, 2018. arXiv:1704.06174 , 2017.",
          "url": "https://arxiv.org/abs/1704.06174"
        },
        {
          "n": 433,
          "cita": "András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics Proceedings of STOC 2019 , pg. 193-204 [ arXiv:1806.01838 ]",
          "url": "https://arxiv.org/abs/1806.01838"
        },
        {
          "n": 494,
          "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": 543,
          "cita": "B. Baskaran, A. S. Rawat, A. Jayashankar, D. Chakravarti, K. Sugisaki, S. Roy, S. Mandal, D. Mukherjee, and V. S. Prasannaa Adapting the Harrow-Hassidim-Lloyd algorithm to quantum many-body theory Phys. Rev. Research , 5:043113, 2023. [ arXiv:2212.14781 ]",
          "url": "https://arxiv.org/abs/2212.14781"
        }
      ],
      "n_referencias": 24,
      "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."
      }
    },
    {
      "id": "estimating-determinants-and-other-spectral-sums",
      "nombre": "Estimating Determinants and Other Spectral Sums",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Estimar determinantes, trazas y otras sumas sobre el espectro de una matriz.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [],
      "referencias": [
        {
          "n": 527,
          "cita": "Alessandro Luongo and Changpeng Shao Quantum algorithms for spectral sums arXiv:2011.06475 , 2020.",
          "url": "https://arxiv.org/abs/2011.06475"
        },
        {
          "n": 528,
          "cita": "Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone A quantum algorithm for estimating the determinant arXiv:2504.11049 , 2025.",
          "url": "https://arxiv.org/abs/2504.11049"
        }
      ],
      "n_referencias": 2,
      "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."
      }
    },
    {
      "id": "machine-learning",
      "nombre": "Machine Learning",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Entrada paraguas: agrupa las tecnicas cuanticas propuestas para aprendizaje automatico. Es tambien el area donde mas claims cayeron por dequantizacion, es decir, por algoritmos clasicos que despues igualaron la supuesta ventaja.",
      "speedup_declarado": "Varies",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ML",
      "implementaciones": [
        {
          "nombre": "Classiq (QSVM)",
          "url": "https://short.classiq.io/qsvm"
        },
        {
          "nombre": "Classiq (Autoencoder)",
          "url": "https://short.classiq.io/autoencoder"
        },
        {
          "nombre": "PennyLane",
          "url": "https://pennylane.ai/qml/demos/tutorial_variational_classifier"
        }
      ],
      "referencias": [
        {
          "n": 11,
          "cita": "Ethan Bernstein and Umesh Vazirani Quantum complexity theory. In Proceedings of the 25th ACM Symposium on the Theory of Computing , pages 11-20, 1993.",
          "url": null
        },
        {
          "n": 23,
          "cita": "A. M. Childs, L. J. Schulman, and U. V. Vazirani Quantum algorithms for hidden nonlinear structures. In Proceedings of the 48th IEEE Symposium on Foundations of Computer Science , pages 395-404, 2007. [ arXiv:0705.2784 ]",
          "url": "http://arxiv.org/abs/0705.2784"
        },
        {
          "n": 31,
          "cita": "Thomas Decker, Jan Draisma, and Pawel Wocjan Quantum algorithm for identifying hidden polynomials. Quantum Information and Computation , 9(3):215-230, 2009. [ arXiv:0706.1219 ]",
          "url": "http://arxiv.org/abs/0706.1219"
        },
        {
          "n": 104,
          "cita": "Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd Quantum algorithm for solving linear systems of equations. Physical Review Letters 15(103):150502, 2009. [ arXiv:0811.3171 ]",
          "url": "http://arxiv.org/abs/0811.3171"
        },
        {
          "n": 146,
          "cita": "Ashley Montanaro The quantum query complexity of learning multilinear polynomials. Information Processing Letters , 112(11):438-442, 2012. [ arXiv:1105.3310 ]",
          "url": "http://arxiv.org/abs/1105.3310"
        },
        {
          "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": 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": 212,
          "cita": "Thomas Decker, Peter Høyer, Gabor Ivanyos, and Miklos Santha Polynomial time quantum algorithms for certain bivariate hidden polynomial problems arXiv:1305.1543",
          "url": "http://arxiv.org/abs/1305.1543"
        },
        {
          "n": 214,
          "cita": "Seth Lloyd, Masoud Mohseni, and Patrick Robentrost Quantum algorithms for supervised and unsupervised machine learning arXiv:1307.0411",
          "url": "http://arxiv.org/abs/1307.0411"
        },
        {
          "n": 221,
          "cita": "Nathan Wiebe, Ashish Kapoor, and Krysta Svore Quantum deep learning arXiv:1412.3489",
          "url": "http://arxiv.org/abs/1412.3489"
        },
        {
          "n": 222,
          "cita": "Seth Lloyd, Silvano Garnerone, and Paolo Zanardi Quantum algorithms for topological and geometric analysis of big data arXiv:1408.3106",
          "url": "http://arxiv.org/abs/1408.3106"
        },
        {
          "n": 224,
          "cita": "Markus Hunziker, David A. Meyer, Jihun Park, James Pommersheim, and Mitch Rothstein The geometry of quantum learning Quantum Information Processing 9:321-341, 2010. [ arXiv:quant-ph/0309059 ]",
          "url": "http://arxiv.org/abs/quant-ph/0309059"
        },
        {
          "n": 236,
          "cita": "Andrew W. Cross, Graeme Smith, and John A. Smolin Quantum learning robust to noise arXiv:1407.5088",
          "url": "http://arxiv.org/abs/1407.5088"
        },
        {
          "n": 237,
          "cita": "Aram W. Harrow and David J. Rosenbaum Uselessness for an oracle model with internal randomness Quantum Information and Computation 14(7/8):608-624, 2014 [ arXiv:1111.1462 ]",
          "url": "http://arxiv.org/abs/1111.1462"
        },
        {
          "n": 246,
          "cita": "Scott Aaronson Read the fine print Nature Physics 11:291-293, 2015. [ fulltext ]",
          "url": "http://www.scottaaronson.com/papers/qml.pdf"
        },
        {
          "n": 250,
          "cita": "S. Lloyd, M. Mohseni, and P. Rebentrost Quantum principal component analysis Nature Physics. 10(9):631, 2014. [ arXiv:1307.0401 ]",
          "url": "http://arxiv.org/abs/1307.0401"
        },
        {
          "n": 251,
          "cita": "Patrick Rebentrost, Masoud Mohseni, and Seth Lloyd Quantum support vector machine for big data classification Phys. Rev. Lett. 113, 130503, 2014. [ arXiv:1307.0471 ]",
          "url": "http://arxiv.org/abs/1307.0471"
        },
        {
          "n": 299,
          "cita": "J. Adcock, E. Allen, M. Day, S. Frick, J. Hinchliff, M. Johnson, S. Morley-Short, S. Pallister, A. Price, and S. Stanisic Advances in quantum machine learning arXiv:1512.02900 , 2015.",
          "url": "http://arxiv.org/abs/1512.02900"
        },
        {
          "n": 309,
          "cita": "Iordanis Kerenidis and Anupam Prakash Quantum recommendation systems Innovations in Theoretical Computer Science (ITCS 2017) , LIPIcs, vol. 67 , pg. 1868-8969 . [ arXiv:1603.08675 ]",
          "url": "http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16054"
        },
        {
          "n": 331,
          "cita": "Peter Wittek Quantum Machine Learning: what quantum computing means to data mining Academic Press, 2014.",
          "url": null
        },
        {
          "n": 332,
          "cita": "Maria Schuld, Ilya Sinayskiy, and Francesco Petruccione An introduction to quantum machine learning Contemporary Physics , 56(2):172, 2014. [ arXiv:1409.3097 ]",
          "url": "https://arxiv.org/abs/1409.3097"
        },
        {
          "n": 333,
          "cita": "J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd Quantum machine learning arXiv:1611.09347",
          "url": "https://arxiv.org/abs/1611.09347"
        },
        {
          "n": 334,
          "cita": "Esma Aïmeur, Gilles Brassard, and Sébastien Gambs Machine learning in a quantum world In Advances in Artificial Intelligence: 19th Conference of the Canadian Society for Computational Studies of Intelligence pg. 431-442, Springer, 2006.",
          "url": null
        },
        {
          "n": 335,
          "cita": "Vedran Dunjko, Jacob Taylor, and Hans Briegel Quantum-enhanced machine learning Phys. Rev. Lett 117:130501, 2016.",
          "url": null
        },
        {
          "n": 336,
          "cita": "Nathan Wiebe, Ashish Kapoor, and Krysta Svore Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning Quantum Information and Computation 15(3/4): 0318-0358, 2015. [ arXiv:1401.2142 ]",
          "url": "https://arxiv.org/abs/1401.2142"
        },
        {
          "n": 337,
          "cita": "Seokwon Yoo, Jeongho Bang, Changhyoup Lee, and Junhyoug Lee A quantum speedup in machine learning: finding a N-bit Boolean function for a classification New Journal of Physics 6(10):103014, 2014. [ arXiv:1303.6055 ]",
          "url": "https://arxiv.org/abs/1303.6055"
        },
        {
          "n": 338,
          "cita": "Maria Schuld, Ilya Sinayskiy, and Francesco Petruccione Prediction by linear regression on a quantum computer Physical Review A 94:022342, 2016. [ arXiv:1601.07823 ]",
          "url": "https://arxiv.org/abs/1601.07823"
        },
        {
          "n": 339,
          "cita": "Zhikuan Zhao, Jack K. Fitzsimons, and Joseph F. Fitzsimons Quantum assisted Gaussian process regression arXiv:1512.03929",
          "url": "https://arxiv.org/abs/1512.03929"
        },
        {
          "n": 340,
          "cita": "Esma Aïmeur, Gilles Brassard, and Sébastien Gambs Quantum speed-up for unsupervised learning Machine Learning , 90(2):261-287, 2013.",
          "url": null
        },
        {
          "n": 341,
          "cita": "Nathan Wiebe, Ashish Kapoor, and Krysta Svore Quantum perceptron models Advances in Neural Information Processing Systems 29 (NIPS 2016), pg. 3999–4007, 2016. [ arXiv:1602.04799 ]",
          "url": "https://arxiv.org/abs/1602.04799"
        },
        {
          "n": 342,
          "cita": "G. Paparo, V. Dunjko, A. Makmal, M. Martin-Delgado, and H. Briegel Quantum speedup for active learning agents Physical Review X 4(3):031002, 2014. [ arXiv:1401.4997 ]",
          "url": "https://arxiv.org/abs/1401.4997"
        },
        {
          "n": 343,
          "cita": "Daoyi Dong, Chunlin Chen, Hanxiong Li, and Tzyh-Jong Tarn Quantum reinforcement learning IEEE Transactions on Systems, Man, and Cybernetics- Part B (Cybernetics) 38(5):1207, 2008.",
          "url": null
        },
        {
          "n": 344,
          "cita": "Daniel Crawford, Anna Levit, Navid Ghadermarzy, Jaspreet S. Oberoi, and Pooya Ronagh Reinforcement learning using quantum Boltzmann machines arXiv:1612.05695 , 2016.",
          "url": "https://arxiv.org/abs/1612.05695"
        },
        {
          "n": 345,
          "cita": "Steven H. Adachi and Maxwell P. Henderson Application of Quantum Annealing to Training of Deep Neural Networks arXiv:1510.06356 , 2015.",
          "url": "https://arxiv.org/abs/1510.06356"
        },
        {
          "n": 346,
          "cita": "M. Benedetti, J. Realpe-Gómez, R. Biswas, and A. Perdomo-Ortiz Quantum-assisted learning of graphical models with arbitrary pairwise connectivity arXiv:1609.02542 , 2016.",
          "url": "https://arxiv.org/abs/1609.02542"
        },
        {
          "n": 348,
          "cita": "M. H. Amin, E. Andriyash, J. Rolfe, B. Kulchytskyy, and R. Melko Quantum Boltzmann machine arXiv:1601.02036 , 2016.",
          "url": "https://arxiv.org/abs/1601.02036"
        },
        {
          "n": 349,
          "cita": "Peter Wittek and Christian Gogolin Quantum enhanced inference in Markov logic networks Scientific Reports 7:45672, 2017. [ arXiv:1611.08104 ]",
          "url": "https://arxiv.org/abs/1611.08104"
        },
        {
          "n": 350,
          "cita": "N. H. Bshouty and J. C. Jackson Learning DNF over the uniform distribution using a quantum example oracle SIAM Journal on Computing 28(3):1136-1153, 1999.",
          "url": null
        },
        {
          "n": 351,
          "cita": "Srinivasan Arunachalam and Ronald de Wolf A survey of quantum learning theory arXiv:1701.06806 , 2017.",
          "url": "https://arxiv.org/abs/1701.06806"
        },
        {
          "n": 352,
          "cita": "Rocco A. Servedio and Steven J. Gortler Equivalences and separations between quantum and classical learnability SIAM Journal on Computing , 33(5):1067-1092, 2017.",
          "url": null
        },
        {
          "n": 353,
          "cita": "Srinivasan Arunachalam and Ronald de Wolf Optimal quantum sample complexity of learning algorithms arXiv:1607.00932 , 2016.",
          "url": "https://arxiv.org/abs/1607.00932"
        },
        {
          "n": 354,
          "cita": "Alex Monràs, Gael Sentís, and Peter Wittek Inductive quantum learning: why you are doing it almost right arXiv:1605.07541 , 2016.",
          "url": "https://arxiv.org/abs/1605.07541"
        },
        {
          "n": 355,
          "cita": "A. Bisio, G. Chiribella, G. M. D'Ariano, S. Facchini, and P. Perinotti Optimal quantum learning of a unitary transformation Physical Review A 81:032324, 2010. [ arXiv:0903.0543 ]",
          "url": "https://arxiv.org/abs/0903.0543"
        },
        {
          "n": 356,
          "cita": "M. Sasaki, A. Carlini, and R. Jozsa Quantum template matching Physical Review A 64:022317, 2001. [ arXiv:quant-ph/0102020 ]",
          "url": "https://arxiv.org/abs/quant-ph/0102020"
        },
        {
          "n": 357,
          "cita": "Masahide Sasaki and Alberto Carlini Quantum learning and universal quantum matching machine Physical Review A 66:022303, 2002. [ arXiv:quant-ph/0202173 ]",
          "url": "https://arxiv.org/abs/quant-ph/0202173"
        },
        {
          "n": 358,
          "cita": "Esma Aïmeur, Gilles Brassard, and Sébastien Gambs Quantum clustering algorithms In Proceedings of the 24th International Conference on Machine Learning (ICML) , pg. 1-8, 2007.",
          "url": null
        },
        {
          "n": 359,
          "cita": "Iordanis Kerenidis and Anupam Prakash Quantum gradient descent for linear systems and least squares arXiv:1704.04992 , 2017.",
          "url": "https://arxiv.org/abs/1704.04992"
        },
        {
          "n": 400,
          "cita": "Ewin Tang A quantum-inspired classical algorithm for recommendation systems In Proceedings of STOC 2019 , pg. 217-228. [ arXiv:1807.04271 ]",
          "url": "https://arxiv.org/abs/1807.04271"
        },
        {
          "n": 401,
          "cita": "Ewin Tang Quantum-inspired classical algorithms for principal component analysis and supervised clustering arXiv:1811.00414 , 2018.",
          "url": "https://arxiv.org/abs/1811.00414"
        },
        {
          "n": 403,
          "cita": "Zhikuan Zhao, Alejandro Pozas-Kerstjens, Patrick Rebentrost, and Peter Wittek Bayesian Deep Learning on a Quantum Computer Quantum Machine Intelligence vol. 1, pg. 41-51, 2019. [ arXiv:1806.11463 ]",
          "url": "https://arxiv.org/abs/1806.11463"
        },
        {
          "n": 428,
          "cita": "Yunchao Liu, Srinivasan Arunachalam, and Kristan Temme A rigorous and robust quantum speed-up in supervised machine learning arXiv:2010.02174",
          "url": "https://arxiv.org/abs/2010.02174"
        },
        {
          "n": 433,
          "cita": "András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics Proceedings of STOC 2019 , pg. 193-204 [ arXiv:1806.01838 ]",
          "url": "https://arxiv.org/abs/1806.01838"
        },
        {
          "n": 456,
          "cita": "Xujie Song, Tong Liu, Shengbo Eben Li, Jingliang Duan, Wenxuan Wang, and Keqiang Li Training multi-layer neural networks on Ising machine arXiv:2311.03408 .",
          "url": "https://arxiv.org/abs/2311.03408"
        },
        {
          "n": 487,
          "cita": "Sam McArdle, András Gilyén, and Mario Berta A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits arXiv:2209.12887 , 2022.",
          "url": "https://arxiv.org/abs/2209.12887"
        },
        {
          "n": 488,
          "cita": "Bernardo Ameneyro, Vasileios Maroulas, and George Siopsis Quantum persistent homology Journal of Applied and Computational Topology , 1-20, 2024. [ arXiv:2202.12965 ]",
          "url": "https://arxiv.org/abs/2202.12965"
        },
        {
          "n": 490,
          "cita": "Dominic W. Berry, Yuan Su, Casper Gyurik, Robbie King, Joao Basso, Alexander Del Toro Barba, Abhishek Rajput, Nathan Wiebe, Vedran Dunjko, and Ryan Babbush Analyzing prospects for quantum advantage in topological data analysis PRX Quantum , 5:010319, 2022. [ arXiv:2209.13581 ]",
          "url": "https://arxiv.org/abs/2209.13581"
        }
      ],
      "n_referencias": 56,
      "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."
      }
    },
    {
      "id": "tensor-principal-component-analysis",
      "nombre": "Tensor Principal Component Analysis",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Recuperar una senal escondida en un tensor de ruido gaussiano de muchas dimensiones.",
      "speedup_declarado": "Polynomial (quartic)",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [],
      "referencias": [
        {
          "n": 424,
          "cita": "Matthew B. Hastings Classical and Quantum Algorithms for Tensor Principal Component Analysis Quantum 4:237, 2020. [ arXiv:1907.12724 ]",
          "url": "https://arxiv.org/abs/1907.12724"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "solving-linear-differential-equations",
      "nombre": "Solving Linear Differential Equations",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Resolver sistemas de ecuaciones diferenciales lineales.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [
        {
          "nombre": "Classiq",
          "url": "https://short.classiq.io/time_marching"
        }
      ],
      "referencias": [
        {
          "n": 104,
          "cita": "Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd Quantum algorithm for solving linear systems of equations. Physical Review Letters 15(103):150502, 2009. [ arXiv:0811.3171 ]",
          "url": "http://arxiv.org/abs/0811.3171"
        },
        {
          "n": 156,
          "cita": "Dominic Berry Quantum algorithms for solving linear differential equations. J. Phys. A: Math. Theor. 47, 105301, 2014. [ arXiv:1010.2745 ].",
          "url": "http://arxiv.org/abs/1010.2745"
        },
        {
          "n": 245,
          "cita": "Dominic W. Berry, Andrew M. Childs, and Robin Kothari Hamiltonian simulation with nearly optimal dependence on all parameters arXiv:1501.01715 , 2015.",
          "url": "http://arxiv.org/abs/1501.01715"
        },
        {
          "n": 249,
          "cita": "B. D. Clader, B. C. Jacobs, and C. R. Sprouse Preconditioned quantum linear system algorithm Phys. Rev. Lett. 110:250504, 2013. [ arXiv:1301.2340 ]",
          "url": "http://arxiv.org/abs/1301.2340"
        },
        {
          "n": 296,
          "cita": "Ashley Montanaro and Sam Pallister Quantum algorithms and the finite element method arXiv:1512.05903 , 2015.",
          "url": "http://arxiv.org/abs/1512.05903"
        },
        {
          "n": 369,
          "cita": "Pedro C.S. Costa, Stephen Jordan, and Aaron Ostrander Quantum algorithm for simulating the wave equation arXiv:1711.05394 , 2017.",
          "url": "https://arxiv.org/abs/1711.05394"
        },
        {
          "n": 410,
          "cita": "Dominic W. Berry, Andrew M. Childs, Aaron Ostrander, and Guoming Wang Quantum algorithm for linear differential equations with exponentially improved dependence on precision Communications in Mathematical Physics , 356(3):1057-1081, 2017. [ arXiv:1701.03684 ]",
          "url": "https://arxiv.org/abs/1701.03684"
        },
        {
          "n": 412,
          "cita": "Y. Cao, A. Papageorgiou, I. Petras, J. Traub, and S. Kais Quantum algorithm and circuit design solving the Poisson equation New Journal of Physics 15(1):013021, 2013. [ arXiv:1207.2485 ]",
          "url": "https://arxiv.org/abs/1207.2485"
        },
        {
          "n": 413,
          "cita": "S. Wang, Z. Wang, W. Li, L. Fan, Z. Wei, and Y. Gu Quantum fast Poisson solver: the algorithm and modular circuit design arXiv:1910.09756 , 2019.",
          "url": "https://arxiv.org/abs/1910.09756"
        },
        {
          "n": 414,
          "cita": "A. Scherer, B. Valiron, S.-C. Mau, S. Alexander, E. van den Berg, and T. Chapuran Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering crossection of a 2D target Quantum Information Processing 16:60, 2017. [ arXiv:1505.06552 ]",
          "url": "https://arxiv.org/abs/1505.06552"
        },
        {
          "n": 415,
          "cita": "Juan Miguel Arrazola, Timjan Kalajdziavski, Christian Weedbrook, and Seth Lloyd Quantum algorithm for nonhomogeneous linear partial differential equations Physical Review A 100:032306, 2019. [ arXiv:1809.02622 ]",
          "url": "https://arxiv.org/abs/1809.02622"
        },
        {
          "n": 416,
          "cita": "Andrew Childs and Jin-Peng Liu Quantum spectral methods for differential equations arXiv:1901.00961",
          "url": "https://arxiv.org/abs/1901.00961"
        },
        {
          "n": 440,
          "cita": "Ryan Babbush, Dominic W. Berry, Robin Kothari, Rolando D. Somma, and Nathan Wiebe Exponential quantum speedup in simulating coupled classical oscillators Physical Review X 13:041041, 2024. [ arXiv:2303.13012 ]",
          "url": "https://arxiv.org/abs/2303.13012"
        },
        {
          "n": 442,
          "cita": "Andrew M. Childs, Jin-Peng Liu, and Aaron Ostrander High-precision quantum algorithms for partial differential equations Quantum 5:574, 2021. [ arXiv:2002.07868 ]",
          "url": "https://arxiv.org/abs/2002.07868"
        },
        {
          "n": 446,
          "cita": "Noah Linden, Ashley Montanaro, Changpeng Shao Quantum vs. classical algorithms for solving the heat equation Communications in Mathematical Physics 395:601, 2022. [ arXiv:2004.06516 ]",
          "url": "https://arxiv.org/abs/2004.06516"
        },
        {
          "n": 459,
          "cita": "Guang Hao Low and Yuan Su Quantum eigenvalue processing arXiv:2401.06240 , 2024.",
          "url": "https://arxiv.org/abs/2401.06240"
        },
        {
          "n": 512,
          "cita": "Rolando D. Somma, Robbie King, Robin Kothari, Thomas O'Brien, and Ryan Babbush Shadow Hamiltonian Simulation arXiv:2407.21775 , 2024.",
          "url": "https://arxiv.org/abs/2407.21775"
        },
        {
          "n": 513,
          "cita": "Maarten Stroeks, Daan Lenterman, Barbara Terhal, and Yaroslav Herasymenko Solving Free Fermion Problems on a Quantum Computer arXiv:2409.04550 , 2024.",
          "url": "https://arxiv.org/abs/2409.04550"
        },
        {
          "n": 514,
          "cita": "Alice Barthe, M. Cerezo, Andrew T. Sornborger, Martín Larocca, and Diego García-Martín Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes Physical Review Letters , 134:070604, 2025. [ arXiv:2407.06290 ]",
          "url": "https://arxiv.org/abs/2407.06290"
        }
      ],
      "n_referencias": 19,
      "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."
      }
    },
    {
      "id": "solving-nonlinear-differential-equations",
      "nombre": "Solving Nonlinear Differential Equations",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Resolver ecuaciones diferenciales no lineales, con supuestos fuertes sobre cuan no lineales pueden ser.",
      "speedup_declarado": "Superpolynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [],
      "referencias": [
        {
          "n": 411,
          "cita": "Sarah K. Leyton and Tobias J. Osborne Quantum algorithm to solve nonlinear differential equations arXiv:0812.4423",
          "url": "https://arxiv.org/abs/0812.4423"
        },
        {
          "n": 417,
          "cita": "Alexander Engle, Graeme Smith, and Scott E. Parker A quantum algorithm for the Vlasov equation arXiv:1907.09418",
          "url": "https://arxiv.org/abs/1907.09418"
        },
        {
          "n": 426,
          "cita": "J-P Liu, H. Kolden, H. Krovi, N. Loureiro, K. Trivisa, and A. M. Childs Efficient quantum algorithm for dissipative nonlinear differential equations arXiv:2011.03185",
          "url": "https://arxiv.org/abs/2011.03185"
        },
        {
          "n": 427,
          "cita": "S. Lloyd, G. De Palma, C. Gokler, B. Kiani, Z-W Liu, M. Marvian, F. Tennie, and T. Palmer Quantum algorithm for nonlinear differential equations arXiv:2011.06571",
          "url": "https://arxiv.org/abs/2011.06571"
        },
        {
          "n": 434,
          "cita": "Dong An, Di Fang, Stephen Jordan, Jin-Peng Liu, Guang Hao Low, and Jiasu Wang Efficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation arXiv:2205.01141 , 2022.",
          "url": "https://arxiv.org/abs/2205.01141"
        },
        {
          "n": 441,
          "cita": "Hari Krovi Improved quantum algorithms for linear and nonlinear differential equations Quantum 7:913, 2023. [ arXiv:2202.01054 ]",
          "url": "https://arxiv.org/abs/2202.01054"
        },
        {
          "n": 443,
          "cita": "Dong An, Noah Linden, Jin-Peng Liu, Ashley Montanaro, Changpeng Shao, and Jiasu Wang Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance Quantum 5:481, 2021. [ arXiv:2012.06283 ]",
          "url": "https://arxiv.org/abs/2012.06283"
        },
        {
          "n": 444,
          "cita": "G. Xu, A. J. Daley, P. Givi, and R. D. Somma Turbulent mixing simulation via a quantum algorithm AIAA Journal 56(2):687-699, 2018.",
          "url": null
        },
        {
          "n": 445,
          "cita": "G. Xu, A. J. Daley, P. Givi, and R. D. Somma Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence Combustion Theory and Modelling 23(6):1090-1104, 2018.",
          "url": null
        },
        {
          "n": 447,
          "cita": "K. Kaneko, K. Miyamoto, N. Takeda, and K. Yoshino Quantum speedup of Monte Carlo integration in the directino of dimension and its application to finance Quantum Information Processing 20:185, 2021. [ arXiv:2011.02165 ]",
          "url": "https://arxiv.org/abs/2011.02165"
        },
        {
          "n": 448,
          "cita": "P. Rebentrost, B. Gupt, and T. R. Bromley Quantum computational finance: Monte Carlo pricing of financial derivatives Physical Review A 98(2):022321, 2018. [ arXiv:1805.00109 ]",
          "url": "https://arxiv.org/abs/1805.00109"
        },
        {
          "n": 449,
          "cita": "Javier Gonzalez-Conde, Ángel Rodríguez-Rozas, Enrique Solano, and Mikel Sanz Efficient Hamiltonian simulation for solving option price dynamics Physical Review Research 5:043220, 2024. [ arXiv:2101.04023 ]",
          "url": "https://arxiv.org/abs/2101.04023"
        },
        {
          "n": 450,
          "cita": "Adam Bouland, Wim van Dam, Hamed Joorati, Iordanis Kerenidis, Anupam Prakash Prospects and challenges of quantum finance arXiv:2011.06492 , 2020.",
          "url": "https://arxiv.org/abs/2011.06492"
        }
      ],
      "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."
      }
    },
    {
      "id": "quantum-dynamic-programming-for-path-in-the-hypercube",
      "nombre": "Quantum Dynamic Programming for path-in-the-hypercube",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Resolver por programacion dinamica problemas del tipo camino en el hipercubo, familia que incluye al viajante.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [],
      "referencias": [
        {
          "n": 409,
          "cita": "A. Ambainis, K. Balodis, J. Iraids, M. Kokainis, K. Prusis, and J. Vihrovs Quantum speedups for exponential-time dynamic programming algorithms Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 19) , pg. 1783-1793, 2019. [ arXiv:1807.05209 ]",
          "url": "https://arxiv.org/abs/1807.05209"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "computing-the-principal-eigenvector",
      "nombre": "Computing the Principal Eigenvector",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Calcular el vector propio principal de una matriz, el nucleo de metodos tipo PageRank.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [],
      "referencias": [
        {
          "n": 462,
          "cita": "Yanlin Chen, András Gilyén, and Ronald de Wolf A quantum speed-up for approximating the top eigenvectors of a matrix arXiv:2405.14765 , 2024.",
          "url": "https://arxiv.org/abs/2405.14765"
        }
      ],
      "n_referencias": 1,
      "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."
      }
    },
    {
      "id": "approximating-nash-equilibria",
      "nombre": "Approximating Nash Equilibria",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Aproximar equilibrios de Nash en juegos de dos jugadores.",
      "speedup_declarado": "Polynomial",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [],
      "referencias": [
        {
          "n": 485,
          "cita": "Adam Bouland, Yosheb Getachew, Yujia Jin, Aaron Sidford, and Kevin Tian Quantum Speedups for zero-sum games via improved dynamic Gibbs sampling Proceedings of ICML23 , 2023. [ arXiv:2301.03763 ]",
          "url": "https://arxiv.org/abs/2301.03763"
        },
        {
          "n": 486,
          "cita": "Joran van Apeldoorn and András Gilyén Quantum algorithms for zero-sum games arXiv:1904.03180 , 2019.",
          "url": "https://arxiv.org/abs/1904.03180"
        }
      ],
      "n_referencias": 2,
      "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."
      }
    },
    {
      "id": "lattice-problems-by-filtering",
      "nombre": "Lattice Problems by Filtering",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Atacar problemas de reticulos, que son la base de la criptografia post-cuantica estandarizada por NIST.",
      "speedup_declarado": "Exponential",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [],
      "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": 498,
          "cita": "Yilei Chen, Qipeng Liu, and Mark Zhandry Quantum algorithms for variants of average-case lattice problems via filtering Proceedings of EUROCRYPT22 , 372 - 401, 2022. [ arXiv:2108.11015 ]",
          "url": "https://arxiv.org/abs/2108.11015"
        }
      ],
      "n_referencias": 3,
      "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."
      }
    },
    {
      "id": "double-bracket-quantum-algorithms",
      "nombre": "Double-bracket quantum algorithms",
      "categoria": "Optimization, Numerics, and Machine Learning",
      "categoria_id": "ONML",
      "problema": "Familia basada en flujos de doble corchete para diagonalizar y preparar estados. La fuente declara su ventaja como desconocida.",
      "speedup_declarado": "Unknown",
      "declarado_por": "Quantum Algorithm Zoo",
      "fuente_url": "https://quantumalgorithmzoo.org/#ONML",
      "implementaciones": [
        {
          "nombre": "Numpy",
          "url": "https://github.com/marekgluza/DBQITE/blob/main/README.md"
        },
        {
          "nombre": "Qibo",
          "url": "https://github.com/qiboteam/boostvqe"
        },
        {
          "nombre": "Qrisp",
          "url": "https://qrisp.eu/reference/Algorithms/QITE.html"
        }
      ],
      "referencias": [
        {
          "n": 250,
          "cita": "S. Lloyd, M. Mohseni, and P. Rebentrost Quantum principal component analysis Nature Physics. 10(9):631, 2014. [ arXiv:1307.0401 ]",
          "url": "http://arxiv.org/abs/1307.0401"
        },
        {
          "n": 519,
          "cita": "Jeongrak Son, Marek Gluza, Ryuji Takagi, and Nelly H. Y. Ng Quantum Dynamic Programming Phys. Rev. Lett. , 134, 180602,2025. [ arXiv:2403.09187 ]",
          "url": "https://arxiv.org/abs/2403.09187"
        },
        {
          "n": 520,
          "cita": "Fuchuan Wei, Zhenhuan Liu, Guoding Liu, Zizhao Han, Xiongfeng Ma, Dong-Ling Deng, and Zhengwei Liu Simulating non-completely positive actions via exponentiation of Hermitian-preserving maps npj Quantum Information 10:134, 2024. [ arXiv:2308.07956 ]",
          "url": "https://arxiv.org/abs/2308.07956"
        },
        {
          "n": 522,
          "cita": "Marek Gluza Double-bracket quantum algorithms for diagonalization Quantum 8, 1316, 2012. [ arXiv:2206.11772 ]",
          "url": "https://arxiv.org/abs/2206.11772"
        },
        {
          "n": 524,
          "cita": "Marek Gluza, Jeongrak Son, Bi Hong Tiang, Yudai Suzuki, Zoë Holmes, and Nelly H. Y. Ng Double-bracket quantum algorithms for quantum imaginary-time evolution arXiv:2412.04554 , 2024",
          "url": "https://arxiv.org/abs/2412.04554"
        },
        {
          "n": 525,
          "cita": "René Zander, Raphael Seidel, Li Xiaoyue, and Marek Gluza Role of Riemannian geometry in double-bracket quantum imaginary-time arXiv:2504.01065 , 2025",
          "url": "https://arxiv.org/abs/2504.01065"
        }
      ],
      "n_referencias": 6,
      "remisiones": [
        {
          "ancla": "HM",
          "url": "https://quantumalgorithmzoo.org/#HM"
        },
        {
          "ancla": "RPP24",
          "url": "https://quantumalgorithmzoo.org/#RPP24"
        },
        {
          "ancla": "STS24",
          "url": "https://quantumalgorithmzoo.org/#STS24"
        }
      ],
      "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."
      }
    }
  ]
}