We propose a novel paradigm of integration of Grover's algorithm in a machine learning framework: the inductive Grover oracular quantum neural network (IGO-QNN). The model defines a variational quantum circuit with hidden layers of parameterized quantum neurons densely connected via entangle synapses to encode a dynamic Grover's search oracle that can be trained from a set of database-hit training examples. This widens the range of problem applications of Grover's unstructured search algorithm to include the vast majority of problems lacking analytic descriptions of solution verifiers, allowing for quadratic speed-up in unstructured search for the set of search problems with relationships between input and output spaces that are tractably underivable deductively. This generalization of Grover's oracularization may prove particularly effective in deep reinforcement learning, computer vision, and, more generally, as a feature vector classifier at the top of an existing model.
We propose a novel paradigm of integration of Grover's algorithm in a machine learning framework: the inductive Grover oracular quantum neural network (IGO-QNN). The model defines a variational quantum circuit with hidden layers of parameterized quantum neurons densely connected via entangle synapses to encode a dynamic Grover's search oracle that can be trained from a set of database-hit training examples. This widens the range of problem applications of Grover's unstructured search algorithm to include the vast majority of problems lacking analytic descriptions of solution verifiers, allowing for quadratic speed-up in unstructured search for the set of search problems with relationships between input and output spaces that are tractably underivable deductively. This generalization of Grover's oracularization may prove particularly effective in deep reinforcement learning, computer vision, and, more generally, as a feature vector classifier at the top of an existing model.
Quantum machine learning (QML) is promising for potential speedups and improvements in conventional machine learning (ML) tasks (e.g., classification/regression). The search for ideal QML models is an active research field. This includes identification of efficient classical-to-quantum data encoding scheme, construction of parametric quantum circuits (PQC) with optimal expressivity and entanglement capability, and efficient output decoding scheme to minimize the required number of measurements, to name a few. However, most of the empirical/numerical studies lack a clear path towards scalability. Any potential benefit observed in a simulated environment may diminish in practical applications due to the limitations of noisy quantum hardware (e.g., under decoherence, gate-errors, and crosstalk). We present a scalable quantum-classical hybrid deep neural network (DeepQMLP) architecture inspired by classical deep neural network architectures. In DeepQMLP, stacked shallow Quantum Neural Network (QNN) models mimic the hidden layers of a classical feed-forward multi-layer perceptron network. Each QNN layer produces a new and potentially rich representation of the input data for the next layer. This new representation can be tuned by the parameters of the circuit. Shallow QNN models experience less decoherence, gate errors, etc. which make them (and the network) more resilient to quantum noise. We present numerical studies on a variety of classification problems to show the trainability of DeepQMLP. We also show that DeepQMLP performs reasonably well on unseen data and exhibits greater resilience to noise over QNN models that use a deep quantum circuit. DeepQMLP provided up to 25.3% lower loss and 7.92% higher accuracy during inference under noise than QMLP.
There is increasing interest in the area of quantum computing, but using and developing new quantum algorithms, often represented as quantum circuits, is arduous and requires designers with a wide area of experience. The exploration of techniques for the automatic design of quantum algorithms, i.e., quantum architecture search, is therefore of high importance. This work explores the use of neural networks for quantum architecture search, since neural networks have proven quite successful in various complex search domains, and current approaches in quantum architecture search make very restricted use of them. There are many different domains in which quantum architecture search can be applied. They can be used to compile unitaries into quantum circuits, develop ansätze for variational quantum circuits, or develop new quantum algorithms by applying it to input output pairs of one task one wishes to solve. The focus in this thesis is on the task of quantum state preparation, a very important task in the field of quantum computing, as it is a subroutine in a large number of quantum algorithms like quantum machine learning and Hamiltonian simulation. This thesis approaches the task of quantum architecture search first by establishing the importance of the structure of quantum circuits. This is done with a large-scale study of the influence different circuit structure parameters, such as qubits and depth, have on the performance on variational quantum machine learning. During this research, four guidelines for designing circuits for variational quantum machine learning were established. DeepQPrep, a neural network-augmented deductive search for the automatic design of quantum circuits for quantum state preparation, was proposed. It is able to create non-parameterized quantum circuits to solve 76.9% of a restrictive set of quantum states with quantum circuits that were much shallower than the ones found in the ground-truth data. The model was trained on a dataset created in this thesis as none were available at the time. During the exploration of extensions of DeepQPrep to enable it to solve more arbitrary quantum state preparation problems without the need for labeled data, different challenges became apparent. A study on the difficulty of training neural networks to create parameterized quantum circuits using reinforcement learning found that training is hampered by the barren plateau problem of quantum computing. It shows that the variance of the gradient of the quantum circuit output with respect to its parameters goes exponentially to zero. A study showed that this problem makes the application of neural networks to encode quantum circuits highly challenging when no intermediate quantum state information is used. This culminated in DeepQPrepGrad, which combines parameterized circuits, the inductive search of DeepQPrep, and the reinforcement learning-based approach with more compact representations. By combining these parts with the gradients of quantum circuits, an approach that is able to create parameterized quantum circuits for arbitrary quantum states was obtained. The approach was evaluated on 20000 arbitrary 3-qubit quantum states without the need for any labeled data, resulting in a mean minimal similarity of 0.97 alleviated the found challenges to a large degree. This thesis explored key challenges faced when training neural networks to encode quantum circuits. These challenges are of paramount importance as they potentially affect a wide range of tasks in the field of quantum computing to which neural networks could be applied. Lastly, DeepQPrepGrad provides a significant step forward for the creation of quantum circuits using neural networks. DeepQPrepGrad makes great progress in solving the challenges highlighted above and has the potential to be applicable in a wide range of quantum architecture search tasks, such as variational eigensolver and variational quantum machine learning.
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.
Quantum machine learning models, like Quantum Neural Networks (QNN) and Quantum Support Vector Classifiers (QSVC), often struggle with overfitting, slow convergence, and suboptimal generalization across various datasets. This paper explores the advantages of integrating deep unfolding techniques into quantum models and develops a framework focusing on Deep Unfolded Variational Quantum Classifiers (DVQC), Deep Unfolded Quantum Neural Networks (DQNN), and Deep Unfolded QSVC (DQSVC). Our novel unfolding transforms quantum circuit training into a sequence of learnable layers, with each layer representing an optimization step that concurrently renews both circuit parameters and QNN hyperparameters. The proposed framework significantly improves training and test accuracy by dynamically adjusting learning rate, perturbations and other similar hyperparameters, particularly on complex datasets like Genomic and Breast Cancer. Our evaluation and experiment show that proposed DVQC and DQNN outperform baseline VQC and QNN, achieving 90% training accuracy and up to 20% higher test accuracy on Genomic and Adhoc datasets. DQSVC achieves 100% accuracy on Adhoc and 97% on Genomic datasets, surpassing the 90% test accuracy of traditional QSVC. Our implementation details will be publicly available.
Quantum Artificial Intelligence (QAI) represents the convergence of quantum computing and machine learning, aiming to harness the computational power of quantum mechanics to enhance the efficiency, scalability, and generalization capability of intelligent systems. This article provides a tutorial on the foundations, models, and emerging directions of QAI. We first review the core concepts of quantum information and hybrid quantum–classical computing, followed by a detailed discussion of variational quantum circuits (VQCs)—the fundamental building blocks of quantum neural networks (QNNs). Building upon these foundations, we introduce representative QAI architectures, including Quantum Convolutional Neural Networks (QCNNs) for pattern recognition, Quantum Long Short-Term Memory (QLSTM) for sequential modeling, and Quantum Reinforcement Learning (QRL) for decision making and control. Advanced topics such as Quantum Architecture Search (QAS), Quantum Fast Weight Programmers (QFWP), and the Quantum-Train (QT) framework are presented to illustrate how classical and quantum models can dynamically co-design and reprogram one another. Furthermore, we discuss federated and distributed quantum learning, encoding complexity, and training challenges such as barren plateaus and hardware constraints. The article concludes with a forward-looking outlook on scalable QAI systems, autonomous quantum agents, and the long-term vision of self-programming, distributed intelligence. By bridging quantum theory, learning algorithms, and system architectures, this work aims to offer both foundational understanding and strategic insights for the next generation of hybrid quantum-classical intelligence.
It has connected quantum computing and deep learning, and the union of the two has signaled the paradigm shift in the field of computational intelligence where quantum computing can provide exponential gains and other representational capabilities never seen in classic computation. The research work is a deep study of the construct of quantum deep learning architecture, the essence of quantum computation that will be imported to the alliance scheme with neural networks paradigms. We present our new hybrid system quantum-classical architecture, where we utilise variational quantum circuits in the input of features and classical optimization benchways in the updating of parametrics. Our architecture trains 47 times as long as its classical counterparts, and achieves similar accuracy scores through a systematic exploit of its closeness to standard datasets through systematic benchmarking. The quantum superposition and entanglement behaviour of the quantum cell is achieved using the parameterized rotation gates to enhance the features representation. We implement the framework to various branches of operation such as healthcare diagnostics, financial model estimation, autonomous regulation and they are all doing better. The research paper ends with the perspectives of the future research in the future such as federated quantum AI, quantum-inspired optimization algorithms and noise-hardy quantum neural architectures. We discovered that quantum deep learning is not a continuation of existing systems, but a new way of thinking about the idea of machine learning with a paradigm shift that introduces applications of artificial general intelligence.