Scheduling Quantum Teleportation with Noisy Memories

• URL: http://arxiv.org/abs/2205.06300v1
• Date: Thu, 12 May 2022 18:29:42 GMT
• Title: Scheduling Quantum Teleportation with Noisy Memories
• Authors: Aparimit Chandra (1), Wenhan Dai (1 and 2), Don Towsley (1) ((1) University of Massachusetts Amherst, (2) Massachusetts Institute of Technology)
• Abstract summary: We quantify the effect of decoherence on fidelity at a node in a quantum network due to the storage of qubits in noisy memory platforms. We show that fidelity at a node is a linear sum of terms, exponentially decaying with time, where the decay rate depends on the decoherence rate of the memory platform. We prove that serving qubits in a Last In First Out order with pushout for buffer overflow management is optimal in terms of average fidelity.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum teleportation channels can overcome the effects of photonic loss, a major challenge in the implementation of a quantum network over fiber. Teleportation channels are created by distributing an entangled state between two nodes which is a probabilistic process requiring classical communication. This causes critical delays that can cause information loss as quantum data suffers from decoherence when stored in memory. In this work, we quantify the effect of decoherence on fidelity at a node in a quantum network due to the storage of qubits in noisy memory platforms. We model the memory platform as a buffer that stores incoming qubits waiting for the creation of a teleportation channel. Memory platforms are parameterized with decoherence rate and buffer size, in addition to the order in which the incoming qubits are served. We show that fidelity at a node is a linear sum of terms, exponentially decaying with time, where the decay rate depends on the decoherence rate of the memory platform. This allows us to utilize Laplace Transforms to derive efficiently computable functions of average fidelity with respect to the load, buffer size, and decoherence rate of the memory platform. We prove that serving qubits in a Last In First Out order with pushout for buffer overflow management is optimal in terms of average fidelity. Lastly, we apply this framework to model a single repeater node to calculate the average fidelity of the teleportation channels created by this repeater assuming perfect gate operations.

Related papers

• Entangling Quantum Memories at Channel Capacity [3.152708951218456]
  Entangling quantum memories, mediated by optical-frequency or microwave channels, is key for linking qubits across short and long ranges. We show that a cavity-assisted memory-photon interface can be used to entangle matter memories with Gottesman-Kitaev-Preskill (GKP) photonic qudits.
  arXiv  Detail & Related papers  (2024-06-06T17:22:11Z)
• Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time [53.56179714852967]
  We explore entanglement distribution using quantum repeaters with optimized buffer time. We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory. When imperfect operations are considered, however, we make the surprising observation that the per-memory entanglement rate decreases with increasing number of memories.
  arXiv  Detail & Related papers  (2023-05-23T23:23:34Z)
• Field-deployable Quantum Memory for Quantum Networking [62.72060057360206]
  We present a quantum memory engineered to meet real-world deployment and scaling challenges. The memory technology utilizes a warm rubidium vapor as the storage medium, and operates at room temperature. We demonstrate performance specifications of high-fidelity retrieval (95%) and low operation error $(10-2)$ at a storage time of 160 $mu s$ for single-photon level quantum memory operations.
  arXiv  Detail & Related papers  (2022-05-26T00:33:13Z)
• Entanglement between a telecom photon and an on-demand multimode solid-state quantum memory [52.77024349608834]
  We show the first demonstration of entanglement between a telecom photon and a collective spin excitation in a multimode solid-state quantum memory. We extend the entanglement storage in the quantum memory for up to 47.7$mu$s, which could allow for the distribution of entanglement between quantum nodes separated by distances of up to 10 km.
  arXiv  Detail & Related papers  (2021-06-09T13:59:26Z)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• 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)
• 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)
• Efficient optimization of cut-offs in quantum repeater chains [0.0]
  We develop an algorithm for computing the probability distribution of the waiting time and fidelity of entanglement produced by repeater chain protocols. We use the algorithm to optimize cut-offs in order to maximize secret-key rate between the end nodes of the repeater chain.
  arXiv  Detail & Related papers  (2020-05-11T09:17:21Z)

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.