{"id":"https://openalex.org/W4416875231","doi":"https://doi.org/10.1109/qce65121.2025.00011","title":"Quantum Tree Generator Improves Qaoa State-of-the-Art for the Knapsack Problem","display_name":"Quantum Tree Generator Improves Qaoa State-of-the-Art for the Knapsack Problem","publication_year":2025,"publication_date":"2025-08-30","ids":{"openalex":"https://openalex.org/W4416875231","doi":"https://doi.org/10.1109/qce65121.2025.00011"},"language":null,"primary_location":{"id":"doi:10.1109/qce65121.2025.00011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009788461","display_name":"P G Christiansen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108329","display_name":"d-fine (Germany)","ror":"https://ror.org/01tppr291","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210108329"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Paul J. Christiansen","raw_affiliation_strings":["d-fine GmbH,Frankfurt,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"d-fine GmbH,Frankfurt,Germany","institution_ids":["https://openalex.org/I4210108329"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060474905","display_name":"Lennart Binkowski","orcid":"https://orcid.org/0009-0001-3723-7699"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lennart Binkowski","raw_affiliation_strings":["Institut f&#x00FC;r Theoretische Physik, Leibniz Universit&#x00E4;t Hannover,Hannover,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f&#x00FC;r Theoretische Physik, Leibniz Universit&#x00E4;t Hannover,Hannover,Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093286167","display_name":"Debora Ramacciotti","orcid":"https://orcid.org/0009-0008-4476-5482"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Debora Ramacciotti","raw_affiliation_strings":["Institut f&#x00FC;r Theoretische Physik, Leibniz Universit&#x00E4;t Hannover,Hannover,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f&#x00FC;r Theoretische Physik, Leibniz Universit&#x00E4;t Hannover,Hannover,Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5093047897","display_name":"S\u00f6ren Wilkening","orcid":null},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S\u00f6ren Wilkening","raw_affiliation_strings":["Institut f&#x00FC;r Theoretische Physik, Leibniz Universit&#x00E4;t Hannover,Hannover,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f&#x00FC;r Theoretische Physik, Leibniz Universit&#x00E4;t Hannover,Hannover,Germany","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17921479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.47780001163482666,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.47780001163482666,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.210099995136261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.10209999978542328,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9682000279426575},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7357000112533569},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.6101999878883362},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4779999852180481},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4643000066280365},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.41359999775886536},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.3894999921321869}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9682000279426575},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7357000112533569},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.6101999878883362},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48159998655319214},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4779999852180481},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4643000066280365},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4562000036239624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42309999465942383},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.41359999775886536},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3894999921321869},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.37290000915527344},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.326200008392334},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2955000102519989},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.29089999198913574},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.272599995136261},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.27149999141693115}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/qce65121.2025.00011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1499143214","https://openalex.org/W2026891055","https://openalex.org/W2039122980","https://openalex.org/W2077604419","https://openalex.org/W2084652510","https://openalex.org/W2121981260","https://openalex.org/W2127172809","https://openalex.org/W2156293131","https://openalex.org/W2754868542","https://openalex.org/W2781738013","https://openalex.org/W2953441843","https://openalex.org/W2990961515","https://openalex.org/W3029819693","https://openalex.org/W3037443854","https://openalex.org/W3088409280","https://openalex.org/W3111162498","https://openalex.org/W3169384015","https://openalex.org/W3215496328","https://openalex.org/W4200462156","https://openalex.org/W4388581207","https://openalex.org/W4396578998","https://openalex.org/W4399796739","https://openalex.org/W4415116588"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3],"novel":[4],"approach":[5],"to":[6,15,37,47,63,86,120],"the":[7,16,21,38,42,49,74,101,122],"Quantum":[8],"Approximate":[9],"Optimization":[10],"Algorithm":[11],"(QAOA),":[12],"specifically":[13],"tailored":[14],"knapsack":[17,39,65],"problem.":[18],"We":[19],"combine":[20],"recently":[22],"proposed":[23],"quantum":[24],"tree":[25],"generator":[26],"as":[27],"an":[28],"efficient":[29],"state":[30],"preparation":[31],"circuit":[32,103,108],"for":[33,79,100],"all":[34],"feasible":[35],"solutions":[36],"problem":[40],"with":[41,61],"framework":[43],"of":[44,52],"Grover-mixer":[45],"QAOA":[46,55],"form":[48],"first":[50],"representative":[51],"Amplitude":[53],"Amplification-mixer":[54],"(AAMQAOA).":[56],"On":[57],"hard":[58],"benchmark":[59],"sets":[60],"up":[62],"20":[64],"items,":[66],"we":[67,111],"demonstrate":[68],"our":[69],"method's":[70],"improved":[71],"performance":[72],"over":[73],"current":[75],"state-of-the-art":[76],"Copula-QAOA.":[77],"However,":[78],"larger":[80],"instance":[81],"sizes,":[82],"both":[83],"approaches":[84],"fail":[85],"deliver":[87],"better":[88],"outcomes":[89],"than":[90],"greedily":[91],"packing":[92],"items":[93],"in":[94],"descending":[95],"value-to-weight":[96],"ratio,":[97],"at":[98],"least":[99],"considered":[102],"depths.":[104],"For":[105],"sufficiently":[106],"high":[107],"depths,":[109],"however,":[110],"can":[112],"prove":[113],"that":[114],"AAM-QAOA":[115],"will":[116],"eventually":[117],"be":[118],"able":[119],"sample":[121],"optimal":[123],"solution.":[124]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-01T00:00:00"}
