A Throughput Optimal Scheduling Policy for a Quantum Switch

• URL: http://arxiv.org/abs/2206.03205v1
• Date: Tue, 7 Jun 2022 11:49:32 GMT
• Title: A Throughput Optimal Scheduling Policy for a Quantum Switch
• Abstract summary: We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region.
• Score: 16.74626042261441
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We study a quantum switch that creates shared end-to-end entangled quantum states to multiple sets of users that are connected to it. Each user is connected to the switch via an optical link across which bipartite Bell-state entangled states are generated in each time-slot with certain probabilities, and the switch merges entanglements of links to create end-to-end entanglements for users. One qubit of an entanglement of a link is stored at the switch and the other qubit of the entanglement is stored at the user corresponding to the link. Assuming that qubits of entanglements of links decipher after one time-slot, we characterize the capacity region, which is defined as the set of arrival rates of requests for end-to-end entanglements for which there exists a scheduling policy that stabilizes the switch. We propose a Max-Weight scheduling policy and show that it stabilizes the switch for all arrival rates that lie in the capacity region. We also provide numerical results to support our analysis.

Related papers

• Optimal Scheduling in a Quantum Switch [1.8024397171920883]
  A quantum switch establishes, distributes, and maintains entanglements across a network. In contrast to a classical switching fabric, a quantum switch is a two sided queueing network. Our proof techniques analyse a two time scale separation phenomenon at the fluid scale for a general switch topology.
  arXiv  Detail & Related papers  (2025-01-09T17:08:01Z)
• Quantum Switches for Gottesman-Kitaev-Preskill Qubit-based All-Photonic Quantum Networks [0.0]
  We introduce a quantum switch for GKP-qubit-based quantum networks. Our quantum switch provides a way to realize quantum networks of arbitrary topology.
  arXiv  Detail & Related papers  (2024-02-05T04:34:48Z)
• 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)
• On the Analysis of a Multipartite Entanglement Distribution Switch [15.753505192876752]
  We study a quantum switch that distributes maximally entangled multipartite states to sets of users. In this work, we study a simple variant of this system, wherein the switch has infinite memory and the links that connect the users to the switch are identical.
  arXiv  Detail & Related papers  (2022-12-04T10:14:12Z)
• On the Capacity Region of a Quantum Switch with Entanglement Purification [17.138781986444222]
  Quantum switches are envisioned to be an integral component of future entanglement distribution networks. We characterize the capacity region of such a quantum switch under noisy channel transmissions and imperfect quantum operations.
  arXiv  Detail & Related papers  (2022-12-02T21:55:02Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems [71.78056556634196]
  This paper unifiedly addresses two kinds of key quantum secure tasks, i.e., quantum versions of secret sharing (SS) and symmetric private information retrieval (SPIR) In particular, two kinds of quantum extensions of SS are known; One is the classical-quantum (CQ) setting, in which the secret to be sent is classical information and the shares are quantum systems. We newly introduce the third setting, i.e., the entanglement-assisted (EA) setting, which is defined by modifying the CQ setting with allowing prior entanglement between the dealer and the end-user who recovers the secret by
  arXiv  Detail & Related papers  (2022-05-29T10:28:04Z)
• Feedback-assisted quantum search by continuous-time quantum walks [58.720142291102135]
  We address the quantum search of a target node on a cycle graph by means of a quantum walk assisted by continuous measurement and feedback. In particular, our protocol is able to drive the walker to a desired target node.
  arXiv  Detail & Related papers  (2022-01-12T16:59:53Z)
• Entanglement Swapping in Quantum Switches: Protocol Design and Stability Analysis [14.638996634412976]
  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.
  arXiv  Detail & Related papers  (2021-10-08T13:24:29Z)
• Stability Analysis of a Quantum Network with Max-Weight Scheduling [16.74626042261441]
  We study a quantum network that distributes entangled quantum states to multiple sets of users that are connected to the network. All the links of the network generate bipartite Bell-state entangled states in each time-slot with certain probabilities. We propose a Max-Weight scheduling policy and show that this policy stabilizes the network for all feasible arrival rates.
  arXiv  Detail & Related papers  (2021-06-01T22:19:33Z)
• Transmon platform for quantum computing challenged by chaotic fluctuations [55.41644538483948]
  We investigate the stability of a variant of a many-body localized (MBL) phase for system parameters relevant to current quantum processors. We find that these computing platforms are dangerously close to a phase of uncontrollable chaotic fluctuations.
  arXiv  Detail & Related papers  (2020-12-10T19:00:03Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

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.