Satellite-Aided Entanglement Distribution for Optimized Quantum Networks

• URL: http://arxiv.org/abs/2502.18107v1
• Date: Tue, 25 Feb 2025 11:21:20 GMT
• Title: Satellite-Aided Entanglement Distribution for Optimized Quantum Networks
• Authors: Jakob Kaltoft Søndergaard, René Bødker Christensen, Petar Popovski,
• Abstract summary: Quantum internet needs to ensure timely provision of entangled qubits to be used in tasks that involve distributed quantum computing or sensing.<n>Pre-distribution of entanglements should aim to minimize the amount of qubits used, as this decreases the risk of decoherence and thus degradation of the entangled state.<n>Satellite-aided Entanglement Distribution (SED) can significantly enhance the performance of small quantum networks.
• Score: 30.362736262973463
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum internet needs to ensure timely provision of entangled qubits to be used in tasks that involve distributed quantum computing or sensing. This has been addressed by a top-down approach of optimized quantum networks [arXiv:2107.10275], in which entanglement is distributed prior to receiving tasks. Upon the task arrival, the desired entanglement state is attained with local operations and classical communication. The pre-distribution of entanglements should aim to minimize the amount of qubits used, as this decreases the risk of decoherence and thus degradation of the entangled state. The optimized quantum networks consider a multi-hop optical network and in this work we are supplementing it with Satellite-aided Entanglement Distribution (SED). The motivation is that satellites can shortcut the topology and place the entanglement at two nodes not directly connected through the optical network. We devise an algorithm for strategic placement of entanglements with SED, which results in a decrease in the number of qubits used in pre-distribution of entanglement. The numerical results show that SED can significantly enhance the performance of small quantum networks, while Entanglement-sharing Constraints (EC) are critical for large networks.

Related papers

• Space-Based Quantum Internet: Entanglement Distribution in Time-Varying LEO Constellations [36.80897914664451]
  We introduce a novel framework that leverages the dynamic nature of LEO satellite networks to enhance entanglement distribution efficiency. Our approach demonstrates superior performance in reducing entanglement drop rates and improving throughput compared to conventional methods.
  arXiv  Detail & Related papers  (2024-09-25T15:33:08Z)
• Resource Placement for Rate and Fidelity Maximization in Quantum Networks [8.707824275470188]
  Existing classical optical network infrastructure cannot be immediately used for quantum network applications due to photon loss. We present a comprehensive framework for network planning, aiming to efficiently distributing quantum repeaters across existing infrastructure. We explore the effect of quantum memory multiplexing within quantum repeaters, as well as the influence of memory coherence time on quantum network utility.
  arXiv  Detail & Related papers  (2023-08-30T18:45:21Z)
• The Quantum Internet: an Efficient Stabilizer states Distribution Scheme [0.0]
  Quantum networks constitute a major part of quantum technologies. They will boost quantum computing drastically by providing a scalable modular architecture of quantum chips. They will provide the backbone of the future quantum internet, allowing for high margins of security.
  arXiv  Detail & Related papers  (2023-05-04T08:53:38Z)
• 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)
• 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)
• DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks [54.03701670739067]
  We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
  arXiv  Detail & Related papers  (2022-09-16T02:44:52Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Strong entanglement distribution of quantum networks [3.6720510088596297]
  Large-scale quantum networks have been employed to overcome practical constraints of transmissions and storage for single entangled systems. We show any connected network consisting of generalized EPR states and GHZ states satisfies strong CKW monogamy inequality in terms of bipartite entanglement measure. We classify entangled quantum networks by distinguishing network configurations under local unitary operations.
  arXiv  Detail & Related papers  (2021-09-27T08:45:18Z)
• The Computational and Latency Advantage of Quantum Communication Networks [70.01340727637825]
  This article summarises the current status of classical communication networks. It identifies some critical open research challenges that can only be solved by leveraging quantum technologies.
  arXiv  Detail & Related papers  (2021-06-07T06:31:02Z)
• 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)
• A Proactive Connection Setup Mechanism for Large Quantum Networks [0.0]
  It is necessary to have an efficient mechanism to distribute entanglement among quantum network nodes. This paper presents a novel way to quicken connection setup between two nodes using historical data. Results show, with quantum network size increase, the proposed approach improves success rate of connection establishments.
  arXiv  Detail & Related papers  (2020-12-25T11:48:40Z)
• 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)

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.