{"id":"https://openalex.org/W7161032875","doi":"https://doi.org/10.48550/arxiv.2605.12365","title":"QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning","display_name":"QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W7161032875","doi":"https://doi.org/10.48550/arxiv.2605.12365"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.12365","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.12365","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"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.12365","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136013120","display_name":"Kien X. Nguyen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen, Kien X.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002076864","display_name":"Ankit Kulshrestha","orcid":"https://orcid.org/0000-0003-0485-4145"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kulshrestha, Ankit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136040319","display_name":"Ilya Safro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Safro, Ilya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136065923","display_name":"Xiaoyuan Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Xiaoyuan","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.9797000288963318,"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.9797000288963318,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.00570000009611249,"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/T11804","display_name":"Quantum many-body systems","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.607200026512146},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4578000009059906},{"id":"https://openalex.org/keywords/quantum-gate","display_name":"Quantum gate","score":0.45739999413490295},{"id":"https://openalex.org/keywords/qubit","display_name":"Qubit","score":0.4447999894618988},{"id":"https://openalex.org/keywords/quantum-circuit","display_name":"Quantum circuit","score":0.4406000077724457},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43299999833106995},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.40700000524520874},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.40380001068115234},{"id":"https://openalex.org/keywords/controlled-not-gate","display_name":"Controlled NOT gate","score":0.3978999853134155}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6377000212669373},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.607200026512146},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4578000009059906},{"id":"https://openalex.org/C58849907","wikidata":"https://www.wikidata.org/wiki/Q2118982","display_name":"Quantum gate","level":4,"score":0.45739999413490295},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.4447999894618988},{"id":"https://openalex.org/C124148022","wikidata":"https://www.wikidata.org/wiki/Q2122210","display_name":"Quantum circuit","level":5,"score":0.4406000077724457},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43299999833106995},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.40380001068115234},{"id":"https://openalex.org/C182953411","wikidata":"https://www.wikidata.org/wiki/Q917713","display_name":"Controlled NOT gate","level":5,"score":0.3978999853134155},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3880000114440918},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38280001282691956},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3472999930381775},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.33730000257492065},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.32899999618530273},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C66322947","wikidata":"https://www.wikidata.org/wiki/Q11658","display_name":"Transformer","level":3,"score":0.3239000141620636},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.32260000705718994},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.30329999327659607},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.29120001196861267},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28119999170303345},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2800000011920929},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.26429998874664307},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.258899986743927},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.12365","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.12365","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.12365","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.12365","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.585119366645813,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Qubit":[0],"routing":[1,18,46,67],"is":[2],"a":[3,48,70,91,101,122,145],"fundamental":[4],"problem":[5,52],"in":[6,100,108],"quantum":[7,82,163],"compilation,":[8],"known":[9],"to":[10,192],"be":[11],"NP-hard.":[12],"Its":[13],"dynamic":[14,71],"nature":[15],"makes":[16],"local":[17,35],"decisions":[19],"propagate":[20],"and":[21,87,134,169,188],"compound":[22],"over":[23],"time,":[24],"making":[25],"global":[26],"efficient":[27],"solutions":[28],"challenging.":[29],"Existing":[30],"heuristic":[31],"methods":[32],"rely":[33],"on":[34,69,160],"rules":[36],"with":[37],"limited":[38],"lookahead,":[39],"while":[40],"recent":[41],"learning-based":[42],"approaches":[43],"often":[44],"treat":[45],"as":[47,84,90],"generic":[49],"sequential":[50],"decision":[51],"without":[53],"fully":[54],"exploiting":[55],"its":[56],"underlying":[57],"structure.":[58],"In":[59],"this":[60,116],"paper,":[61],"we":[62],"introduce":[63],"QAP-Router,":[64],"framing":[65],"qubit":[66],"based":[68],"Quadratic":[72],"Assignment":[73],"Problem":[74],"(QAP)":[75],"formulation.":[76],"By":[77],"modeling":[78],"logical":[79],"interactions,":[80],"or":[81],"gates,":[83],"flow":[85,132],"matrices":[86],"hardware":[88],"topology":[89],"distance":[92,136],"matrix,":[93],"our":[94,174],"approach":[95],"captures":[96],"the":[97,106,109,118,128,131,135,139,152,166,178],"interaction-distance":[98],"coupling":[99],"unified":[102],"objective,":[103],"which":[104],"defines":[105],"reward":[107],"reinforcement":[110],"learning":[111],"environment.":[112],"To":[113],"further":[114],"exploit":[115],"structure,":[117],"policy":[119],"network":[120],"employs":[121],"solution-aware":[123],"Transformer":[124],"backbone":[125],"that":[126,148,173],"encodes":[127],"interaction":[129],"between":[130],"matrix":[133,137],"into":[138,151],"attention":[140],"mechanism.":[141],"We":[142],"also":[143],"integrate":[144],"lookahead":[146],"mechanism":[147],"blends":[149],"naturally":[150],"QAP":[153],"framework,":[154],"preventing":[155],"myopic":[156],"decisions.":[157],"Extensive":[158],"experiments":[159],"1,831":[161],"real-world":[162],"circuits":[164,184],"from":[165],"MQTBench,":[167],"AgentQ":[168],"QUEKO":[170],"datasets":[171],"show":[172],"method":[175],"substantially":[176],"reduces":[177],"CNOT":[179],"gate":[180],"count":[181],"of":[182],"routed":[183],"by":[185],"15.7%,":[186],"30.4%":[187],"12.1%,":[189],"respectively,":[190],"relative":[191],"existing":[193],"industry":[194],"compilers.":[195]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-14T00:00:00"}