Quantum connectivity of quantum networks

• URL: http://arxiv.org/abs/2603.29601v1
• Date: Tue, 31 Mar 2026 11:18:40 GMT
• Title: Quantum connectivity of quantum networks
• Abstract summary: We introduce the quantum connectivity measure (QCM), which quantifies the average connection quality between pairs of network nodes.<n>We show that even a fully connected graph can be functionally disconnected for quantum tasks if average network edge-concurrence falls below a critical threshold.
• Score: 0.7609212210331453
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The practical utility of a quantum network depends on its ability to establish entanglement between arbitrary node pairs with quality sufficient to execute entanglement enabled tasks. This capability can be assessed globally, through aggregate performance over all node pairs, as well as locally, at the level of individual nodes. Since entanglement-based connections form a layer above the underlying physical topology, quantum connectivity is not adequately captured by classical topological connectivity metrics. To enable characterisation of the quantum connectivity at the level of the network (or its subnetworks), we introduce the quantum connectivity measure (QCM), which quantifies the average connection quality between pairs of network nodes. Further, we describe two quantities, the quantum-connected fraction (QCF) and the quantum clustering coefficient (QCC), naturally derived from the QCM, which capture important features of the functional connectivity of the quantum network at the level of the network and an individual node, respectively. These metrics of quantum connectivity depend crucially on the entanglement distribution protocol and the quantum network parameters in addition to its physical topology. We demonstrate the crucial distinction between topological and quantum connectivity, showing that even a fully connected graph can be functionally disconnected for quantum tasks if average network edge-concurrence falls below a critical threshold. These quantum connectivity metrics thus provide important tools for the design, optimization, and benchmarking of future quantum networks.

Related papers

• QPing: a Quantum Ping Primitive for Quantum Networks [40.350859102407505]
  We introduce the concept of Quantum Ping (QPing) as a diagnostic primitive for future quantum networks.<n>We develop a formal framework for QPing and leverage different tools such as sequential hypothesis testing.<n>We present several strategies, including active strategies, with path-based and segment-based variants, and passive strategies that utilize pre-shared entangled resources.
  arXiv  Detail & Related papers  (2025-08-05T18:00:06Z)
• No quantum advantage without classical communication: fundamental limitations of quantum networks [0.0]
  We show that quantum networks relying on the long-distance distribution of bipartite entanglement, combined with local operations and shared randomness, cannot achieve a relevant quantum advantage.<n>Specifically, we prove that these networks do not help in preparing resourceful quantum states such as Greenberger-Horne-Zeilinger states or cluster states.
  arXiv  Detail & Related papers  (2025-03-12T15:30:02Z)
• Guarantees on the structure of experimental quantum networks [105.13377158844727]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Routing in Quantum Repeater Networks with Mixed Efficiency Figures [10.955844285189373]
  We focus on some key parameters in an operational quantum network such as the fraction of nodes with a higher efficiency.<n>Our simulations show that incorporating knowledge of node quality helps boost the fidelity of some of the routing paths.<n>The study also highlights the critical role of the fraction of high-quality nodes in end-to-end fidelity and explores the trade-offs between upgrading all nodes to high quality or retaining a subset of lower-quality nodes.
  arXiv  Detail & Related papers  (2023-10-13T10:13:16Z)
• 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)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Cavity-enhanced quantum network nodes [0.0]
  A future quantum network will consist of quantum processors that are connected by quantum channels. I will describe how optical resonators facilitate quantum network nodes.
  arXiv  Detail & Related papers  (2022-05-30T18:50:35Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• Preliminary Study of Connectivity for Quantum Key Distribution Network [3.0454955988938743]
  Quantum network is fragile to disturbances when qubits are transmitted through quantum channel. A metric is needed to describe the reliability of a quantum network to build a robust infrastructure and communication protocols.
  arXiv  Detail & Related papers  (2020-04-23T16:44:10Z)

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.