{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:24:40Z","timestamp":1764656680681,"version":"3.46.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002347","name":"BMBF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,30]]},"DOI":"10.1109\/qce65121.2025.00011","type":"proceedings-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T18:22:51Z","timestamp":1764613371000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Tree Generator Improves Qaoa State-of-the-Art for the Knapsack Problem"],"prefix":"10.1109","author":[{"given":"Paul J.","family":"Christiansen","sequence":"first","affiliation":[{"name":"d-fine GmbH,Frankfurt,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lennart","family":"Binkowski","sequence":"additional","affiliation":[{"name":"Institut für Theoretische Physik, Leibniz Universität Hannover,Hannover,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debora","family":"Ramacciotti","sequence":"additional","affiliation":[{"name":"Institut für Theoretische Physik, Leibniz Universität Hannover,Hannover,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Wilkening","sequence":"additional","affiliation":[{"name":"Institut für Theoretische Physik, Leibniz Universität Hannover,Hannover,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum Computing in the NISQ era and beyond","volume":"2","author":"Preskill","year":"2018","journal-title":"Quantum"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00348-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/revmodphys.86.153"},{"key":"ref4","article-title":"A Quantum Approximate Optimization Algorithm","author":"Farhi","year":"2014","journal-title":"arXiv preprint"},{"issue":"2","key":"ref5","doi-asserted-by":"crossref","first-page":"34","DOI":"10.3390\/a12020034","article-title":"From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz","volume":"12","author":"Hadfield","year":"2019","journal-title":"Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"ref7","article-title":"Knapsack Problem variants of QAOA for battery revenue optimisation","author":"Grand\u2019rive","year":"2019","journal-title":"arXiv preprint"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77980-1_5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/qce52317.2021.00033"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"479","DOI":"10.22331\/q-2021-06-17-479","article-title":"Warm-starting quantum optimization","volume":"5","author":"Egger","year":"2021","journal-title":"Quantum"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.12.009"},{"key":"ref12","article-title":"A quantum algorithm for the solution of the 0-1 Knapsack problem","author":"Wilkening","year":"2023","journal-title":"arXiv preprint"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/qce49297.2020.00020"},{"issue":"7","key":"ref14","doi-asserted-by":"crossref","first-page":"073001","DOI":"10.1088\/1367-2630\/ad59bb","article-title":"Elementary proof of QAOA convergence","volume":"26","author":"Binkowski","year":"2024","journal-title":"New J. Phys."},{"issue":"1","key":"ref15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0377-2217(94)00013-3","article-title":"An expanding-core algorithm for the exact 0\u20131 knapsack problem","volume":"87","author":"Pisinger","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.3.414"},{"year":"2022","key":"ref17","article-title":"IBM ILOG CPLEX Optimization Studio"},{"year":"2023","key":"ref18","article-title":"Gurobi Optimizer Reference Manual"},{"year":"2024","key":"ref19","article-title":"Google OR-Tools Documentation"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.61.032303"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.2.013056"},{"key":"ref22","article-title":"A Quantum Algorithm for Finding the Minimum","author":"Durr","year":"1996","journal-title":"arXiv preprint"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1090\/conm\/305\/05215","article-title":"Quantum amplitude amplification and estimation","author":"Brassard","year":"2002","journal-title":"Contemp. Math."},{"volume-title":"Reducibility among Combinatorial Problems","year":"1972","author":"M.Karp","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321909"},{"key":"ref27","article-title":"Dynamic Programming","volume-title":"Princeton","author":"Bellman","year":"1957"},{"key":"ref28","article-title":"Quantum Computation by Adiabatic Evolution","author":"Farhi","year":"2000","journal-title":"arXiv preprint"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.22331\/q-2025-10-13-1882"},{"key":"ref30","first-page":"137","article-title":"2021 IEEE International Conference on Quantum Computing and Engineering (QCE)","volume-title":"IEEE","author":"Golden"},{"key":"ref31","article-title":"OpenShop Scheduling With Hard Constraints","author":"Ko\u00dfmann","year":"2023","journal-title":"arXiv preprint"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.109.052406"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3624062.3624220"},{"key":"ref35","article-title":"qHiPSTER: The Quantum High Performance Software Testing Environment","author":"Smelyanskiy","year":"2016","journal-title":"arXiv preprint"},{"issue":"9","key":"ref36","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","article-title":"Where are the hard knapsack problems?","volume":"32","author":"Pisinger","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"}],"event":{"name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","start":{"date-parts":[[2025,8,30]]},"location":"Albuquerque, NM, USA","end":{"date-parts":[[2025,9,5]]}},"container-title":["2025 IEEE International Conference on Quantum Computing and Engineering (QCE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11249812\/11249813\/11249858.pdf?arnumber=11249858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:20:57Z","timestamp":1764656457000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11249858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/qce65121.2025.00011","relation":{},"subject":[],"published":{"date-parts":[[2025,8,30]]}}}