Selected article for: "high low and low complexity"

Author: Gyongyosi, Laszlo; Imre, Sandor
Title: Routing space exploration for scalable routing in the quantum Internet.
  • Cord-id: wbx7qy8z
  • Document date: 2020_7_17
  • ID: wbx7qy8z
    Snippet: The entangled network structure of the quantum Internet formulates a high complexity routing space that is hard to explore. Scalable routing is a routing method that can determine an optimal routing at particular subnetwork conditions in the quantum Internet to perform a high-performance and low-complexity routing in the entangled structure. Here, we define a method for routing space exploration and scalable routing in the quantum Internet. We prove that scalable routing allows a compact and eff
    Document: The entangled network structure of the quantum Internet formulates a high complexity routing space that is hard to explore. Scalable routing is a routing method that can determine an optimal routing at particular subnetwork conditions in the quantum Internet to perform a high-performance and low-complexity routing in the entangled structure. Here, we define a method for routing space exploration and scalable routing in the quantum Internet. We prove that scalable routing allows a compact and efficient routing in the entangled networks of the quantum Internet.

    Search related documents:
    Co phrase search for related documents
    • Try single phrases listed below for: 1
    Co phrase search for related documents, hyperlinks ordered by date