Optimization by quantum annealing for the graph colouring problem
Quantum annealing is the quantum equivalent of the well known classical simulated annealing algorithm for combinatorial optimization problems. Despite the appeal of the approach, quantum annealing algorithms competitive with the state of the art for specific problems hardly exist in the literature....
| Main Author: | |
|---|---|
| Published: |
Manchester Metropolitan University
2013
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618102 |