{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T16:16:16Z","timestamp":1786119376667,"version":"build-2736575974"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T00:00:00Z","timestamp":1785974400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T00:00:00Z","timestamp":1785974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002957","name":"Technische Universit\u00e4t Dresden","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002957","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In quantum networks, routing mechanisms designed to deliver successfully multiple simultaneous requests to the destination under limited channel capacity should simultaneously consider resource usage optimization, entanglement-generation performance, and the quality of the end-to-end delivered entangled states. The routing approaches developed for quantum networks in the literature mostly consider the change in fidelity during routing. However, it should be noted that quantum states with the same fidelity value may have different levels of coherence. In this study, for the first time, a novel routing and purification approach for quantum networks is presented, using the end-to-end (E2E) relative entropy of coherence (REC) together with E2E fidelity to determine the purification level and the feasibility of candidate paths. In our study, the coherence- and fidelity-aware routing algorithm (CAFARA) is proposed. In CAFARA, the BBPSSW purification levels are determined for each candidate path and ordered from the lowest to the highest. This information is stored in a lookup table. Then, the lowest BBPSSW purification level that simultaneously satisfies the requested fidelity, REC, latency, and capacity constraints is selected. The E2E fidelity, REC, and required number of raw Bell pairs mentioned here are all stored together in the previously mentioned lookup table. This lookup table was constructed using imperfect initial Werner states, one-sided amplitude damping, Werner-state twirling, BBPSSW purification, and density-matrix-based entanglement swapping, and all calculations were completed before the routing process. As the final step, CAFARA selects the best path with the highest entanglement generation rate (EGR) from the selected feasible paths. In our study, the FARA-PostREC and FARA-NoREC algorithms were developed for comparison with CAFARA. While the FARA-PostREC algorithm uses the REC constraint during the final validation stage of the request, FARA-NoREC does not use any REC constraint; it uses only fidelity as the quality parameter of the paths and as the parameter for determining the purification level. In our simulations under varying link distance, channel capacity, network size, and request load, CAFARA achieved a better average request success rate than FARA-PostREC by reducing late-stage request drops related to coherence because it also uses REC during the purification-level determination stage while maintaining the required E2E fidelity and REC values. Although FARA-NoREC often accepts more requests and assumes that they are successfully delivered, the average final fidelity\u00a0(AFF) and average final coherence (AFC) values of the requests considered successful are lower than those of the other algorithms; the AFC does not even satisfy the REC threshold. Overall, CAFARA provides a balanced trade-off between the quality-guaranteed request success rate, latency, purification overhead, and resource consumption.<\/jats:p>","DOI":"10.1038\/s41598-026-65444-1","type":"journal-article","created":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T18:14:37Z","timestamp":1786040077000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coherence and fidelity aware routing in quantum networks"],"prefix":"10.1038","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2621-3576","authenticated-orcid":false,"given":"Hilal Sultan Duranoglu","family":"Tunc","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joy","family":"Halder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Azita","family":"Hajizade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Voigt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bassem","family":"Arar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"Bassoli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard P.","family":"Fettweis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank H. P.","family":"Fitzek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,6]]},"reference":[{"key":"65444_CR1","first-page":"19262","volume":"14","author":"J Halder","year":"2024","unstructured":"Halder, J., Rajabov, A., Bassoli, R., Fitzek, F. H. & Fettweis, G. P. Optimal routing and end-to-end entanglement distribution in quantum networks. Scientif. Rep. Nat. 14, 19262 (2024).","journal-title":"Scientif. Rep. Nat."},{"key":"65444_CR2","doi-asserted-by":"crossref","unstructured":"Halder, J., Matus, E. & Fettweis, G. On the concurrent multipath entanglement distribution in quantum networks. In GLOBECOM 2024-2024 IEEE global communications conference, 2791\u20132796 (IEEE, 2024).","DOI":"10.1109\/GLOBECOM52923.2024.10901810"},{"key":"65444_CR3","doi-asserted-by":"crossref","unstructured":"Tunc, H. S.\u00a0D., Bassoli, R. & Fitzek, F.\u00a0H. Distributed quantum routing with fidelity assurance in memory-free networks. In 2025 IEEE wireless communications and networking conference (WCNC), 1\u20136 (IEEE, 2025).","DOI":"10.1109\/WCNC61545.2025.10978289"},{"key":"65444_CR4","doi-asserted-by":"crossref","unstructured":"Tunc, H. S.\u00a0D., Bayleyegn, A.\u00a0A., Notcker, J., Bassoli, R. & Fitzek, F.\u00a0H. Resilience analysis of quantum network against targeted attacks: Recovery via rerouting and purification. Opt. Switching Netw. 100810 (2025).","DOI":"10.1016\/j.osn.2025.100810"},{"key":"65444_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/MNET.001.1900092","volume":"34","author":"AS Cacciapuoti","year":"2019","unstructured":"Cacciapuoti, A. S. et al. Quantum internet: Networking challenges in distributed quantum computing. IEEE Netw. 34, 137\u2013143 (2019).","journal-title":"IEEE Netw."},{"key":"65444_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/JSAC.2020.2969035","volume":"38","author":"M Caleffi","year":"2020","unstructured":"Caleffi, M. & Cacciapuoti, A. S. Quantum switch for the quantum internet: Noiseless communications through noisy channels. IEEE J. Select. Areas Commun. 38, 575\u2013588 (2020).","journal-title":"IEEE J. Select. Areas Commun."},{"key":"65444_CR7","doi-asserted-by":"crossref","unstructured":"Wehner, S., Elkouss, D. & Hanson, R. Quantum internet: A vision for the road ahead. Science 362, eaam9288 (2018).","DOI":"10.1126\/science.aam9288"},{"key":"65444_CR8","first-page":"14255","volume":"7","author":"L Gyongyosi","year":"2017","unstructured":"Gyongyosi, L. & Imre, S. Entanglement-gradient routing for quantum networks. Scientif. Rep. 7, 14255 (2017).","journal-title":"Scientif. Rep."},{"key":"65444_CR9","first-page":"22390","volume":"10","author":"L Gyongyosi","year":"2020","unstructured":"Gyongyosi, L. & Imre, S. Resource prioritization and balancing for the quantum internet. Scientif. Rep. 10, 22390 (2020).","journal-title":"Scientif. Rep."},{"key":"65444_CR10","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1038\/nature02570","volume":"429","author":"M Riebe","year":"2004","unstructured":"Riebe, M. et al. Deterministic quantum teleportation with atoms. Nature 429, 734\u2013737 (2004).","journal-title":"Nature"},{"key":"65444_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00708652","volume":"1","author":"JL Park","year":"1970","unstructured":"Park, J. L. The concept of transition in quantum mechanics. Found. Phys. 1, 23\u201333 (1970).","journal-title":"Found. Phys."},{"key":"65444_CR12","first-page":"10922","volume":"5","author":"Z Xi","year":"2015","unstructured":"Xi, Z., Li, Y. & Fan, H. Quantum coherence and correlations in quantum system. Scientif. Rep. 5, 10922 (2015).","journal-title":"Scientif. Rep."},{"key":"65444_CR13","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1088\/0953-4075\/40\/8\/012","volume":"40","author":"H Prakash","year":"2007","unstructured":"Prakash, H. et al. Effect of decoherence on fidelity in teleportation using entangled coherent states. J. Phys. B Atomic, Mol. Opt. Phys. 40, 1613 (2007).","journal-title":"J. Phys. B Atomic, Mol. Opt. Phys."},{"key":"65444_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-017-1650-7","volume":"16","author":"C Liu","year":"2017","unstructured":"Liu, C., Zhang, D.-J., Yu, X.-D., Ding, Q.-M. & Liu, L. A new coherence measure based on fidelity. Quantum Information Processing 16, 1\u201310 (2017).","journal-title":"Quantum Information Processing"},{"key":"65444_CR15","unstructured":"Mokeev, A.\u00a0S., Zhang, Y.-N. & Dobrovitski, V.\u00a0V. Modeling of decoherence and fidelity enhancement during transport of entangled qubits. arXiv preprint arXiv:2409.04404 (2024)."},{"key":"65444_CR16","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/s11128-020-02675-9","volume":"19","author":"Y-N Guo","year":"2020","unstructured":"Guo, Y.-N., Tian, Q.-L., Zeng, K. & Chen, P.-X. Fidelity of quantum teleportation in correlated quantum channels. Quantum Inform. Process. 19, 182 (2020).","journal-title":"Quantum Inform. Process."},{"key":"65444_CR17","doi-asserted-by":"crossref","unstructured":"Tunc, H. S. D. The impact of decoherence and purification on end-to-end fidelity in noisy quantum networks. In 2025 IEEE middle east conference on communications and networking (MECOM) 203\u2013208 (IEEE, 2025).","DOI":"10.1109\/MECOM67453.2025.11439835"},{"key":"65444_CR18","unstructured":"Tunc, H. S.\u00a0D., Bassoli, R., Fitzek, F.\u00a0H. & Bayleyegn, A.\u00a0A. Investigating the impact of relative entropy of coherence on end-to-end fidelity in quantum networks under different noise models. In Quantum communications and quantum imaging XXIII, vol. 13618, 1361803 (SPIE, 2025)."},{"key":"65444_CR19","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1109\/COMST.2023.3254481","volume":"25","author":"Z Yang","year":"2023","unstructured":"Yang, Z., Zolanvari, M. & Jain, R. A survey of important issues in quantum computing and communications. IEEE Commun. Surv. Tutor. 25, 1059\u20131094 (2023).","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"65444_CR20","doi-asserted-by":"crossref","unstructured":"Gu, H. Cost-aware high-fidelity entanglement distribution and purification in the quantum internet. IEEE transactions on networking) (2025).","DOI":"10.1109\/TON.2025.3606263"},{"key":"65444_CR21","doi-asserted-by":"publisher","first-page":"6748","DOI":"10.1109\/TCOMM.2022.3200115","volume":"70","author":"J Li","year":"2022","unstructured":"Li, J. et al. Fidelity-guaranteed entanglement routing in quantum networks. IEEE Trans. Commun. 70, 6748\u20136763 (2022).","journal-title":"IEEE Trans. Commun."},{"key":"65444_CR22","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Zhao, G. & Qiao, C. E2e fidelity aware routing and purification for throughput maximization in quantum networks. In IEEE INFOCOM 2022-IEEE conference on computer communications, 480\u2013489 (IEEE, 2022).","DOI":"10.1109\/INFOCOM48880.2022.9796814"},{"key":"65444_CR23","doi-asserted-by":"publisher","first-page":"3320","DOI":"10.1109\/TNSE.2025.3631132","volume":"13","author":"J Tan","year":"2025","unstructured":"Tan, J., Li, Z., Li, J., Liu, B. & Yu, N. Distributed entanglement routing scheme with fidelity guarantee in quantum networks. IEEE Trans. Netw. Sci. Eng. 13, 3320\u20133334 (2025).","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"65444_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/MCOM.006.2300851","volume":"62","author":"Z Yang","year":"2024","unstructured":"Yang, Z., Ghubaish, A., Jain, R., Kompella, R. & Shapourian, H. Multi-tree quantum routing in realistic topologies. IEEE Commun. Magazine 62, 78\u201385 (2024).","journal-title":"IEEE Commun. Magazine"},{"key":"65444_CR25","doi-asserted-by":"crossref","unstructured":"Tunc, H. S.\u00a0D., Halder, J., Bassoli, R., Fettweis, G.\u00a0P. & Fitzek, F.\u00a0H. Fidelity-preserving routing without memory for practical quantum network implementation. In 2025 IEEE 36th international symposium on personal, Indoor and mobile radio communications (PIMRC), 1\u20136 (IEEE, 2025).","DOI":"10.1109\/PIMRC62392.2025.11275219"},{"key":"65444_CR26","doi-asserted-by":"publisher","first-page":"3952","DOI":"10.1109\/TCOMM.2026.3658364","volume":"74","author":"Z Wang","year":"2026","unstructured":"Wang, Z. et al. SFTRAP: Satisfying fidelity threshold routing and adaptive purification for throughput maximum in quantum network. IEEE Trans. Commun. 74, 3952\u20133967 (2026).","journal-title":"IEEE Trans. Commun."},{"key":"65444_CR27","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1103\/PhysRevLett.76.722","volume":"76","author":"CH Bennett","year":"1996","unstructured":"Bennett, C. H. et al. Purification of noisy entanglement and faithful teleportation via noisy channels. Phys. Rev. Lett. 76, 722 (1996).","journal-title":"Phys. Rev. Lett."},{"key":"65444_CR28","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"BM Waxman","year":"2002","unstructured":"Waxman, B. M. Routing of multipoint connections. IEEE J. Select. Areas Commun. 6, 1617\u20131622 (2002).","journal-title":"IEEE J. Select. Areas Commun."},{"key":"65444_CR29","doi-asserted-by":"publisher","first-page":"2825","DOI":"10.1109\/JSAC.2025.3568063","volume":"43","author":"Z Yang","year":"2025","unstructured":"Yang, Z. et al. Layer-wise security framework and analysis for the quantum internet. IEEE J. Select. Areas Commun. 43, 2825\u20132840 (2025).","journal-title":"IEEE J. Select. Areas Commun."},{"key":"65444_CR30","doi-asserted-by":"crossref","unstructured":"Yang, Z., Ghubaish, A., Jain, R., Shapourian, H. & Shabani, A. Asynchronous entanglement routing for the quantum internet. AVS Quantum Sci. 6, (2024).","DOI":"10.1116\/5.0172819"},{"key":"65444_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.113.140401","volume":"113","author":"T Baumgratz","year":"2014","unstructured":"Baumgratz, T., Cramer, M. & Plenio, M. B. Quantifying coherence. Phys. Rev. Lett. 113, 140401 (2014).","journal-title":"Phys. Rev. Lett."},{"key":"65444_CR32","doi-asserted-by":"publisher","first-page":"4277","DOI":"10.1103\/PhysRevA.40.4277","volume":"40","author":"RF Werner","year":"1989","unstructured":"Werner, R. F. Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model. Phys. Rev. A 40, 4277 (1989).","journal-title":"Phys. Rev. A"},{"key":"65444_CR33","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M. A. & Chuang, I. L. Quantum computation and quantum information (Cambridge University Press, Cambridge, 2010)."},{"key":"65444_CR34","doi-asserted-by":"crossref","unstructured":"Shi, Y. Design of an entanglement purification protocol selection module. In 2025 IEEE international conference on quantum computing and engineering (QCE) Vol. 2 268\u2013271 (IEEE, 2025).","DOI":"10.1109\/QCE65121.2025.10332"},{"key":"65444_CR35","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1088\/0034-4885\/70\/8\/R03","volume":"70","author":"W D\u00fcr","year":"2007","unstructured":"D\u00fcr, W. & Briegel, H. J. Entanglement purification and quantum error correction. Rep. Progr. Phys. 70, 1381\u20131424 (2007).","journal-title":"Rep. Progr. Phys."},{"key":"65444_CR36","doi-asserted-by":"publisher","first-page":"4287","DOI":"10.1103\/PhysRevLett.71.4287","volume":"71","author":"M \u017bukowski","year":"1993","unstructured":"\u017bukowski, M., Zeilinger, A., Horne, M. A. & Ekert, A. K. \u201cEvent-ready-detectors\u2019\u2019bell experiment via entanglement swapping. Phys. Rev. Lett. 71, 4287 (1993).","journal-title":"Phys. Rev. Lett."},{"key":"65444_CR37","doi-asserted-by":"crossref","unstructured":"Wang, Z. Fair-eas: Entanglement allocation and selection for process-oriented fairness in quantum communication networks. IEEE transactions on communications (2024).","DOI":"10.1109\/TCOMM.2024.3516497"},{"key":"65444_CR38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.032425","volume":"103","author":"L Ruan","year":"2021","unstructured":"Ruan, L., Kirby, B. T., Brodsky, M. & Win, M. Z. Efficient entanglement distillation for quantum channels with polarization mode dispersion. Phys. Rev. A 103, 032425 (2021).","journal-title":"Phys. Rev. A"},{"key":"65444_CR39","doi-asserted-by":"crossref","unstructured":"Caleffi, M. End-to-end entanglement rate: Toward a quantum route metric. IEEE Globecom Workshops (GC Wkshps) 1\u20136 (IEEE, ) (2017).","DOI":"10.1109\/GLOCOMW.2017.8269080"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-65444-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-65444-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-65444-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T18:23:41Z","timestamp":1786040621000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-65444-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,6]]},"references-count":39,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["65444"],"URL":"https:\/\/doi.org\/10.1038\/s41598-026-65444-1","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,6]]},"assertion":[{"value":"8 May 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no conflict of interest.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"24346"}}