The quantum adiabatic algorithm is a general approach to solving combinatorial search problems using a quantum computer. It will succeed if the run time is long enough. I will discuss how this algorithm works and our current understanding of the required run time.
Quantum Computation by Adiabatic Evolution
On April 25, 2008 at 11:00 am till 12:00 pm