Entanglement-Based Artificial Topology: Neighboring Remote Network Nodes

• URL: http://arxiv.org/abs/2404.16204v2
• Date: Tue, 16 Jul 2024 11:30:31 GMT
• Title: Entanglement-Based Artificial Topology: Neighboring Remote Network Nodes
• Authors: SiYi Chen, Jessica Illiano, Angela Sara Cacciapuoti, Marcello Caleffi,
• Abstract summary: Entanglement is unanimously recognized as the key communication resource of the Quantum Internet. We show that multipartite entanglement allows to generate an inter-QLAN artificial topology, by means of local operations only. Our contribution aims at providing the network engineering community with a hands-on guideline towards the concept of artificial topology and artificial neighborhood.
• Score: 7.53305437064932
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement is unanimously recognized as the key communication resource of the Quantum Internet. Yet, the possibility of implementing novel network functionalities by exploiting the marvels of entanglement has been poorly investigated so far, by mainly restricting the attention to bipartite entanglement. Conversely, in this paper, we aim at exploiting multipartite entanglement as inter-network resource. Specifically, we consider the interconnection of different Quantum Local Area Networks (QLANs), and we show that multipartite entanglement allows to dynamically generate an inter-QLAN artificial topology, by means of local operations only, that overcomes the limitations of the physical QLAN topologies. To this aim, we first design the multipartite entangled state to be distributed within each QLAN. Then, we show how such a state can be engineered to: i) interconnect nodes belonging to different QLANs, and ii) dynamically adapt to different inter-QLAN traffic patterns. Our contribution aims at providing the network engineering community with a hands-on guideline towards the concept of artificial topology and artificial neighborhood.

Related papers

• AI Flow at the Network Edge [58.31090055138711]
  AI Flow is a framework that streamlines the inference process by jointly leveraging the heterogeneous resources available across devices, edge nodes, and cloud servers. This article serves as a position paper for identifying the motivation, challenges, and principles of AI Flow.
  arXiv  Detail & Related papers  (2024-11-19T12:51:17Z)
• Simulation of Entanglement-Enabled Connectivity in QLANs using SeQUeNCe [7.486717790185952]
  Quantum Local Area Networks (QLANs) are a promising building block for larger scale quantum networks. In this paper, we discuss the implementation of the QLAN model in SeQUeNCe, a discrete-event simulator of quantum networks.
  arXiv  Detail & Related papers  (2024-11-17T10:20:25Z)
• Intra-QLAN Connectivity: beyond the Physical Topology [7.469200949273275]
  Quantum Local Area Networks (QLANs) are the building block of the Quantum Internet. QLANs are based on simpler, scarcely-connected physical topologies, such as star topologies. This paper addresses the fundamental issue of engineering the artificial topology of a QLAN.
  arXiv  Detail & Related papers  (2024-06-14T12:12:36Z)
• On the Bipartite Entanglement Capacity of Quantum Networks [9.377912974064227]
  We consider multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem. We then compute the overall network capacity, defined as the maximum number of EPR states distributed to users per time unit.
  arXiv  Detail & Related papers  (2023-07-10T10:58:02Z)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50:45Z)
• Limitations of nearest-neighbour quantum networks [0.688204255655161]
  We focus on the most promising architectures for future quantum networks - those connecting nodes close to each other. Nearest-neighbour networks such as rings, lines, and grids have been studied under different communication scenarios.
  arXiv  Detail & Related papers  (2022-02-22T13:36:31Z)
• Quantum violation of local causality in urban network with hybrid photonic technologies [0.5461681605490603]
  Two independent sources using different technologies are used to share photonic entangled state among three nodes connected through a 270 m free-space channel and fiber links. By violating a suitable non-linear Bell inequality, we demonstrate the nonlocal behaviour of the correlations among the nodes of the network. Our results pave the way towards the realization of more complex networks and the implementation of quantum communication protocols in an urban environment.
  arXiv  Detail & Related papers  (2021-09-14T17:06:51Z)
• Optimized Quantum Networks [68.8204255655161]
  Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests. We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
  arXiv  Detail & Related papers  (2021-07-21T18:00:07Z)
• Learning Autonomy in Management of Wireless Random Networks [102.02142856863563]
  This paper presents a machine learning strategy that tackles a distributed optimization task in a wireless network with an arbitrary number of randomly interconnected nodes. We develop a flexible deep neural network formalism termed distributed message-passing neural network (DMPNN) with forward and backward computations independent of the network topology.
  arXiv  Detail & Related papers  (2021-06-15T09:03:28Z)
• Graph Neural Networks for Decentralized Multi-Robot Submodular Action Selection [101.38634057635373]
  We focus on applications where robots are required to jointly select actions to maximize team submodular objectives. We propose a general-purpose learning architecture towards submodular at scale, with decentralized communications. We demonstrate the performance of our GNN-based learning approach in a scenario of active target coverage with large networks of robots.
  arXiv  Detail & Related papers  (2021-05-18T15:32:07Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.