Policies for elementary links in a quantum network

• URL: http://arxiv.org/abs/2007.03193v4
• Date: Fri, 3 Sep 2021 10:07:00 GMT
• Title: Policies for elementary links in a quantum network
• Authors: Sumeet Khatri
• Abstract summary: An important problem, especially for near-term quantum networks, is to develop optimal entanglement distribution protocols. We address this problem by initiating the study of quantum network protocols for entanglement distribution using the theory of decision processes. We show that the previously-studied memory-cutoff protocol can be phrased as a policy within our decision process framework.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Distributing entanglement over long distances is one of the central tasks in quantum networks. An important problem, especially for near-term quantum networks, is to develop optimal entanglement distribution protocols that take into account the limitations of current and near-term hardware, such as quantum memories with limited coherence time. We address this problem by initiating the study of quantum network protocols for entanglement distribution using the theory of decision processes, such that optimal protocols (referred to as policies in the context of decision processes) can be found using dynamic programming or reinforcement learning algorithms. As a first step, in this work we focus exclusively on the elementary link level. We start by defining a quantum decision process for elementary links, along with figures of merit for evaluating policies. We then provide two algorithms for determining policies, one of which we prove to be optimal (with respect to fidelity and success probability) among all policies. Then we show that the previously-studied memory-cutoff protocol can be phrased as a policy within our decision process framework, allowing us to obtain several new fundamental results about it. The conceptual developments and results of this work pave the way for the systematic study of the fundamental limitations of near-term quantum networks, and the requirements for physically realizing them.

Related papers

• Routing in Quantum Networks with End-to-End Knowledge [10.955844285189373]
  We introduce an approach that facilitates the establishment of paths capable of delivering end-to-end fidelity above a specified threshold. We define algorithms that are specific instances of this approach and evaluate them in comparison to Dijkstra shortest path algorithm and a fully knowledge-aware algorithm through simulations. Our results demonstrate that one of the grey box algorithms consistently outperforms the other methods in delivering paths above the fidelity threshold.
  arXiv  Detail & Related papers  (2024-07-19T15:34:51Z)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Resource Management in Quantum Virtual Private Networks [10.257460386235024]
  We provide insights into the potential of genetic and learning-based algorithms for optimizing qVPNs. Our findings demonstrate that compared to traditional greedy based links, genetic and learning-based algorithms can identify better paths.
  arXiv  Detail & Related papers  (2023-05-05T01:19:41Z)
• 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)
• Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning [0.6249768559720122]
  Future quantum technologies will rely on networks of shared entanglement between spatially separated nodes. We provide improved protocols/policies for entanglement distribution along a linear chain of nodes.
  arXiv  Detail & Related papers  (2023-03-01T19:05:32Z)
• 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)
• On the design and analysis of near-term quantum network protocols using Markov decision processes [0.9065034043031668]
  Theory of near-term quantum networks based on Markov decision processes (MDPs) MDPs provide a precise and systematic mathematical framework to model protocols for near-term quantum networks. New results show that the well-known memory-cutoff policy is optimal.
  arXiv  Detail & Related papers  (2022-07-07T16:18:59Z)
• Quantum Reinforcement Learning via Policy Iteration [6.961253535504979]
  We provide a general framework for performing quantum reinforcement learning via policy iteration. We validate our framework by designing and analyzing: emphquantum policy evaluation methods for infinite horizon discounted problems. We study the theoretical and experimental performance of our quantum algorithms on two environments from OpenAI's Gym.
  arXiv  Detail & Related papers  (2022-03-03T18:08:17Z)
• Experimental multi-state quantum discrimination through a Quantum network [63.1241529629348]
  We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information. The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
  arXiv  Detail & Related papers  (2021-07-21T09:26:48Z)
• 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)
• 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.