Nonnegative/Binary Matrix Factorization for Image Classification using Quantum Annealing

• URL: http://arxiv.org/abs/2311.01028v1
• Date: Thu, 2 Nov 2023 06:41:27 GMT
• Title: Nonnegative/Binary Matrix Factorization for Image Classification using Quantum Annealing
• Authors: Hinako Asaoka, Kazue Kudo
• Abstract summary: We implement a matrix factorization method using quantum annealing for image classification. Our findings show that when the amount of data, features, and epochs is small, the accuracy of models trained by NBMF is superior to classical machine-learning methods.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical computing has borne witness to the development of machine learning. The integration of quantum technology into this mix will lead to unimaginable benefits and be regarded as a giant leap forward in mankind's ability to compute. Demonstrating the benefits of this integration now becomes essential. With the advance of quantum computing, several machine-learning techniques have been proposed that use quantum annealing. In this study, we implement a matrix factorization method using quantum annealing for image classification and compare the performance with traditional machine-learning methods. Nonnegative/binary matrix factorization (NBMF) was originally introduced as a generative model, and we propose a multiclass classification model as an application. We extract the features of handwritten digit images using NBMF and apply them to solve the classification problem. Our findings show that when the amount of data, features, and epochs is small, the accuracy of models trained by NBMF is superior to classical machine-learning methods, such as neural networks. Moreover, we found that training models using a quantum annealing solver significantly reduces computation time. Under certain conditions, there is a benefit to using quantum annealing technology with machine learning.

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)
• Quantum Machine Learning with Application to Progressive Supranuclear Palsy Network Classification [0.0]
  We present a quantum machine learning model for the diagnosis of Progressive Supranuclear Palsy (PSP) disorder. The results suggest that quantum machine learning has led to noticeable advancement and outperforms classical frameworks. In particular, we have demonstrated the successful application of the present model on both a quantum simulator and real chips of the IBM quantum platform.
  arXiv  Detail & Related papers  (2024-07-06T14:16:31Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification [83.20479832949069]
  Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Here we investigate the problem-dependent power of QCs on multi-class classification tasks. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.
  arXiv  Detail & Related papers  (2022-12-29T10:46:40Z)
• 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)
• A Review of Machine Learning Classification Using Quantum Annealing for Real-world Applications [1.8047694351309205]
  The implementation of a physical quantum annealer has been realized by D-Wave systems. Recent experimental results on a variety of machine learning applications using quantum annealing have shown interesting results. We discuss and analyze the experiments performed on the D-Wave quantum annealer for applications such as image recognition, remote sensing imagery, computational biology, and particle physics.
  arXiv  Detail & Related papers  (2021-06-05T21:15:34Z)
• Generation of High-Resolution Handwritten Digits with an Ion-Trap Quantum Computer [55.41644538483948]
  We implement a quantum-circuit based generative model to learn and sample the prior distribution of a Generative Adversarial Network. We train this hybrid algorithm on an ion-trap device based on $171$Yb$+$ ion qubits to generate high-quality images.
  arXiv  Detail & Related papers  (2020-12-07T18:51:28Z)
• Quantum Machine Learning for Particle Physics using a Variational Quantum Classifier [0.0]
  We propose a novel hybrid variational quantum classifier that combines the quantum gradient descent method with steepest gradient descent to optimise the parameters of the network. We find that this algorithm has a better learning outcome than a classical neural network or a quantum machine learning method trained with a non-quantum optimisation method.
  arXiv  Detail & Related papers  (2020-10-14T18:05:49Z)
• QEML (Quantum Enhanced Machine Learning): Using Quantum Computing to Enhance ML Classifiers and Feature Spaces [0.49841205356595936]
  Machine learning and quantum computing are causing a paradigm shift in the performance and behavior of certain algorithms. This paper first understands the mathematical intuition for the implementation of quantum feature space. We build a noisy variational quantum circuit KNN which mimics the classification methods of a traditional KNN.
  arXiv  Detail & Related papers  (2020-02-22T04:14:32Z)

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.