• Corpus ID: 88522189

Adiabatic Quantum Computing for Binary Clustering

  title={Adiabatic Quantum Computing for Binary Clustering},
  author={Christian Bauckhage and Eduardo Brito and Kostadin Cvejoski and C. Ojeda and Rafet Sifa and Stefan Wrobel},
  journal={arXiv: Machine Learning},
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this paradigm and discuss how to adopt it to the problem of binary clustering. Numerical simulations demonstrate the feasibility of our approach and illustrate how systems of qubits adiabatically evolve towards a solution. 

Figures from this paper

Adiabatic Quantum Computing for Kernel k=2 Means Clustering
This paper discusses how to accomplish the quest for Ising model (re-)formulations of their underlying objective functions for the problem of kernel binary clustering, and discusses how these models can be solved on an adiabatic quantum computing device.
Adiabatic Quantum Computing for Solving the Weapon Target Assignment Problem
Overall, the described method is not limited to the context of weapon management but is, with slight modifications to the model Hamiltonian, applicable to relevant problems in data fusion, for example sensor allocation and multi-target data association in tracking applications.
Coreset Clustering on Small Quantum Computers
This work investigates using a new paradigm in hybrid quantum-classical computing to perform $k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset.
Clustering by quantum annealing on the three-level quantum elements qutrits
The simulation has shown that the clustering problem can be effectively solved on qutrits represented by the spins S = 1, and the advantages of clustering on qUTrits over that on qubits have been demonstrated.
Q-means using variational quantum feature embedding
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


An introduction to quantum machine learning
This contribution gives a systematic overview of the emerging field of quantum machine learning and presents the approaches as well as technical details in an accessible way, and discusses the potential of a future theory of quantum learning.
Adiabatic quantum computation
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing,
Quantum clustering algorithms
This paper begins the idea of quantizing clustering algorithms by using variations on a celebrated quantum algorithm due to Grover, and illustrates it with a quantized version of three standard algorithms: divisive clustering, k-medians and an algorithm for the construction of a neighbourhood graph.
Quantum Computation by Adiabatic Evolution
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that
Quantum speed-up for unsupervised learning
It is explained how it is possible to accelerate learning algorithms by quantizing some of their subroutines by giving quantized versions of clustering via minimum spanning tree, divisive clustering and k-medians that are faster than their classical analogues.
Quantum algorithms for supervised and unsupervised machine learning
Machine-learning tasks frequently involve problems of manipulating and classifying large numbers of vectors in high-dimensional spaces. Classical algorithms for solving such problems typically take
The Ising model : teaching an old problem new tricks
In this paper we investigate the use of hardware which physically realizes quantum annealing for machine learning applications. We show how to take advantage of the hardware in both zeroand
Quantum annealing with manufactured spins
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.
Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning
This work presents quantum algorithms for performing nearest-neighbor learning and k-means clustering and proves upper bounds on the number of queries to the input data required to compute such distances and find the nearest vector to a given test example.
Ising formulations of many NP problems
This work collects and extends mappings to the Ising model from partitioning, covering and satisfiability, and provides Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21NP-complete problems.