Addressing a device in a quantum network: A quantum approach including routing

• URL: http://arxiv.org/abs/2604.05321v1
• Date: Tue, 07 Apr 2026 01:47:28 GMT
• Title: Addressing a device in a quantum network: A quantum approach including routing
• Abstract summary: Quantum network devices use their address state together with a request state that encodes the tasks to be executed.<n>We present a distributed quantum routing protocol using entanglement that coherently selects a route in a network of Bell-states for controlled-teleportation.
• Score: 51.736723807086385
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work we propose an addressing scheme for quantum networks which relies on quantum states held by devices. Quantum network devices use their address state together with a request state that encodes the tasks to be executed. Our approach not only removes the necessity to classically communicate addresses, but also the need to communicate the operations a device must apply. It turns out that utilizing entanglement to encode addresses of devices in a quantum network leads to interesting applications such as overlaying different network states. We present a distributed quantum routing protocol using entanglement that coherently selects a route in a network of Bell-states for controlled-teleportation and lastly we prove that addressing using quantum states is equivalent to performing tasks in superposition in a quantum network.

Related papers

• Advanced Quantum Communication and Quantum Networks -- From basic research to future applications [60.24341949660563]
  This review provides an overview of the specific properties of quantum information networks.<n>We aim to provide a starting point based on fundamental concepts of quantum information processing for further research on a future quantum internet.
  arXiv  Detail & Related papers  (2026-02-05T15:38:58Z)
• Practical Routing and Criticality in Large-Scale Quantum Communication Networks [0.0]
  In quantum communications, there exists a fundamental rate-loss tradeoff for point-to-point quantum channels.<n>Quantum networks are the solution to overcome point-to-point limitations, but they simultaneously invite a challenging open question.<n>Our work reveals the weaknesses of applying single-path routing protocols within quantum networks.
  arXiv  Detail & Related papers  (2025-09-13T17:19:51Z)
• A Brief Introduction to Quantum Network Control [7.952919774651851]
  Quantum networking is an emerging area with the potential to transform information processing and communications. We present a brief introduction to quantum network control, an area dedicated to designing algorithms for distributing entanglement (i.e., entangled qubits) We present a model for distributing entanglement in a multi-hop quantum network to enable applications such as quantum key distribution and distributed quantum computing.
  arXiv  Detail & Related papers  (2024-07-29T11:21:45Z)
• Practical limitations on robustness and scalability of quantum Internet [0.7499722271664144]
  We study the limitations on the scaling and robustness of quantum Internet. We present practical bottlenecks for secure communication, delegated computing, and resource distribution among end nodes. For some examples of quantum networks, we present algorithms to perform different quantum network tasks of interest.
  arXiv  Detail & Related papers  (2023-08-24T12:32:48Z)
• Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions [66.27337498864556]
  This paper presents a comprehensive survey of entanglement-assisted quantum networks. It provides a detailed overview of the network structure, working principles, and development stages. It also emphasizes open research directions, including architecture design, entanglement-based network issues, and standardization.
  arXiv  Detail & Related papers  (2023-07-24T02:48:22Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Experimental demonstration of entanglement delivery using a quantum network stack [1.3684924922685724]
  We experimentally demonstrate, using remote solid-state quantum network nodes, a link layer and a physical layer protocol for entanglement-based quantum networks. Results mark a clear transition from physics experiments to quantum communication systems.
  arXiv  Detail & Related papers  (2021-11-22T16:39:33Z)
• A quantum walk control plane for distributed quantum computing in quantum networks [15.602482592330201]
  We describe a quantum walk protocol to perform distributed quantum computing in a quantum network. We show how to use the quantum walker system to perform a distributed CNOT operation.
  arXiv  Detail & Related papers  (2021-06-17T22:19:15Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

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.