{"id":"https://openalex.org/W4416873490","doi":"https://doi.org/10.1109/qce65121.2025.00138","title":"Towards Optimal Orders for Entanglement Swapping in Path Graphs: A Greedy Approach","display_name":"Towards Optimal Orders for Entanglement Swapping in Path Graphs: A Greedy Approach","publication_year":2025,"publication_date":"2025-08-30","ids":{"openalex":"https://openalex.org/W4416873490","doi":"https://doi.org/10.1109/qce65121.2025.00138"},"language":null,"primary_location":{"id":"doi:10.1109/qce65121.2025.00138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00138","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/A5036573770","display_name":"Van Sy","orcid":"https://orcid.org/0000-0001-9576-0317"},"institutions":[{"id":"https://openalex.org/I4210101396","display_name":"Communications Technology Laboratory","ror":"https://ror.org/015xey021","country_code":"US","type":"government","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065","https://openalex.org/I4210101396"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Van Sy Mai","raw_affiliation_strings":["CTL, NIST,Gaithersburg,MD,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CTL, NIST,Gaithersburg,MD,USA","institution_ids":["https://openalex.org/I4210101396"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5094304550","display_name":"Abderrahim Amlou","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101396","display_name":"Communications Technology Laboratory","ror":"https://ror.org/015xey021","country_code":"US","type":"government","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065","https://openalex.org/I4210101396"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abderrahim Amlou","raw_affiliation_strings":["CTL, NIST,Gaithersburg,MD,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CTL, NIST,Gaithersburg,MD,USA","institution_ids":["https://openalex.org/I4210101396"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002622547","display_name":"Amar Abane","orcid":"https://orcid.org/0000-0002-0094-5907"},"institutions":[{"id":"https://openalex.org/I4210101396","display_name":"Communications Technology Laboratory","ror":"https://ror.org/015xey021","country_code":"US","type":"government","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065","https://openalex.org/I4210101396"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amar Abane","raw_affiliation_strings":["CTL, NIST,Gaithersburg,MD,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CTL, NIST,Gaithersburg,MD,USA","institution_ids":["https://openalex.org/I4210101396"]}]},{"author_position":"last","author":{"id":null,"display_name":"Abdella Battou","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101396","display_name":"Communications Technology Laboratory","ror":"https://ror.org/015xey021","country_code":"US","type":"government","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065","https://openalex.org/I4210101396"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abdella Battou","raw_affiliation_strings":["CTL, NIST,Gaithersburg,MD,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CTL, NIST,Gaithersburg,MD,USA","institution_ids":["https://openalex.org/I4210101396"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7588,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89732109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1237","last_page":"1247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.47380000352859497,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.47380000352859497,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.42719998955726624,"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/T10622","display_name":"Quantum Mechanics and Applications","score":0.027400000020861626,"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/quantum-entanglement","display_name":"Quantum entanglement","score":0.6869999766349792},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6496999859809875},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5938000082969666},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5602999925613403},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48510000109672546},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.4408999979496002},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.42640000581741333},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.40529999136924744},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3594000041484833}],"concepts":[{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.6869999766349792},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6496999859809875},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5938000082969666},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5602999925613403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.527999997138977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4887000024318695},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48510000109672546},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.4408999979496002},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.42640000581741333},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.40529999136924744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3614000082015991},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3594000041484833},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.32109999656677246},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27469998598098755},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/qce65121.2025.00138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00138","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":[{"id":"https://openalex.org/F4320332178","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W2000446243","https://openalex.org/W2018697056","https://openalex.org/W2080553533","https://openalex.org/W2092105345","https://openalex.org/W2093199434","https://openalex.org/W2589961586","https://openalex.org/W2766679834","https://openalex.org/W2963893013","https://openalex.org/W3046704400","https://openalex.org/W3111252474","https://openalex.org/W3197516892","https://openalex.org/W4225558362","https://openalex.org/W4253699484","https://openalex.org/W4280646555","https://openalex.org/W4283204966","https://openalex.org/W4293146273","https://openalex.org/W4382238007","https://openalex.org/W4391995106","https://openalex.org/W4407360708","https://openalex.org/W4409154717"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,24,29,44,55,58,64,72,77,93,122,130,138,143,152,168,184,192,197,208],"problem":[4,41,123],"of":[5,17,32,47,57,66,79,132,140,155,171,212],"finding":[6],"an":[7,108,147],"optimal":[8],"order":[9,78],"for":[10,51,111,125],"entanglement":[11,98,193],"swapping":[12,49,94,116,164,203],"in":[13,38,43,91,103,142,183],"a":[14,223],"heterogeneous":[15],"path":[16,25,198],"quantum":[18,225],"repeaters":[19,141],"so":[20],"as":[21,28,74,76,129,167],"to":[22,120,157,162],"maximize":[23],"throughput":[26],"defined":[27,166],"delivery":[30],"rate":[31],"end-to-end":[33],"entanglements.":[34],"The":[35,177],"primary":[36],"difficulty":[37],"addressing":[39],"this":[40],"lies":[42],"vast":[45],"array":[46],"possible":[48,133],"orders":[50,134],"large":[52],"paths":[53],"and":[54,69,113,210,216],"complexity":[56],"expected":[59,169],"throughput,":[60],"which":[61],"depends":[62],"on":[63,151,191,196,201],"attributes":[65],"each":[67],"node":[68],"edge":[70],"along":[71],"path,":[73,144],"well":[75],"swapping.":[80],"To":[81],"cope":[82],"with":[83,137],"these":[84],"issues,":[85],"we":[86,145,206],"first":[87],"propose":[88],"simple":[89],"approximations":[90],"estimating":[92],"outcome":[95],"between":[96],"two":[97],"distributions":[99,194],"that":[100,186],"can":[101],"run":[102],"constant":[104],"time,":[105],"thereby":[106],"providing":[107],"efficient":[109,148],"approach":[110,217],"evaluating":[112],"comparing":[114],"different":[115],"orders,":[117],"allowing":[118],"us":[119],"solve":[121],"exactly":[124],"small":[126],"paths.":[127],"Second,":[128],"number":[131,139,170],"grows":[135],"exponentially":[136],"develop":[146],"heuristic":[149],"based":[150],"greedy":[153],"selection":[154],"nodes":[156],"sequentially":[158],"perform":[159],"swaps":[160],"according":[161],"their":[163,175],"scores,":[165],"entanglements":[172],"resulting":[173],"from":[174],"swaps.":[176],"scores":[178],"are":[179],"local":[180],"but":[181,199],"dynamic":[182],"sense":[185],"they":[187],"depend":[188],"not":[189],"just":[190],"available":[195],"also":[200],"prior":[202],"decisions.":[204],"Finally,":[205],"illustrate":[207],"efficiency":[209],"effectiveness":[211],"our":[213],"proposed":[214],"model":[215],"through":[218],"extensive":[219],"experimentation":[220],"conducted":[221],"using":[222],"general":[224],"network":[226],"simulator.":[227]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-01T00:00:00"}