2014/08/21 by Sudip Mukherjee, Bikas K. Chakrabarti · 2 citations
Physics and Astronomy · #cond-mat.stat-mech #quant-ph
paper · pdf · doi:10.1140/epjst/e2015-02339-y
published as Eur. Phys. J. Special Topics, 224, 17-24 (2015) · 9 pages, 3 figures; EPJ ST: spl. 'Debate & Discussion' issue on "Quantum Annealing: The fastest route to large scale computation?"
arxiv created 2014/08/21 · arxiv updated 2015/06/22
Recent developments in quantum annealing techniques have been indicating potential advantage of quantum annealing for solving NP-hard optimization problems. In this article we briefly indicate and discuss the beneficial features of quantum annealing techniques and compare them with those of simulated annealing techniques. We then briefly discuss the quantum annealing studies of some model spin glass and kinetically constrained systems.