{
  "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": "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."
  }
}