Quantum Circuit Switching with One-Way Repeaters in Star Networks

• URL: http://arxiv.org/abs/2405.19049v2
• Date: Fri, 01 Nov 2024 15:53:38 GMT
• Title: Quantum Circuit Switching with One-Way Repeaters in Star Networks
• Authors: Álvaro G. Iñesta, Hyeongrak Choi, Dirk Englund, Stephanie Wehner,
• Abstract summary: We analyze quantum circuit switching as a protocol to distribute quantum states in one-way quantum networks. We show that requests are met at a higher rate when packets are distributed in parallel, although sequential distribution can generally provide service to a larger number of users simultaneously.
• Score: 0.0
• License:
• Abstract: Distributing quantum states reliably among distant locations is a key challenge in the field of quantum networks. One-way quantum networks address this by using one-way communication and quantum error correction. Here, we analyze quantum circuit switching as a protocol to distribute quantum states in one-way quantum networks. In quantum circuit switching, pairs of users can request the delivery of multiple quantum states from one user to the other. After waiting for approval from the network, the states can be distributed either sequentially, forwarding one at a time along a path of quantum repeaters, or in parallel, sending batches of quantum states from repeater to repeater. Since repeaters can only forward a finite number of quantum states at a time, a pivotal question arises: is it advantageous to send them sequentially (allowing for multiple requests simultaneously) or in parallel (reducing processing time but handling only one request at a time)? We compare both approaches in a quantum network with a star topology. Using tools from queuing theory, we show that requests are met at a higher rate when packets are distributed in parallel, although sequential distribution can generally provide service to a larger number of users simultaneously. We also show that using a large number of quantum repeaters to combat channel losses limits the maximum distance between users, as each repeater introduces additional processing delays. These findings provide insight into the design of protocols for distributing quantum states in one-way quantum networks.

Related papers

• Entanglement distribution based on quantum walk in arbitrary quantum networks [6.37705397840332]
  We develop a series of scheme for generating high-dimensional entangled states via quantum walks with multiple coins or single coin. We also give entanglement distribution schemes on arbitrary quantum networks according to the above theoretical framework. Our work can serve as a building block for constructing larger and more complex quantum networks.
  arXiv  Detail & Related papers  (2024-07-05T08:26:41Z)
• Enhanced quantum state transfer: Circumventing quantum chaotic behavior [35.74056021340496]
  We show how to transfer few-particle quantum states in a two-dimensional quantum network. Our approach paves the way to short-distance quantum communication for connecting distributed quantum processors or registers.
  arXiv  Detail & Related papers  (2024-02-01T19:00:03Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• 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)
• Quantum repeaters: From quantum networks to the quantum internet [2.053047357590719]
  We review the conceptual frameworks and architectures for quantum repeaters. We discuss the various near-term proposals to overcome the limits to the communication rates set by point-to-point quantum communication.
  arXiv  Detail & Related papers  (2022-12-21T07:21:50Z)
• 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)
• Quantum Zeno Repeaters [0.0]
  Quantum repeaters pave the way for long-distance quantum communications and quantum Internet. Our work has potential to contribute to long distance quantum communications and quantum computing via quantum Zeno effect.
  arXiv  Detail & Related papers  (2022-06-17T13:56:44Z)
• Backward propagating quantum repeater protocol with multiple quantum memories [0.0]
  We propose a quantum repeater protocol based on backward propagating photon emission and absorption. It is applicable to various physical systems and opens up the possibility of high-speed high-fidelity quantum networks.
  arXiv  Detail & Related papers  (2022-05-09T12:42:51Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Telecom-heralded entanglement between remote multimode solid-state quantum memories [55.41644538483948]
  Future quantum networks will enable the distribution of entanglement between distant locations and allow applications in quantum communication, quantum sensing and distributed quantum computation. Here we report the demonstration of heralded entanglement between two spatially separated quantum nodes, where the entanglement is stored in multimode solid-state quantum memories. We also show that the generated entanglement is robust against loss in the heralding path, and demonstrate temporally multiplexed operation, with 62 temporal modes.
  arXiv  Detail & Related papers  (2021-01-13T14:31:54Z)

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.