Exact Resource Laws for Passive Wavelength Routing in Entanglement Networks

• URL: http://arxiv.org/abs/2608.29911v1
• Date: Sun, 30 Aug 2026 17:12:37 GMT
• Title: Exact Resource Laws for Passive Wavelength Routing in Entanglement Networks
• Abstract summary: Entanglement-based networks provide a scalable framework for quantum communication by passively routing spectrally correlated photon pairs.<n>We address the problem through the network's connectivity graph, where the wavelength assignment becomes a resource-optimization problem.<n>We formulate the BBM92 quantum key distribution (QKD) secret-key-rate analysis for a continuous-wave-pumped broadband source.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entanglement-based networks provide a scalable framework for multiuser quantum communication by passively routing spectrally correlated photon pairs across interconnected nodes. Several wavelength-allocation schemes have been demonstrated experimentally, but these designs do not yet give a general way to determine how spectral use, receiver load, repeated connections, and fan-out constrain one another. We address this problem through the network's connectivity graph, where the wavelength assignment becomes a resource-optimization problem. For one-sided fan-out, assigning each link to a center and grouping links with the same center gives an exact optimization for arbitrary networks and fan-out limits. We solve this for complete networks and for complete networks in which every user has one excluded partner. Allowing both conjugate wavelengths to fan out changes the resource landscape: a balanced binary hierarchy attains the minimum spectral-layer count for a complete network while reducing the maximum receiver load to logarithmic in the number of users. An eight-user complete network then makes explicit the competing roles of spectral efficiency, receiver load, redundancy, and fan-out. We include the passive-splitter loss and the dependence of the key rate on the delivered pair flux to determine the minimum total pair-generation rate required to meet the prescribed targets. Finally, we formulate the corresponding BBM92 quantum key distribution (QKD) secret-key-rate analysis for a continuous-wave-pumped broadband source, with true and accidental coincidences evaluated between detector channels at the two endpoint users and relative layer pair-generation rates fixed by the source spectrum. This framework, therefore, provides a direct route from exact network resource laws to the design and comparison of passive entanglement architectures under experimentally specified hardware constraints.

Related papers

• Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks [11.448612804302783]
  We present a three-stage pipeline for efficient user-to-user frequency allocation in a quantum network.<n>We numerically demonstrate this approach on a representative ring network and a Manhattan incumbent local exchange carrier topology.
  arXiv  Detail & Related papers  (2026-07-16T21:20:35Z)
• Unrolled Neural Networks for Constrained Optimization [83.29547301151177]
  Our framework comprises two coupled neural networks that jointly approximate the saddle point of the Lagrangian.<n>We numerically evaluate the framework on mixed-integer quadratic programs and power allocation in wireless networks.
  arXiv  Detail & Related papers  (2026-01-24T03:12:41Z)
• A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking [42.12511690811535]
  We develop an analytical network digital twin (NDT) that predicts link duty cycles from network context.<n>NDT accurately predicts link duty cycles and congestion patterns with up to a 5000x speedup over packet-level simulation.
  arXiv  Detail & Related papers  (2025-12-11T18:04:30Z)
• An Optical Interconnect for Modular Quantum Computers [0.44624755182670844]
  scaling up quantum computers requires an optical interconnect.<n>We propose a multi-group structure where the group switch routes photons emitted by computational end nodes.<n>We implement a prototype three-node switched interconnect and create two-hop entanglement with fidelities of at least 0.6.
  arXiv  Detail & Related papers  (2024-12-12T14:16:50Z)
• Routing and Spectrum Allocation in Broadband Quantum Entanglement Distribution [4.404652389362312]
  We investigate resource allocation for quantum entanglement over an optical network.<n>We develop a routing and spectrum allocation scheme for distributing entangled photon pairs over such a network.<n>We find that a spectrum allocation approach that achieves higher minimum EPR-pair rate can perform significantly worse when the median EPR-pair rate, Jain index, and computational resources are considered.
  arXiv  Detail & Related papers  (2024-04-12T18:11:25Z)
• 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)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Entanglement Routing Based on Fidelity Curves [0.0]
  We consider quantum networks where each link is characterized by a trade-off between the entanglement generation rate and fidelity. Two entanglement distribution models are considered: one where entangled qubits are distributed one at a time, and a flow model where a large number of entangled qubits are distributed simultaneously.
  arXiv  Detail & Related papers  (2023-03-22T18:59:36Z)
• Bandwidth-efficient distributed neural network architectures with application to body sensor networks [73.02174868813475]
  This paper describes a conceptual design methodology to design distributed neural network architectures. We show that the proposed framework enables up to a factor 20 in bandwidth reduction with minimal loss. While the application focus of this paper is on wearable brain-computer interfaces, the proposed methodology can be applied in other sensor network-like applications as well.
  arXiv  Detail & Related papers  (2022-10-14T12:35:32Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio [101.84651388520584]
  This paper presents a new framework named network adjustment, which considers network accuracy as a function of FLOPs. Experiments on standard image classification datasets and a wide range of base networks demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2020-04-06T15:51:00Z)
• Wireless Power Control via Counterfactual Optimization of Graph Neural Networks [124.89036526192268]
  We consider the problem of downlink power control in wireless networks, consisting of multiple transmitter-receiver pairs communicating over a single shared wireless medium. To mitigate the interference among concurrent transmissions, we leverage the network topology to create a graph neural network architecture. We then use an unsupervised primal-dual counterfactual optimization approach to learn optimal power allocation decisions.
  arXiv  Detail & Related papers  (2020-02-17T07:54:39Z)

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.