{"id":"https://openalex.org/W7220209677","doi":null,"title":"Comparative Study of Classical vs Quantum Algorithms for Combinatorial Problems","display_name":"Comparative Study of Classical vs Quantum Algorithms for Combinatorial Problems","alternate_titles":[],"publication_year":2024,"publication_date":"2024-03-28","ids":{"openalex":"https://openalex.org/W7220209677"},"language":"en","primary_location":{"id":"pmh:oai:ojs2.galaxiauniverse.com:article/350","doi":null,"is_oa":true,"landing_page_url":"https://galaxiauniverse.com/index.php/QFJ/article/view/350","pdf_url":"https://galaxiauniverse.com/index.php/QFJ/article/download/350/305","source":{"id":"https://openalex.org/S7407082193","display_name":"Quantum Frontiers Journal","issn_l":"3117-6070","issn":["3117-6070","3117-6089"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"3117-6070","raw_type":"info:eu-repo/semantics/article"},"parent_works":[],"lineage":["https://openalex.org/W7220209677"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://galaxiauniverse.com/index.php/QFJ/article/download/350/305","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5156919445","display_name":"Daniel Popescu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Popescu, Daniel","raw_affiliation_strings":["Research Scientist, Institute of Intelligent Systems, Nordic Technical University, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Scientist, Institute of Intelligent Systems, Nordic Technical University, Stockholm, Sweden","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5147248427","display_name":"Helena Petrov","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petrov, Helena","raw_affiliation_strings":["Research Scientist, Department of Artificial Intelligence, Nordic Technical University, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Scientist, Department of Artificial Intelligence, Nordic Technical University, Stockholm, Sweden","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5006,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.61206835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":92,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"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":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0,"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.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-advantage","display_name":"quantum advantage","score":0.9369999766349792},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9300000071525574},{"id":"https://openalex.org/keywords/quantum-approximate-optimization-algorithm","display_name":"quantum approximate optimization algorithm","score":0.7570000290870667},{"id":"https://openalex.org/keywords/variational-quantum-eigensolver","display_name":"variational quantum eigensolver","score":0.781000018119812},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.9409999847412109},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.652999997138977},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.968999981880188},{"id":"https://openalex.org/keywords/knapsack","display_name":"knapsack","score":0.9850000143051147},{"id":"https://openalex.org/keywords/set-cover","display_name":"set cover","score":0.9990000128746033},{"id":"https://openalex.org/keywords/weighted-max-sat","display_name":"weighted MaxSAT","score":0.949999988079071},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9359999895095825},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"iterated local search","score":0.824999988079071},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.7049999833106995},{"id":"https://openalex.org/keywords/nisq-devices","display_name":"NISQ devices","score":0.7440000176429749}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6039000153541565},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5910000205039978},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5400000214576721},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5091999769210815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.499099999666214},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.46700000762939453},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.44029998779296875},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4348999857902527},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.38510000705718994},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.3828999996185303},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3772999942302704},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3644999861717224},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.36390000581741333},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.33149999380111694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32829999923706055},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.32330000400543213},{"id":"https://openalex.org/C2779521423","wikidata":"https://www.wikidata.org/wiki/Q3855646","display_name":"Combinatorial method","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30970001220703125},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26179999113082886}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:ojs2.galaxiauniverse.com:article/350","doi":null,"is_oa":true,"landing_page_url":"https://galaxiauniverse.com/index.php/QFJ/article/view/350","pdf_url":"https://galaxiauniverse.com/index.php/QFJ/article/download/350/305","source":{"id":"https://openalex.org/S7407082193","display_name":"Quantum Frontiers Journal","issn_l":"3117-6070","issn":["3117-6070","3117-6089"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"3117-6070","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ojs2.galaxiauniverse.com:article/350","doi":null,"is_oa":true,"landing_page_url":"https://galaxiauniverse.com/index.php/QFJ/article/view/350","pdf_url":"https://galaxiauniverse.com/index.php/QFJ/article/download/350/305","source":{"id":"https://openalex.org/S7407082193","display_name":"Quantum Frontiers Journal","issn_l":"3117-6070","issn":["3117-6070","3117-6089"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"3117-6070","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7220209677.pdf","grobid_xml":"https://content.openalex.org/works/W7220209677.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1568345435","https://openalex.org/W2781738013","https://openalex.org/W2963332217","https://openalex.org/W2980835754","https://openalex.org/W2982169647","https://openalex.org/W3111162498","https://openalex.org/W3133657164","https://openalex.org/W4213212652","https://openalex.org/W4246598646","https://openalex.org/W4399118343","https://openalex.org/W4403834027","https://openalex.org/W7219930936","https://openalex.org/W7220087452","https://openalex.org/W7220187471"],"related_works":["https://openalex.org/W7160734185","https://openalex.org/W7163520579","https://openalex.org/W7017746380","https://openalex.org/W7165685655","https://openalex.org/W7160534191","https://openalex.org/W7219930936","https://openalex.org/W7203596264","https://openalex.org/W7158446284","https://openalex.org/W4414430030","https://openalex.org/W7217233912"],"abstract_inverted_index":{"Claims":[0],"of":[1,55],"quantum":[2,21,26,41,56,120,200],"advantage":[3,183],"for":[4,168],"combinatorial":[5,92],"optimisation":[6,57],"require":[7],"rigorous":[8,52],"comparison":[9],"against":[10,28,63],"state-of-the-art":[11,65],"classical":[12,30,66,125,145,160],"algorithms":[13,58,67,146,201],"under":[14],"controlled":[15],"experimental":[16],"conditions":[17],"--":[18],"yet":[19],"the":[20,46,176,181],"computing":[22],"literature":[23],"frequently":[24],"benchmarks":[25],"methods":[27],"weak":[29],"baselines":[31,126],"such":[32],"as":[33],"greedy":[34],"heuristics":[35],"or":[36],"random":[37],"search,":[38,73],"inflating":[39],"apparent":[40],"advantage.":[42,205],"This":[43],"paper":[44],"presents":[45],"Quantum-Classical":[47],"Combinatorial":[48],"Benchmark":[49],"(QCCB),":[50],"a":[51],"comparative":[53],"study":[54],"(QAOA,":[59],"VQE-QUBO,":[60],"hybrid":[61],"QA)":[62],"nine":[64,144],"(Goemans-Williamson":[68],"SDP,":[69],"simulated":[70],"annealing,":[71],"tabu":[72],"CPLEX":[74,164],"branch-and-bound,":[75],"OR-Tools":[76],"CP-SAT,":[77],"Gurobi":[78,161],"MIP,":[79],"Benders":[80],"decomposition,":[81],"extremal":[82],"optimisation,":[83],"and":[84,103,163,196],"population-based":[85],"iterated":[86],"local":[87],"search)":[88],"across":[89,127],"six":[90],"canonical":[91],"problem":[93,107,129,192],"classes":[94,130],"(MaxCut,":[95],"Vertex":[96],"Cover,":[97,102],"Graph":[98],"Colouring,":[99],"Knapsack,":[100],"Set":[101],"Weighted":[104],"Max-SAT)":[105],"at":[106,131,149,184],"sizes":[108],"n":[109,113,150,169,172],"=":[110,114,151,173],"12":[111],"to":[112,171],"256.":[115],"QCCB":[116,187],"finds":[117],"that":[118],"no":[119],"algorithm":[121],"consistently":[122],"outperforms":[123,142],"all":[124,128,143],"current":[132],"NISQ":[133],"scale.":[134,186],"QAOA":[135,182],"with":[136],"QOAS":[137],"adaptive":[138],"depth":[139],"(Bianchi,":[140],"2024)":[141],"on":[147,191],"MaxCut":[148,166],"48":[152],"(approximation":[153],"ratio":[154],"0.924":[155],"vs.":[156],"GW":[157],"0.878).":[158],"However,":[159],"MIP":[162],"solve":[165],"exactly":[167],"up":[170],"84":[174],"within":[175],"same":[177],"time":[178,197],"budget,":[179],"eliminating":[180],"moderate":[185],"provides":[188],"nuanced":[189],"guidance":[190],"classes,":[193],"instance":[194],"sizes,":[195],"budgets":[198],"where":[199],"offer":[202],"genuine":[203],"near-term":[204]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7220209677","counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2026-10-05T00:00:00"}
