Skip to main navigation Skip to search Skip to main content

Congestion-free Multiflow Quantum Tree Network with Logarithmic Overhead

  • Massachusetts Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We propose quantum tree network (QTN) designs that are 1) free from congestion in multiflow communications, 2) optimal routing with only local information (self-information) and 3) completely covers 2D surface, 4) with only logarithmic overhead. If the channel is dominated by the insertion loss and the communication is limited by the local gates, as in current state-of-the-art technologies, the overhead is log(N), while this is relaxed to the general cases with poly-log overhead by engaging repeater chains in the long range communication.

Original languageEnglish
Title of host publicationProceedings - 2022 IEEE/ACM 7th Symposium on Edge Computing, SEC 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages411-413
Number of pages3
ISBN (Electronic)9781665486118
DOIs
StatePublished - 2022
Event7th IEEE/ACM Symposium on Edge Computing, SEC 2022 - Seattle, United States
Duration: Dec 5 2022Dec 8 2022

Publication series

NameProceedings - 2022 IEEE/ACM 7th Symposium on Edge Computing, SEC 2022

Conference

Conference7th IEEE/ACM Symposium on Edge Computing, SEC 2022
Country/TerritoryUnited States
CitySeattle
Period12/5/2212/8/22

Keywords

  • Network Congestion
  • Quantum Communication
  • Quantum Information
  • Quantum Internet
  • Quantum Network
  • Quantum Repeater
  • Tree Network

Fingerprint

Dive into the research topics of 'Congestion-free Multiflow Quantum Tree Network with Logarithmic Overhead'. Together they form a unique fingerprint.

Cite this