Affiliation:
1. School of Physics The University of Melbourne Parkville VIC 3010 Australia
2. Data61 CSIRO Clayton VIC 3168 Australia
Abstract
AbstractThe recent physical realization of quantum computers with 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. In this work, QML methods are developed and applied to B meson flavor tagging, an important component of experiments which probe CP violation in order to better understand the matter‐antimatter asymmetry of the universe. One 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 the classifier is of particular importance, doubling the effective tagging efficiency of a single QSVM, which is find to be highly prone to overfitting. These results are obtained despite the constraint of working with QSVM architectures that are classically simulable, and it finds evidence that QSVMs beyond the simulable regime may be able to realize even higher performance, when sufficiently powerful quantum hardware is developed to execute them.
Funder
Australian Research Council
Subject
Electrical and Electronic Engineering,Computational Theory and Mathematics,Condensed Matter Physics,Mathematical Physics,Nuclear and High Energy Physics,Electronic, Optical and Magnetic Materials,Statistical and Nonlinear Physics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献