Abstract
Quantum annealing is a quantum algorithm proposed recently for combinatorial optimization problems. It manipulates time evolution of a quantum mechanical state and obtain an approximate solution. In order to implement the algorithm in classical computers, we propose to apply the density matrix renormalization group method. Simulation of the time evolution of a quantum mechanical state becomes possible by the density matrix renormalization group method for problems of large size. We explain quantum annealing and the density matrix renormalization group method, and present results of numerical simulation using them.
