For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Quantum Annealing from a Viewpoint of Algorithm
C - Abstracts of IEICE TRANSACTIONS on Electronics (Japanese Edition)
Publication Date: 2018/03/01
Online ISSN: 1881-0217
Type of Manuscript: INVITED PAPER
quantum annealing, combinatorial optimization problem, Ising model, natural computing,
Full Text(in Japanese): FreePDF(316KB)
To solve combinatorial optimization problems, quantum annealing has been attracted attention in various fields. Studies on combinatorial optimization problems by using quantum annealing machines have been done. We have to transform combinatorial optimization problems to the Ising model when we use quantum annealing machines. In addition, there are some methods to demonstrate the quantum annealing by a classical computer. In this paper, we explain the quantum annealing from the viewpoint of computation technology.