FENDI: Toward High-Fidelity Entanglement Distribution in the Quantum Internet

• URL: http://arxiv.org/abs/2301.08269v3
• Date: Tue, 24 Oct 2023 16:37:03 GMT
• Title: FENDI: Toward High-Fidelity Entanglement Distribution in the Quantum Internet
• Authors: Huayue Gu, Zhouyu Li, Ruozhou Yu, Xiaojian Wang, Fangtong Zhou, Jianqing Liu, Guoliang Xue
• Abstract summary: A quantum network distributes quantum entanglements between remote nodes, and is key to many applications in secure communication, quantum sensing and distributed quantum computing. This paper explores the fundamental trade-off between the throughput and the quality of entanglement distribution in a multi-hop quantum repeater network.
• Score: 12.103184144665637
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A quantum network distributes quantum entanglements between remote nodes, and is key to many applications in secure communication, quantum sensing and distributed quantum computing. This paper explores the fundamental trade-off between the throughput and the quality of entanglement distribution in a multi-hop quantum repeater network. Compared to existing work which aims to heuristically maximize the entanglement distribution rate (EDR) and/or entanglement fidelity, our goal is to characterize the maximum achievable worst-case fidelity, while satisfying a bound on the maximum achievable expected EDR between an arbitrary pair of quantum nodes. This characterization will provide fundamental bounds on the achievable performance region of a quantum network, which can assist with the design of quantum network topology, protocols and applications. However, the task is highly non-trivial and is NP-hard as we shall prove. Our main contribution is a fully polynomial-time approximation scheme to approximate the achievable worst-case fidelity subject to a strict expected EDR bound, combining an optimal fidelity-agnostic EDR-maximizing formulation and a worst-case isotropic noise model. The EDR and fidelity guarantees can be implemented by a post-selection-and-storage protocol with quantum memories. By developing a discrete-time quantum network simulator, we conduct simulations to show the characterized performance region (the approximate Pareto frontier) of a network, and demonstrate that the designed protocol can achieve the performance region while existing protocols exhibit a substantial gap.

Related papers

• Optimized Distribution of Entanglement Graph States in Quantum Networks [2.934854825488435]
  In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently.
  arXiv  Detail & Related papers  (2024-04-30T22:00:25Z)
• Performance metrics for the continuous distribution of entanglement in multi-user quantum networks [0.0]
  Entangled states shared among distant nodes are frequently used in quantum network applications. In this paper, we focus on the steady-state performance analysis of protocols for continuous distribution of entanglement. One of the main conclusions from our analysis is that the entanglement consumption rate has a greater impact on the protocol performance than the fidelity requirements.
  arXiv  Detail & Related papers  (2023-07-03T23:55:02Z)
• Scalable Quantum Repeater Deployment Modeling [3.7710541619011737]
  Long-distance quantum communication presents a significant challenge as maintaining the fidelity of qubits can be difficult. We present novel models to quickly determine a minimum number of quantum repeaters to deploy in large-scale networks.
  arXiv  Detail & Related papers  (2023-05-16T23:54:41Z)
• 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)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• 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)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Entangling Quantum Generative Adversarial Networks [53.25397072813582]
  We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN) We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-04-30T20:38:41Z)
• Distributing Multipartite Entanglement over Noisy Quantum Networks [0.0]
  A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. We present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories.
  arXiv  Detail & Related papers  (2021-03-26T22:48:05Z)

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.