• Corpus ID: 245124384

Q-means using variational quantum feature embedding

@inproceedings{Menon2021QmeansUV,
  title={Q-means using variational quantum feature embedding},
  author={Arvind S. Menon and Nikaash Puri},
  year={2021}
}
This paper proposes a hybrid quantum-classical algorithm that learns a suitable quantum feature map that separates unlabelled data that is originally non linearly separable in the classical space using a Variational quantum feature map and q-means as a subroutine for unsupervised learning. The objective of the Variational circuit is to maximally separate the clusters in the quantum feature Hilbert space. First part of the circuit embeds the classical data into quantum states. Second part… 
[PDF] Semantic Reader

Figures and Tables from this paper

18 References

Quantum embeddings for machine learning

This work proposes to train the first part of the circuit with the objective of maximally separating data classes in Hilbert space, a strategy it calls quantum metric learning, which provides a powerful analytic framework for quantum machine learning.

Quantum Machine Learning in Feature Hilbert Spaces.

This Letter interprets the process of encoding inputs in a quantum state as a nonlinear feature map that maps data to quantum Hilbert space and shows how it opens up a new avenue for the design of quantum machine learning algorithms.

Supervised learning with quantum-enhanced feature spaces

Two classification algorithms that use the quantum state space to produce feature maps are demonstrated on a superconducting processor, enabling the solution of problems when the feature space is large and the kernel functions are computationally expensive to estimate.

Experimental kernel-based quantum machine learning in finite feature space

An all-optical setup demonstrating kernel-based quantum machine learning for two-dimensional classification problems using specialized multiphoton quantum optical circuits exhibits exponentially better scaling in the required number of qubits than a direct generalization of kernels described in the literature.

Quantum classifier with tailored quantum kernel

A distance-based quantum classifier whose kernel is based on the quantum state fidelity between training and test data, and it is shown that the classifier is equivalent to measuring the expectation value of a Helstrom operator, from which the well-known optimal quantum state discrimination can be derived.

q-means: A quantum algorithm for unsupervised machine learning

The q-means algorithm is introduced, a new quantum algorithm for clustering which is a canonical problem in unsupervised machine learning and provides substantial savings compared to the classical $k$-mean algorithm that runs in time $O(kdN)$ per iteration, particularly for the case of large datasets.

PennyLane: Automatic differentiation of hybrid quantum-classical computations

PennyLane's core feature is the ability to compute gradients of variational quantum circuits in a way that is compatible with classical techniques such as backpropagation, and it extends the automatic differentiation algorithms common in optimization and machine learning to include quantum and hybrid computations.

Implementing a distance-based classifier with a quantum interference circuit

A distance-based classifier that is realised by a simple quantum interference circuit that computes the distance between data points in quantum parallel and is demonstrated using the IBM Quantum Experience and analysed with numerical simulations.

Quantum circuit learning

A classical-quantum hybrid algorithm for machine learning on near-term quantum processors, which is hybridizing a low-depth quantum circuit and a classical computer for machinelearning, paves the way toward applications of near- term quantum devices for quantum machine learning.

Sublinear quantum algorithms for training linear and kernel-based classifiers

Sublinear quantum algorithms for classification for classification, a fundamental problem in machine learning, with provable guarantees, are investigated, suggesting minimal overheads when used as subroutines for end-to-end applications.