{"id":"https://openalex.org/W7213399474","doi":"https://doi.org/10.48550/arxiv.2609.16198","title":"Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths","display_name":"Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths","publication_year":2026,"publication_date":"2026-09-14","ids":{"openalex":"https://openalex.org/W7213399474","doi":"https://doi.org/10.48550/arxiv.2609.16198"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.16198","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.16198","pdf_url":"https://arxiv.org/pdf/2609.16198","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.16198","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062504600","display_name":"Leonardo Bacciottini","orcid":"https://orcid.org/0000-0002-2319-5256","observed_orcids":["https://orcid.org/0000-0002-2319-5256"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bacciottini, Leonardo","raw_affiliation_strings":["Manning College of Information and Computer Sciences University of Massachusetts Amherst"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Manning College of Information and Computer Sciences University of Massachusetts Amherst","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052551454","display_name":"Subhransu Maji","orcid":"https://orcid.org/0000-0002-3869-9334","observed_orcids":["https://orcid.org/0000-0002-3869-9334"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maji, Subhransu","raw_affiliation_strings":["Manning College of Information and Computer Sciences University of Massachusetts Amherst"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Manning College of Information and Computer Sciences University of Massachusetts Amherst","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036683370","display_name":"Don Towsley","orcid":"https://orcid.org/0000-0002-7808-7375","observed_orcids":["https://orcid.org/0000-0002-7808-7375"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Towsley, Don","raw_affiliation_strings":["Manning College of Information and Computer Sciences University of Massachusetts Amherst"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Manning College of Information and Computer Sciences University of Massachusetts Amherst","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046553366","display_name":"Gayane Vardoyan","orcid":"https://orcid.org/0000-0002-6005-8138","observed_orcids":["https://orcid.org/0000-0002-6005-8138"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vardoyan, Gayane","raw_affiliation_strings":["Manning College of Information and Computer Sciences University of Massachusetts Amherst"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Manning College of Information and Computer Sciences University of Massachusetts Amherst","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9937000274658203,"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"}},"topics":[{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.9937000274658203,"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"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.002400000113993883,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-networks","display_name":"quantum networks","score":0.8889999985694885},{"id":"https://openalex.org/keywords/entanglement-distribution","display_name":"entanglement distribution","score":0.9430000185966492},{"id":"https://openalex.org/keywords/path-choice","display_name":"path selection","score":0.7540000081062317},{"id":"https://openalex.org/keywords/utility-based-routing","display_name":"utility-based routing","score":0.675000011920929},{"id":"https://openalex.org/keywords/quantum-repeaters","display_name":"quantum repeaters","score":0.6290000081062317},{"id":"https://openalex.org/keywords/fully-polynomial-time-approximation-scheme","display_name":"fully polynomial time approximation scheme","score":0.8579999804496765}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.534500002861023},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5091999769210815},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5044999718666077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4869000017642975},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.46889999508857727},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.45329999923706055},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.4196000099182129},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.37599998712539673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3652999997138977},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.3296000063419342},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.32749998569488525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.30160000920295715},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.2825999855995178},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.2685000002384186},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.2533999979496002},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2515000104904175}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.16198","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.16198","pdf_url":"https://arxiv.org/pdf/2609.16198","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.16198","doi":"https://doi.org/10.48550/arxiv.2609.16198","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.16198","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,"listed_in":[],"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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.16198","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.16198","pdf_url":"https://arxiv.org/pdf/2609.16198","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2036045937","display_name":"NeTS: Small: Surrogate-Assisted Full-Stack Optimization of Quantum Networks with Reinforcement Learning","funder_award_id":"2522101","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3817840624","display_name":"Research Infrastructure: CIRC: New: Full-stack Codesign Tools for Quantum Hardware","funder_award_id":"2346089","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6276915973","display_name":"Collaborative Research: NeTS: Medium: Design, Analysis, and Control of Quantum Networks","funder_award_id":"2402861","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7576470222","display_name":"NSF Engineering Research Center for Quantum Networks (CQN)","funder_award_id":"1941583","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213399474.pdf","grobid_xml":"https://content.openalex.org/works/W7213399474.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1475146671","https://openalex.org/W3217304835","https://openalex.org/W4360889124","https://openalex.org/W4417129467"],"related_works":["https://openalex.org/W7133364756","https://openalex.org/W4319996286","https://openalex.org/W7106789522","https://openalex.org/W4327767809","https://openalex.org/W7214304173","https://openalex.org/W4384835320","https://openalex.org/W4360889124","https://openalex.org/W4407986171","https://openalex.org/W7202360177","https://openalex.org/W7084054532"],"abstract_inverted_index":{"A":[0,99],"path":[1,19,79,87,112,151],"in":[2,192],"a":[3,7,18,63,85,90,142,149,153],"quantum":[4],"network":[5],"is":[6,43,141,166],"chain":[8],"of":[9,28,118,137],"repeaters":[10],"that":[11,62,127],"distributes":[12],"entanglement":[13],"between":[14],"two":[15],"users.":[16],"Selecting":[17],"requires":[20],"balancing":[21],"the":[22,29,103,111,133,139,187],"rate":[23,58,105,119,136],"and":[24,71,81,120],"quality":[25],"(e.g.,":[26,49,181],"fidelity)":[27],"delivered":[30],"entanglement,":[31],"but":[32,175],"these":[33],"quantities,":[34],"unlike":[35],"standard":[36],"routing":[37,163],"metrics,":[38],"compose":[39],"non-additively.":[40],"The":[41],"problem":[42,83],"compounded":[44],"by":[45],"link-level":[46],"configuration":[47,82],"choices":[48],"distillation":[50],"rounds":[51],"or":[52],"emitter":[53],"brightness":[54],"tuning),":[55],"each":[56],"trading":[57],"against":[59],"fidelity,":[60],"so":[61],"path's":[64],"performance":[65],"depends":[66],"jointly":[67],"on":[68,89],"its":[69,72],"route":[70],"per-link":[73],"settings.":[74],"We":[75,125,156],"cast":[76],"this":[77],"joint":[78],"selection":[80],"as":[84],"shortest":[86],"computation":[88],"layered":[91,188],"graph":[92],"whose":[93],"layers":[94],"track":[95],"discretized":[96],"end-to-end":[97],"fidelity.":[98],"single":[100],"run":[101],"returns":[102],"full":[104],"fidelity":[106,121,173],"Pareto":[107],"frontier,":[108],"from":[109],"which":[110],"maximizing":[113],"any":[114],"nondecreasing":[115],"utility":[116,130,169],"function":[117],"can":[122,176],"be":[123,177],"selected.":[124],"prove":[126],"for":[128,168,182],"certain":[129],"functions":[131,170],"(including":[132],"secret":[134],"key":[135],"BB84),":[138],"method":[140,189],"fully":[143],"polynomial":[144],"time":[145],"approximation":[146],"scheme,":[147],"returning":[148],"near-optimal":[150],"within":[152],"specified":[154],"tolerance.":[155],"further":[157],"characterize":[158],"exactly":[159],"when":[160],"cheaper":[161],"scalarization-based":[162],"suffices:":[164],"it":[165],"optimal":[167],"with":[171],"convex":[172],"profiles,":[174],"arbitrarily":[178],"suboptimal":[179],"otherwise":[180],"step-like,":[183],"sigmoidal":[184],"utilities),":[185],"whereas":[186],"remains":[190],"reliable":[191],"all":[193],"cases.":[194]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-17T00:00:00"}