A Quantum Internet Protocol Suite Beyond Layering

• URL: http://arxiv.org/abs/2602.19998v1
• Date: Mon, 23 Feb 2026 16:03:30 GMT
• Title: A Quantum Internet Protocol Suite Beyond Layering
• Authors: Angela Sara Cacciapuoti, Marcello Caleffi,
• Abstract summary: This paper proposes a quantum-native organizational principle based on dynamic composition.<n>It replaces static layering with a distributed orchestration fabric driven by the node local state and in-band control.
• Score: 4.918712889079032
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Layering, the protocol organization principle underpinning the classical Internet, is ill-suited to the Quantum Internet, built around entanglement, which is non-local and stateful. This paper proposes a quantum-native organizational principle based on dynamic composition, which replaces static layering with a distributed orchestration fabric driven by the node local state and in-band control. Each node runs a Dynamic Kernel that i) constructs a local PoA of candidate steps to advance a service intent, and ii) executes the PoA by composing atomic micro-protocols into context-aware procedures (the meta-protocols). Quantum packets carry an in-band control-field (the meta-header) containing the service intent and an append-only list of action-commit records, termed as stamps. Successive nodes exploit this minimal, authoritative history to construct their local PoAs. As quantum packets progress, these local commits collectively induce a network-wide, direct acyclic graph that certifies end-to-end service fulfillment, without requiring global synchronization. In contrast to classical encapsulation, the proposed suite enforces order by certification: dependency-aware local scheduling decides what may run at a certain node, stamps certify what did run and constrain subsequent planning. By embedding procedural control within the quantum packet, the design ensures coherence and consistency between entanglement-state evolution and control-flow, preventing divergence between resource state ad protocol logic, while remaining MP-agnostic and implementation-decoupled. The resulting suite is modular, adaptable to entanglement dynamics, and scalable. It operates correctly with or without optional control-plane hints. Indeed, when present, hints can steer QoS policies, without changing semantics. We argue that dynamic composition is the organizing principle required for a truly quantum-native Internet.

Related papers

• QuantumSavory: Write Symbolically, Run on Any Backend -- A Unified Simulation Toolkit for Quantum Computing and Networking [0.9009968922973344]
  We present QuantumSavory, an open-source toolkit built to make end-to-end studies practical.<n>States, operations, measurements, and protocol logic are expressed in a backend-agnostic symbolic language.<n>New custom backends can be added via a small, well-defined interface.<n>QuantumSavory ships reusable libraries of standard states, circuits, and protocol building blocks with consistent interfaces.
  arXiv  Detail & Related papers  (2025-12-18T16:48:49Z)
• A Comprehensive Protocol Stack for Quantum Networks with a Global Entanglement Module [1.1648648796144156]
  This paper introduces a Global Entanglement Module (GEM) that maintains a consistent, network-wide view of entanglement resources.<n>By enabling real-time adaptive execution of entanglement distribution plans, GEM bridges the gap between static planning and dynamic operation.<n>We show that a lightweight scoring-based strategy consistently achieves the best performance, improving entanglement generation rates by about 20% over a globally optimal but non-adaptive fixed-tree baseline.
  arXiv  Detail & Related papers  (2025-09-20T21:39:25Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• A resource-centric, task-based approach to quantum network control [44.99833362998488]
  We propose an unconventional approach to organize and manage the operations of quantum network devices.<n>Instead of a hierarchical scheme using layers, like in classical networks and present quantum network stack models, we propose a resource-centric scheme.
  arXiv  Detail & Related papers  (2025-07-16T08:43:18Z)
• Percolation thresholds and connectivity in quantum networks [0.0]
  We study entanglement percolation in qubit-based planar quantum network models.<n>We develop an algorithm designed to find a sequence of entanglement swapping and distillation operations.<n>We find distinct regimes of quantum percolation, which are clearly separated by the percolation thresholds of the employed strategies.
  arXiv  Detail & Related papers  (2025-02-24T14:26:09Z)
• Architecture and protocols for all-photonic quantum repeaters [0.49157446832511503]
  All-photonic quantum repeater scheme promises resilience to photon losses and operational errors. We propose a new emitter-photonic qubit building block and an RGS protocol that addresses several key considerations. Our proposed building block significantly reduces the total number of emissive quantum memories required for end nodes.
  arXiv  Detail & Related papers  (2023-06-06T15:08:50Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Feedback-assisted quantum search by continuous-time quantum walks [58.720142291102135]
  We address the quantum search of a target node on a cycle graph by means of a quantum walk assisted by continuous measurement and feedback. In particular, our protocol is able to drive the walker to a desired target node.
  arXiv  Detail & Related papers  (2022-01-12T16:59:53Z)
• Better than the Best: Gradient-based Improper Reinforcement Learning for Network Scheduling [60.48359567964899]
  We consider the problem of scheduling in constrained queueing networks with a view to minimizing packet delay. We use a policy gradient based reinforcement learning algorithm that produces a scheduler that performs better than the available atomic policies.
  arXiv  Detail & Related papers  (2021-05-01T10:18:34Z)
• Protocols for creating and distilling multipartite GHZ states with Bell pairs [0.0]
  distribution of high-quality Greenberger-Horne-Zeilinger (GHZ) states is at the heart of many quantum communication tasks. We introduce a dynamic programming algorithm to optimize over a large class of protocols that create and purify GHZ states.
  arXiv  Detail & Related papers  (2020-10-23T09:40:01Z)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)
• 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)

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.