Adaptive, Continuous Entanglement Generation for Quantum Networks
- URL: http://arxiv.org/abs/2212.08806v1
- Date: Sat, 17 Dec 2022 05:40:09 GMT
- Title: Adaptive, Continuous Entanglement Generation for Quantum Networks
- Authors: Alexander Kolar, Allen Zang, Joaquin Chung, Martin Suchara, Rajkumar
Kettimuthu
- Abstract summary: 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.
- Score: 59.600944425468676
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum networks, which enable the transfer of quantum information across
long distances, promise to provide exciting benefits and new possibilities in
many areas including communication, computation, security, and metrology. These
networks rely on entanglement between qubits at distant nodes to transmit
information; however, creation of these quantum links is not dependent on the
information to be transmitted. Researchers have explored schemes for continuous
generation of entanglement, where network nodes may generate entanglement links
before receiving user requests. In this paper we present an adaptive scheme
that uses information from previous requests to better guide the choice of
randomly generated quantum links before future requests are received. We
analyze parameter spaces where such a scheme may provide benefit and observe an
increase in performance of up to 75% over other continuous schemes on
single-bottleneck and autonomous systems networks. We also test the scheme for
other parameter choices and observe continued benefits of up to 95%. The power
of our adaptive scheme on a randomized request queue is demonstrated on a
single-bottleneck topology. We also explore quantum memory allocation
scenarios, where a difference in latency performance implies the necessity of
optimal allocation of resources for quantum networks.
Related papers
- 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) - 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) - A Quantum Overlay Network for Efficient Entanglement Distribution [15.034732044326752]
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.
arXiv Detail & Related papers (2022-12-03T21:20:30Z) - 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) - 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) - SeQUeNCe: A Customizable Discrete-Event Simulator of Quantum Networks [53.56179714852967]
This work develops SeQUeNCe, a comprehensive, customizable quantum network simulator.
We implement a comprehensive suite of network protocols and demonstrate the use of SeQUeNCe by simulating a photonic quantum network with nine routers equipped with quantum memories.
We are releasing SeQUeNCe as an open source tool and aim to generate community interest in extending it.
arXiv Detail & Related papers (2020-09-25T01:52:15Z)
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.