Title: Quantum Algorithms for Combinatorial Optimization

Speaker: Rolando D. Somma, Los Alamos National Laboratory

Date/Time: Tuesday, February 2, 2010, 10:00 am        

Location: CSRI/90

Brief Abstract: In this talk I will describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of the well known (classical) simulated annealing method. The quantum algorithm uses quantum walks to traverse a particular path of eigenstates, which is a novel method to implement quasi adiabatic evolutions. The quantum algorithm is optimal and runs quadratically faster than simulated annealing in several instances.

CSRI POC: Andrew Landahl, (505) 844-0463