Design and Simulation of the Adaptive Continuous Entanglement Generation Protocol

• URL: http://arxiv.org/abs/2502.01964v2
• Date: Sun, 16 Feb 2025 18:12:42 GMT
• Title: Design and Simulation of the Adaptive Continuous Entanglement Generation Protocol
• Authors: Caitao Zhan, Joaquin Chung, Allen Zang, Alexander Kolar, Rajkumar Kettimuthu,
• Abstract summary: A critical performance metric for quantum networks is the time-to-serve (TTS) for users' EP requests. In this paper, we study the Adaptive Continuous entanglement generation Protocol (ACP), which enables quantum network nodes to continuously generate EPs with their neighbors. ACP reduces TTS by up to 94% and increases entanglement fidelity by up to 0.05.
• Score: 41.82512234114899
• License:
• Abstract: Generating and distributing remote entangled pairs (EPs) is a primary function of quantum networks, as entanglement is the fundamental resource for key quantum network applications. A critical performance metric for quantum networks is the time-to-serve (TTS) for users' EP requests, which is the time to distribute EPs between the requested nodes. Minimizing the TTS is essential given the limited qubit coherence time. In this paper, we study the Adaptive Continuous entanglement generation Protocol (ACP), which enables quantum network nodes to continuously generate EPs with their neighbors, while adaptively selecting the neighbors to optimize TTS. Meanwhile, entanglement purification is used to mitigate decoherence in pre-generated EPs prior to the arrival of user requests. We extend the SeQUeNCe simulator to fully implement ACP and conduct extensive simulations across various network scales. Our results show that ACP reduces TTS by up to 94% and increases entanglement fidelity by up to 0.05.

Related papers

• Optimized Generation of Entanglement by Real-Time Ordering of Swapping Operations [4.152766500389854]
  Long-distance quantum communication in quantum networks faces significant challenges due to the constraints imposed by the no-cloning theorem. Most existing quantum communication protocols rely on the a priori distribution of entanglement pairs (EPs) We present a greedy algorithm that iteratively determines the best route and/or entanglement-swapping operation to perform at each stage based on the current network.
  arXiv  Detail & Related papers  (2024-05-13T06:43:11Z)
• Differentially Private Deep Q-Learning for Pattern Privacy Preservation in MEC Offloading [76.0572817182483]
  attackers may eavesdrop on the offloading decisions to infer the edge server's (ES's) queue information and users' usage patterns. We propose an offloading strategy which jointly minimizes the latency, ES's energy consumption, and task dropping rate, while preserving pattern privacy (PP) We develop a Differential Privacy Deep Q-learning based Offloading (DP-DQO) algorithm to solve this problem while addressing the PP issue by injecting noise into the generated offloading decisions.
  arXiv  Detail & Related papers  (2023-02-09T12:50:18Z)
• 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)
• 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)
• Pre-Distribution of Entanglements in Quantum Networks [1.258157541985447]
  Quantum network communication is challenging, as the No-Cloning theorem in quantum regime makes many classical techniques inapplicable. For long-distance communication, the only viable approach is teleportation of quantum states, which requires a prior distribution of entangled pairs (EPs) of qubits. We propose and investigate a complementary technique to reduce EP generation latency--to pre-distribute EPs over certain (pre-determined) pairs of network nodes.
  arXiv  Detail & Related papers  (2022-05-09T04:50:08Z)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)
• Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees [2.934854825488435]
  We develop techniques that minimize entanglement generation latency. We develop a dynamic programming algorithm to select an optimal swapping-tree for a single pair of nodes. We present simulation results which show that our solutions outperform the prior approaches by an order of magnitude.
  arXiv  Detail & Related papers  (2021-12-21T06:04:51Z)
• EdgeBERT: Sentence-Level Energy Optimizations for Latency-Aware Multi-Task NLP Inference [82.1584439276834]
  Transformer-based language models such as BERT provide significant accuracy improvement for a multitude of natural language processing (NLP) tasks. We present EdgeBERT, an in-depth algorithm- hardware co-design for latency-aware energy optimization for multi-task NLP.
  arXiv  Detail & Related papers  (2020-11-28T19:21:47Z)
• Efficient 2D Tensor Network Simulation of Quantum Systems [6.074275058563179]
  2D tensor networks such as Projected Entangled States (PEPS) are well-suited for key classes of physical systems and quantum circuits. We propose new algorithms and software abstractions for PEPS-based methods, accelerating the bottleneck operation of contraction and scalableization of a subnetwork.
  arXiv  Detail & Related papers  (2020-06-26T22:36:56Z)
• Continual Weight Updates and Convolutional Architectures for Equilibrium Propagation [69.87491240509485]
  Equilibrium Propagation (EP) is a biologically inspired alternative algorithm to backpropagation (BP) for training neural networks. We propose a discrete-time formulation of EP which enables to simplify equations, speed up training and extend EP to CNNs. Our CNN model achieves the best performance ever reported on MNIST with EP.
  arXiv  Detail & Related papers  (2020-04-29T12:14:06Z)

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.