In this paper, we introduce elements of probabilistic model that is suitable for modeling of learning algorithms in biologically plausible artificial neural networks framework. Model is based on two of the main concepts in quantum physics - a density matrix and the Born rule. As an example, we will show that proposed probabilistic interpretation is suitable for modeling of on-line learning algorithms for PSA, which are preferably realized by a parallel hardware based on very simple computational units. Proposed concept (model) can be used in the context of improving algorithm convergence speed, learning factor choice, or input signal scale robustness. We are going to see how the Born rule and the Hebbian learning rule are connected
In this paper, we introduce elements of probabilistic model that is suitable for modeling of learning algorithms in biologically plausible artificial neural networks framework. Model is based on two of the main concepts in quantum physics - a density matrix and the Born rule. As an example, we will show that proposed probabilistic interpretation is suitable for modeling of on-line learning algorithms for PSA, which are preferably realized by a parallel hardware based on very simple computational units. Proposed concept (model) can be used in the context of improving algorithm convergence speed, learning factor choice, or input signal scale robustness. We are going to see how the Born rule and the Hebbian learning rule are connected
Recently, it has been shown that a probabilistic model based on two of the main concepts in quantum physics - a density matrix and the Born rule, can be suitable for the modeling of learning algorithms in biologically plausible artificial neural networks framework. It has been shown that the proposed probabilistic interpretation is suitable for modeling on-line learning algorithms for Independent /Principal/Minor Component Analysis, which could be realized on parallel hardware based on very simple computational units. Also, it has been shown that the quantum entropy of the system, related to that model, can be successfully used in the problems like change point detection. Here, it will be shown that the proposed model can be successfully used in other areas of applied signal processing, with some examples of applications in the area of power electronics and general classification problems.
Recently, the several applications of the probabilistic model based on two of the main concepts in quantum physics - a density matrix and the Born rule, have been introduced. It was shown that the model can be suitable for the modeling of learning algorithms in biologically plausible artificial neural networks framework, like it is the case of on-line learning algorithms for Independent /Principal/Minor Component Analysis, which could be realized on parallel hardware based on very simple computational units. Also, it has been shown that the quantum entropy of the system, related to that model, can be successfully used in the problems like change point detection, with some examples of applications in the area of power electronics and general classification problems. Here, we present a robust on-line Principal Component Algorithm based on the proposed model, which extracts several principal components simultaneously. Also, we will show usefulness of the proposed method in a simple example of image segmentation.
A novel neural networks model with quantum weights is present.Firstly, based on the information processing modes of biology neuron and quantum computing theory, a quantum neuron model is presented, which is composed of weighting, aggregating, activating, and inspiriting.Secondly the quantum neural networks model based on quantum neuron is constructed in which the input and the output are real vectors; the linked weight and the activation value are qubits.On the basic of the gradient descent algorithm, a learning algorithm of this model is proposed.It is shown that this algorithm is super-linearly convergent under certain conditions and can increase the probability of getting the global optimal solution.Finally, the availability of the model is illustrated in both convergence speed and convergence rate by two application examples of pattern recognition and function approximation.
This chapter offers a clear and accessible introduction to the field of quantum-inspired neural computing. This area combines ideas from quantum mechanics with traditional neural network models to create new possibilities in machine learning and optimization metaheuristic algorithms. Unlike actual quantum computing, quantum-inspired approaches work on classical computers but borrow key concepts like superposition, entanglement, and probabilistic behaviour to improve how neural networks learn and process information. The study begins by explaining why researchers are interested in using quantum principles in neural networks. It then introduces the basic mathematical ideas behind these concepts, such as quantum states and transformations, and shows how they can be used to design more powerful and flexible learning systems. It focuses on discussing current models, outlining the distinctions between quantum-inspired and true quantum systems, and evaluating the potential benefits and challenges of this approach. In addition, Quantum-inspired neural computing introduces a novel framework that bridges classical artificial intelligence with principles derived from quantum mechanics. By simulating quantum behaviours on classical hardware, it opens new avenues for developing more adaptive and efficient learning models. This emerging approach offers promising advantages in areas such as optimization, parallel processing, and high-dimensional data representation. Finally, despite its potential, the field faces notable limitations and challenges. These include the lack of limited theoretical formalization, and difficulties in scaling models for complex real-world applications. Moreover, distinguishing genuine quantum-inspired advantages from conservative algorithmic improvements remains an current research apprehension.
It is well known that the field of pattern recognition is concerned with the automatic discovery of regularities in data through the use of computer algorithms and with the use of these regularities to take actions such as classifying the data into different categories. There are many algorithms based on different theoretical backgrounds that could be used for pattern recognition in practical applications. Generally, most of the algorithms are applied in areas like classification, regression or change point detection.Recently, it has been shown that a probabilistic model based on two of the main concepts in quantum physics – a density matrix and the Born rule, can be suitable for the modeling of learning algorithms in biologically plausible artificial neural networks framework. It has been shown that the proposed probabilistic interpretation is suitable for modeling on-line learning algorithms for Independent/Principal/Minor Component Analysis, which could be realized on parallel hardware based on very simple computational units. Also, it has been shown that the quantum entropy of the system, related to that model, can be successfully used in the problems like change point or anomalies detection as well as simple classification problems. Here another application of the proposed quantum probabilistic model is going to be presented. A general paradigm called QLEAR learning (Quantum Low Entropy based Associative Reasoning) would be presented and tested in classification context. Proposed method potentially can overcome the problem that classifier performance depends greatly on the characteristics of the data to be classified. It is known that until now, there is no single classifier that works best on all given problems (a phenomenon that may be explained by the no-free-lunch theorem). Here we will try to propose a classification algorithm that, actually, automatically adjusts its performance according to characteristics of the data on which it is applied. An interesting aspect is that proposed method inherently solves the problem of unbalanced classes (classes that have significantly different size). The proposed paradigm can be applied in any area in which standard classification techniques are applied. The method is going to be analyzed in the context of classification, prediction and solving some mathematical problems.We’ll analyze, mainly, the case in which data is represented by vectors. Generalization toward multiway data would be discussed only on one example. The approach is based on the idea that classification can be understood as supervised clustering, where quantum entropy, in the context of the quantum probabilistic model, will be used as a “capturer” (measure, or external index) of the “natural structure” of the data. By using quantum entropy we don’t make any assumption about linear separability of the data that are going to be classified. The basic idea is to find close neighbours to a query sample and then use relative change in the quantum entropy as a measure of similarity of the newly arrived sample with the representatives of interest. In other words, method is based on calculation of quantum entropy of the referent system and its relative change with the addition of the newly arrived sample. Referent system consists of vectors/matrices that represent individual classes and that are the most similar, in Euclidean distance sense, to the vector that is analyzed. The classification problem is analysed in the context of measuring similarities to prototype examples of categories. The proposed method could be seen as a hybrid of nearest neighbor and optimization machine learning technique which deals naturally with the multiclass setting, has reasonable computational complexity both in training and at run time, and yields excellent results in practice.
The learning process for multilayered neural networks with many nodes makes heavy demands on computational resources. In some neural network models, the learning formulas, such as the Widrow–Hoff formula, do not change the eigenvectors of the weight matrix while flatting the eigenvalues. In infinity, these iterative formulas result in terms formed by the principal components of the weight matrix, namely, the eigenvectors corresponding to the non-zero eigenvalues. In quantum computing, the phase estimation algorithm is known to provide speedups over the conventional algorithms for the eigenvalue-related problems. Combining the quantum amplitude amplification with the phase estimation algorithm, a quantum implementation model for artificial neural networks using the Widrow–Hoff learning rule is presented. The complexity of the model is found to be linear in the size of the weight matrix. This provides a quadratic improvement over the classical algorithms. Quanta 2018; 7: 7–18.