Can Geometric Quantum Machine Learning Lead to Advantage in Barcode Classification?

• URL: http://arxiv.org/abs/2409.01496v1
• Date: Mon, 2 Sep 2024 23:34:52 GMT
• Title: Can Geometric Quantum Machine Learning Lead to Advantage in Barcode Classification?
• Authors: Chukwudubem Umeano, Stefano Scali, Oleksandr Kyriienko,
• Abstract summary: We develop a geometric quantum machine learning (GQML) approach with embedded symmetries. We show that quantum networks largely outperform their classical counterparts. While the ability to achieve advantage largely depends on how data are loaded, we discuss how similar problems can benefit from quantum machine learning.
• Score: 16.34646723046073
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the problem of distinguishing two vectors (visualized as images or barcodes) and learning if they are related to one another. For this, we develop a geometric quantum machine learning (GQML) approach with embedded symmetries that allows for the classification of similar and dissimilar pairs based on global correlations, and enables generalization from just a few samples. Unlike GQML algorithms developed to date, we propose to focus on symmetry-aware measurement adaptation that outperforms unitary parametrizations. We compare GQML for similarity testing against classical deep neural networks and convolutional neural networks with Siamese architectures. We show that quantum networks largely outperform their classical counterparts. We explain this difference in performance by analyzing correlated distributions used for composing our dataset. We relate the similarity testing with problems that showcase a proven maximal separation between the BQP complexity class and the polynomial hierarchy. While the ability to achieve advantage largely depends on how data are loaded, we discuss how similar problems can benefit from quantum machine learning.

Related papers

• A Comparative Analysis of Adversarial Robustness for Quantum and Classical Machine Learning Models [0.0]
  We show how to investigate the similarities and differences in adversarial robustness of classical and quantum models. Our findings show that a classical approximation of QML circuits can be seen as a "middle ground" on the quantum-classical boundary.
  arXiv  Detail & Related papers  (2024-04-24T19:20:15Z)
• Geometric quantum machine learning of BQP$^A$ protocols and latent graph classifiers [17.857341127079305]
  Geometric quantum machine learning (GQML) aims to embed problem symmetries for learning efficient solving protocols. In this Letter we consider Simon's problem for learning properties of Boolean functions, and show that this can be related to an unsupervised circuit classification problem.
  arXiv  Detail & Related papers  (2024-02-06T10:32:39Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Heterogenous Memory Augmented Neural Networks [84.29338268789684]
  We introduce a novel heterogeneous memory augmentation approach for neural networks. By introducing learnable memory tokens with attention mechanism, we can effectively boost performance without huge computational overhead. We show our approach on various image and graph-based tasks under both in-distribution (ID) and out-of-distribution (OOD) conditions.
  arXiv  Detail & Related papers  (2023-10-17T01:05:28Z)
• Learning Layer-wise Equivariances Automatically using Gradients [66.81218780702125]
  Convolutions encode equivariance symmetries into neural networks leading to better generalisation performance. symmetries provide fixed hard constraints on the functions a network can represent, need to be specified in advance, and can not be adapted. Our goal is to allow flexible symmetry constraints that can automatically be learned from data using gradients.
  arXiv  Detail & Related papers  (2023-10-09T20:22:43Z)
• Approximately Equivariant Quantum Neural Network for $p4m$ Group Symmetries in Images [30.01160824817612]
  This work proposes equivariant Quantum Convolutional Neural Networks (EquivQCNNs) for image classification under planar $p4m$ symmetry. We present the results tested in different use cases, such as phase detection of the 2D Ising model and classification of the extended MNIST dataset.
  arXiv  Detail & Related papers  (2023-10-03T18:01:02Z)
• Permutation Equivariant Neural Functionals [92.0667671999604]
  This work studies the design of neural networks that can process the weights or gradients of other neural networks. We focus on the permutation symmetries that arise in the weights of deep feedforward networks because hidden layer neurons have no inherent order. In our experiments, we find that permutation equivariant neural functionals are effective on a diverse set of tasks.
  arXiv  Detail & Related papers  (2023-02-27T18:52:38Z)
• 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)
• Reflection Equivariant Quantum Neural Networks for Enhanced Image Classification [0.7232471205719458]
  We build new machine learning models which explicitly respect the symmetries inherent in their data, so-called geometric quantum machine learning (GQML) We find that these networks are capable of consistently and significantly outperforming generic ansatze on complicated real-world image datasets.
  arXiv  Detail & Related papers  (2022-12-01T04:10:26Z)
• 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)
• Group-Invariant Quantum Machine Learning [0.0]
  Quantum Machine Learning (QML) models are aimed at learning from data encoded in quantum states. Group-invariant models produce outputs that remain invariant under the action of any element of the symmetry group $mathfrakG$ associated to the dataset. We present theoretical results underpinning the design of $mathfrakG$-invariant models, and exemplify their application through several paradigmatic QML classification tasks.
  arXiv  Detail & Related papers  (2022-05-04T18:04: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.