{
  "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": "searching",
  "nombre": "Searching",
  "categoria": "Oracular Algorithms",
  "categoria_id": "oracular",
  "problema": "Encontrar la aguja en un pajar sin estructura: buscar un elemento marcado entre N con solo un oraculo que responde si/no. Es Grover.",
  "speedup_declarado": "Polynomial",
  "declarado_por": "Quantum Algorithm Zoo",
  "fuente_url": "https://quantumalgorithmzoo.org/#oracular",
  "implementaciones": [
    {
      "nombre": "Classiq",
      "url": "https://short.classiq.io/quantum_counting"
    },
    {
      "nombre": "Cirq",
      "url": "https://github.com/quantumlib/Cirq/blob/main/examples/grover.py"
    },
    {
      "nombre": "PennyLane",
      "url": "https://pennylane.ai/qml/demos/tutorial_grovers_algorithm"
    },
    {
      "nombre": "Cirq",
      "url": "https://github.com/quantumlib/Cirq/blob/main/examples/grover.py"
    },
    {
      "nombre": "Qrisp (Grover)",
      "url": "https://qrisp.eu/reference/Algorithms/Grover.html"
    },
    {
      "nombre": "Qrisp (Quantum Counting)",
      "url": "https://qrisp.eu/reference/Algorithms/quantum_counting.html"
    },
    {
      "nombre": "Qrisp (Amplitude Amplification)",
      "url": "https://qrisp.eu/reference/Primitives/amplitude_amplification.html"
    }
  ],
  "referencias": [
    {
      "n": 15,
      "cita": "M. Boyer, G. Brassard, P. Høyer, and A. Tapp Tight bounds on quantum searching. Fortschritte der Physik , 46:493-505, 1998.",
      "url": null
    },
    {
      "n": 16,
      "cita": "G. Brassard, P. Høyer, and A. Tapp Quantum counting. arXiv:quant-ph/9805082 , 1998.",
      "url": "http://arxiv.org/abs/quant-ph/9805082"
    },
    {
      "n": 17,
      "cita": "Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp Quantum amplitude amplification and estimation. In Samuel J. Lomonaco Jr. and Howard E. Brandt, editors, Quantum Computation and Quantum Information: A Millennium Volume , volume 305 of AMS Contemporary Mathematics Series . American Mathematical Society, 2002. [ arXiv:quant-ph/0005055 ]",
      "url": "http://arxiv.org/abs/quant-ph/0005055"
    },
    {
      "n": 35,
      "cita": "Christoph Dürr and Peter Høyer A quantum algorithm for finding the minimum. arXiv:quant-ph/9607014 , 1996.",
      "url": "http://arxiv.org/abs/quant-ph/9607014"
    },
    {
      "n": 48,
      "cita": "Lov K. Grover Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters , 79(2):325-328, 1997. [ arXiv:quant-ph/9605043 ]",
      "url": "http://arxiv.org/abs/quant-ph/9605043"
    },
    {
      "n": 73,
      "cita": "M. Mosca Quantum searching, counting, and amplitude amplification by eigenvector analysis. In R. Freivalds, editor, Proceedings of International Workshop on Randomized Algorithms , pages 90-100, 1998.",
      "url": null
    },
    {
      "n": 75,
      "cita": "Ashwin Nayak and Felix Wu The quantum query complexity of approximating the median and related statistics. In Proceedings of 31st ACM Symposium on the Theory of Computing , 1999. [ arXiv:quant-ph/9804066 ]",
      "url": "http://arxiv.org/abs/quant-ph/9804066"
    },
    {
      "n": 77,
      "cita": "Erich Novak Quantum complexity of integration. Journal of Complexity , 17:2-16, 2001. [ arXiv:quant-ph/0008124 ]",
      "url": "http://arxiv.org/abs/quant-ph/0008124"
    },
    {
      "n": 100,
      "cita": "Eli Biham, Ofer Biham, David Biron, Markus Grassl, and Daniel Lidar Grover's quantum search algorithm for an arbitrary initial amplitude distribution. Physical Review A , 60(4):2742, 1999. [ arXiv:quant-ph/9807027 and arXiv:quant-ph/0010077 ]",
      "url": "http://arxiv.org/abs/quant-ph/9807027"
    },
    {
      "n": 123,
      "cita": "Ashley Montanaro Quantum search with advice. In Proceedings of the 5th conference on Theory of quantum computation, communication, and cryptography (TQC 2010) [ arXiv:0908.3066 ]",
      "url": "http://arxiv.org/abs/0908.3066"
    },
    {
      "n": 133,
      "cita": "Andris Ambainis Quantum Search Algorithms. SIGACT News , 35 (2):22-35, 2004. [ arXiv:quant-ph/0504012 ]",
      "url": "http://arxiv.org/abs/quant-ph/0504012"
    },
    {
      "n": 134,
      "cita": "Nicolas J. Cerf, Lov K. Grover, and Colin P. Williams Nested quantum search and NP-hard problems. Applicable Algebra in Engineering, Communication and Computing , 10 (4-5):311-338, 2000.",
      "url": null
    },
    {
      "n": 138,
      "cita": "Andris Ambainis Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations. arXiv:1010.4458 , 2010.",
      "url": "http://arxiv.org/abs/1010.4458"
    },
    {
      "n": 208,
      "cita": "Lov Grover Fixed-point quantum search. Phys. Rev. Lett. 95(15):150501, 2005. [ arXiv:quant-ph/0503205 ]",
      "url": "http://arxiv.org/abs/quant-ph/0503205"
    },
    {
      "n": 209,
      "cita": "Tathagat Tulsi, Lov Grover, and Apoorva Patel A new algorithm for fixed point quantum search. Quantum Information and Computation 6(6):483-494, 2005. [ arXiv:quant-ph/0505007 ]",
      "url": "http://arxiv.org/abs/quant-ph/0505007"
    },
    {
      "n": 216,
      "cita": "Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani Strengths and weaknesses of quantum computing SIAM J. Comput. 26(5):1524-1540, 1997 [ arXiv:quant-ph/9701001 ]",
      "url": "http://arxiv.org/abs/quant-ph/9701001"
    },
    {
      "n": 255,
      "cita": "L. A. B. Kowada, C. Lavor, R. Portugal, and C. M. H. de Figueiredo A new quantum algorithm for solving the minimum searching problem International Journal of Quantum Information, Vol. 6, No. 3, pg. 427-436 , 2008.",
      "url": null
    },
    {
      "n": 261,
      "cita": "David Cornwell Amplified Quantum Transforms arXiv:1406.0190 , 2015.",
      "url": "http://arxiv.org/abs/1406.0190"
    },
    {
      "n": 262,
      "cita": "T. Laarhoven, M. Mosca, and J. van de Pol Solving the shortest vector problem in lattices faster using quantum search Proceedings of PQCrypto13 , pp. 83-101, 2013. [ arXiv:1301.6176 ]",
      "url": "http://arxiv.org/abs/1301.6176"
    },
    {
      "n": 274,
      "cita": "Andrew Childs and Jeffrey Goldstone Spatial search by quantum walk Physical Review A , 70:022314, 2004. [ arXiv:quant-ph/0306054 ]",
      "url": "http://arxiv.org/abs/quant-ph/0306054"
    },
    {
      "n": 275,
      "cita": "Shantanav Chakraborty, Leonardo Novo, Andris Ambainis, and Yasser Omar Spatial search by quantum walk is optimal for almost all graphs arXiv:1508.01327 , 2015.",
      "url": "http://arxiv.org/abs/1508.01327"
    },
    {
      "n": 303,
      "cita": "Thomas G. Wong Quantum walk search on Johnson graphs arXiv:1601.04212 , 2016.",
      "url": "http://arxiv.org/abs/1601.04212"
    },
    {
      "n": 304,
      "cita": "Jonatan Janmark, David A. Meyer, and Thomas G. Wong Global symmetry is unnecessary for fast quantum search Physical Review Letters 112:210502, 2014. [ arXiv:1403.2228 ]",
      "url": "http://arxiv.org/abs/1403.2228"
    },
    {
      "n": 305,
      "cita": "David A. Meyer and Thomas G. Wong Connectivity is a poor indicator of fast quantum search Physical Review Letters 114:110503, 2014. [ arXiv:1409.5876 ]",
      "url": "http://arxiv.org/abs/1409.5876"
    },
    {
      "n": 306,
      "cita": "Thomas G. Wong Spatial search by continuous-time quantum walk with multiple marked vertices Quantum Information Processing 15(4):1411-1443, 2016. [ arXiv:1501.07071 ]",
      "url": "http://arxiv.org/abs/1409.5876"
    },
    {
      "n": 330,
      "cita": "Peter Høyer and Mojtaba Komeili Efficient quantum walk on the grid with multiple marked elements Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) , 42, 2016. [ arXiv:1612.08958 ]",
      "url": "https://arxiv.org/abs/1612.08958"
    },
    {
      "n": 405,
      "cita": "Kun Zhang and Vladimir E. Korepin Low depth quantum search algorithm arXiv:1908.04171 , 2019.",
      "url": "https://arxiv.org/abs/1908.04171"
    },
    {
      "n": 433,
      "cita": "András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics Proceedings of STOC 2019 , pg. 193-204 [ arXiv:1806.01838 ]",
      "url": "https://arxiv.org/abs/1806.01838"
    },
    {
      "n": 465,
      "cita": "Robin Kothari and Ryan O'Donnell Mean estimation when you have the source code; or, quantum Monte Carlo methods Proceedings of SODA23 , 1186-1215, 2023. [ arXiv:2208.07544 ]",
      "url": "https://arxiv.org/abs/2208.07544"
    },
    {
      "n": 472,
      "cita": "Arjan Cornelissen, Yassine Hamoudi, Sofiene Jerbi Near-optimal quantum algorithms for multivariate mean estimation Proceedings of STOC22 , 33-43, 2022. [ arXiv:2111.09787 ]",
      "url": "https://arxiv.org/abs/2111.09787"
    },
    {
      "n": 492,
      "cita": "Alexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, and Fernando G.S.L. Brandão Mind the gap: Achieving a super-Grover quantum speedup by jumping to the end Proceedings of STOC23 , 1131 - 1144, 2023. [ arXiv:2212.01513 ]",
      "url": "https://arxiv.org/abs/2212.01513"
    },
    {
      "n": 493,
      "cita": "M. B. Hastings A short path quantum algorithm for exact optimization Quantum , 2:78, 2018. [ arXiv:1802.10124 ]",
      "url": "https://arxiv.org/abs/1802.10124"
    }
  ],
  "n_referencias": 32,
  "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."
  }
}