Practical Quantum K-Means Clustering: Performance Analysis and Applications in Energy Grid Classification

• URL: http://arxiv.org/abs/2112.08506v2
• Date: Sun, 11 Sep 2022 15:01:42 GMT
• Title: Practical Quantum K-Means Clustering: Performance Analysis and Applications in Energy Grid Classification
• Authors: Stephen DiAdamo, Corey O'Meara, Giorgio Cortiana, Juan Bernab\'e-Moreno
• Abstract summary: We propose a general, competitive, and parallelized version of quantum $k$-means clustering to avoid some pitfalls due to noisy hardware. Using real-world German electricity grid data, we show that the new approach improves the balanced accuracy of the standard quantum $k$-means clustering by $67.8%$ with respect to the labeling of the classical algorithm.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we aim to solve a practical use-case of unsupervised clustering which has applications in predictive maintenance in the energy operations sector using quantum computers. Using only cloud access to quantum computers, we complete a thorough performance analysis of what some current quantum computing systems are capable of for practical applications involving non-trivial mid-to-high dimensional datasets. We first benchmark how well distance estimation can be performed using two different metrics based on the swap-test, using angle and amplitude data embedding. Next, for the clustering performance analysis, we generate sets of synthetic data with varying cluster variance and compare simulation to physical hardware results using the two metrics. From the results of this performance analysis, we propose a general, competitive, and parallelized version of quantum $k$-means clustering to avoid some pitfalls discovered due to noisy hardware and apply the approach to a real energy grid clustering scenario. Using real-world German electricity grid data, we show that the new approach improves the balanced accuracy of the standard quantum $k$-means clustering by $67.8\%$ with respect to the labeling of the classical algorithm.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Big data applications on small quantum computers [0.0]
  Coresets allow for a succinct description of large datasets and their solution in a computational task is competitive with the solution on the original dataset. We apply the coreset method in three different well-studied classical machine learning problems, namely Divisive Clustering, 3-means Clustering, and Gaussian Model Clustering. We show that our approach provides comparable performance to classical solvers.
  arXiv  Detail & Related papers  (2024-02-02T16:15:55Z)
• Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computing [93.83016310295804]
  AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for computer vision tasks. In this work, we explore the potential of using this information for probabilistic balanced k-means clustering. Instead of discarding non-optimal solutions, we propose to use them to compute calibrated posterior probabilities with little additional compute cost. This allows us to identify ambiguous solutions and data points, which we demonstrate on a D-Wave AQC on synthetic tasks and real visual data.
  arXiv  Detail & Related papers  (2023-10-18T17:59:45Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Variational Quantum and Quantum-Inspired Clustering [0.0]
  We present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2022-06-20T17:02:19Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Binary classifiers for noisy datasets: a comparative study of existing quantum machine learning frameworks and some new approaches [0.0]
  We apply Quantum Machine Learning frameworks to improve binary classification. noisy datasets are in financial datasets. New models exhibit better learning characteristics to asymmetrical noise in the dataset.
  arXiv  Detail & Related papers  (2021-11-05T10:29:05Z)
• Quantum Algorithms for Data Representation and Analysis [68.754953879193]
  We provide quantum procedures that speed-up the solution of eigenproblems for data representation in machine learning. The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis. Results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
  arXiv  Detail & Related papers  (2021-04-19T00:41:43Z)
• Nearest Centroid Classification on a Trapped Ion Quantum Computer [57.5195654107363]
  We design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimations. We experimentally demonstrate it on a 11-qubit trapped-ion quantum machine, matching the accuracy of classical nearest centroid classifiers for the MNIST handwritten digits dataset and achieving up to 100% accuracy for 8-dimensional synthetic data.
  arXiv  Detail & Related papers  (2020-12-08T01:10:30Z)
• Coreset Clustering on Small Quantum Computers [3.4075213885825377]
  Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing. We investigate using this paradigm to perform $k$-means clustering on near-term quantum computers. We find data sets where both coresets and QAOA work well--which is necessary for a quantum advantage over $k$-means on the entire data set--appears to be challenging.
  arXiv  Detail & Related papers  (2020-04-30T17:19:19Z)
• Small quantum computers and large classical data sets [2.8174125805742416]
  We introduce hybrid classical-quantum algorithms for problems involving a large classical data set X and a space of models Y. These algorithms use data reduction techniques to construct a weighted subset of X called a coreset that yields approximately the same loss for each model. Concrete applications include k-means clustering, logistical regression, zero-sum games and boosting.
  arXiv  Detail & Related papers  (2020-03-31T18:00:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.