Quantum Annealing from a Viewpoint of Algorithm

Shu TANAKA  

Publication
C - Abstracts of IEICE TRANSACTIONS on Electronics (Japanese Edition)   Vol.J101-C   No.3   pp.166-171
Publication Date: 2018/03/01
Online ISSN: 1881-0217
DOI: 
Type of Manuscript: INVITED PAPER
Category: 
Keyword: 
quantum annealing,  combinatorial optimization problem,  Ising model,  natural computing,  

Full Text(in Japanese): FreePDF(316KB)


Summary: 
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.