Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible

• URL: http://arxiv.org/abs/2203.10318v1
• Date: Sat, 19 Mar 2022 12:55:56 GMT
• Title: Exact rate analysis for quantum repeaters with imperfect memories and entanglement swapping as soon as possible
• Authors: Lars Kamin, Evgeny Shchukin, Frank Schmidt, Peter van Loock
• Abstract summary: We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. We consider additional tools and parameters such as memory cut-offs, multiplexing, initial state and swapping gate fidelities.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present an exact rate analysis for a secret key that can be shared among two parties employing a linear quantum repeater chain. One of our main motivations is to address the question whether simply placing quantum memories along a quantum communication channel can be beneficial in a realistic setting. The underlying model assumes deterministic entanglement swapping of single-spin quantum memories and it excludes probabilistic entanglement distillation, and thus two-way classical communication, on higher nesting levels. Within this framework, we identify the essential properties of any optimal repeater scheme: entanglement distribution in parallel, entanglement swapping as soon and parallel quantum storage as little as possible. While these features are obvious or trivial for the simplest repeater with one middle station, for more stations they cannot always be combined. We propose an optimal scheme including channel loss and memory dephasing, proving its optimality for the case of two stations and conjecturing it for the general case. In an even more realistic setting, we consider additional tools and parameters such as memory cut-offs, multiplexing, initial state and swapping gate fidelities, and finite link coupling efficiencies in order to identify potential regimes in memory-assisted quantum key distribution beyond one middle station that exceed the rates of the smallest quantum repeaters as well as those obtainable in all-optical schemes unassisted by stationary memory qubits and two-way classical communication.

Related papers

• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Generalized quantum repeater graph states [1.7635061227370266]
  We present a new approach to ensure the loss tolerance of distributing a single ebit. We demonstrate that our new scheme significantly outperforms the previous work with much flexibility. These findings offer new insights into the scalability and reliability of loss-tolerant quantum networks.
  arXiv  Detail & Related papers  (2024-07-01T16:21:37Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Optimal entanglement swapping in quantum repeaters [0.0]
  We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process. We show that the commonly used "doubling" scheme does not always produce the best possible raw rate. Our approach provides the minimal possible waiting time of quantum repeaters in a fairly general physical setting.
  arXiv  Detail & Related papers  (2021-09-02T09:02:40Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Multiplexed quantum repeaters based on dual-species trapped-ion systems [0.8819673391477034]
  Trapped ions form an advanced technology platform for quantum information processing with long qubit coherence times. These traits make them attractive not only for quantum computing but also for quantum networking. Dedicated, special-purpose trapped-ion processors in conjunction with suitable interconnecting hardware can be used to form quantum repeaters.
  arXiv  Detail & Related papers  (2021-05-14T08:35:41Z)
• Overcoming the repeaterless bound in continuous-variable quantum communication without quantum memories [0.0]
  One of the main problems in quantum communications is how to achieve high rates at long distances. We introduce a continuous-variable protocol which overcomes the repeaterless bound and scales like the single-repeater bound. We show that our scheme can be extended to longer repeater chains using quantum memories.
  arXiv  Detail & Related papers  (2021-05-08T04:02:17Z)
• Environment-assisted bosonic quantum communications [0.0]
  We consider a quantum relay which is used by two parties to perform several continuous-variable protocols of quantum communication. In the worst case scenario where bipartite entanglement is completely lost at the relay, we show that the various protocols can be reactivated by the assistance of classical (separable) correlations in the environment. Our findings are confirmed by a proof-of-principle experiment where we show, for the first time, that memory effects in the environment can drastically enhance the performance of a quantum relay.
  arXiv  Detail & Related papers  (2020-03-20T12: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.