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