Boosted Ensembles of Qubit and Continuous Variable Quantum Support Vector Machines for B Meson Flavour Tagging

• URL: http://arxiv.org/abs/2305.02729v3
• Date: Mon, 21 Aug 2023 03:49:34 GMT
• Title: Boosted Ensembles of Qubit and Continuous Variable Quantum Support Vector Machines for B Meson Flavour Tagging
• Authors: Maxwell T. West, Martin Sevior and Muhammad Usman
• Abstract summary: We develop and apply quantum machine learning methods to B meson tagging. We simulate boosted ensembles of quantum support vector machines based on both conventional qubit-based and continuous variable architectures. We find evidence that continuous variable QSVMs beyond the classically simulable regime may be able to realise even higher performance.
• Score: 0.7232471205719458
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The recent physical realisation of quantum computers with dozens to hundreds of noisy qubits has given birth to an intense search for useful applications of their unique capabilities. One area that has received particular attention is quantum machine learning (QML), the study of machine learning algorithms running natively on quantum computers. Such algorithms have begun to be applied to data intensive problems in particle physics, driven by the expected increased capacity for pattern recognition of quantum computers. In this work we develop and apply QML methods to B meson flavour tagging, an important component of experiments in particle physics which probe heavy quark mixing and CP violation in order to obtain a better understanding of the matter-antimatter asymmetry observed in the universe. We simulate boosted ensembles of quantum support vector machines (QSVMs) based on both conventional qubit-based and continuous variable architectures, attaining effective tagging efficiencies of 28.0% and 29.2% respectively, comparable with the leading published result of 30.0% using classical machine learning algorithms. The ensemble nature of our classifier is of particular importance, doubling the effective tagging efficiency of a single QSVM, which we find to be highly prone to overfitting. These results are obtained despite the strong constraint of working with QSVM architectures that are classically simulable, and we find evidence that continuous variable QSVMs beyond the classically simulable regime may be able to realise even higher performance, surpassing the reported classical results, when sufficiently powerful quantum hardware is developed to execute them.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Machine Learning in the Quantum Age: Quantum vs. Classical Support Vector Machines [0.0]
  This work endeavors to juxtapose the efficacy of machine learning algorithms within classical and quantum computational paradigms. We scrutinize the classification prowess of classical SVM and Quantum Support Vector Machines operational on quantum hardware over the Iris dataset.
  arXiv  Detail & Related papers  (2023-10-17T01:06:59Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Improving Quantum Classifier Performance in NISQ Computers by Voting Strategy from Ensemble Learning [9.257859576573942]
  Large error rates occur in quantum algorithms due to quantum decoherence and imprecision of quantum gates. In this study, we suggest that ensemble quantum classifiers be optimized with plurality voting.
  arXiv  Detail & Related papers  (2022-10-04T14:59:58Z)
• Application of Quantum Machine Learning in a Higgs Physics Study at the CEPC [5.747925022035578]
  We have pioneered employing a quantum machine learning algorithm to study the $e+e- rightarrow ZH$ process at the Circular Electron-Positron Collider (CEPC) Using 6 qubits on quantum computer simulators, we optimised the QSVM- Kernel algorithm and obtained a classification performance similar to the classical support-vector machine algorithm. Our study shows that state-of-the-art quantum computing technologies could be utilised by particle physics.
  arXiv  Detail & Related papers  (2022-09-26T15:46:30Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Quantum Support Vector Machines for Continuum Suppression in B Meson Decays [0.27342795342528275]
  We investigate the effect of different quantum encoding circuits, the process that transforms classical data into a quantum state, on the final classification performance. We show an encoding approach that achieves an average Area Under Receiver Operating Characteristic Curve (AUC) of 0.848 determined using quantum circuit simulations. Using a reduced version of the dataset we then ran the algorithm on the IBM Quantum ibmq_casablanca device achieving an average AUC of 0.703.
  arXiv  Detail & Related papers  (2021-03-23T02:09:05Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.