{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:55:38Z","timestamp":1760234138984,"version":"build-2065373602"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tevc.2024.3485194","type":"journal-article","created":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T13:48:13Z","timestamp":1729691293000},"page":"2062-2073","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Acceleration of Black-Box Pseudo-Boolean Optimization Algorithms"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3481-3168","authenticated-orcid":false,"given":"Adetunji David","family":"Ajimakin","sequence":"first","affiliation":[{"name":"Department of Computer Science and Automation, Indian Institute of Science Bengaluru, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1001-7714","authenticated-orcid":false,"given":"V. Susheela","family":"Devi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Automation, Indian Institute of Science Bengaluru, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref2","article-title":"A quantum algorithm for finding the minimum","author":"D\u00fcrr","year":"1996","journal-title":"arXiv:quant-ph\/9607014"},{"key":"ref3","article-title":"A quantum algorithm for finding the maximum","author":"Ahuja","year":"1999","journal-title":"arXiv:quant-ph\/9911082"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/305\/05215"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9784-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.028"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0354-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15844-5_1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10762-2_88"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0502-x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205569"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.01.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.113.210501"},{"issue":"1","key":"ref17","first-page":"229","article-title":"On two problems of information theory","volume":"8","author":"Erdos","year":"1963","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40273-9_1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4_3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-004-1177-z"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4_9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2956633"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340305"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3229038"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539796300921"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58484-6_259"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1967654.1967669"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2307\/2690338"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.013"},{"key":"ref31","article-title":"Alternating sums of terms of the Vandermonde identity","author":"Zaimi","year":"2009","journal-title":"MathOverflow"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4_1"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4235\/11199991\/10730757.pdf?arnumber=10730757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:47:26Z","timestamp":1760161646000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10730757\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":32,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2024.3485194","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"type":"print","value":"1089-778X"},{"type":"print","value":"1089-778X"},{"type":"electronic","value":"1941-0026"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}