Antonio Macaluso, Luca Clissa, Stefano Lodi, Claudio Sartori
{"title":"An efficient quantum algorithm for ensemble classification using bagging","authors":"Antonio Macaluso, Luca Clissa, Stefano Lodi, Claudio Sartori","doi":"10.1049/qtc2.12087","DOIUrl":null,"url":null,"abstract":"<p>Ensemble methods aggregate predictions from multiple models, typically demonstrating improved accuracy and reduced variance compared to individual classifiers. However, they often come with significant memory usage and computational time requirements. A novel quantum algorithm that leverages quantum superposition, entanglement, and interference to construct an ensemble of classification models using bagging as an aggregation strategy is introduced. Through the generation of numerous quantum trajectories in superposition, the authors achieve <i>B</i> transformations of the training set with only <span></span><math>\n <semantics>\n <mrow>\n <mi>log</mi>\n <mfenced>\n <mi>B</mi>\n </mfenced>\n </mrow>\n <annotation> $\\mathit{log}\\left(B\\right)$</annotation>\n </semantics></math> operations, allowing an exponential enlargement of the ensemble size while linearly increasing the depth of the corresponding circuit. Moreover, when assessing the algorithm's overall cost, the authors demonstrate that the training of a single weak classifier contributes additively to the overall time complexity, as opposed to the multiplicative impact commonly observed in classical ensemble methods. To illustrate the efficacy of the authors’ approach, experiments on reduced real-world datasets utilising the IBM qiskit environment to demonstrate the functionality and performance of the proposed algorithm are introduced.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"5 3","pages":"253-268"},"PeriodicalIF":2.5000,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12087","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Quantum Communication","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/qtc2.12087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"QUANTUM SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0
Abstract
Ensemble methods aggregate predictions from multiple models, typically demonstrating improved accuracy and reduced variance compared to individual classifiers. However, they often come with significant memory usage and computational time requirements. A novel quantum algorithm that leverages quantum superposition, entanglement, and interference to construct an ensemble of classification models using bagging as an aggregation strategy is introduced. Through the generation of numerous quantum trajectories in superposition, the authors achieve B transformations of the training set with only operations, allowing an exponential enlargement of the ensemble size while linearly increasing the depth of the corresponding circuit. Moreover, when assessing the algorithm's overall cost, the authors demonstrate that the training of a single weak classifier contributes additively to the overall time complexity, as opposed to the multiplicative impact commonly observed in classical ensemble methods. To illustrate the efficacy of the authors’ approach, experiments on reduced real-world datasets utilising the IBM qiskit environment to demonstrate the functionality and performance of the proposed algorithm are introduced.
集合方法汇总了多个模型的预测结果,与单个分类器相比,通常能提高准确性并减少方差。然而,这些方法往往需要占用大量内存和计算时间。本文介绍了一种新颖的量子算法,它利用量子叠加、纠缠和干涉来构建分类模型集合,并将袋聚作为一种聚合策略。通过在叠加中生成大量量子轨迹,作者仅用运算就实现了训练集的 B 变换,从而在线性增加相应电路深度的同时,以指数形式扩大了集合规模。此外,在评估算法的总体成本时,作者证明了单个弱分类器的训练对总体时间复杂度的影响是加法,而不是经典集合方法中常见的乘法。为了说明作者方法的有效性,介绍了利用 IBM qiskit 环境在缩小的真实世界数据集上进行的实验,以展示所提算法的功能和性能。