{"id":"https://openalex.org/W4416874118","doi":"https://doi.org/10.1109/qce65121.2025.00018","title":"SCOOP: A Quantum-Computing Framework for Constrained Combinatorial Optimization","display_name":"SCOOP: A Quantum-Computing Framework for Constrained Combinatorial Optimization","publication_year":2025,"publication_date":"2025-08-30","ids":{"openalex":"https://openalex.org/W4416874118","doi":"https://doi.org/10.1109/qce65121.2025.00018"},"language":null,"primary_location":{"id":"doi:10.1109/qce65121.2025.00018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00018","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/A5028908168","display_name":"Prashanti Priya Angara","orcid":"https://orcid.org/0000-0002-9660-011X"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Prashanti Priya Angara","raw_affiliation_strings":["University of Victoria,Victoria,BC,Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria,Victoria,BC,Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102825923","display_name":"Everlyn Martins","orcid":"https://orcid.org/0000-0002-5614-3647"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Emily Martins","raw_affiliation_strings":["University of Victoria,Victoria,BC,Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria,Victoria,BC,Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063629937","display_name":"Ulrike Stege","orcid":"https://orcid.org/0000-0001-9466-7196"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ulrike Stege","raw_affiliation_strings":["University of Victoria,Victoria,BC,Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria,Victoria,BC,Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069238142","display_name":"Hausi M\u00fcller","orcid":"https://orcid.org/0000-0002-1004-5830"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hausi M\u00fcller","raw_affiliation_strings":["University of Victoria,Victoria,BC,Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria,Victoria,BC,Canada","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17495335,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"75"},"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.9896000027656555,"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.9896000027656555,"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.0010999999940395355,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.0007999999797903001,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scoop","display_name":"SCOOP","score":0.7813000082969666},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.5925999879837036},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5726000070571899},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5455999970436096},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5368000268936157},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4968000054359436},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.37070000171661377},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.3698999881744385},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.35899999737739563}],"concepts":[{"id":"https://openalex.org/C2779427698","wikidata":"https://www.wikidata.org/wiki/Q17146793","display_name":"SCOOP","level":2,"score":0.7813000082969666},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.673799991607666},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.5925999879837036},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5726000070571899},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5455999970436096},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5368000268936157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5019999742507935},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4968000054359436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3799999952316284},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.37070000171661377},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3698999881744385},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.35899999737739563},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.35530000925064087},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.35260000824928284},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.3312999904155731},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3240000009536743},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.32350000739097595},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.2705000042915344},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.26260000467300415},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.25929999351501465}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/qce65121.2025.00018","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00018","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1502057009","https://openalex.org/W1988133548","https://openalex.org/W2024860775","https://openalex.org/W2039122980","https://openalex.org/W2094067618","https://openalex.org/W2118986316","https://openalex.org/W2149852414","https://openalex.org/W2225916722","https://openalex.org/W2344235023","https://openalex.org/W2563390049","https://openalex.org/W2754868542","https://openalex.org/W2948156386","https://openalex.org/W2964582498","https://openalex.org/W2980415717","https://openalex.org/W3033179442","https://openalex.org/W3088409280","https://openalex.org/W3093283812","https://openalex.org/W3134096386","https://openalex.org/W3198024605","https://openalex.org/W4200337247","https://openalex.org/W4206448558","https://openalex.org/W4224238425","https://openalex.org/W4226006885","https://openalex.org/W4281570404","https://openalex.org/W4306739702","https://openalex.org/W4312190740","https://openalex.org/W4360611042","https://openalex.org/W4376455908","https://openalex.org/W4389159488","https://openalex.org/W4389162802","https://openalex.org/W4409319758"],"related_works":[],"abstract_inverted_index":{"While":[0],"the":[1,92,106,110,124],"ultimate":[2],"goal":[3],"of":[4,18],"solving":[5,69],"computationally":[6],"intractable":[7],"problems":[8,46,57],"is":[9,36,117],"to":[10,95,109],"find":[11],"a":[12,37,64,75],"provably":[13],"optimal":[14,98],"solutions,":[15],"practical":[16,142],"constraints":[17],"real-world":[19],"scenarios":[20],"often":[21],"necessitate":[22],"focusing":[23],"on":[24,91,126,160],"efficiently":[25],"obtaining":[26],"high-quality,":[27],"near-optimal":[28,100],"solutions.":[29,101],"The":[30,86],"Quantum":[31],"Approximate":[32],"Optimization":[33],"Algorithm":[34],"(QAOA)":[35],"state-of-the-art":[38],"hybrid":[39],"quantum-classical":[40],"approach":[41,116],"for":[42,68],"tackling":[43],"these":[44],"challenging":[45],"that":[47],"are":[48],"encoded":[49],"using":[50],"quadratic":[51],"and":[52,59,99,120,136,151,158],"higher-order":[53],"unconstrained":[54,80,93],"binary":[55],"optimization":[56,71],"(QUBO":[58],"HUBO).":[60],"We":[61,122,154],"present":[62],"SCOOP,":[63],"novel":[65],"QAOAbased":[66],"framework":[67,125],"constrained":[70,76,111],"problems.":[72],"SCOOP":[73,83,115],"transforms":[74],"problem":[77,84,112],"into":[78],"an":[79],"counterpart,":[81],"forming":[82],"twins.":[85],"QAOA":[87],"quantum":[88],"algorithm":[89],"operates":[90],"twin":[94],"identify":[96],"potential":[97],"Effective":[102],"classical":[103],"post-processing":[104],"reduces":[105],"solution":[107],"set":[108],"space.":[113],"Our":[114],"solution-enhanced,":[118],"objective-function-compatible,":[119],"scalable.":[121],"demonstrate":[123],"three":[127],"NP-hard":[128],"problems,":[129],"Minimum":[130,133,137],"Dominating":[131],"Set,":[132],"Maximal":[134],"Matching,":[135],"Set":[138],"Cover":[139],"appearing":[140],"in":[141],"application":[143],"domains":[144],"such":[145],"as":[146],"resource":[147],"allocation,":[148],"communication":[149],"networks,":[150],"machine":[152],"learning.":[153],"validate":[155],"SCOOP's":[156],"feasibility":[157],"effectiveness":[159],"Xanadu":[161],"PennyLane":[162],"simulators.":[163]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-12-01T00:00:00"}