Entanglement Swapping in Quantum Switches: Protocol Design and Stability Analysis

• URL: http://arxiv.org/abs/2110.04116v2
• Date: Mon, 22 May 2023 03:13:08 GMT
• Title: Entanglement Swapping in Quantum Switches: Protocol Design and Stability Analysis
• Authors: Wenhan Dai, Anthony Rinaldi, and Don Towsley
• Abstract summary: Quantum switches are critical components in quantum networks, distributing maximally entangled pairs among end nodes by entanglement swapping. In this work, we design protocols that schedule entanglement swapping operations in quantum switches.
• Score: 14.638996634412976
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum switches are critical components in quantum networks, distributing maximally entangled pairs among end nodes by entanglement swapping. In this work, we design protocols that schedule entanglement swapping operations in quantum switches. Entanglement requests randomly arrive at the switch, and the goal of an entanglement swapping protocol is to stabilize the quantum switch so that the number of unfinished entanglement requests is bounded with a high probability. We determine the capacity region for the rates of entanglement requests and develop entanglement swapping protocols to stabilize the switch. Among these protocols, the on-demand protocols are not only computationally efficient, but also achieve high fidelity and low latency demonstrated by results obtained using a quantum network discrete event simulator.

Related papers

• Simple loss-tolerant protocol for GHZ-state distribution in a quantum network [0.0]
  We propose a simple loss-tolerant protocol for the Greenberger-Horne-Zeilinger state distribution. Our protocol does not use quantum repeaters and is achievable with current quantum optics technology.
  arXiv  Detail & Related papers  (2024-04-30T11:16:37Z)
• Secure and Efficient Entanglement Distribution Protocol for Near-Term Quantum Internet [1.7562083088615124]
  This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links. The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation.
  arXiv  Detail & Related papers  (2023-12-10T05:38:40Z)
• The Quantum Internet: an Efficient Stabilizer states Distribution Scheme [0.0]
  Quantum networks constitute a major part of quantum technologies. They will boost quantum computing drastically by providing a scalable modular architecture of quantum chips. They will provide the backbone of the future quantum internet, allowing for high margins of security.
  arXiv  Detail & Related papers  (2023-05-04T08:53:38Z)
• 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)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Scalable fast benchmarking for individual quantum gates with local twirling [1.7995166939620801]
  We propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates. We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit.
  arXiv  Detail & Related papers  (2022-03-19T13:01:14Z)
• Benchmarking of Quantum Protocols [0.9176056742068812]
  We consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols.
  arXiv  Detail & Related papers  (2021-11-03T21:17:04Z)
• 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)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)

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.