Learning from quantum data using classical machine learning models has emerged as a promising paradigm toward realizing quantum advantages. Despite extensive analyses on their performance, clean and fully labeled quantum data from the target domain are often unavailable in practical scenarios, forcing models to be trained on data collected under conditions that differ from those encountered at deployment. This mismatch highlights the need for new approaches beyond the common assumptions of prior work. In this work, we address this issue by employing an unsupervised domain adaptation framework for learning from imperfect quantum data. Specifically, by leveraging classical representations of quantum states obtained via classical shadows, we perform unsupervised domain adaptation entirely within a classical computational pipeline once measurements on the quantum states are executed. We numerically evaluate the framework on quantum phases of matter and entanglement classification tasks under realistic domain shifts. Across both tasks, our method outperforms source-only non-adaptive baselines and target-only unsupervised learning approaches, demonstrating the practical applicability of domain adaptation to realistic quantum data learning.
Learning from quantum data using classical machine learning models has emerged as a promising paradigm toward realizing quantum advantages. Despite extensive analyses on their performance, clean and fully labeled quantum data from the target domain are often unavailable in practical scenarios, forcing models to be trained on data collected under conditions that differ from those encountered at deployment. This mismatch highlights the need for new approaches beyond the common assumptions of prior work. In this work, we address this issue by employing an unsupervised domain adaptation framework for learning from imperfect quantum data. Specifically, by leveraging classical representations of quantum states obtained via classical shadows, we perform unsupervised domain adaptation entirely within a classical computational pipeline once measurements on the quantum states are executed. We numerically evaluate the framework on quantum phases of matter and entanglement classification tasks under realistic domain shifts. Across both tasks, our method outperforms source-only non-adaptive baselines and target-only unsupervised learning approaches, demonstrating the practical applicability of domain adaptation to realistic quantum data learning.
Quantum machine learning is often highlighted as one of the most promising practical applications for which quantum computers could provide a computational advantage. However, a major obstacle to the widespread use of quantum machine learning models in practice is that these models, even once trained, still require access to a quantum computer in order to be evaluated on new data. To solve this issue, we introduce a class of quantum models where quantum resources are only required during training, while the deployment of the trained model is classical. Specifically, the training phase of our models ends with the generation of a 'shadow model' from which the classical deployment becomes possible. We prove that: (i) this class of models is universal for classically-deployed quantum machine learning; (ii) it does have restricted learning capacities compared to 'fully quantum' models, but nonetheless (iii) it achieves a provable learning advantage over fully classical learners, contingent on widely believed assumptions in complexity theory. These results provide compelling evidence that quantum machine learning can confer learning advantages across a substantially broader range of scenarios, where quantum computers are exclusively employed during the training phase. By enabling classical deployment, our approach facilitates the implementation of quantum machine learning models in various practical contexts.
Quantum Machine Learning (QML) is an exciting frontier applying the philosophy of quantum computation to classical machine learning for improved learning performance of complicated tasks. However, QML is greatly challenged by realistic issues like noisy quantum measurements and limited labeled quantum data caused by the high cost and technological limitations. This paper explores the novel transfer-learning mechanisms to tackle these issues, which allow the reuse of the knowledge from related quantum tasks for improving model performance and generalization in resource-limited scenarios. Transfer learning, one of the great and successful concepts of classical machine learning, is to transfer the learned parameters or features from the source domain (or task) to the target domain (or task). We further develop and investigate, in quantum, a methodology where parameterized quantum circuits (PQCs) learnt on a source quantum data set have certain parts partially re-used or fine-tuned for a target task, given limited amount of target data. This strategy also avoids large quantum training runs that are not scalable on state-of-the-art noisy intermediate-scale quantum (NISQ) processors. The suggested methods are layerwise quantum adaptation, quantum kernel reuse and hybrid quantum-classical feature transfer. We investigate the robustness of these mechanisms in presence of noise by simulating quantum circuits using depolarizing and readout noise models. Moreover, we show that pretraining of quantum models on synthetic (or simulated) data sets (which are generated using larger, less noisy systems) can be instrumental in learning on real, small-sized quantum devices. Experiment results in quantum classification tasks demonstrate the effectiveness of transfer learning in boosting the accuracy, accelerating the convergence, and lowering the quantum circuit depth of successfully trained model. It is interesting to mention that transfer using layer-wise models became very resistant to quantum noise, as its performance did not degrade significantly for noisy inputs. These results demonstrate that transfer learning can overcome the scarce quantum data and suppress the harmful impact of measurement noise. This work presents a potential venue for enhancing the applicability of QML in the NISQ era. By transferring knowledge from theoretical quantum learning models to actual quantum hardware constraints, transfer learning allows quantum algorithms to learn faster and generalize better across tasks.
This paper explores the potential of quantum computing for unsupervised feature representation learning. Traditional unsupervised methods often rely on manually designed feature extraction algorithms, limiting their applicability to complex datasets. We propose a novel approach leveraging quantum entanglement and quantum gate operations to achieve unsupervised feature extraction directly from raw data. This approach aims to enhance the generalization capability and robustness of machine learning models. The core idea involves constructing a quantum circuit-based model that implicitly maps input data and extracts relevant features through quantum entanglement and gate operations. We present a theoretical framework outlining the methodology and discuss the potential benefits and challenges of this emerging field. The primary goal is to demonstrate that quantum computing offers a fundamentally different paradigm for unsupervised learning, potentially surpassing the limitations of classical approaches. ---
Abstract Quantum machine learning is an important application of quantum computing in the era of noisy intermediate-scale quantum devices. Domain adaptation (DA) is an effective method for addressing the distribution discrepancy problem between the training data and the real data when the neural network model is deployed. In this paper, we propose a variational quantum domain adaptation method inspired by the quantum convolutional neural network, named variational quantum domain adaptation (VQDA). The data is first uploaded by a ‘quantum coding module’, then the feature information is extracted by several ‘quantum convolution layers’ and ‘quantum pooling layers’, which is named ‘Feature Extractor’. Subsequently, the labels and the domains of the samples are obtained by the ‘quantum fully connected layer’. With a gradient reversal module, the trained ‘Feature Extractor’ can extract the features that cannot be distinguished from the source and target domains. The simulations on the local computer and IBM Quantum Experience (IBM Q) platform by Qiskit show the effectiveness of the proposed method. The results show that VQDA(with 8 quantum bits) has 91.46% average classification accuracy for DA task between MNIST→USPS (USPS→ MNIST), achieves 91.16% average classification accuracy for gray-scale and color images (with 10 quantum bits), and has 69.25% average classification accuracy on the DA task for color images (also with 10 quantum bits). VQDA achieves a 9.14% improvement in average classification accuracy compared to its corresponding classical domain adaptation method with the same parameter scale for different DA tasks. Simultaneously, the parameters scale is reduced to 43% by using VQDA when both quantum and classical DA methods have similar classification accuracies.
Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.
Quantum machine learning (QML) has attracted growing interest with the rapid parallel advances in large-scale classical machine learning and quantum technologies. Similar to classical machine learning, QML models also face challenges arising from the scarcity of labeled data, particularly as their scale and complexity increase. Here, we introduce self-supervised pretraining of quantum representations that reduces reliance on labeled data by learning invariances from unlabeled examples. We implement this paradigm on a programmable trapped-ion quantum computer, encoding images as quantum states. In situ contrastive pretraining on hardware yields a representation that, when fine-tuned, classifies image families with higher mean test accuracy and lower run-to-run variability than models trained from random initialization. Performance improvement is especially significant in regimes with limited labeled training data. We show that the learned invariances generalize beyond the pretraining image samples. Unlike prior work, our pipeline derives similarity from measured quantum overlaps and executes all training and classification stages on hardware. These results establish a label-efficient route to quantum representation learning, with direct relevance to quantum-native datasets and a clear path to larger classical inputs.