On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations

Abstract

Losses are one of the main bottlenecks for the distribution of entanglement in quantum networks, which can be overcome by the implementation of quantum repeaters. The most basic form of a quantum repeater chain is the swap ASAP repeater chain. In such a repeater chain, elementary links are probabilistically generated and deterministically swapped as soon as two adjacent links have been generated. As each entangled state is waiting to be swapped, decoherence is experienced, turning the fidelity of the entangled state between the end nodes of the chain into a random variable. Fully characterizing the (average) fidelity as the repeater chain grows is still an open problem. Here, we analytically investigate the case of equally-spaced repeaters, where we find exact analytic formulae for all moments of the fidelity up to 25 segments. We obtain these formulae by providing a general solution in terms of a generating function; a function whose n'th term in its Maclaurin series yields the moments of the fidelity for n segments. We generalize this approach as well to a global cut-off policy -- a method for increasing fidelity at the cost of longer entanglement delivery times -- allowing for fast optimization of the cut-off parameter by eliminating the need for Monte Carlo simulation. We furthermore find simple approximations of the average fidelity that are exponentially tight, and, for up to 10 segments, the full distribution of the delivered fidelity. We use this to analytically calculate the secret-key rate, both with and without binning methods.

Accepted in Quantum. 36 pages, 13 figures

References in corpus (36)

• Quantum cryptography: Public key distribution and coin tossing
• The Security of Practical Quantum Key Distribution
• Quantum secret sharing
• Distributed Quantum Computation over Noisy Channels
• Quantum repeaters: From quantum networks to the quantum internet
• From Classical to Quantum Shannon Theory
• Graph States for Quantum Secret Sharing
• Distributed quantum computation via optical fibres
• Longer-Baseline Telescopes Using Quantum Repeaters
• Performance and structure of single-mode bosonic codes
• Multiplexed Memory-Insensitive Quantum Repeaters
• Fault-tolerant bosonic quantum error correction with the surface-GKP code
• Improved quantum capacity bounds of Gaussian loss channels and achievable rates with Gottesman-Kitaev-Preskill codes
• Near-term quantum-repeater experiments with nitrogen-vacancy centers: Overcoming the limitations of direct transmission
• A general framework for randomized benchmarking
• On the waiting time in quantum repeaters with probabilistic entanglement swapping
• Rate analysis for a hybrid quantum repeater
• Tools for quantum network design
• Practical figures of merit and thresholds for entanglement distribution in quantum networks
• Parameter regimes for a single sequential quantum repeater
• Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node
• Designing Quantum Networks Using Preexisting Infrastructure
• Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs
• Requirements for a processing-node quantum repeater on a real-world fiber grid
• Quantum repeater architecture with hierarchically optimized memory buffer times
• Quantum key distribution over quantum repeaters with encoding: Using Error Detection as an Effective Post-Selection Tool
• Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time
• Deep reinforcement learning for key distribution based on quantum repeaters
• Near-term $n$ to $k$ distillation protocols using graph codes
• Quantum limits of parameter estimation in long-baseline imaging
• Real zeros of 2F1 hypergeometric polynomials
• Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies
• Exact Solution of the Discrete (1+1)-dimensional RSOS Model with Field and Surface Interactions
• Log-Convex set of Lindblad semigroups acting on $N$-level system
• Exact Solution of the Discrete (1+1)-dimensional RSOS Model in a Slit with Field and Wall Interactions
• Utilizing probabilistic entanglement between sensors in quantum networks

Cited by in corpus (3)

• Optimization of Quantum-Repeater Networks using Stochastic Automatic Differentiation
• Fidelity-Aware Multipath Routing for Multipartite State Distribution in Quantum Networks
• A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks