Quantum Neural Networks Learning Algorithm Based on a Global Search
Fernando M. de Paula Neto, Teresa B. Ludermir, Wilson Rosa de Oliveira · 2019
This paper reports the performance of a novel training algorithm for quantum neural networks (QNN) using a variation of the quantum search algorithm. The proposed algorithm trains a QNN exploring all possible weights with a sublinear cost. The training cost is theoretically O(√(N/t)), as a function of the quantity N of possible weights and t is the number of possible solutions. Initial experimental results demonstrate that the algorithm always converges to existing solutions, in addition to having the mean and maximum values, almost in total, lower than the expected maximum amount, as theoretically expected. The training algorithm is applied to classification problems.