Binary Classification with Classical Instances and Quantum Labels
In classical statistical learning theory, one of the most well studied problems is that of binary classification. The information-theoretic sample complexity of this task is tightly characterized by the Vapnik-Chervonenkis (VC) dimension. A quantum analog of this task, with training data given as a quantum state has also been intensely studied and is now known to have the same sample complexity as its classical counterpart. We propose a novel quantum version of the classical binary classification task by considering maps with classical input and quantum output and corresponding classical-quantum training data. We discuss learning strategies for the agnostic and for the realizable case and study their performance to obtain sample complexity upper bounds. Moreover, we provide sample complexity lower bounds which show that our upper bounds are essentially tight for pure output states. In particular, we see that the sample complexity is the same as in the classical binary classification task w.r.t. its dependence on accuracy, confidence and the VC-dimension.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationClassificationGeneral ClassificationLearning TheorySimilar Papers 제목 키워드 기반
Representation of binary classification trees with binary features by quantum circuits
We propose a quantum representation of binary classification trees with binary features based on a probabilistic approach. By using the quantum computer as a processor for probability distributions, a probabilistic trave…
Binary ClassificationMulti-class Classification Model Inspired by Quantum Detection Theory
Machine Learning has become very famous currently which assist in identifying the patterns from the raw data. Technological advancement has led to substantial improvement in Machine Learning which, thus helping to improv…
BIG-bench Machine LearningClassificationGeneral ClassificationMulti-class ClassificationMORE: Measurement and Correlation Based Variational Quantum Circuit for Multi-classification
Quantum computing has shown considerable promise for compute-intensive tasks in recent years. For instance, classification tasks based on quantum neural networks (QNN) have garnered significant interest from researchers …
Binary ClassificationQuantum State TomographyTransfer 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…
Binary ClassificationQuantum Machine LearningTransfer LearningThe Quantum Version of Prediction for Binary Classification Problem by Ensemble Methods
In this work, we consider the performance of using a quantum algorithm to predict a result for a binary classification problem if a machine learning model is an ensemble from any simple classifiers. Such an approach is f…
Binary Classification