There has been significant recent interest in quantum neural networks (QNNs), along with their applications in diverse domains. Current solutions for QNNs pose significant challenges concerning their scalability, ensuring that the postulates of quantum mechanics are satisfied and that the networks are physically realizable. The exponential state space of QNNs poses challenges for the scalability of training procedures. The no-cloning principle prohibits making multiple copies of training samples, and the measurement postulates lead to non-deterministic loss functions. Consequently, the physical realizability and efficiency of existing approaches that rely on repeated measurement of several copies of each sample for training QNNs are unclear. This paper presents a new model for QNNs that relies on band-limited Fourier expansions of transfer functions of quantum perceptrons (QPs) to design scalable training procedures. This training procedure is augmented with a randomized quantum stochastic gradient descent technique that eliminates the need for sample replication. We show that this training procedure converges to the true minima in expectation, even in the presence of non-determinism due to quantum measurement. Our solution has a number of important benefits: (i) using QPs with concentrated Fourier power spectrum, we show that the training procedure for QNNs can be made scalable; (ii) it eliminates the need for resampling, thus staying consistent with the no-cloning rule; and (iii) enhanced data efficiency for the overall training process since each data sample is processed once per epoch. We present a detailed theoretical foundation for our models and methods' scalability, accuracy, and data efficiency. We also validate the utility of our approach through a series of numerical experiments.
There has been significant recent interest in quantum neural networks (QNNs), along with their applications in diverse domains. Current solutions for QNNs pose significant challenges concerning their scalability, ensuring that the postulates of quantum mechanics are satisfied and that the networks are physically realizable. The exponential state space of QNNs poses challenges for the scalability of training procedures. The no-cloning principle prohibits making multiple copies of training samples, and the measurement postulates lead to non-deterministic loss functions. Consequently, the physical realizability and efficiency of existing approaches that rely on repeated measurement of several copies of each sample for training QNNs are unclear. This paper presents a new model for QNNs that relies on band-limited Fourier expansions of transfer functions of quantum perceptrons (QPs) to design scalable training procedures. This training procedure is augmented with a randomized quantum stochastic gradient descent technique that eliminates the need for sample replication. We show that this training procedure converges to the true minima in expectation, even in the presence of non-determinism due to quantum measurement. Our solution has a number of important benefits: (i) using QPs with concentrated Fourier power spectrum, we show that the training procedure for QNNs can be made scalable; (ii) it eliminates the need for resampling, thus staying consistent with the no-cloning rule; and (iii) enhanced data efficiency for the overall training process since each data sample is processed once per epoch. We present a detailed theoretical foundation for our models and methods' scalability, accuracy, and data efficiency. We also validate the utility of our approach through a series of numerical experiments.
Training large-scale neural networks with traditional stochastic gradient descent (SGD) methods often faces significant challenges, including slow convergence rates and high computational costs. This paper proposes a novel approach, Quantum-Inspired Stochastic Gradient Descent (QISGD), designed to address these limitations. QISGD leverages principles inspired by quantum measurement processes, specifically employing a random projection operator to approximate the gradient. This technique aims to provide a more efficient and potentially faster way to update the network's parameters during training. The theoretical underpinnings of QISGD are presented, along with a detailed explanation of the algorithm's components. We demonstrate the potential benefits of QISGD through a conceptual analysis and outline a framework for future research and implementation. The core innovation lies in translating quantum measurement intuition into a practical optimization strategy for classical neural networks. The goal is to improve the training efficiency of large networks while retaining the benefits of SGD.
This paper explores the potential of utilizing measurement-based quantum computation (MBQC) to accelerate the training of quantum neural networks (QNNs). Traditional QNN training is computationally expensive, posing a significant barrier to their practical implementation. We propose a novel architecture for a QNN that directly employs MBQC principles to perform key calculations involved in the training process. The core idea is to transform the training objective into a series of measurements performed on a quantum state prepared according to the network's parameters. This approach aims to circumvent the limitations of classical optimization algorithms by exploiting quantum superposition and interference. We present a theoretical framework outlining this method, detailing the mapping of the training problem onto a MBQC protocol. The expected speedup, based on the inherent parallelism of MBQC, is discussed, along with potential challenges and future research directions. Specifically, we examine how the measurement process itself can be optimized to reduce noise and improve the accuracy of the trained network. The ultimate goal is to demonstrate a practical approach to training QNNs that leverages the advantages of quantum computation.
Quantum Neural Networks (QNNs) have been recently proposed as generalizations of classical neural networks to achieve the quantum speed-up. Despite the potential to outperform classical models, serious bottlenecks exist for training QNNs; namely, QNNs with random structures have poor trainability due to the vanishing gradient with rate exponential to the input qubit number. The vanishing gradient could seriously influence the applications of large-size QNNs. In this work, we provide a viable solution with theoretical guarantees. Specifically, we prove that QNNs with tree tensor and step controlled architectures have gradients that vanish at most polynomially with the qubit number. We numerically demonstrate QNNs with tree tensor and step controlled structures for the application of binary classification. Simulations show faster convergent rates and better accuracy compared to QNNs with random structures.
Quantum Machine Learning is an emerging sub-field in machine learning where one of the goals is to perform pattern recognition tasks by encoding data into quantum states. This extension from classical to quantum domain has been made possible due to the development of hybrid quantum-classical algorithms that allow a parameterized quantum circuit to be optimized using gradient based algorithms that run on a classical computer. The similarities in training of these hybrid algorithms and classical neural networks has further led to the development of Quantum Neural Networks (QNNs). However, in the current training regime for QNNs, the gradients w.r. t objective function have to be computed on the quantum device. This computation is highly non-scalable and is affected by hardware and sampling noise present in the current generation of quantum hardware. In this paper, we propose a training algorithm that does not rely on gradient information. Specifically, we introduce a novel meta-optimization algorithm that trains a meta-optimizer network to output parameters for the quantum circuit such that the objective function is minimized. We empirically and theoretically show that we achieve a better quality minima in fewer circuit evaluations than existing gradient based algorithms on different datasets.
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.
Machine learning holds fundamental computational significance due to the increasing demand for efficient solutions to complex tasks in data analysis, pattern recognition, and optimization, which are essential for addressing the multifaceted challenges of modern society. As the volume of data proliferates at an unprecedented rate, the need for more powerful machine learning strategies becomes increasingly evident. Quantum neural networks (QNNs) represent an emerging and transformative research field that seeks to harness the unique principles of quantum mechanics to enhance the capabilities of machine learning algorithms. This survey examines various QNN approaches, including fully connected QNNs, quantum convolutional neural networks, equivariant QNNs, quantum Hopfield networks, quantum Boltzmann machines, quantum reservoir computing, and composite networks for quantum reinforcement learning, quantum generative learning, and quantum transfer learning. We summarize the relevant investigations on their performance, including learning accuracy, training time, and resource requirements, etc. Each QNN type has unique strengths and weaknesses, offering diverse solutions for different applications.