{
  "total": 11,
  "devueltos": 11,
  "total_catalogo": 74,
  "filtro": {
    "categoria": "BQP",
    "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-09-09",
    "como_reconstruir": "Baja https://quantumalgorithmzoo.org/, recomputa su sha256 y corre scripts/build-quantum-catalog.mjs"
  },
  "items": [
    {
      "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 cuántico dado su hamiltoniano. Es la aplicación 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 térmico de un hamiltoniano, punto de partida de casi toda simulación de materiales y química.",
      "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 topológicos 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 función de partición de un sistema clásico, de la que se derivan prácticamente todas sus magnitudes termodinámicas.",
      "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 criptografía de curvas elípticas.",
      "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 códigos, que describen la distribución de distancias de un código 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 clásico 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."
      }
    }
  ]
}