Quantum Simulations of Classical Annealing Processes

Simple item page
dc.creatorSomma, R. D.
dc.creatorBoixo, S.
dc.creatorBarnum, H.
dc.creatorKnill, E.
dc.date2008-04-09
dc.date.accessioned2026-07-07T12:35:58Z
dc.date.available2026-07-07T12:35:58Z
dc.descriptionWe describe a quantum algorithm that solves combinatorial optimization problems by quantum simulation of a classical simulated annealing process. Our algorithm exploits quantum walks and the quantum Zeno effect induced by evolution randomization. It requires order $1/\sqrtδ$ steps to find an optimal solution with bounded error probability, where $δ$ is the minimum spectral gap of the stochastic matrices used in the classical annealing process. This is a quadratic improvement over the order $1/δ$ steps required by the latter.
dc.description4 pages - 1 figure. This work differs from arXiv:0712.1008 in that the quantum Zeno effect is implemented via randomization in the evolution
dc.identifierhttps://arxiv.org/abs/0804.1571
dc.identifierhttp://arxiv.org/abs/0804.1571
dc.identifierPhys. Rev. Lett. 101, 130504 (2008)
dc.identifierdoi:10.1103/PhysRevLett.101.130504
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217942
dc.subjectQuantum Physics
dc.titleQuantum Simulations of Classical Annealing Processes
dc.typetext

Files

Collections

arXiv