{
  "aviso": "speedup_declarado es lo que declara la fuente citada, NO una medición de Rosetta. Lo que Rosetta midió va en evidencia_rosetta, y para la mayoría del catálogo está vacío.",
  "procedencia": {
    "fuente": "Quantum Algorithm Zoo",
    "fuente_url": "https://quantumalgorithmzoo.org/",
    "instantanea_sha256": "dee7e76b5f19096ed329c88714744b93babf7b7d0296eb97e357b2582d16b75e",
    "generado_at": "2026-08-09"
  },
  "id": "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."
  }
}