This work analyzes transfer learning of the Variational Quantum Circuit (VQC). Our framework begins with a pretrained VQC configured in one domain and calculates the transition of 1-parameter unitary subgroups required for a new domain. A formalism is established to investigate the adaptability and capability of a VQC under the analysis of loss bounds. Our theory observes knowledge transfer in VQCs and provides a heuristic interpretation for the mechanism. An analytical fine-tuning method is derived to attain the optimal transition for adaptations of similar domains.
This work analyzes transfer learning of the Variational Quantum Circuit (VQC). Our framework begins with a pretrained VQC configured in one domain and calculates the transition of 1-parameter unitary subgroups required for a new domain. A formalism is established to investigate the adaptability and capability of a VQC under the analysis of loss bounds. Our theory observes knowledge transfer in VQCs and provides a heuristic interpretation for the mechanism. An analytical fine-tuning method is derived to attain the optimal transition for adaptations of similar domains.
Variational quantum circuits (VQCs) are a central component of many quantum machine learning algorithms, offering a hybrid quantum-classical framework that, under certain aspects, can be considered similar to classical deep neural networks. A shared aspect is, for instance, their vulnerability to adversarial inputs, small perturbations that can lead to incorrect predictions. While formal verification techniques have been extensively developed for classical models, no comparable framework exists for certifying the robustness of VQCs. Here, we present the first in-depth theoretical and practical study of the formal verification problem for VQCs. Inspired by abstract interpretation methods used in deep learning, we analyze the applicability and limitations of interval-based reachability techniques in the quantum setting. We show that quantum-specific aspects, such as state normalization, introduce inter-variable dependencies that challenge existing approaches. We investigate these issues by introducing a novel semantic framework based on abstract interpretation, where the verification problem for VQCs can be formally defined, and its complexity analyzed. Finally, we demonstrate our approach on standard verification benchmarks.
In the era of noisy intermediate-scale quantum (NISQ), variational quantum circuits (VQCs) have been widely applied in various domains, demonstrating the potential advantages of quantum circuits over classical models. Similar to classic models, VQCs can be optimized by various gradient-based methods. However, the optimization may get stuck in barren plateaus initially or trapped in saddle points during training. These gradient-related issues can severely impact the trainability of VQCs. In this work, we propose a strategy that regularizes model parameters with prior knowledge of the training data and Gaussian noise diffusion. We conduct ablation studies to verify the effectiveness of our strategy across four public datasets and demonstrate that our method can improve the trainability of VQCs against the above-mentioned gradient issues.
Domain adaptation, a crucial sub-field of transfer learning, aims to utilize known knowledge of one data set to accomplish tasks on another data set. In this paper, we perform one of the most representative domain adaptation algorithms, transfer component analysis (TCA), on quantum devices. Two different quantum implementations of this transfer learning algorithm; namely, the linear-algebra-based quantum TCA algorithm and the variational quantum TCA algorithm, are presented. The algorithmic complexity of the linear-algebra-based quantum TCA algorithm is O(poly(log(ns+nt))), where ns and nt are input sample size. Compared with the corresponding classical algorithm, the linear-algebra-based quantum TCA can be performed on a universal quantum computer with exponential speedup in the number of given samples. Finally, the variational quantum TCA algorithm based on a quantum-classical hybrid procedure, that can be implemented on the near term quantum devices, is proposed.
Abstract Machine learning techniques enhanced by noisy intermediate-scale quantum (NISQ) devices and especially variational quantum circuits (VQC) have recently attracted much interest and have already been benchmarked for certain problems. Inspired by classical deep learning, VQCs are trained by gradient descent methods which allow for efficient training over big parameter spaces. For NISQ sized circuits, such methods show good convergence. There are however still many open questions related to the convergence of the loss function and to the trainability of these circuits in situations of vanishing gradients. Furthermore, it is not clear how ‘good’ the minima are in terms of generalization and stability against perturbations of the data and there is, therefore, a need for tools to quantitatively study the convergence of the VQCs. In this work, we introduce a way to compute the Hessian of the loss function of VQCs and show how to characterize the loss landscape with it. The eigenvalues of the Hessian give information on the local curvature and we discuss how this information can be interpreted and compared to classical neural networks. We benchmark our results on several examples, starting with a simple analytic toy model to provide some intuition about the behaviour of the Hessian, then going to bigger circuits, and also train VQCs on data. Finally, we show how the Hessian can be used to adjust the learning rate for faster convergence during the training of variational circuits.
Abstract Variational Quantum Circuits (VQC)s have been widely explored to advance quantum circuits against classic models in various domains. Similar to classic machine-learning models, VQCs can be optimized through gradient-based approaches. However, the gradient of VQCs may dramatically vanish during the optimization process for various reasons. This issue, known as Barren Plateaus (BP)s, seriously hinders the advancement of quantum computing. To mitigate BPs, extensive efforts have been devoted to tackling this issue through different methods. In this work, we aim to investigate several circuit components through the lens of parameter initialization techniques. We study the performance and gradient variance of the different quantum circuit structures in combination with various initialization methods. This investigation will provide a better understanding of how the VQC structures behave under different initialization strategies for binary classification problems.
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.