Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Brazilian Conference on Intelligent Systems

Quantum Neural Networks Learning Algorithm Based on a Global Search

Fernando M. de Paula Neto, Teresa B. Ludermir, Wilson Rosa de Oliveira

Published Oct 1, 2019• 4 citations
Publisher

Abstract

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.

DOI
10.1109/bracis.2019.00150

Related papers

Quantum Walk to Train a Classical Artificial Neural Network

Luciano S. de Souza, Jonathan H. A. de Carvalho, Tiago A. E. Ferreira

This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to simulate a quantum machine to execute the quantum walk. In this way, to minimize the computational cost, the methodology employed to train the neural network will adjust the synaptic weights of the output layer, not altering the weights of the hidden layer, inspired in the method of Extreme Learning Machine. The quantum walk algorithm as a search algorithm is quadratically faster than its classic analog. The quantum walk variance is O(t) while the variance of its classic analog is O(√t), where t is the time or iteration. In addition to computational gain, another advantage of the proposed procedure is to be possible to know a priori the number of iterations required to obtain the solutions, unlike the classical training algorithms based on gradient descendent.

arXiv:2109.00128•Brazilian Conference on Intelligent Systems•Oct 1, 2019•9 citations

A new training algorithm for Quantum Neural Networks

Jian Sun, Pla Uni

Inspired by the principle of superposing states in quantum mechanics,a new kind of feedforward neural network with single hidden layer was designed and named as Quantum Neural Networks.It has mainly been used for data classification.Multilevel activation functions is adopted in Quantum Neural Networks and a different objective function is used for the learning of quantum intervals of the multilevel hidden units;minimizing the class-conditional variances at the outputs of the hidden units.Quantum Neural Networks is endowed with a special ability of identifying uncertainty in data classification by its unique design.However,as different objective functions are used for the learning of synaptic weights and quantum intervals,conflict is observed in the iterative training process which will cause more iteration times for training and degrades the training results.Using the theory of Constrained Optimization,a new training algorithm is proposed in this paper by introducing penalty function into the steepest descent method.In the new training algorithm, the conflict is removed.Experimental results indicate that the new algorithm can increase the training speed and improve the performance of the trained network remarkably.

Signal Processing•Jan 1, 2011•1 citation

Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure

Luciano S. de Souza, Jonathan H. A. de Carvalho, Tiago A. E. Ferreira

This article proposes a computational procedure that applies a quantum algorithm to train classical artificial neural networks. The goal of the procedure is to apply quantum walk as a search algorithm in a complete graph to find all synaptic weights of a classical artificial neural network. Each vertex of this complete graph represents a possible synaptic weight set in the$w$-dimensional search space, where$w$is the number of weights of the neural network. To know the number of iterations requireda priorito obtain the solutions is one of the main advantages of the procedure. Another advantage is that the proposed method does not stagnate in local minimums. Thus, it is possible to use the quantum walk search procedure as an alternative to the backpropagation algorithm. The proposed method was employed for a$XOR$problem to prove the proposed concept. To solve this problem, the proposed method trained a classical artificial neural network with nine weights. However, the procedure can find solutions for any number of dimensions. The results achieved demonstrate the viability of the proposal, contributing to machine learning and quantum computing researches.

arXiv:2108.12448•IEEE Transactions on Computers•Feb 9, 2021•14 citations

Quantum speed-up in global optimization of binary neural nets

Yidong Liao, Daniel Ebler, Feiyang Liu +1 more

Abstract The performance of a neural network (NN) for a given task is largely determined by the initial calibration of the network parameters. Yet, it has been shown that the calibration, also referred to as training, is generally NP-complete. This includes networks with binary weights, an important class of networks due to their practical hardware implementations. We therefore suggest an alternative approach to training binary NNs. It utilizes a quantum superposition of weight configurations. We show that the quantum training guarantees with high probability convergence towards the globally optimal set of network parameters. This resolves two prominent issues of classical training: (1) the vanishing gradient problem and (2) common convergence to sub-optimal network parameters. We prove that a solution is found after approximately 4 n 2 log n δ N ˜ calls to a comparing oracle, where δ represents a precision, n is the number of training inputs and N ˜ is the number of weight configurations. We give the explicit algorithm and implement it in numerical simulations.

arXiv:1810.12948•New Journal of Physics•Nov 12, 2020•9 citations

Learning to learn with quantum neural networks via classical neural networks

Guillaume Verdon, Michael Broughton, Jarrod R. McClean +5 more

Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Specifically, we train classical recurrent neural networks to find approximately optimal parameters within a small number of queries of the cost function for the Quantum Approximate Optimization Algorithm (QAOA) for MaxCut, QAOA for Sherrington-Kirkpatrick Ising model, and for a Variational Quantum Eigensolver for the Hubbard model. By initializing other optimizers at parameter values suggested by the classical neural network, we demonstrate a significant improvement in the total number of optimization iterations required to reach a given accuracy. We further demonstrate that the optimization strategies learned by the neural network generalize well across a range of problem instance sizes. This opens up the possibility of training on small, classically simulatable problem instances, in order to initialize larger, classically intractably simulatable problem instances on quantum devices, thereby significantly reducing the number of required quantum-classical optimization iterations.

arXiv:1907.05415•Jul 11, 2019•274 citations

Variational Quantum Neural Networks (VQNNS) in Image Classification

Meghashrita Das, Tirupati Bolisetti

Quantum machine learning has established as an interdisciplinary field to overcome limitations of classical machine learning and neural networks. This is a field of research which can prove that quantum computers are able to solve problems with complex correlations between inputs that can be hard for classical computers. This suggests that learning models made on quantum computers may be more powerful for applications, potentially faster computation and better generalization on less data. The objective of this paper is to investigate how training of quantum neural network (QNNs) can be done using quantum optimization algorithms for improving the performance and time complexity of QNNs. A classical neural network can be partially quantized to create a hybrid quantum-classical neural network which is used mainly in classification and image recognition. In this paper, a QNN structure is made where a variational parameterized circuit is incorporated as an input layer named as Variational Quantum Neural Network (VQNNs). We encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the network parameters. The parameters are tuned with an iterative quantum approximate optimisation (QAOA) mixer and problem hamiltonians. VQNNs is experimented with MNIST digit recognition (less complex) and crack image classification datasets (more complex) which converges the computation in lesser time than QNN with decent training accuracy.

arXiv:2303.05860•Mar 10, 2023•19 citations
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.
This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to simulate a quantum machine to execute the quantum walk. In this way, to minimize the computational cost, the methodology employed to train the neural network will adjust the synaptic weights of the output layer, not altering the weights of the hidden layer, inspired in the method of Extreme Learning Machine. The quantum walk algorithm as a search algorithm is quadratically faster than its classic analog. The quantum walk variance is O(t) while the variance of its classic analog is O(√t), where t is the time or iteration. In addition to computational gain, another advantage of the proposed procedure is to be possible to know a priori the number of iterations required to obtain the solutions, unlike the classical training algorithms based on gradient descendent.
Inspired by the principle of superposing states in quantum mechanics,a new kind of feedforward neural network with single hidden layer was designed and named as Quantum Neural Networks.It has mainly been used for data classification.Multilevel activation functions is adopted in Quantum Neural Networks and a different objective function is used for the learning of quantum intervals of the multilevel hidden units;minimizing the class-conditional variances at the outputs of the hidden units.Quantum Neural Networks is endowed with a special ability of identifying uncertainty in data classification by its unique design.However,as different objective functions are used for the learning of synaptic weights and quantum intervals,conflict is observed in the iterative training process which will cause more iteration times for training and degrades the training results.Using the theory of Constrained Optimization,a new training algorithm is proposed in this paper by introducing penalty function into the steepest descent method.In the new training algorithm, the conflict is removed.Experimental results indicate that the new algorithm can increase the training speed and improve the performance of the trained network remarkably.
This article proposes a computational procedure that applies a quantum algorithm to train classical artificial neural networks. The goal of the procedure is to apply quantum walk as a search algorithm in a complete graph to find all synaptic weights of a classical artificial neural network. Each vertex of this complete graph represents a possible synaptic weight set in thewww-dimensional search space, wherewwwis the number of weights of the neural network. To know the number of iterations requireda priorito obtain the solutions is one of the main advantages of the procedure. Another advantage is that the proposed method does not stagnate in local minimums. Thus, it is possible to use the quantum walk search procedure as an alternative to the backpropagation algorithm. The proposed method was employed for aXORXORXORproblem to prove the proposed concept. To solve this problem, the proposed method trained a classical artificial neural network with nine weights. However, the procedure can find solutions for any number of dimensions. The results achieved demonstrate the viability of the proposal, contributing to machine learning and quantum computing researches.
Abstract The performance of a neural network (NN) for a given task is largely determined by the initial calibration of the network parameters. Yet, it has been shown that the calibration, also referred to as training, is generally NP-complete. This includes networks with binary weights, an important class of networks due to their practical hardware implementations. We therefore suggest an alternative approach to training binary NNs. It utilizes a quantum superposition of weight configurations. We show that the quantum training guarantees with high probability convergence towards the globally optimal set of network parameters. This resolves two prominent issues of classical training: (1) the vanishing gradient problem and (2) common convergence to sub-optimal network parameters. We prove that a solution is found after approximately 4 n 2 log n δ N ˜ calls to a comparing oracle, where δ represents a precision, n is the number of training inputs and N ˜ is the number of weight configurations. We give the explicit algorithm and implement it in numerical simulations.
Quantum Neural Networks (QNNs) are a promising variational learning paradigm with applications to near-term quantum processors, however they still face some significant challenges. One such challenge is finding good parameter initialization heuristics that ensure rapid and consistent convergence to local minima of the parameterized quantum circuit landscape. In this work, we train classical neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms. Specifically, we train classical recurrent neural networks to find approximately optimal parameters within a small number of queries of the cost function for the Quantum Approximate Optimization Algorithm (QAOA) for MaxCut, QAOA for Sherrington-Kirkpatrick Ising model, and for a Variational Quantum Eigensolver for the Hubbard model. By initializing other optimizers at parameter values suggested by the classical neural network, we demonstrate a significant improvement in the total number of optimization iterations required to reach a given accuracy. We further demonstrate that the optimization strategies learned by the neural network generalize well across a range of problem instance sizes. This opens up the possibility of training on small, classically simulatable problem instances, in order to initialize larger, classically intractably simulatable problem instances on quantum devices, thereby significantly reducing the number of required quantum-classical optimization iterations.
Quantum machine learning has established as an interdisciplinary field to overcome limitations of classical machine learning and neural networks. This is a field of research which can prove that quantum computers are able to solve problems with complex correlations between inputs that can be hard for classical computers. This suggests that learning models made on quantum computers may be more powerful for applications, potentially faster computation and better generalization on less data. The objective of this paper is to investigate how training of quantum neural network (QNNs) can be done using quantum optimization algorithms for improving the performance and time complexity of QNNs. A classical neural network can be partially quantized to create a hybrid quantum-classical neural network which is used mainly in classification and image recognition. In this paper, a QNN structure is made where a variational parameterized circuit is incorporated as an input layer named as Variational Quantum Neural Network (VQNNs). We encode the cost function of QNNs onto relative phases of a superposition state in the Hilbert space of the network parameters. The parameters are tuned with an iterative quantum approximate optimisation (QAOA) mixer and problem hamiltonians. VQNNs is experimented with MNIST digit recognition (less complex) and crack image classification datasets (more complex) which converges the computation in lesser time than QNN with decent training accuracy.