{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T23:25:01Z","timestamp":1777937101463,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:00:00Z","timestamp":1676851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:00:00Z","timestamp":1676851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["LAMARR22B"],"award-info":[{"award-number":["LAMARR22B"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["LAMARR22B"],"award-info":[{"award-number":["LAMARR22B"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100016378","name":"Technische Universit\u00e4t Dortmund","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100016378","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In machine learning, fewer features reduce model complexity. Carefully assessing the influence of each input feature on the model quality is therefore a crucial preprocessing step. We propose a novel feature selection algorithm based on a quadratic unconstrained binary optimization (QUBO) problem, which allows to select a specified number of features based on their importance and redundancy. In contrast to iterative or greedy methods, our direct approach yields higher-quality solutions. QUBO problems are particularly interesting because they can be solved on quantum hardware. To evaluate our proposed algorithm, we conduct a series of numerical experiments using a classical computer, a quantum gate computer, and a quantum annealer. Our evaluation compares our method to a range of standard methods on various benchmark data sets. We observe competitive performance.<\/jats:p>","DOI":"10.1007\/s42484-023-00099-z","type":"journal-article","created":{"date-parts":[[2023,2,23]],"date-time":"2023-02-23T17:14:20Z","timestamp":1677172460000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Feature selection on quantum computers"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8332-6169","authenticated-orcid":false,"given":"Sascha","family":"M\u00fccke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7479-3339","authenticated-orcid":false,"given":"Raoul","family":"Heese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1682-4576","authenticated-orcid":false,"given":"Sabine","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Wolter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6334-8042","authenticated-orcid":false,"given":"Nico","family":"Piatkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,20]]},"reference":[{"key":"99_CR1","doi-asserted-by":"publisher","unstructured":"ANIS MS, Abraham H, Aduoffei, et al. (2021) Qiskit: An open-source framework for quantum computing. https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"99_CR2","unstructured":"Bauckhage C, Ojeda C, Sifa R et al (2018) Adiabatic quantum computing for kernel k = 2 means clustering. In: LWDA, pp 21\u201332"},{"key":"99_CR3","doi-asserted-by":"publisher","unstructured":"Bauckhage C, Ramamurthy R, Sifa R (2020) Hopfield networks for vector quantization. In: Farka\u0161 I, Masulli P, Wermter S (eds) Artificial neural networks and machine learning (ICANN). Springer International Publishing, pp 192\u2013203, https:\/\/doi.org\/10.1007\/978-3-030-61616-8_16","DOI":"10.1007\/978-3-030-61616-8_16"},{"key":"99_CR4","unstructured":"Booth M, Reinhardt S, Roy A (2017) Partitioning optimization problems for hybrid classical\/quantum execution. Technical Report, https:\/\/docs.ocean.dwavesys.com\/projects\/qbsolv\/en\/latest\/_downloads\/bd15a2d8f32e587e9e5997ce9d5512cc\/qbsolv_techReport.pdf"},{"key":"99_CR5","unstructured":"Breiman L, Friedman J, Olshen R et al (1984) Classification and regression trees. Cole Statistics\/Probability Series"},{"issue":"1","key":"99_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compeleceng.2013.11.024","volume":"40","author":"G Chandrashekar","year":"2014","unstructured":"Chandrashekar G, Sahin F (2014) A survey on feature selection methods. Computers & Electrical Engineering 40(1):16\u201328. https:\/\/doi.org\/10.1016\/j.compeleceng.2013.11.024","journal-title":"Computers & Electrical Engineering"},{"key":"99_CR7","doi-asserted-by":"crossref","unstructured":"Date P, Arthur D, Pusey-Nazzaro L (2020) QUBO Formulations for training machine learning models. arXiv:200802369","DOI":"10.1038\/s41598-021-89461-4"},{"key":"99_CR8","unstructured":"Dua D, Graff C (2017) UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"99_CR9","unstructured":"Farhi E, Goldstone J, Gutmann S et al (2000) Quantum computation by adiabatic evolution. arXiv:quant-ph\/0001106"},{"key":"99_CR10","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1998) Tabu search. In: Handbook of combinatorial optimization. Springer, pp 2093\u20132229","DOI":"10.1007\/978-1-4613-0303-9_33"},{"issue":"3","key":"99_CR11","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ejor.2017.08.025","volume":"265","author":"F Glover","year":"2018","unstructured":"Glover F, Lewis M, Kochenberger G (2018) Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems. Eur J Oper Res 265(3):829\u2013842. https:\/\/doi.org\/10.1016\/j.ejor.2017.08.025","journal-title":"Eur J Oper Res"},{"issue":"4","key":"99_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1088\/0143-0807\/20\/4\/303","volume":"20","author":"C Gruber","year":"1999","unstructured":"Gruber C (1999) Thermodynamics of systems with internal adiabatic constraints: time evolution of the adiabatic piston. Eur J Phys 20(4):259","journal-title":"Eur J Phys"},{"issue":"1","key":"99_CR13","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1012487302797","volume":"46","author":"I Guyon","year":"2002","unstructured":"Guyon I, Weston J, Barnhill S, et al. (2002) Gene selection for cancer classification using support vector machines. Mach Learn 46(1):389\u2013422","journal-title":"Mach Learn"},{"key":"99_CR14","unstructured":"Guyon I, Gunn S, Ben-Hur A, et al. (2004) Result analysis of the nips 2003 feature selection challenge. Advances in Neural Information Processing Systems, 17"},{"issue":"3","key":"99_CR15","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/BF00139572","volume":"1","author":"PL Hammer","year":"1971","unstructured":"Hammer PL, Shlifer E (1971) Applications of pseudo-Boolean methods to economic problems. Theory and decision 1(3):296\u2013308","journal-title":"Theory and decision"},{"issue":"7","key":"99_CR16","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s11128-018-1924-8","volume":"17","author":"Z He","year":"2018","unstructured":"He Z, Li L, Huang Z, et al. (2018) Quantum-enhanced feature selection with forward selection and backward elimination. Quantum Inf Process 17(7):154. https:\/\/doi.org\/10.1007\/s11128-018-1924-8","journal-title":"Quantum Inf Process"},{"key":"99_CR17","doi-asserted-by":"publisher","unstructured":"John GH, Kohavi R, Pfleger K (1994) Irrelevant features and the subset selection problem. Morgan Kaufmann, p 121\u2013129, https:\/\/doi.org\/10.1016\/B978-1-55860-335-6.50023-4","DOI":"10.1016\/B978-1-55860-335-6.50023-4"},{"issue":"5","key":"99_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki T, Nishimori H (1998) Quantum annealing in the transverse Ising model. Phys Rev E 58(5):53\u201355","journal-title":"Phys Rev E"},{"key":"99_CR19","unstructured":"Kingma DP, Ba J (2014) Adam: a method for stochastic optimization. arXiv:14126980"},{"key":"99_CR20","unstructured":"Kingma DP, Welling M (2013) Auto-encoding variational Bayes. arXiv:13126114"},{"issue":"1-2","key":"99_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1504\/IJOR.2005.007435","volume":"1","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger G, Glover F, Alidaee B, et al. (2005) Using the unconstrained quadratic program to model and solve Max 2-SAT problems. International Journal of Operational Research 1(1-2):89\u2013100","journal-title":"International Journal of Operational Research"},{"issue":"1","key":"99_CR22","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger G, Hao JK, Glover F, et al. (2014) The unconstrained binary quadratic programming problem: a survey. J Comb Optim 28(1):58\u201381","journal-title":"J Comb Optim"},{"issue":"2","key":"99_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s11128-017-1809-2","volume":"17","author":"V Kumar","year":"2018","unstructured":"Kumar V, Bass G, Tomlin C, et al. (2018) Quantum annealing for combinatorial clustering. Quantum Inf Process 17(2):39. https:\/\/doi.org\/10.1007\/s11128-017-1809-2","journal-title":"Quantum Inf Process"},{"issue":"3","key":"99_CR24","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1287\/opre.18.3.454","volume":"18","author":"D Laughhunn","year":"1970","unstructured":"Laughhunn D (1970) Quadratic binary programming with application to capital-budgeting problems. Operations research 18(3):454\u2013461","journal-title":"Operations research"},{"issue":"5","key":"99_CR25","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/cem.1180060506","volume":"6","author":"R Leardi","year":"1992","unstructured":"Leardi R, Boggia R, Terrile M (1992) Genetic algorithms as a strategy for feature selection. J Chemom 6(5):267\u2013281. https:\/\/doi.org\/10.1002\/cem.1180060506","journal-title":"J Chemom"},{"key":"99_CR26","unstructured":"LeCun Y, Cortes C (2010) MNIST handwritten digit database http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"issue":"9","key":"99_CR27","doi-asserted-by":"publisher","first-page":"1989","DOI":"10.1016\/j.jmva.2009.04.008","volume":"100","author":"D Lewandowski","year":"2009","unstructured":"Lewandowski D, Kurowicka D, Joe H (2009) Generating random correlation matrices based on vines and extended onion method. J Multivar Anal 100(9):1989\u20132001. https:\/\/doi.org\/10.1016\/j.jmva.2009.04.008","journal-title":"J Multivar Anal"},{"key":"99_CR28","doi-asserted-by":"publisher","unstructured":"Mandros P, Kaltenpoth D, Boley M et al (2020) Discovering functional dependencies from mixed-type data. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, pp 1404\u20131414, https:\/\/doi.org\/10.1145\/3394486.3403193","DOI":"10.1145\/3394486.3403193"},{"key":"99_CR29","doi-asserted-by":"publisher","unstructured":"Matsubara S, Takatsu M, Miyazawa T et al (2020) Digital annealer for high-speed solving of combinatorial optimization problems and its applications. In: Asia and South Pacific Design Automation Conference (ASP-DAC), pp 667\u2013672, https:\/\/doi.org\/10.1109\/ASP-DAC47756.2020.9045100, iSSN: 2153-697X","DOI":"10.1109\/ASP-DAC47756.2020.9045100"},{"key":"99_CR30","doi-asserted-by":"publisher","first-page":"023","DOI":"10.1088\/1367-2630\/18\/2\/023023","volume":"023","author":"JR McClean","year":"2016","unstructured":"McClean JR, Romero J, Babbush R, et al. (2016) The theory of variational hybrid quantum-classical algorithms. New Journal of Physics 18(2) 023:023. https:\/\/doi.org\/10.1088\/1367-2630\/18\/2\/023023","journal-title":"New Journal of Physics 18(2)"},{"issue":"12","key":"99_CR31","doi-asserted-by":"publisher","first-page":"125,210","DOI":"10.1063\/1.2995837","volume":"49","author":"S Morita","year":"2008","unstructured":"Morita S, Nishimori H (2008) Mathematical foundation of quantum annealing. J Math Phys 49(12):125,210","journal-title":"J Math Phys"},{"key":"99_CR32","unstructured":"M\u00fccke S, Piatkowski N, Morik K (2019) Learning bit by bit: extracting the essence of machine learning. In: J\u00e4schke R, Weidlich M (eds) Proceedings of the Conference on \u201cLernen, Wissen, Daten, Analysen\u201d (LWDA), pp 144\u2013155. http:\/\/ceur-ws.org\/Vol-2454\/paper_51.pdf"},{"issue":"5","key":"99_CR33","doi-asserted-by":"publisher","first-page":"052,203","DOI":"10.1063\/1.4983266","volume":"58","author":"Y Nakata","year":"2017","unstructured":"Nakata Y, Hirche C, Morgan C, et al. (2017) Unitary 2-designs from random X- and Z-diagonal unitaries. J Math Phys 58(5):052,203. https:\/\/doi.org\/10.1063\/1.4983266","journal-title":"J Math Phys"},{"key":"99_CR34","doi-asserted-by":"publisher","first-page":"7057","DOI":"10.1109\/JSTARS.2021.3095377","volume":"14","author":"S Otgonbaatar","year":"2021","unstructured":"Otgonbaatar S, Datcu M (2021) A quantum annealer for subset feature selection and the classification of hyperspectral images. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 14:7057\u20137065","journal-title":"IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing"},{"issue":"2","key":"99_CR35","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","volume":"11","author":"PM Pardalos","year":"1992","unstructured":"Pardalos PM, Jha S (1992) Complexity of uniqueness and local search in quadratic 0\u20131 programming. Oper Res Lett 11(2):119\u2013123","journal-title":"Oper Res Lett"},{"key":"99_CR36","unstructured":"Paszke A, Gross S, Massa F et al (2019) PyTorch: an imperative style, high-performance deep learning library. In: Wallach H, Larochelle H, Beygelzimer A et al (eds) Advances in neural information processing systems 32. Curran Associates, Inc., p 8024\u20138035, http:\/\/papers.neurips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf"},{"key":"99_CR37","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, et al. (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"issue":"1","key":"99_CR38","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo A, McClean J, Shadbolt P, et al. (2014) A variational eigenvalue solver on a photonic quantum processor. Nat Commun 5(1):4213. https:\/\/doi.org\/10.1038\/ncomms5213","journal-title":"Nat Commun"},{"key":"99_CR39","unstructured":"Rodriguez-Lujan I, Elkan C, Santa Cruz C et al (2010) Quadratic programming feature selection. Journal of Machine Learning Research"},{"key":"99_CR40","doi-asserted-by":"crossref","unstructured":"Siedlecki W, Sklansky J (1993) A note on genetic algorithms for large-scale feature selection. In: Handbook of Pattern Recognition and Computer Vision. WORLD SCIENTIFIC, p 88\u2013107,","DOI":"10.1142\/9789814343138_0005"},{"issue":"3","key":"99_CR41","first-page":"262","volume":"10","author":"VG Sigillito","year":"1989","unstructured":"Sigillito VG, Wing SP, Hutton LV, et al. (1989) Classification of radar returns from the ionosphere using neural networks. J Hopkins APL Tech Dig 10(3):262\u2013266","journal-title":"J Hopkins APL Tech Dig"},{"key":"99_CR42","doi-asserted-by":"crossref","unstructured":"Smith LN, Topin N (2018) Super-convergence: very fast training of neural networks using large learning rates. arXiv:170807120","DOI":"10.1117\/12.2520589"},{"issue":"4","key":"99_CR43","first-page":"482","volume":"19","author":"JC Spall","year":"1998","unstructured":"Spall JC (1998) An overview of the simultaneous perturbation method for efficient optimization. Johns Hopkins apl Technical digest 19(4):482\u2013492","journal-title":"Johns Hopkins apl Technical digest"},{"key":"99_CR44","unstructured":"Tanahashi K, Takayanagi S, Motohashi T et al (2018) Global mutual information based feature selection by quantum annealing"},{"key":"99_CR45","unstructured":"Update TASP (2021) Catherine mcgeoch and pau farr\u00e9. Tech. rep., D-Wave"},{"issue":"66-71","key":"99_CR46","first-page":"13","volume":"10","author":"L Van Der Maaten","year":"2009","unstructured":"Van Der Maaten L, Postma E, Van den Herik J, et al. (2009) Dimensionality reduction: a comparative. J Mach Learn Res 10(66-71):13","journal-title":"J Mach Learn Res"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-023-00099-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-023-00099-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-023-00099-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T07:29:23Z","timestamp":1687159763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-023-00099-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,20]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["99"],"URL":"https:\/\/doi.org\/10.1007\/s42484-023-00099-z","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,20]]},"assertion":[{"value":"24 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 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":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}],"article-number":"11"}}