Backward propagating quantum repeater protocol with multiple quantum memories

• URL: http://arxiv.org/abs/2205.04243v1
• Date: Mon, 9 May 2022 12:42:51 GMT
• Title: Backward propagating quantum repeater protocol with multiple quantum memories
• Authors: Yuhei Sekiguchi, Satsuki Okumura and Hideo Kosaka
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum repeaters with multiple quantum memories provide high throughput, low latency, and high fidelity quantum state (qubit) transfer over long distances. However, conventional quantum repeater protocols require full connections among the multiple quantum memories in a repeater node, which is technically challenging. Here, we propose a quantum repeater protocol based on backward propagating photon emission and absorption, where the quantum memories are multiplexed in the time-domain to speed up a single transmission channel without requiring full connectivity, drastically facilitating physical implementation. Although the protocol is described with nitrogen-vacancy (NV) centers in diamond, it is applicable to various physical systems and opens up the possibility of high-speed high-fidelity quantum networks for distributed quantum computation and quantum Internet.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09: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)
• Ultimate-rate quantum repeaters for quantum communications [0.0]
  Quantum repeaters are necessary to overcome the repeaterless bound. In this thesis, we give physical repeater designs for this achievability. We also propose practical repeater designs with near-term potential for real-world practical applications.
  arXiv  Detail & Related papers  (2023-06-15T02:19:18Z)
• Quantum Optical Memory for Entanglement Distribution [52.77024349608834]
  Entanglement of quantum states over long distances can empower quantum computing, quantum communications, and quantum sensing. Over the past two decades, quantum optical memories with high fidelity, high efficiencies, long storage times, and promising multiplexing capabilities have been developed.
  arXiv  Detail & Related papers  (2023-04-19T03:18:51Z)
• 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)
• 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)
• 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)
• Entanglement distribution with wavevector-multiplexed quantum memory [0.0]
  We show the WV-MUX-QM platform to provide quasi-deterministic entanglement generation over extended distances. We establish the entangled-bit (ebit) rate per number of employed nodes as a practical figure of merit.
  arXiv  Detail & Related papers  (2020-07-01T15:03:58Z)

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.