Le contenu de cette page n’est pas disponible en français. Veuillez nous en excuser.
 

Quantum Simulations of Classical Annealing Processes

Recording Details

Speaker(s): 
Scientific Areas: 
PIRSA Number: 
08050033

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.