{
  "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": "bernstein-vazirani",
  "nombre": "Bernstein-Vazirani",
  "categoria": "Oracular Algorithms",
  "categoria_id": "oracular",
  "problema": "Recuperar una cadena secreta oculta en una funcion lineal, consultandola lo menos posible.",
  "speedup_declarado": "Polynomial Directly, Superpolynomial Recursively",
  "declarado_por": "Quantum Algorithm Zoo",
  "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
  "implementaciones": [
    {
      "nombre": "Classiq",
      "url": "https://short.classiq.io/bernstein_vazirani"
    },
    {
      "nombre": "Cirq",
      "url": "https://github.com/quantumlib/Cirq/blob/main/examples/bernstein_vazirani.py"
    },
    {
      "nombre": "PennyLane",
      "url": "https://pennylane.ai/qml/demos/tutorial_qutrits_bernstein_vazirani"
    }
  ],
  "referencias": [
    {
      "n": 11,
      "cita": "Ethan Bernstein and Umesh Vazirani Quantum complexity theory. In Proceedings of the 25th ACM Symposium on the Theory of Computing , pages 11-20, 1993.",
      "url": null
    },
    {
      "n": 256,
      "cita": "Sean Hallgren and Aram Harrow Superpolynomial speedups based on almost any quantum circuit Proceedings of ICALP 2008 , pg. 782-795. [ arXiv:0805.0007 ]",
      "url": "http://arxiv.org/abs/0805.0007"
    },
    {
      "n": 257,
      "cita": "Fernando G.S.L. Brandao and Michal Horodecki Exponential quantum speed-ups are generic Quantum Information and Computation , Vol. 13, Pg. 0901, 2013 [ arXiv:1010.3654 ]",
      "url": "http://arxiv.org/abs/1010.3654"
    },
    {
      "n": 258,
      "cita": "Scott Aaronson and Andris Ambainis Forrelation: A problem that optimally separates quantum from classical computing. arXiv:1411.5729 , 2014.",
      "url": "http://arxiv.org/abs/1411.5729"
    },
    {
      "n": 270,
      "cita": "Scott Aaronson, Shalev Ben-David, and Robin Kothari Separations in query complexity using cheat sheets arXiv:1511.01937 , 2015.",
      "url": "http://arxiv.org/abs/1511.01937"
    }
  ],
  "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."
  }
}