Grover’s Search Algorithm: An Approachable Application of Quantum Computing

• Jed Brody ^[1] ; Grant-Christopher Worthington Sykes ^[2]
  1. [1] Emory University

     Emory University

     Estados Unidos

     
  2. [2] Harvard-Westlake School, Los Angeles
• Localización: The Physics Teacher, ISSN 0031-921X, Vol. 63, Nº. 1, 2025, págs. 23-25
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • This image signals that this contribution is a featured part of the special collection on “Quantum Science and Technology in the Introductory Physics Classroom.” Quantum computing has generated considerable excitement in the media, and even introductory students may wish to delve into this hot topic.1 Grover’s search algorithm, sometimes called a “killer app”2 of quantum computing, is typically taught with the full machinery of linear algebra: inner products, outer products, and summation notation. We avoid these abstractions and present the essence of Grover’s algorithm at a level appropriate for introductory physics students. No background in quantum mechanics is required. Students can design and run their own circuits on remote quantum processors, for free, via the IBM Quantum website.