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