Quantum Simulated Annealing

Simple item page
dc.creatorSomma, R.
dc.creatorBoixo, S.
dc.creatorBarnum, H.
dc.date2007-12-06
dc.date.accessioned2026-07-07T08:47:43Z
dc.date.available2026-07-07T08:47:43Z
dc.descriptionWe develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno effect. It can be viewed as a quantum analogue of the discrete-time Markov chain Monte Carlo implementation of classical simulated annealing. Our implementation scales with the inverse of the square root of the minimum spectral gap of the stochastic matrix used in the classical simulation. The quantum algorithm outperforms the classical one, which scales with the inverse of the gap.
dc.description8 pages, 2 figure
dc.identifierhttps://arxiv.org/abs/0712.1008
dc.identifierhttp://arxiv.org/abs/0712.1008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143698
dc.subjectQuantum Physics
dc.titleQuantum Simulated Annealing
dc.typetext

Files

Collections

arXiv