A Quantum Overlay Network for Efficient Entanglement Distribution
- URL: http://arxiv.org/abs/2212.01694v1
- Date: Sat, 3 Dec 2022 21:20:30 GMT
- Title: A Quantum Overlay Network for Efficient Entanglement Distribution
- Authors: Shahrooz Pouryousef, Nitish K. Panigrahy, Don Towsley
- Abstract summary: We introduce Quantum Overlay Networks (QONs) for efficient entanglement distribution in quantum networks.
When the demand to create end-to-end user entanglements is low, QONs can generate and store maximally entangled Bell pairs.
We show that QONs fare well by a factor of 40% with respect to meeting surge and changing demands compared to traditional non-overlay proposals.
- Score: 15.034732044326752
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Distributing quantum entanglements over long distances is essential for the
realization of a global scale quantum Internet. Most of the prior work and
proposals assume an on-demand distribution of entanglements which may result in
significant network resource under-utilization. In this work, we introduce
Quantum Overlay Networks (QONs) for efficient entanglement distribution in
quantum networks. When the demand to create end-to-end user entanglements is
low, QONs can generate and store maximally entangled Bell pairs (EPR pairs) at
specific overlay storage nodes of the network. Later, during peak demands,
requests can be served by performing entanglement swaps either over a direct
path from the network or over a path using the storage nodes. We solve the link
entanglement and storage resource allocation problem in such a QON using a
centralized optimization framework. We evaluate the performance of our proposed
QON architecture over a wide number of network topologies under various
settings using extensive simulation experiments. Our results demonstrate that
QONs fare well by a factor of 40% with respect to meeting surge and changing
demands compared to traditional non-overlay proposals. QONs also show
significant improvement in terms of average entanglement request service delay
over non-overlay approaches.
Related papers
- Adaptive User-Centric Entanglement Routing in Quantum Data Networks [5.421492821020181]
Distributed quantum computing (DQC) holds immense promise in harnessing the potential of quantum computing by interconnecting multiple small quantum computers (QCs) through a quantum data network (QDN)
establishing long-distance quantum entanglement between two QCs for quantum teleportation within the QDN is a critical aspect, and it involves entanglement routing.
Existing approaches have mainly focused on optimizing entanglement performance for current entanglement connection (EC) requests.
We present a novel user-centric entanglement routing problem that spans an extended period to maximize entanglement success rate while adhering to the user's budget constraint.
arXiv Detail & Related papers (2024-04-13T17:20:00Z) - A Control Architecture for Entanglement Generation Switches in Quantum
Networks [1.0282274843007797]
Entanglement between quantum network nodes is often produced using intermediary devices - such as heralding stations - as a resource.
Here, we propose a cost-effective architecture to connect many quantum network nodes via a central quantum network hub called an Entanglement Generation Switch (EGS)
The EGS allows multiple quantum nodes to be connected at a fixed resource cost, by sharing the resources needed to make entanglement.
arXiv Detail & Related papers (2023-09-05T10:06:48Z) - Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud
Computing [73.7522199491117]
Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources.
The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning.
We propose a resource allocation model to provision quantum computing and networking resources.
arXiv Detail & Related papers (2023-07-25T00:38:46Z) - Scaling Limits of Quantum Repeater Networks [62.75241407271626]
Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing.
Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability.
In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
arXiv Detail & Related papers (2023-05-15T14:57:01Z) - 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) - Adaptive, Continuous Entanglement Generation for Quantum Networks [59.600944425468676]
Quantum networks rely on entanglement between qubits at distant nodes to transmit information.
We present an adaptive scheme that uses information from previous requests to better guide the choice of randomly generated quantum links.
We also explore quantum memory allocation scenarios, where a difference in latency performance implies the necessity of optimal allocation of resources for quantum networks.
arXiv Detail & Related papers (2022-12-17T05:40:09Z) - Tactile Network Resource Allocation enabled by Quantum Annealing based
on ILP Modeling [0.0]
We propose a new framework for short-time network optimization based on quantum computing (QC) and integer linear program (ILP) models.
We map a nearly real-world ILP model for resource provisioning to a quadratic unconstrained binary optimization problem, which is solvable on quantum annealer (QA)
arXiv Detail & Related papers (2022-12-14T14:12:03Z) - 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) - 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.