TL;DR
This paper introduces an adaptive scheme for continuous entanglement generation in quantum networks that improves performance by leveraging past request information, achieving up to 95% enhancement over existing methods.
Contribution
The paper presents a novel adaptive approach for quantum entanglement generation that dynamically guides link creation based on previous requests, outperforming non-adaptive schemes.
Findings
Performance improvements of up to 75% and 95% over non-adaptive schemes.
Effective application on single-bottleneck and autonomous systems networks.
Demonstrated benefits in quantum memory allocation scenarios.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
