Flexible Qubit Allocation of Network Resource States

• URL: http://arxiv.org/abs/2510.15776v1
• Date: Fri, 17 Oct 2025 16:01:17 GMT
• Title: Flexible Qubit Allocation of Network Resource States
• Authors: Francesco Mazza, Jorge Miguel-Ramiro, Jessica Illiano, Alexander Pirker, Marcello Caleffi, Angela Sara Cacciapuoti, Wolfgang Dür,
• Abstract summary: We explore the use of graph states with flexible, non-trivial qubit-to-node assignments.<n>We focus on cluster states with arbitrary allocation as network resource states.<n>We introduce a modeling framework for overlaying entanglement topologies on physical networks.
• Score: 37.8666266153972
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The Quantum Internet is still in its infancy, yet identifying scalable and resilient quantum network resource states is an essential task for realizing it. We explore the use of graph states with flexible, non-trivial qubit-to-node assignments. This flexibility enables adaptable engineering of the entanglement topology of an arbitrary quantum network. In particular, we focus on cluster states with arbitrary allocation as network resource states and as a promising candidate for a network core-level entangled resource, due to its intrinsic flexible connectivity properties and resilience to particle losses. We introduce a modeling framework for overlaying entanglement topologies on physical networks and demonstrate how optimized and even random qubit assignment, creates shortcuts and improves robustness and memory savings, while substantially reducing the average hop distance between remote network nodes, when compared to conventional approaches.

Related papers

• On Utility-optimal Entanglement Routing in Quantum Networks [0.10312968200748114]
  Quantum networks are envisioned to enable reliable distribution and manipulation of quantum information across distances.<n>In this work, we aim to identify optimal routes that correspond to the achievable network utility.<n>Our work provides the framework for extending classical flow-based and quality of service-aware routing concepts to quantum networks.
  arXiv  Detail & Related papers  (2026-03-01T17:32:32Z)
• Generative Adversarial Networks for Resource State Generation [1.9832598896178517]
  We introduce a physics-informed Generative Adversarial Network framework that recasts quantum resource-state generation as an inverse-design task.<n>By embedding task-specific utility functions into training, the model learns to generate valid two-qubit states optimized for teleportation and entanglement broadcasting.
  arXiv  Detail & Related papers  (2026-01-20T08:04:57Z)
• A Framework for Distributed Resource Allocation in Quantum Networks [8.76473628143937]
  We introduce a distributed resource allocation framework for the Quantum Internet that relies on fully decentralized coordination to serve co-existing applications.<n>We develop quantum network control algorithms under the mathematical framework of Quantum Network Utility Maximization (QNUM)<n>We then introduce QPrimal-Dual, a decentralized, scalable algorithm that solves QNUM by placing network controllers that operate using local state information.
  arXiv  Detail & Related papers  (2025-10-10T13:27:32Z)
• Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network [2.2110030760685957]
  We propose a novel quantum network protocol to efficiently implement the general graph state distribution in the network layer.<n>An explicit mathematical model for a general graph state distribution problem has been constructed.<n>We leverage the spacetime quantum network inspired by the symmetry from relativity for memory management in network problems.
  arXiv  Detail & Related papers  (2024-12-19T11:37:32Z)
• Resilient Entanglement Distribution in a Multihop Quantum Network [0.605746798865181]
  We introduce multihop quantum networks to improve network reach and resilience. We present multihop two-qubit polarization-entanglement distribution within a quantum network at the Oak Ridge National Laboratory campus.
  arXiv  Detail & Related papers  (2024-07-29T22:42:08Z)
• Generative AI-enabled Quantum Computing Networks and Intelligent Resource Allocation [80.78352800340032]
  Quantum computing networks execute large-scale generative AI computation tasks and advanced quantum algorithms. efficient resource allocation in quantum computing networks is a critical challenge due to qubit variability and network complexity. We introduce state-of-the-art reinforcement learning (RL) algorithms, from generative learning to quantum machine learning for optimal quantum resource allocation.
  arXiv  Detail & Related papers  (2024-01-13T17:16:38Z)
• Quantum network-entanglement measures [0.0]
  We introduce measures of quantum network-entanglement that are well-defined within the general framework of quantum resource theories.<n>We also provide methods to estimate these measures by introducing novel witnesses of network-entanglement.
  arXiv  Detail & Related papers  (2023-11-23T11:50:09Z)
• 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)
• Entanglement Rate Optimization in Heterogeneous Quantum Communication Networks [79.8886946157912]
  Quantum communication networks are emerging as a promising technology that could constitute a key building block in future communication networks in the 6G era and beyond. Recent advances led to the deployment of small- and large-scale quantum communication networks with real quantum hardware. In quantum networks, entanglement is a key resource that allows for data transmission between different nodes.
  arXiv  Detail & Related papers  (2021-05-30T11:34:23Z)
• Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
  We propose a topological perspective to represent a network into a complete graph for analysis. By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner. This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
  arXiv  Detail & Related papers  (2020-08-19T04:53:31Z)
• Resource Allocation via Graph Neural Networks in Free Space Optical Fronthaul Networks [119.81868223344173]
  This paper investigates the optimal resource allocation in free space optical (FSO) fronthaul networks. We consider the graph neural network (GNN) for the policy parameterization to exploit the FSO network structure. The primal-dual learning algorithm is developed to train the GNN in a model-free manner, where the knowledge of system models is not required.
  arXiv  Detail & Related papers  (2020-06-26T14:20:48Z)

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.