{"id":"https://openalex.org/W7160949243","doi":"https://doi.org/10.48550/arxiv.2605.09616","title":"A Hybrid Classical-Quantum Annealing Algorithm for the TSP","display_name":"A Hybrid Classical-Quantum Annealing Algorithm for the TSP","publication_year":2026,"publication_date":"2026-05-10","ids":{"openalex":"https://openalex.org/W7160949243","doi":"https://doi.org/10.48550/arxiv.2605.09616"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.09616","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09616","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.09616","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135968461","display_name":"Siwei Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Siwei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119474032","display_name":"Victor Lopata","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lopata, Victor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028631087","display_name":"Salvatore Sinno","orcid":"https://orcid.org/0009-0002-9177-5161"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sinno, Salvatore","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092855506","display_name":"Shruthi Thuravakkath","orcid":"https://orcid.org/0009-0002-9792-3276"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thuravakkath, Shruthi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054022139","display_name":"Paolo Zuliani","orcid":"https://orcid.org/0000-0001-6033-5919"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zuliani, Paolo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8267999887466431,"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.8267999887466431,"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.029999999329447746,"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/T13187","display_name":"Diffusion and Search Dynamics","score":0.008799999952316284,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-annealing","display_name":"Quantum annealing","score":0.8761000037193298},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6791999936103821},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5932000279426575},{"id":"https://openalex.org/keywords/qubit","display_name":"Qubit","score":0.5415999889373779},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.4968000054359436},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.48570001125335693},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4535999894142151},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.4404999911785126},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3919000029563904}],"concepts":[{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.8761000037193298},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6791999936103821},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5932000279426575},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.5415999889373779},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4968000054359436},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.48570001125335693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4661000072956085},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4535999894142151},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4404999911785126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4293999969959259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42800000309944153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41100001335144043},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3919000029563904},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.35249999165534973},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30799999833106995},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.2964000105857849},{"id":"https://openalex.org/C154018700","wikidata":"https://www.wikidata.org/wiki/Q898323","display_name":"Path integral formulation","level":3,"score":0.2906999886035919},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.2865999937057495},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.09616","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09616","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.09616","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09616","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Hybrid":[0],"quantum-classical":[1],"algorithms":[2],"can":[3],"help":[4],"mitigating":[5],"the":[6,14,19,38,56,59],"physical":[7],"limitations":[8],"of":[9,55,58,66,80],"current":[10],"quantum":[11,76,88,101],"devices,":[12],"particularly":[13],"low":[15],"qubit":[16],"count":[17],"and":[18,95],"reduced":[20],"topological":[21],"connectivity.":[22],"In":[23],"this":[24],"paper,":[25],"we":[26],"propose":[27],"a":[28,33,48,64,67,75,99],"hybrid":[29],"technique":[30,51],"to":[31,70],"solve":[32],"well-known":[34],"NP-hard":[35],"optimization":[36],"problem:":[37],"Traveling":[39],"Salesperson":[40],"Problem":[41],"(TSP).":[42],"Our":[43],"approach":[44,82],"is":[45,83],"based":[46],"on":[47,86,98],"graph":[49],"contraction":[50],"that":[52],"removes":[53],"most":[54],"dimensionality":[57],"original":[60],"problem":[61],"instance,":[62],"producing":[63],"sub-TSP":[65],"size":[68],"suitable":[69],"be":[71],"efficiently":[72],"solved":[73],"by":[74],"device.":[77],"The":[78],"performance":[79],"our":[81],"first":[84],"demonstrated":[85],"classical":[87],"simulation":[89],"using":[90],"Path":[91],"Integral":[92],"Monte":[93],"Carlo,":[94],"then":[96],"run":[97],"D-Wave":[100],"annealer.":[102]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-13T00:00:00"}