{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T01:01:03Z","timestamp":1781053263112,"version":"3.54.1"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.future.2026.108597","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:06:15Z","timestamp":1778861175000},"page":"108597","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Entanglement in the trees: Optimal entanglement distribution in binary tree quantum network topologies"],"prefix":"10.1016","volume":"184","author":[{"given":"Iulian Ioan","family":"B\u00eerlic\u0103","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alin Bogdan","family":"Popa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bogdan C\u0103lin","family":"Ciobanu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florin","family":"Pop","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pantelimon George","family":"Popescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.future.2026.108597_b1","doi-asserted-by":"crossref","first-page":"8201","DOI":"10.1038\/s41598-023-35280-8","article-title":"Testing the speed of \u201cspooky action at a distance\u201d in a tabletop experiment","volume":"13","author":"Santamaria Amato","year":"2023","journal-title":"Sci. Rep."},{"issue":"13","key":"10.1016\/j.future.2026.108597_b2","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","article-title":"Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels","volume":"70","author":"Bennett","year":"1993","journal-title":"Phys. Rev. Lett."},{"issue":"6","key":"10.1016\/j.future.2026.108597_b3","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1103\/PhysRevLett.80.1121","article-title":"Experimental realization of teleporting an unknown pure quantum state via dual classical and Einstein-Podolsky-Rosen channels","volume":"80","author":"Boschi","year":"1998","journal-title":"Phys. Rev. Lett."},{"issue":"6660","key":"10.1016\/j.future.2026.108597_b4","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1038\/37539","article-title":"Experimental quantum teleportation","volume":"390","author":"Bouwmeester","year":"1997","journal-title":"Nature"},{"issue":"20","key":"10.1016\/j.future.2026.108597_b5","doi-asserted-by":"crossref","first-page":"2881","DOI":"10.1103\/PhysRevLett.69.2881","article-title":"Communication via one-and two-particle operators on Einstein-Podolsky-Rosen states","volume":"69","author":"Bennett","year":"1992","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"10.1016\/j.future.2026.108597_b6","doi-asserted-by":"crossref","first-page":"21310","DOI":"10.1038\/s41598-022-25812-z","article-title":"Distribution of controlled unitary quantum gates towards factoring large numbers on today\u2019s small-register devices","volume":"12","author":"T\u0103n\u0103sescu","year":"2022","journal-title":"Sci. Rep."},{"issue":"26","key":"10.1016\/j.future.2026.108597_b7","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.71.4287","article-title":"\u201d Event-ready-detectors\u201d Bell experiment via entanglement swapping","volume":"71","author":"Zukowski","year":"1993","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"10.1016\/j.future.2026.108597_b8","doi-asserted-by":"crossref","first-page":"9834","DOI":"10.1038\/s41598-023-36562-x","article-title":"Optimal quantum network decongestion strategies","volume":"13","author":"Perju Verzotti","year":"2023","journal-title":"Sci. Rep."},{"issue":"1","key":"10.1016\/j.future.2026.108597_b9","doi-asserted-by":"crossref","first-page":"11714","DOI":"10.1038\/s41598-024-62274-x","article-title":"Optimal and scalable entanglement distribution over crossbar quantum networks","volume":"14","author":"Ciobanu","year":"2024","journal-title":"Sci. Rep."},{"issue":"2315","key":"10.1016\/j.future.2026.108597_b10","doi-asserted-by":"crossref","DOI":"10.1098\/rsta.2024.0518","article-title":"Quantum data centres: why entanglement changes everything","volume":"384","author":"Cacciapuoti","year":"2026","journal-title":"Philos. Trans. R. Soc. A: Math. Phys. Eng. Sci."},{"key":"10.1016\/j.future.2026.108597_b11","doi-asserted-by":"crossref","unstructured":"H. Zhang, Y. Xu, H. Hu, K. Yin, H. Shapourian, J. Zhao, R.R. Kompella, R. Nejabati, Y. Ding, Switchqnet: Optimizing distributed quantum computing for quantum data centers with switch networks, in: Proceedings of the 52nd Annual International Symposium on Computer Architecture, 2025, pp. 1449\u20131463.","DOI":"10.1145\/3695053.3731046"},{"issue":"11","key":"10.1016\/j.future.2026.108597_b12","doi-asserted-by":"crossref","DOI":"10.1002\/qute.202000025","article-title":"Quantum conference key agreement: A review","volume":"3","author":"Murta","year":"2020","journal-title":"Adv. Quantum Technol."},{"issue":"23","key":"10.1016\/j.future.2026.108597_b13","doi-asserted-by":"crossref","first-page":"eabe0395","DOI":"10.1126\/sciadv.abe0395","article-title":"Experimental quantum conference key agreement","volume":"7","author":"Proietti","year":"2021","journal-title":"Sci. Adv."},{"issue":"4","key":"10.1016\/j.future.2026.108597_b14","doi-asserted-by":"crossref","DOI":"10.1088\/2058-9565\/abd4c3","article-title":"Distributed quantum sensing","volume":"6","author":"Zhang","year":"2021","journal-title":"Quantum Sci. Technol."},{"key":"10.1016\/j.future.2026.108597_b15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2023.3329714","article-title":"Multiuser entanglement distribution in quantum networks using multipath routing","volume":"4","author":"Sutcliffe","year":"2023","journal-title":"IEEE Trans. Quantum Eng."},{"key":"10.1016\/j.future.2026.108597_b16","series-title":"2023 IEEE International Conference on Quantum Computing and Engineering","first-page":"1120","article-title":"Generation and distribution of ghz states in quantum networks","volume":"Vol. 1","author":"Ghaderibaneh","year":"2023"},{"issue":"1","key":"10.1016\/j.future.2026.108597_b17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.future.2026.108597_b18","series-title":"IEEE INFOCOM 2022-IEEE Conference on Computer Communications","first-page":"510","article-title":"Multi-entanglement routing design over quantum networks","author":"Zeng","year":"2022"},{"key":"10.1016\/j.future.2026.108597_b19","doi-asserted-by":"crossref","first-page":"348","DOI":"10.22331\/q-2020-10-22-348","article-title":"Transforming graph states to Bell-pairs is NP-Complete","volume":"4","author":"Dahlberg","year":"2020","journal-title":"Quantum"},{"issue":"4","key":"10.1016\/j.future.2026.108597_b20","doi-asserted-by":"crossref","DOI":"10.1103\/RevModPhys.95.045006","article-title":"Quantum repeaters: From quantum networks to the quantum internet","volume":"95","author":"Azuma","year":"2023","journal-title":"Rev. Modern Phys."},{"issue":"3","key":"10.1016\/j.future.2026.108597_b21","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.134.030803","article-title":"Path percolation in quantum communication networks","volume":"134","author":"Meng","year":"2025","journal-title":"Phys. Rev. Lett."},{"issue":"1\u20132","key":"10.1016\/j.future.2026.108597_b22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","article-title":"The complexity of path coloring and call scheduling","volume":"255","author":"Erlebach","year":"2001","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.future.2026.108597_b23","doi-asserted-by":"crossref","first-page":"16459","DOI":"10.1038\/s41598-025-00391-x","article-title":"Optimal entanglement distribution within a multi-ring topology","volume":"15","author":"Ciobanu","year":"2025","journal-title":"Sci. Rep."},{"issue":"1","key":"10.1016\/j.future.2026.108597_b24","doi-asserted-by":"crossref","first-page":"19262","DOI":"10.1038\/s41598-024-70114-1","article-title":"Optimal routing and end-to-end entanglement distribution in quantum networks","volume":"14","author":"Halder","year":"2024","journal-title":"Sci. Rep."},{"key":"10.1016\/j.future.2026.108597_b25","series-title":"2023 32nd International Conference on Computer Communications and Networks","first-page":"1","article-title":"Esdi: Entanglement scheduling and distribution in the quantum internet","author":"Gu","year":"2023"},{"key":"10.1016\/j.future.2026.108597_b26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2020.3028172","article-title":"Entanglement distribution in a quantum network: A multicommodity flow-based approach","volume":"1","author":"Chakraborty","year":"2020","journal-title":"IEEE Trans. Quantum Eng."},{"key":"10.1016\/j.future.2026.108597_b27","doi-asserted-by":"crossref","unstructured":"S. Shi, C. Qian, Concurrent entanglement routing for quantum networks: Model and designs, in: Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, 2020, pp. 62\u201375.","DOI":"10.1145\/3387514.3405853"},{"key":"10.1016\/j.future.2026.108597_b28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2022.3168784","article-title":"Efficient quantum network communication using optimized entanglement swapping trees","volume":"3","author":"Ghaderibaneh","year":"2022","journal-title":"IEEE Trans. Quantum Eng."},{"key":"10.1016\/j.future.2026.108597_b29","doi-asserted-by":"crossref","DOI":"10.1109\/MNET.2025.3532847","article-title":"Entanglement request scheduling in quantum datacenter networks","author":"Vista","year":"2025","journal-title":"IEEE Netw."},{"key":"10.1016\/j.future.2026.108597_b30","series-title":"Introduction to Algorithms","author":"Cormen","year":"2022"},{"issue":"3","key":"10.1016\/j.future.2026.108597_b31","article-title":"A ten-qubit solid-state spin register with quantum memory up to one minute","volume":"9","author":"Bradley","year":"2019","journal-title":"Phys. Rev. X"},{"key":"10.1016\/j.future.2026.108597_b32","series-title":"50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art","first-page":"219","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"2009"},{"issue":"2","key":"10.1016\/j.future.2026.108597_b33","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"Siam J. Comput."},{"issue":"2","key":"10.1016\/j.future.2026.108597_b34","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.future.2026.108597_b35","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1093\/comjnl\/19.2.182","article-title":"On various algorithms for estimating the chromatic number of a graph","volume":"19","author":"Mitchem","year":"1976","journal-title":"Comput. J."},{"key":"10.1016\/j.future.2026.108597_b36","first-page":"113","article-title":"\u00dcber die aufl\u00f6sung von graphen in vollst\u00e4ndige teilgraphen","volume":"1","author":"Hajnal","year":"1958","journal-title":"Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math."},{"issue":"2","key":"10.1016\/j.future.2026.108597_b37","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.future.2026.108597_b38","first-page":"65","article-title":"On the coloration of perfect graphs","author":"Maffray","year":"2003","journal-title":"Recent Adv. Algorithms Comb."},{"key":"10.1016\/j.future.2026.108597_b39","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"2004"},{"key":"10.1016\/j.future.2026.108597_b40","series-title":"Graph Drawing: Symposium on Graph Drawing, GD\u201995 Passau, Germany, September 20\u201322, 1995 Proceedings 3","first-page":"166","article-title":"The botanical beauty of random binary trees","author":"Devroye","year":"1996"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26002311?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26002311?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T00:39:56Z","timestamp":1781051996000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X26002311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":40,"alternative-id":["S0167739X26002311"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2026.108597","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Entanglement in the trees: Optimal entanglement distribution in binary tree quantum network topologies","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2026.108597","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"108597"}}