{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:21:21Z","timestamp":1779891681924,"version":"3.53.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T00:00:00Z","timestamp":1690416000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T00:00:00Z","timestamp":1690416000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s42484-023-00122-3","type":"journal-article","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T10:03:57Z","timestamp":1690452237000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum boosting using domain-partitioning hypotheses"],"prefix":"10.1007","volume":"5","author":[{"given":"Sagnik","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rohan","family":"Bhatia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Parmeet","family":"Singh Chani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Debajyoti","family":"Bera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,27]]},"reference":[{"key":"122_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson S, Rall P (2022) Quantum Approximate Counting, Simplified, pp. 24\u201332. https:\/\/doi.org\/10.1137\/1.9781611976014.5. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611976014.5","DOI":"10.1137\/1.9781611976014.5"},{"key":"122_CR2","doi-asserted-by":"publisher","unstructured":"Aleksandrowicz G, et al (2021) Qiskit: An open-source framework for quantum computing. https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"122_CR3","unstructured":"Ambainis A (2008) STACS ed by P.W. Susanne Albers (IBFI Schloss Dagstuhl, Bordeaux, France, 2008), pp. 49\u201360 2008"},{"issue":"2","key":"122_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/3106700.3106710","volume":"48","author":"S Arunachalam","year":"2017","unstructured":"Arunachalam S, de Wolf R (2017) Guest column: A survey of quantum learning theory. ACM SIGACT News 48(2):41\u201367","journal-title":"ACM SIGACT News"},{"issue":"1","key":"122_CR5","first-page":"2879","volume":"19","author":"S Arunachalam","year":"2018","unstructured":"Arunachalam S, De Wolf R (2018) Optimal quantum sample complexity of learning algorithms. J Mach Learn Res 19(1):2879\u20132878","journal-title":"J Mach Learn Res"},{"key":"122_CR6","unstructured":"Arunachalam S, Maity R (2020) 37th Int. Conf. Mach. Learn. ICML 2020 , vol. PartF16814 (PMLR, 2020), pp. 354\u2013364"},{"key":"122_CR7","doi-asserted-by":"crossref","unstructured":"Bauer E, Kohavi R (1999) An empirical comparison of voting classification algorithms: Bagging, boosting, and variants 36(1):105\u2013139","DOI":"10.1023\/A:1007515423169"},{"issue":"7671","key":"122_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/nature23474","volume":"549","author":"J Biamonte","year":"2017","unstructured":"Biamonte J, Wittek P, Pancotti N, Rebentrost P, Wiebe N, Lloyd S (2017) Quantum machine learning. Nature 549(7671):195\u2013202","journal-title":"Nature"},{"key":"122_CR9","doi-asserted-by":"publisher","unstructured":"Brassard G, H\u00f8yer P, Mosca M, Tapp A (2002) Quantum Comput. Inf. (Washington, DC , 2000), Contemp Math, vol. 305 (Amer. Math. Soc., Providence, RI, 2002), pp. 53\u201374. https:\/\/doi.org\/10.1090\/conm\/305\/05215","DOI":"10.1090\/conm\/305\/05215"},{"key":"122_CR10","doi-asserted-by":"crossref","unstructured":"Bshouty NH, Gavinsky D (2002) On boosting with polynomially bounded distributions. J Mach Learn Res 3(Nov):483\u2013506","DOI":"10.1007\/3-540-44581-1_32"},{"issue":"3","key":"122_CR11","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1137\/S0097539795293123","volume":"28","author":"NH Bshouty","year":"1998","unstructured":"Bshouty NH, Jackson JC (1998) Learning dnf over the uniform distribution using a quantum example oracle. SIAM J Comput 28(3):1136\u20131153","journal-title":"SIAM J Comput"},{"issue":"4","key":"122_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00116835","volume":"3","author":"P Clark","year":"1989","unstructured":"Clark P, Niblett T (1989) The cn2 induction algorithm. Mach learn 3(4):261\u2013283","journal-title":"Mach learn"},{"issue":"6","key":"122_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng L (2012) The mnist database of handwritten digit images for machine learning research. IEEE Signal Processing Magazine 29(6):141\u2013142","journal-title":"IEEE Signal Processing Magazine"},{"issue":"2","key":"122_CR14","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"TG Dietterich","year":"2000","unstructured":"Dietterich TG (2000) An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine learning 40(2):139\u2013157","journal-title":"Machine learning"},{"key":"122_CR15","unstructured":"Drucker H, Cortes C (1996) Boosting decision trees. Adv neural inf process syst 479\u2013485"},{"issue":"2","key":"122_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y Freund","year":"1995","unstructured":"Freund Y (1995) Boosting a weak learning algorithm by majority. Inf comput 121(2):256\u2013285","journal-title":"Inf comput"},{"issue":"1","key":"122_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/JCSS.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire RE (1997) A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. J Comput Syst Sci 55(1):119\u2013139. https:\/\/doi.org\/10.1006\/JCSS.1997.1504","journal-title":"J Comput Syst Sci"},{"key":"122_CR18","doi-asserted-by":"publisher","unstructured":"Friedman J, Hastie T, Tibshirani R (2000) Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors). Ann Stat 28(2). https:\/\/doi.org\/10.1214\/aos\/1016218223","DOI":"10.1214\/aos\/1016218223"},{"issue":"May","key":"122_CR19","first-page":"101","volume":"4","author":"D Gavinsky","year":"2003","unstructured":"Gavinsky D (2003) Optimally-smooth adaptive boosting and application to agnostic learning. J Mach Learn Res 4(May):101\u2013117","journal-title":"J Mach Learn Res"},{"key":"122_CR20","doi-asserted-by":"crossref","unstructured":"Grinko D, Gacon J, Zoufal C, Woerner S (2021) Iterative quantum amplitude estimation. npj Quantum Information 7(1):1\u20136","DOI":"10.1038\/s41534-021-00379-1"},{"key":"122_CR21","unstructured":"Izdebski A, de Wolf R (2020) Improved Quantum Boosting arXiv:2009.08360"},{"key":"122_CR22","unstructured":"Neven H, Denchev VS, Rose G, Macready WG (2012) Proceedings of the Asian Conference on Machine Learning, Proceedings of Machine Learning Research, vol 25, ed. by Hoi SCH, Buntine W, (PMLR, Singapore Management University, ingapore, 2012), pp. 333\u2013348"},{"key":"122_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1613\/jair.614","volume":"11","author":"D Opitz","year":"1999","unstructured":"Opitz D, Maclin R (1999) Popular ensemble methods: An empirical study. J artif intell res 11:169\u2013198","journal-title":"J artif intell res"},{"key":"122_CR24","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, et al (2011) Scikit-learn: Machine learning in python.the Journal of machine Learning research 12:2825\u20132830"},{"key":"122_CR25","unstructured":"Prakash A (2014) Quantum algorithms for linear algebra and machine learning. Ph.D. thesis, University of California, Berkeley 2014"},{"issue":"3","key":"122_CR26","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1024099825458","volume":"52","author":"F Provost","year":"2003","unstructured":"Provost F, Domingos P (2003) Tree induction for probability-based ranking. Mach learn 52(3):199\u2013215","journal-title":"Mach learn"},{"issue":"130","key":"122_CR27","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1103\/PhysRevLett.113.130503","volume":"113","author":"P Rebentrost","year":"2014","unstructured":"Rebentrost P, Mohseni M, Lloyd S (2014) Quantum support vector machine for big data classification. Phys Rev Lett 113(130):503. https:\/\/doi.org\/10.1103\/PhysRevLett.113.130503","journal-title":"Phys Rev Lett"},{"key":"122_CR28","doi-asserted-by":"publisher","unstructured":"Ruan C, Ruan Q, Li X (2010) IEEE 10th INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS , pp. 1402\u20131405.https:\/\/doi.org\/10.1109\/ICOSP.2010.5656917","DOI":"10.1109\/ICOSP.2010.5656917"},{"key":"122_CR29","doi-asserted-by":"crossref","unstructured":"Schapire RE, Freund Y (2012) Boosting: Foundations and Algorithms (The MIT Press, 2012)","DOI":"10.7551\/mitpress\/8291.001.0001"},{"issue":"2","key":"122_CR30","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00116037","volume":"5","author":"RE Schapire","year":"1990","unstructured":"Schapire RE (1990) The strength of weak learnability. Mach Learn 5(2):197\u2013227. https:\/\/doi.org\/10.1007\/BF00116037","journal-title":"Mach Learn"},{"issue":"3","key":"122_CR31","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Schapire","year":"1999","unstructured":"Schapire RE, Singer Y (1999) Improved boosting algorithms using confidence-rated predictions. Mach Learn 37(3):297\u2013336. https:\/\/doi.org\/10.1023\/A:1007614523901","journal-title":"Mach Learn"},{"issue":"1","key":"122_CR32","doi-asserted-by":"publisher","first-page":"2772","DOI":"10.1038\/s41598-018-20403-3","volume":"8","author":"M Schuld","year":"2018","unstructured":"Schuld M, Petruccione F (2018) Quantum ensembles of quantum classifiers. Sci Rep 8(1):2772. https:\/\/doi.org\/10.1038\/s41598-018-20403-3","journal-title":"Sci Rep"},{"issue":"2","key":"122_CR33","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1080\/00107514.2014.964942","volume":"56","author":"M Schuld","year":"2015","unstructured":"Schuld M, Sinayskiy I, Petruccione F (2015) An introduction to quantum machine learning. Contemporary Physics 56(2):172\u2013185","journal-title":"Contemporary Physics"},{"key":"122_CR34","first-page":"633","volume":"4","author":"RA Servedio","year":"2003","unstructured":"Servedio RA (2003) Smooth boosting and learning with malicious noise. J Mach Learn Res 4:633\u2013648","journal-title":"J Mach Learn Res"},{"key":"122_CR35","unstructured":"van Apeldoorn J (2021) 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021) (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2021)"},{"key":"122_CR36","first-page":"987","volume":"12","author":"A Vezhnevets","year":"2005","unstructured":"Vezhnevets A (2005) Vezhnevets V. Graphicon 12:987\u2013997","journal-title":"Graphicon"},{"issue":"2","key":"122_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/S11433-020-1638-5","volume":"64","author":"X Wang","year":"2020","unstructured":"Wang X, Ma Y, Hsieh MH, Yung MH (2020) Quantum speedup in adaptive boosting of binary classification. Sci China Physics Mech Astron 64(2):1\u201310. https:\/\/doi.org\/10.1007\/S11433-020-1638-5","journal-title":"Sci China Physics Mech Astron"},{"key":"122_CR38","unstructured":"Wang S, Wang H (2009) 2009 7th International Conference on Information, Communications and Signal Processing (ICICS) (IEEE, 2009), pp. 1\u20135"},{"key":"122_CR39","doi-asserted-by":"crossref","unstructured":"Wittek P (2014) Quantum machine learning: what quantum computing means to data mining. (Academic Press, 2014)","DOI":"10.1016\/B978-0-12-800953-6.00004-9"},{"key":"122_CR40","unstructured":"Wolberg DWH, Street WN, Mangasarian OL (1995) UCI machine learning repository. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Breast+Cancer+Wisconsin+(Diagnostic)"},{"issue":"6","key":"122_CR41","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/LSP.2014.2313570","volume":"21","author":"S Wu","year":"2014","unstructured":"Wu S, Nagahashi H (2014) Parameterized adaboost: introducing a parameter to speed up the training of real adaboost. IEEE Signal Process Lett 21(6):687\u2013691","journal-title":"IEEE Signal Process Lett"},{"issue":"11","key":"122_CR42","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1587\/transinf.2015EDP7069","volume":"98","author":"S Wu","year":"2015","unstructured":"Wu S, Nagahashi H (2015) Penalized adaboost: improving the generalization error of gentle adaboost through a margin distribution. IEICE Trans Inf Syst 98(11):1906\u20131915","journal-title":"IEICE Trans Inf Syst"},{"key":"122_CR43","doi-asserted-by":"publisher","unstructured":"Wu B, Ai H, Huang C, Lao S (2004) Sixth IEEE International Conference on Automatic Face and Gesture Recognition, 2004. Proceedings , pp. 79\u201384.https:\/\/doi.org\/10.1109\/AFGR.2004.1301512","DOI":"10.1109\/AFGR.2004.1301512"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-023-00122-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-023-00122-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-023-00122-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T05:28:26Z","timestamp":1702877306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-023-00122-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,27]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["122"],"URL":"https:\/\/doi.org\/10.1007\/s42484-023-00122-3","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2633875\/v1","asserted-by":"object"}]},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,27]]},"assertion":[{"value":"27 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"33"}}