PIRSA:08050033

Quantum Simulations of Classical Annealing Processes

APA

Somma, R. (2008). Quantum Simulations of Classical Annealing Processes. Perimeter Institute. https://pirsa.org/08050033

MLA

Somma, Rolando. Quantum Simulations of Classical Annealing Processes. Perimeter Institute, May. 02, 2008, https://pirsa.org/08050033

BibTex

          @misc{ pirsa_PIRSA:08050033,
            doi = {10.48660/08050033},
            url = {https://pirsa.org/08050033},
            author = {Somma, Rolando},
            keywords = {Quantum Information},
            language = {en},
            title = {Quantum Simulations of Classical Annealing Processes},
            publisher = {Perimeter Institute},
            year = {2008},
            month = {may},
            note = {PIRSA:08050033 see, \url{https://pirsa.org}}
          }
          

Rolando Somma

Alphabet (United States)

Talk number
PIRSA:08050033
Talk Type
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.