A neural network architecture suitable for learning and generalization is discussed and developed. The architecture is inspired and modeled after quantum electronic devices and circuits where coherent electronic wavefunctions traveling through different parts of the circuit are combined together and result in interferences at detection nodes. These wavefunctions, represented by complex numbers, are implemented as complex weights in our neural net architecture to efficiently and accurately facilitate certain computations. Although similar to the radial basis function (RBF) net, our computational model called quantum net (QN) has demonstrated a considerable gain in performance and efficiency in number of applications compared to RBF net. Its better performance in classification tasks is explained by the cross-product terms in internal representation of its basis functions introduced parsimoniously. These cross-products are the results of interferences naturally occurring in coherent electronic systems. Although we primarily discuss the software implementation of QN on Von Neuman computers, its hardware implementation is also briefly discussed. A number of examples, solved using QN and other networks, are used to illustrate the desirable characteristics of QN.
A neural network architecture suitable for learning and generalization is discussed and developed. The architecture is inspired and modeled after quantum electronic devices and circuits where coherent electronic wavefunctions traveling through different parts of the circuit are combined together and result in interferences at detection nodes. These wavefunctions, represented by complex numbers, are implemented as complex weights in our neural net architecture to efficiently and accurately facilitate certain computations. Although similar to the radial basis function (RBF) net, our computational model called quantum net (QN) has demonstrated a considerable gain in performance and efficiency in number of applications compared to RBF net. Its better performance in classification tasks is explained by the cross-product terms in internal representation of its basis functions introduced parsimoniously. These cross-products are the results of interferences naturally occurring in coherent electronic systems. Although we primarily discuss the software implementation of QN on Von Neuman computers, its hardware implementation is also briefly discussed. A number of examples, solved using QN and other networks, are used to illustrate the desirable characteristics of QN.
Radial-basis-function (RBF) networks are third-layered neural networks that are widely used in function approximation and data classification. Here we propose a quantum model for RBF networks. As in the classical case, we use radial basis functions as activation functions; quantum linear algebraic techniques and coherent states can be applied to implement these functions. We define the state of the weight as a tensor product of single-qubit states. This gives a simple approach to implement the quantum RBF network in quantum circuits. In this model we prove that training is almost quadratically faster than in the classical case. We demonstrate numerically that the quantum RBF network can solve binary classification problems as effectively as the classical RBF network, while the time and number of iterations used for training are much smaller.
Quantum Neural Networks (QNNs) represent a novel computational paradigm that merges the principles of quantum computing with the architecture of artificial neural networks. Through the quantum phenomena of superposition, entanglement, and interference, QNNs enable parallel computation in high-dimensional Hilbert spaces, offering the potential to surpass the representational limits of classical models. This review provides a comprehensive overview of the theoretical foundations and architectures of QNNs, including Quantum Perceptrons, Variational Quantum Circuits (VQCs), Quantum Convolutional Neural Networks (QCNNs), and Quantum Recurrent Neural Networks (QRNNs). Furthermore, it discusses hybrid quantum–classical training mechanisms and key challenges such as barren plateaus, decoherence, and sampling complexity. The review also highlights recent applications of QNNs in medical diagnostics, materials science, and financial forecasting, demonstrating their potential to accelerate computation and improve predictive accuracy. Finally, future research directions are discussed in relation to computational efficiency, model interpretability, and integration with next-generation quantum hardware.
Quantum Circuit C∗-algebra Net
This paper introduces quantum circuit C∗-algebra net, which provides a connection between C∗-algebra nets proposed in classical machine learning and quantum circuits. Using C∗-algebra, a generalization of the space of complex numbers, we can represent quantum gates as weight parameters of a neural network. By introducing additional parameters, we can induce interaction among multiple circuits constructed by quantum gates. This interaction enables the circuits to share information among them, which contributes to improved generalization performance in machine learning tasks. As an application, we propose to use the quantum circuit C∗-algebra net to encode classical data into quantum states, which enables us to integrate classical data into quantum algorithms. Numerical results demonstrate that the interaction among circuits improves performance significantly in image classification, and encoded data by the quantum circuit C∗-algebra net are useful for downstream quantum machine learning tasks.
This paper proposes a novel neural network architecture, termed Entanglement-Based Neural Networks (EBNNs), inspired by the principles of quantum entanglement. Conventional classical neural networks often face challenges in effectively capturing and representing intricate correlations within data, particularly when dealing with high-dimensional or complex datasets. The core idea behind EBNNs is to construct networks where nodes are interconnected in a manner that mirrors the correlated states observed in quantum entanglement, even across spatial separation. This is achieved through a specifically designed network topology that introduces dependencies between nodes, allowing for a more efficient representation of complex relationships. The network's structure is defined by a set of interconnected nodes, each possessing a state (s_i) represented by a real number. The connections between nodes are characterized by a correlation function (C_{ij}), which dictates the degree to which the state of node *j* is influenced by the state of node *i*. The architecture utilizes a layered approach, where layers are composed of interconnected nodes. The propagation of information through the network is governed by a modified version of the Hebbian learning rule, adapted to incorporate the entanglement-like correlation functions. This approach aims to improve the network's ability to learn and represent complex patterns by leveraging inherent correlations rather than relying solely on independent node activations. The key contributions of this work are the conceptual design of EBNNs and the formulation of the core mathematical framework for their implementation. We present a detailed description of the network architecture, the correlation function definition, and the learning rule, offering a foundation for further research and development in this area. Finally, we demonstrate the potential advantages of EBNNs in terms of improved learning efficiency and representation capacity.
Quantum neural networks (QNNs) are a burgeoning field that merges the principles of quantum mechanics with machine learning. These models aim to leverage the unique capabilities of quantum computers, such as superposition, entanglement, and interference, to overcome limitations faced by classical neural networks (NNs). Quantum machine learning algorithms often produce probabilistic results and contain correlated components. This chapter explores a general method for building NNs inspired by classical architectures on quantum computers. It delves into the key differences and similarities between quantum and classical NNs and also explores the potential of quantum-classical hybrid approaches. The chapter also discusses some potential applications and future trends in the exciting field of QNNs. Artificial neurons are the building blocks of artificial neural network (ANN). Reinforcement learning is a powerful branch of machine learning where agents learn to make optimal decisions through a feedback mechanism of rewards and penalties.
We give an explicit simple method to build quantum neural networks (QNNs) to solve classification problems. Besides the input (state preparation) and output (amplitude estimation), it has one hidden layer which uses a tensor product of logM two-dimensional rotations to introduce logM weights. Here M is the number of training samples. We also have an efficient method to prepare the quantum states of the training samples. By the quantum-classical hybrid method or the variational method, the training algorithm of this QNN is easy to accomplish in a quantum computer. The idea is inspired by the kernel methods and the radial basis function (RBF) networks. In turn, the construction of QNN provides new findings in the design of RBF networks. As an application, we introduce a quantum-inspired RBF network, in which the number of weight parameters is logM. Numerical tests indicate that the performance of this neural network in solving classification problems improves when M increases. Since using exponentially fewer parameters, more advanced optimization methods (e.g. Newton's method) can be used to train this network. Finally, about the convex optimization problem to train support vector machines, we use a similar idea to reduce the number of variables, which equals M, to logM.