The demo applet illustrates the behavior of several quantum search algorithms on a few small problem instances. It shows how the amplitudes associated with the search states change during the algorithm's execution, and the resulting probabilities to obtain states with various properties.
The algorithms include L. Grover's unstructured search algorithm (amplitude amplification), a discrete version of E. Farhi et al.'s adiabatic algorithm and T. Hogg's heuristic methods.
The versions of these algorithms used in the demo are described in T. Hogg, Adiabatic Quantum Computing for Random Satisfiability Problems.
Tad Hogg
|
printable version
