On the design and analysis of near-term quantum network protocols using Markov decision processes

• URL: http://arxiv.org/abs/2207.03403v2
• Date: Thu, 16 Nov 2023 13:36:00 GMT
• Title: On the design and analysis of near-term quantum network protocols using Markov decision processes
• Authors: Sumeet Khatri
• Abstract summary: 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.
• Score: 0.9065034043031668
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum internet is one of the frontiers of quantum information science research. It will revolutionize the way we communicate and do other tasks, and it will allow for tasks that are not possible using the current, classical internet. The backbone of a quantum internet is entanglement distributed globally in order to allow for such novel applications to be performed over long distances. Experimental progress is currently being made to realize quantum networks on a small scale, but much theoretical work is still needed in order to understand how best to distribute entanglement, especially with the limitations of near-term quantum technologies taken into account. This work provides an initial step towards this goal. In this work, we lay out a theory of near-term quantum networks based on Markov decision processes (MDPs), and we show that MDPs provide a precise and systematic mathematical framework to model protocols for near-term quantum networks that is agnostic to the specific implementation platform. We start by simplifying the MDP for elementary links introduced in prior work, and by providing new results on policies for elementary links. In particular, we show that the well-known memory-cutoff policy is optimal. Then we show how the elementary link MDP can be used to analyze a quantum network protocol in which we wait for all elementary links to be active before creating end-to-end links. We then provide an extension of the MDP formalism to two elementary links, which is useful for analyzing more sophisticated quantum network protocols. Here, as new results, we derive linear programs that give us optimal steady-state policies with respect to the expected fidelity and waiting time of the end-to-end link.

Related papers

• Towards a Unified Quantum Protocol Framework: Classification, Implementation, and Use Cases [0.5235143203977018]
  We present a framework for the unification and standardization of quantum network protocols. Our framework is available as an open-source repository, the Quantum Protocol Zoo.
  arXiv  Detail & Related papers  (2023-10-19T14:33:28Z)
• Quantum information spreading and scrambling in a distributed quantum network: A Hasse/Lamport diagrammatic approach [14.308249733521182]
  Large-scale quantum networks, known as quantum internet, hold great promises for advanced distributed quantum computing and long-distance quantum communication. We propose a novel diagrammatic way of visualizing information flow dynamics within the quantum network. We also propose a quantum information scrambling protocol, where a specific node scrambles secret quantum information across the entire network.
  arXiv  Detail & Related papers  (2023-09-19T06:48:42Z)
• 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)
• 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)
• Demonstration of teleportation across a quantum network code [0.0]
  We study measurement-based quantum network coding (MQNC), which is a protocol particularly suitable for noisy intermediate-scale quantum devices. In particular, we develop techniques to adapt MQNC to state-of-the-art superconducting processors and subsequently demonstrate successful teleportation of quantum information. The teleportation in our demonstration is shown to occur with fidelity higher than could be achieved via classical means, made possible by considering qubits from a polar cap of the Bloch Sphere.
  arXiv  Detail & Related papers  (2022-10-06T12:59:48Z)
• 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)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Quantum Federated Learning with Quantum Data [87.49715898878858]
  Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems. This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
  arXiv  Detail & Related papers  (2021-05-30T12:19:27Z)
• 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)
• Policies for elementary links in a quantum network [0.0]
  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.
  arXiv  Detail & Related papers  (2020-07-07T04:10:41Z)
• Multi-party quantum fingerprinting with weak coherent pulses: circuit design and protocol analysis [0.0]
  We introduce a novel multi-user quantum fingerprinting protocol that is ready to be implemented with existing technology. Much of the importance of our work arises from the fact that the obtained QCC figures of merit allow direct comparison with the best-known classical multi-user fingerprinting protocol.
  arXiv  Detail & Related papers  (2020-06-01T04:28:52Z)

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.