{"id":"https://openalex.org/W7123668502","doi":"https://doi.org/10.1109/iscc65549.2025.11326060","title":"Routing in Memoryless Quantum Networks: A Lexicographic Approach with Fidelity Guarantee","display_name":"Routing in Memoryless Quantum Networks: A Lexicographic Approach with Fidelity Guarantee","publication_year":2025,"publication_date":"2025-07-02","ids":{"openalex":"https://openalex.org/W7123668502","doi":"https://doi.org/10.1109/iscc65549.2025.11326060"},"language":null,"primary_location":{"id":"doi:10.1109/iscc65549.2025.11326060","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc65549.2025.11326060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Symposium on Computers and Communications (ISCC)","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/A5049137981","display_name":"Hilal S. Duranoglu Tunc","orcid":null},"institutions":[{"id":"https://openalex.org/I4210093367","display_name":"Deutsche Telekom (Germany)","ror":"https://ror.org/00m8prc86","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210093367"]},{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Hilal Sultan Duranoglu Tunc","raw_affiliation_strings":["Technische Universität Dresden,Deutsche Telekom Chair of Communication Networks,Dresden,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universität Dresden,Deutsche Telekom Chair of Communication Networks,Dresden,Germany","institution_ids":["https://openalex.org/I4210093367","https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015607026","display_name":"Milad Ghadimi","orcid":"https://orcid.org/0000-0001-7098-4226"},"institutions":[{"id":"https://openalex.org/I4210093367","display_name":"Deutsche Telekom (Germany)","ror":"https://ror.org/00m8prc86","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210093367"]},{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Milad Ghadimi","raw_affiliation_strings":["Technische Universität Dresden,Deutsche Telekom Chair of Communication Networks,Dresden,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universität Dresden,Deutsche Telekom Chair of Communication Networks,Dresden,Germany","institution_ids":["https://openalex.org/I4210093367","https://openalex.org/I78650965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122961146","display_name":"Riccardo Bassoli","orcid":null},"institutions":[{"id":"https://openalex.org/I4210093367","display_name":"Deutsche Telekom (Germany)","ror":"https://ror.org/00m8prc86","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210093367"]},{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Riccardo Bassoli","raw_affiliation_strings":["Technische Universität Dresden,Deutsche Telekom Chair of Communication Networks,Dresden,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universität Dresden,Deutsche Telekom Chair of Communication Networks,Dresden,Germany","institution_ids":["https://openalex.org/I4210093367","https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047803856","display_name":"H. P. Frank Fitzek","orcid":null},"institutions":[{"id":"https://openalex.org/I4210093367","display_name":"Deutsche Telekom (Germany)","ror":"https://ror.org/00m8prc86","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210093367"]},{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"H. P. Frank Fitzek","raw_affiliation_strings":["Technische Universität Dresden,Deutsche Telekom Chair of Communication Networks,Dresden,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universität Dresden,Deutsche Telekom Chair of Communication Networks,Dresden,Germany","institution_ids":["https://openalex.org/I4210093367","https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5049137981"],"corresponding_institution_ids":["https://openalex.org/I4210093367","https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.81148863,"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":"6"},"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.5669000148773193,"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.5669000148773193,"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.30410000681877136,"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/T11414","display_name":"Quantum optics and atomic interactions","score":0.02070000022649765,"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/fidelity","display_name":"Fidelity","score":0.5842000246047974},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5235000252723694},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5156000256538391},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.51419997215271},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5023000240325928},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4609000086784363},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4223000109195709}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6776999831199646},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.5842000246047974},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5235000252723694},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5156000256538391},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.51419997215271},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5023000240325928},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4223000109195709},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4092999994754791},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.3619999885559082},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3292999863624573},{"id":"https://openalex.org/C122527463","wikidata":"https://www.wikidata.org/wiki/Q578430","display_name":"Quantum decoherence","level":3,"score":0.3077000081539154},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29019999504089355},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2849999964237213},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2669999897480011},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2651999890804291}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc65549.2025.11326060","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc65549.2025.11326060","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311687","display_name":"Ministry of Education","ror":"https://ror.org/03m01yf64"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W266794195","https://openalex.org/W1969306194","https://openalex.org/W2002842428","https://openalex.org/W2006615804","https://openalex.org/W2057278205","https://openalex.org/W2061862411","https://openalex.org/W2092105345","https://openalex.org/W2094169436","https://openalex.org/W2131045650","https://openalex.org/W2132293653","https://openalex.org/W2132388203","https://openalex.org/W2132764286","https://openalex.org/W2479152214","https://openalex.org/W2609088824","https://openalex.org/W2849152050","https://openalex.org/W2887003841","https://openalex.org/W3120696673","https://openalex.org/W3176303726","https://openalex.org/W3178307110","https://openalex.org/W4206980136","https://openalex.org/W4281624875","https://openalex.org/W4283214197","https://openalex.org/W4283832122","https://openalex.org/W4292348062","https://openalex.org/W4385267349","https://openalex.org/W4401728494","https://openalex.org/W4406261128","https://openalex.org/W4407131064"],"related_works":[],"abstract_inverted_index":{"While":[0],"routing":[1,17],"methods":[2],"in":[3,126],"the":[4,8,45,52,61,73,82,110,117,127],"literature":[5],"often":[6],"assume":[7],"use":[9],"of":[10,112,129],"quantum":[11,22,130],"memory,":[12],"this":[13],"study":[14,93,119],"proposes":[15],"a":[16,57],"algorithm":[18,25],"designed":[19],"for":[20],"memoryless":[21],"networks.":[23,131],"The":[24,92],"leverages":[26],"lexicographic":[27],"optimization":[28],"principles":[29],"to":[30,85,109,120,135],"hierarchically":[31],"prioritize":[32],"and":[33,40,55,104,144],"optimize":[34],"multiple":[35],"objectives":[36],"such":[37],"as":[38],"distance":[39],"capacity.":[41],"This":[42],"approach":[43],"identifies":[44],"shortest":[46],"paths":[47],"between":[48],"source-destination":[49],"pairs":[50],"within":[51],"decoherence":[53],"time":[54],"selects":[56],"path":[58],"that":[59,141],"satisfies":[60],"minimum":[62],"capacity":[63,100],"require":[64],"ments.":[65],"To":[66],"prevent":[67],"entanglement":[68],"fidelity":[69,106,139],"from":[70],"dropping":[71],"below":[72],"desired":[74],"threshold,":[75],"purification":[76],"is":[77,116],"applied.":[78],"Simulation":[79],"results":[80],"demonstrate":[81],"algorithm\u2019s":[83],"ability":[84],"manage":[86],"latency":[87,145],"while":[88],"enhancing":[89],"throughput":[90,143],"effectively.":[91],"comprehensively":[94],"analyzes":[95],"performance":[96],"metrics":[97],"under":[98],"varying":[99],"values,":[101],"request":[102],"numbers,":[103],"threshold":[105,138],"levels.":[107],"Additionally,":[108],"best":[111],"our":[113],"knowledge,":[114],"it":[115],"first":[118],"calculate":[121],"latency,":[122],"including":[123],"queuing":[124],"delay,":[125],"context":[128],"Future":[132],"research":[133],"aims":[134],"explore":[136],"optimal":[137],"values":[140],"balance":[142],"performance.":[146]},"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2026-01-14T00:00:00"}