EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Entanglement in the trees: Optimal entanglement distribution in binary tree quantum network topologies

Iulian Ioan Bîrlică, Alin Bogdan Popa, Bogdan Călin Ciobanu, Florin Pop, Pantelimon George Popescu

Future Generation Computer Systems · 2026-11 · 184 · 108597

DOI: 10.1016/j.future.2026.108597 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Future Generation Computer Systems, 2026-11. Verfasst von Iulian Ioan Bîrlică und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: Ministerul Educaţiei şi Cercetării, Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Ministerul Educaţiei şi Cercetării
  • Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii

Zitieren

APA

Bîrlică, I. I., Popa, A. B., Ciobanu, B. C., Pop, F., & Popescu, P. G. (2026). Entanglement in the trees: Optimal entanglement distribution in binary tree quantum network topologies. Future Generation Computer Systems, 184, 108597. https://doi.org/10.1016/j.future.2026.108597

Vancouver

Bîrlică II, Popa AB, Ciobanu BC, Pop F, Popescu PG. Entanglement in the trees: Optimal entanglement distribution in binary tree quantum network topologies. Future Generation Computer Systems. 2026;184:108597. doi:10.1016/j.future.2026.108597

BibTeX
@article{Brlic2026,
  author = {Bîrlică, Iulian Ioan and Popa, Alin Bogdan and Ciobanu, Bogdan Călin and Pop, Florin and Popescu, Pantelimon George},
  title = {Entanglement in the trees: Optimal entanglement distribution in binary tree quantum network topologies},
  journal = {Future Generation Computer Systems},
  year = {2026},
  volume = {184},
  pages = {108597},
  doi = {10.1016/j.future.2026.108597}
}
Kostenlos starten →