The convergence of a recently proposed tabu-enhanced quantum annealing algorithm depends critically on the finiteness of memory of the related stochastic process. We discuss the background of quantum annealing and the convergence issues of the tabu-enhanced algorithm. Given the details of the tabu data structure, the so-called tabu matrix, we consider the sequences of solutions that result in a tabu matrix collisions. As such, convergence of the algorithm is related to the problem of studying the so-called matrix kernel, which we investigate and give an example of such a collision as well.
On Convergence of Tabu-Enhanced Quantum Annealing Algorithm / Rumyantsev A.S.; Pastorello D.; Blanzieri E.; Cavecchia V.. - ELETTRONICO. - 1552:(2022), pp. 214-219. (Intervento presentato al convegno 24th International Conference on Distributed Computer and Communication Networks, DCCN 2021 tenutosi a Moscow nel 2021) [10.1007/978-3-030-97110-6_16].
On Convergence of Tabu-Enhanced Quantum Annealing Algorithm
Pastorello D.;
2022
Abstract
The convergence of a recently proposed tabu-enhanced quantum annealing algorithm depends critically on the finiteness of memory of the related stochastic process. We discuss the background of quantum annealing and the convergence issues of the tabu-enhanced algorithm. Given the details of the tabu data structure, the so-called tabu matrix, we consider the sequences of solutions that result in a tabu matrix collisions. As such, convergence of the algorithm is related to the problem of studying the so-called matrix kernel, which we investigate and give an example of such a collision as well.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
