{"id":"https://openalex.org/W4416249420","doi":"https://doi.org/10.1109/ijcnn64981.2025.11228458","title":"Quantum Approaches for Degree-Constrained Minimum Spanning Tree Computation","display_name":"Quantum Approaches for Degree-Constrained Minimum Spanning Tree Computation","publication_year":2025,"publication_date":"2025-06-30","ids":{"openalex":"https://openalex.org/W4416249420","doi":"https://doi.org/10.1109/ijcnn64981.2025.11228458"},"language":null,"primary_location":{"id":"doi:10.1109/ijcnn64981.2025.11228458","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11228458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","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/A5002696039","display_name":"Rafael S. Carmo","orcid":"https://orcid.org/0000-0002-8432-5464"},"institutions":[{"id":"https://openalex.org/I879563668","display_name":"Universidade Estadual Paulista (Unesp)","ror":"https://ror.org/00987cb86","country_code":"BR","type":"education","lineage":["https://openalex.org/I879563668"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Rafael Sim\u00f5es do Carmo","raw_affiliation_strings":["S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil"],"affiliations":[{"raw_affiliation_string":"S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil","institution_ids":["https://openalex.org/I879563668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025825161","display_name":"Marcos Cleison Silva Santana","orcid":"https://orcid.org/0000-0003-2568-8019"},"institutions":[{"id":"https://openalex.org/I879563668","display_name":"Universidade Estadual Paulista (Unesp)","ror":"https://ror.org/00987cb86","country_code":"BR","type":"education","lineage":["https://openalex.org/I879563668"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcos Cleison Silva Santana","raw_affiliation_strings":["S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil"],"affiliations":[{"raw_affiliation_string":"S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil","institution_ids":["https://openalex.org/I879563668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043241009","display_name":"F. F. Fanchini","orcid":"https://orcid.org/0000-0003-3297-905X"},"institutions":[{"id":"https://openalex.org/I879563668","display_name":"Universidade Estadual Paulista (Unesp)","ror":"https://ror.org/00987cb86","country_code":"BR","type":"education","lineage":["https://openalex.org/I879563668"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Felipe Fernandes Fanchini","raw_affiliation_strings":["S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil"],"affiliations":[{"raw_affiliation_string":"S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil","institution_ids":["https://openalex.org/I879563668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000302987","display_name":"Kelton Augusto Pontara da Costa","orcid":"https://orcid.org/0000-0001-5458-3908"},"institutions":[{"id":"https://openalex.org/I879563668","display_name":"Universidade Estadual Paulista (Unesp)","ror":"https://ror.org/00987cb86","country_code":"BR","type":"education","lineage":["https://openalex.org/I879563668"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Kelton A. P. Costa","raw_affiliation_strings":["S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil"],"affiliations":[{"raw_affiliation_string":"S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil","institution_ids":["https://openalex.org/I879563668"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120549596","display_name":"Weslley Santana Rosalem","orcid":null},"institutions":[{"id":"https://openalex.org/I879563668","display_name":"Universidade Estadual Paulista (Unesp)","ror":"https://ror.org/00987cb86","country_code":"BR","type":"education","lineage":["https://openalex.org/I879563668"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Weslley Santana Rosalem","raw_affiliation_strings":["S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil"],"affiliations":[{"raw_affiliation_string":"S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil","institution_ids":["https://openalex.org/I879563668"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111315652","display_name":"Jo\u00e3o Paulo Papa","orcid":null},"institutions":[{"id":"https://openalex.org/I879563668","display_name":"Universidade Estadual Paulista (Unesp)","ror":"https://ror.org/00987cb86","country_code":"BR","type":"education","lineage":["https://openalex.org/I879563668"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jo\u00e3o Paulo Papa","raw_affiliation_strings":["S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil"],"affiliations":[{"raw_affiliation_string":"S&#x00E3;o Paulo State University - UNESP,School of Sciences,Bauru,Brazil","institution_ids":["https://openalex.org/I879563668"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5002696039"],"corresponding_institution_ids":["https://openalex.org/I879563668"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18189189,"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":"8"},"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.9448999762535095,"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.9448999762535095,"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.007000000216066837,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.006800000090152025,"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/spanning-tree","display_name":"Spanning tree","score":0.6236000061035156},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6136000156402588},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.566100001335144},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5228000283241272},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5066999793052673},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.5048999786376953},{"id":"https://openalex.org/keywords/qubit","display_name":"Qubit","score":0.4754999876022339},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.43709999322891235},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.42719998955726624}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6236000061035156},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6136000156402588},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.566100001335144},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5228000283241272},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5066999793052673},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5048999786376953},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4912000000476837},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.4754999876022339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4410000145435333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43880000710487366},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.42719998955726624},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.399399995803833},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.39340001344680786},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.3447999954223633},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.33730000257492065},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.3046000003814697},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.29120001196861267},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25769999623298645},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn64981.2025.11228458","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11228458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311419","display_name":"Ministry of Health","ror":null},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1562473198","https://openalex.org/W1948148225","https://openalex.org/W1965121855","https://openalex.org/W1985440868","https://openalex.org/W1995670816","https://openalex.org/W2015101476","https://openalex.org/W2039122980","https://openalex.org/W2044793578","https://openalex.org/W2074078071","https://openalex.org/W2096411924","https://openalex.org/W2152195021","https://openalex.org/W2781738013","https://openalex.org/W3088409280","https://openalex.org/W4247040364","https://openalex.org/W4248916828","https://openalex.org/W4386031611","https://openalex.org/W4386038258","https://openalex.org/W4392502199","https://openalex.org/W4392877631","https://openalex.org/W4408847956"],"related_works":[],"abstract_inverted_index":{"Quantum":[0,5],"optimization":[1,14,117],"algorithms,":[2,188],"particularly":[3],"the":[4,29,37,53,57,77,112,128,137,147,163,176,183,203],"Approximate":[6],"Optimization":[7],"Algorithm":[8],"(QAOA),":[9],"have":[10],"significantly":[11],"addressed":[12],"combinatorial":[13,199],"problems.":[15],"While":[16],"QAOA":[17,61,79,89,132],"has":[18],"been":[19],"applied":[20],"to":[21,36,67,93,100,133,175,196],"various":[22],"NP-hard":[23],"problems,":[24],"such":[25],"as":[26,122,142],"Max-Cut":[27],"and":[28,62,85,108,115,193,201],"Traveling":[30],"Salesman":[31],"Problem":[32],"(TSP),":[33],"its":[34,65],"application":[35],"Degree-Constrained":[38],"Minimum":[39],"Spanning":[40],"Tree":[41],"(DCMST)":[42],"problem":[43],"remains":[44],"unexplored.":[45],"Inspired":[46],"by":[47],"Fowler\u2019s":[48],"formulation,":[49],"this":[50,134],"work":[51],"presents":[52],"first":[54],"implementation":[55],"of":[56,125,130,139,149,166,179,185,205],"DCMST":[58],"Hamiltonian":[59],"within":[60],"insights":[63],"from":[64],"benefits":[66],"graph-based":[68],"machine":[69],"learning":[70],"algorithms.":[71,208],"We":[72,96],"investigated":[73],"two":[74],"approaches:":[75],"(i)":[76],"standard":[78],"ansatz":[80],"with":[81,106,146,190],"an":[82],"X":[83],"mixer":[84],"(ii)":[86],"a":[87,123],"warm-started":[88],"utilizing":[90],"classical":[91],"preprocessing":[92],"enhance":[94],"convergence.":[95],"used":[97],"these":[98],"strategies":[99],"provide":[101],"numerical":[102],"results":[103],"for":[104],"instances":[105],"3":[107],"4":[109],"nodes,":[110,150],"employing":[111],"COBYLA":[113],"optimizer":[114],"metaheuristic":[116],"techniques.":[118],"Our":[119],"findings":[120],"serve":[121],"proof":[124],"concept,":[126],"demonstrating":[127],"feasibility":[129],"applying":[131],"problem;":[135],"however,":[136],"number":[138,148,165],"qubits":[140],"scales":[141],"O(N<sup":[143],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[144],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>)":[145],"limiting":[151],"scalability.":[152],"Current":[153],"research":[154],"focuses":[155],"on":[156],"developing":[157],"more":[158],"efficient":[159],"implementations":[160],"that":[161],"encode":[162],"same":[164],"binary":[167],"variables":[168],"using":[169],"fewer":[170],"qubits.":[171],"This":[172],"study":[173],"contributes":[174],"expanding":[177],"field":[178],"quantum":[180,207],"optimization,":[181],"highlighting":[182],"potential":[184],"hybrid":[186],"quantum-classical":[187],"especially":[189],"resource-efficient":[191],"mixers":[192],"warm-starting":[194],"techniques,":[195],"solve":[197],"complex":[198],"problems":[200],"advance":[202],"development":[204],"scalable":[206]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-14T00:00:00"}