PIRSA Logo


PERIMETER INSTITUTE RECORDED SEMINAR ARCHIVE

Quantum Simulations of Classical Annealing Processes
Speaker(s): Rolando Somma
Abstract: Quantum computers provide new resources to solve combinatorial optimization problems (COPs). Using techniques borrowed from quantum information theory, I will present a quantum algorithm that simulates classical annealing processes, where the (quantum) annealing rate greatly outperforms other classical methods like Markov chain Monte-Carlo based algorithms. Our quantum algorithm provides quadratic speedups to find both, the solution to particular instances of COPs, and the preparation of (quantum) Gibbs' states.
Date: 02/05/2008 - 9:30 am
Valid XHTML 1.0!