Quantum simulated annealing
| dc.creator | Huntsman, Steve | |
| dc.date | 2000-12-20 | |
| dc.date | 2002-12-09 | |
| dc.date.accessioned | 2026-07-07T06:01:23Z | |
| dc.date.available | 2026-07-07T06:01:23Z | |
| dc.description | The question of whether or not quantum computers can efficiently solve NP-complete problems is open, although indications are that BQP does not contain NP. Still, many of these problems are natural candidates for solution on quantum computers. We outline a thermodynamical formalism for the traveling salesman problem which allows for its expected polytime solution on a quantum computer with probability arbitrarily close to unity, given sufficient energy resources and subject to a weak nondegeneracy constraint on the distances. Applications to other problems are also discussed. | |
| dc.description | 5 pages, pdf only [Finally deleted a blooper paragraph about expected runtimes that is only true for Euclidean TSP and has a bum eqn anyway. Does not affect anything that matters (temperature v precision etc)] | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0012112 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0012112 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/89241 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum simulated annealing | |
| dc.type | text |