{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T16:23:24Z","timestamp":1777652604619,"version":"3.51.4"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"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 J. Emerg. Sel. Topics Circuits Syst."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1109\/jetcas.2022.3202566","type":"journal-article","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T20:58:46Z","timestamp":1661806726000},"page":"614-623","source":"Crossref","is-referenced-by-count":16,"title":["Engineering Grover Adaptive Search: Exploring the Degrees of Freedom for Efficient QUBO Solving"],"prefix":"10.1109","volume":"12","author":[{"given":"Luigi","family":"Giuffrida","sequence":"first","affiliation":[{"name":"Department of Electronics and Telecommunications, Politecnico di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3364-1114","authenticated-orcid":false,"given":"Deborah","family":"Volpe","sequence":"additional","affiliation":[{"name":"Department of Electronics and Telecommunications, Politecnico di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5563-8277","authenticated-orcid":false,"given":"Giovanni Amedeo","family":"Cirillo","sequence":"additional","affiliation":[{"name":"Department of Electronics and Telecommunications, Politecnico di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Zamboni","sequence":"additional","affiliation":[{"name":"Department of Electronics and Telecommunications, Politecnico di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8520-906X","authenticated-orcid":false,"given":"Giovanna","family":"Turvani","sequence":"additional","affiliation":[{"name":"Department of Electronics and Telecommunications, Politecnico di Torino, Torino, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023061218864"},{"key":"ref11","year":"2022","journal-title":"Qiskit Optimization GitHub Repository"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-04-08-428"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/040605072"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.05.039"},{"key":"ref15","year":"2022","journal-title":"Intel Xeon Gold 6134 Processor—Product Specifcation"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.79.325"},{"key":"ref17","article-title":"Grover’s search algorithm for n qubits with optimal number of iterations","author":"sadana","year":"2020","journal-title":"arXiv 2011 04051"},{"key":"ref18","article-title":"Foundational patterns for efficient quantum computing","author":"gilliam","year":"2019","journal-title":"arXiv 1907 11513"},{"key":"ref19","author":"nielsen","year":"2010","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref4","article-title":"A quantum algorithm for finding the minimum","author":"durr","year":"1996","journal-title":"arXiv quant-ph\/9607014v2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/phvs.202070608"},{"key":"ref6","author":"iosue","year":"2019","journal-title":"Qubovert Documentation"},{"key":"ref5","article-title":"A tutorial on formulating and using QUBO models","author":"glover","year":"2018","journal-title":"arXiv 1811 11538"},{"key":"ref8","first-page":"1","article-title":"Garden optimization problems for benchmarking quantum annealers","volume":"20","author":"calaza","year":"2021","journal-title":"Quantum Inf Process"},{"key":"ref7","article-title":"Adiabatic quantum computing solution of the knapsack problem","author":"coffey","year":"2017","journal-title":"arXiv 1701 05584"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.6.031015"},{"key":"ref1","article-title":"Combinatorial optimization on gate model quantum computers: A survey","author":"zahedinejad","year":"2017","journal-title":"arXiv 1708 05294"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-49172-3"},{"key":"ref20","article-title":"An approximate Fourier transform useful in quantum factoring","author":"coppersmith","year":"2002","journal-title":"arXiv quant-ph\/0201031"}],"container-title":["IEEE Journal on Emerging and Selected Topics in Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5503868\/9915329\/09869620.pdf?arnumber=9869620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T22:31:21Z","timestamp":1670279481000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9869620\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":20,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jetcas.2022.3202566","relation":{},"ISSN":["2156-3357","2156-3365"],"issn-type":[{"value":"2156-3357","type":"print"},{"value":"2156-3365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}