Live briefing
Everything about Grover's algorithm
Quantum search algorithm
In quantum computing, Grover's algorithm, also known as the quantum search algorithm, is a quantum algorithm for unstructured search that finds with high probability the unique input to a black box function that produces a particular output value, using just evaluations of the function, where is the size of the function's domain. It was devised by an Indian-American computer scientist Lov Grover in 1996. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Grover's algorithmA 5-minute orientation
- Skim a recent paper: A Grover Search-Based Algorithm for the List Coloring ProblemInfluential work since 2022
- Pick up a classic book: HackingThe most-reprinted book on the subject
- Read the landmark paper: Grover algorithm with zero theoretical failure rateCited 421 times
- Go sideways: Quantum algorithmA closely related topic
- Go sideways: Amplitude amplificationA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Grover algorithm with zero theoretical failure rate
Coherence depletion in the Grover quantum search algorithm
Grover algorithm for large nuclear spins in semiconductors
Noise effect on Grover algorithm
Experimental realization of a continuous version of the Grover algorithm
Characterizing Grover search algorithm on large-scale superconducting quantum computers
Global versus local quantum correlations in the Grover search algorithm
Multiphase matching in the Grover algorithm
🆕 Influential since 2022
A Grover Search-Based Algorithm for the List Coloring Problem
Circuit optimization of Grover quantum search algorithm
A Secure Information Transmission Protocol for Healthcare Cyber Based on Quantum Image Expansion and Grover Search Algorithm
Implementing the Grover algorithm in homomorphic encryption schemes
Solving Vehicle Routing Problem Using Grover Adaptive Search Algorithm
đź“š Books worth reading
HackingJon Erickson, Jon Erickson · 2003
Quantum Walks and Search AlgorithmsRenato Portugal · 2013
Theory and Practice of ComputationShin-ya Nishizaki · 2013
Classical and Quantum Information TheoryEmmanuel Desurvire · 2009
Mathematics of quantum computationGoong Chen · 2002
Quantum computer scienceMarco Lanzagorta · 2008- 📕Quantum Computing SHA256Edward Franklin · 2024
Mathematical and Engineering Methods in Computer ScienceA. Kučera · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Quantum algorithm In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the…
- Amplitude amplification Amplitude amplification is a technique in quantum computing that generalizes the idea behind Grover's search algorithm, and gives rise to a family of quantum…
- Quantum counting algorithm The Quantum counting algorithm is a quantum algorithm for efficiently counting the number of solutions for a given search problem. The algorithm is based…
- Quantum complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
- Quantum optimization algorithms Quantum optimization algorithms are quantum algorithms that are used to solve optimization problems. Mathematical optimization deals with finding the best…
- Quantum walk search In the context of quantum computing, the quantum walk search (sometimes regarded as QFS, similar to DFS and BFS) is a quantum algorithm for finding a marked…
- BHT algorithm In quantum computing, the Brassard–Høyer–Tapp (BHT) algorithm is a quantum algorithm that solves the collision problem. In this problem, one is given n…
- Hidden subgroup problem The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. It is a generalization of problems including…