Quantum subspace alignment for domain adaptation
arXiv:2001.02472 · doi:10.1103/PhysRevA.102.062403
Abstract
Domain adaptation (DA) is used for adaptively obtaining labels of an unprocessed data set with a given related, but different labelled data set. Subspace alignment (SA), a representative DA algorithm, attempts to find a linear transformation to align the subspaces of the two different data sets. The classifier trained on the aligned labelled data set can be transferred to the unlabelled data set to predict the target labels. In this paper, two quantum versions of the SA are proposed to implement the DA procedure on quantum devices. One method, the quantum subspace alignment algorithm (QSA), achieves quadratic speedup in the number and dimension of given samples. The other method, the variational quantum subspace alignment algorithm (VQSA), can be implemented on the near term quantum devices through a variational hybrid quantum-classical procedure. The results of the numerical experiments on different types of datasets demonstrate that the VQSA can achieve competitive performance compared with the corresponding classical algorithm.
arXiv comment8 pages, 1 figures
References in corpus (27)
- Scikit-learn: Machine Learning in Python
- Quantum algorithm for solving linear systems of equations
- Quantum support vector machine for big data classification
- Quantum principal component analysis
- Quantum random access memory
- Domain Adaptation for Statistical Classifiers
- Efficient Learning for Deep Quantum Neural Networks
- Quantum generative adversarial learning
- Quantum Data Fitting
- Quantum algorithms for supervised and unsupervised machine learning
- Quantum generative adversarial networks
- Quantum autoencoders for efficient compression of quantum data
- Transfer learning in hybrid classical-quantum neural networks
- Quantum Boltzmann Machine
- Prediction by linear regression on a quantum computer
- Quantum generalisation of feedforward neural networks
- Variational Quantum State Diagonalization
- Quantum Variational Autoencoder
- Quantum generative adversarial learning in a superconducting quantum circuit
- Quantum generative adversarial network for generating discrete distribution
- Quantum singular value decomposition of non-sparse low-rank matrices
- Quantum Discriminant Analysis for Dimensionality Reduction and Classification
- Learning and Inference on Generative Adversarial Quantum Circuits
- Adversarial quantum circuit learning for pure state approximation
- Quantum autoencoders via quantum adders with genetic algorithms
- Quantum Algorithms to Matrix Multiplication
- Quantum correlation alignment for unsupervised domain adaptation