Transfer Learning for Quantum Classifiers: An Information-Theoretic Generalization Analysis
A key component of a quantum machine learning model operating on classical inputs is the design of an embedding circuit mapping inputs to a quantum state. This paper studies a transfer learning setting in which classical-to-quantum embedding is carried out by an arbitrary parametric quantum circuit that is pre-trained based on data from a source task. At run time, a binary quantum classifier of the embedding is optimized based on data from the target task of interest. The average excess risk, i.e., the optimality gap, of the resulting classifier depends on how (dis)similar the source and target tasks are. We introduce a new measure of (dis)similarity between the binary quantum classification tasks via the trace distances. An upper bound on the optimality gap is derived in terms of the proposed task (dis)similarity measure, two R$\'e$nyi mutual information terms between classical input and quantum embedding under source and target tasks, as well as a measure of complexity of the combined space of quantum embeddings and classifiers under the source task. The theoretical results are validated on a simple binary classification example.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationQuantum Machine LearningTransfer LearningSimilar Papers 제목 키워드 기반
Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis
In a manner analogous to their classical counterparts, quantum classifiers are vulnerable to adversarial attacks that perturb their inputs. A promising countermeasure is to train the quantum classifier by adopting an att…
Quantum Machine LearningGeneralization in Quantum Machine Learning: a Quantum Information Perspective
Quantum classification and hypothesis testing are two tightly related subjects, the main difference being that the former is data driven: how to assign to quantum states $\rho(x)$ the corresponding class $c$ (or hypothes…
BIG-bench Machine LearningClassificationQuantum Machine LearningInformation-theoretic generalization bounds for learning from quantum data
Learning tasks play an increasingly prominent role in quantum information and computation. They range from fundamental problems such as state discrimination and metrology over the framework of quantum probably approximat…
Generalization BoundsLearning TheoryPAC learningparameter estimationPrivacy Implies Stability: Information-Theoretic Generalization Bounds for Quantum Learning
We develop an information-theoretic framework connecting stability, privacy, and generalization for quantum learning algorithms. Learning procedures are modeled as quantum instruments with classical-quantum outputs, and …
Certified Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise
Recently, quantum classifiers have been found to be vulnerable to adversarial attacks, in which quantum classifiers are deceived by imperceptible noises, leading to misclassification. In this paper, we propose the first …