# Quantum Computer Search Algorithms

Quantum Computer Search Algorithms

Quantum computers use subtle physical behaviors of quantum mechanical systems for computing. Such computers may solve some problems, such as integer factoring, dramatically faster than conventional machines. Two major challenges for quantum computing are building the machines and developing algorithms exploiting their unique capabilities. Only a few quantum computer algorithms have been invented so far, and they can have counterintuitive behaviors. This Demonstration visually compares four quantum computer search algorithms. The left plot shows the amplitudes of the quantum state during the search, with the large black points corresponding to the two solutions of the problem. The right plot shows the probability distribution among either the number of conflicts in the possible results or the eigenvalues of the quantum search operator. Results with zero conflicts are the solutions.