The Grover algorithm is a [[Quantum Algorithm|quantum algorithm]] for [[Fault-Tolerant Quantum Computer|fault-tolerant quantum computers]]. It allows unsorted data to be searched more quickly and requires a number of steps that increases with the square root of the number of list entries. The Grover algorithm is often used as a subroutine in other [[Quantum Algorithm|quantum algorithms]]. >[!read]- Further Reading >- [[Quantum Algorithm]] >- [[Shor Algorithm]] >- [[Quantum Computer]] >[!ref]- References