Statistical analysis of quantum entangled network generation

Abstract

We develop techniques to analyse the statistics of completion times of non-deterministic elements in quantum entanglement generation, and how they affect the overall performance as measured by the secret key rate. By considering such processes as Markov chains, we show how to obtain exact expressions for the probability distributions over the number of errors that a network acquires, as well as the distribution of entanglement establishment times. We show how results from complex analysis can be used to analyse Markov matrices to extract information with a lower computational complexity than previous methods. We apply these techniques to the Innsbruck quantum repeater protocol, and find that consideration of the effect of statistical fluctuations tightens bounds on the secret key rate by 3 orders of magnitude. We also use the theory of order statistics to derive tighter bounds on the minimum quantum memory lifetimes that are required in order to communicate securely.

13 pages, 5 figures

References in corpus (9)

• The Quantum Internet
• Hacking commercial quantum cryptography systems by tailored bright illumination
• Resource-efficient linear optical quantum computation
• Entanglement purification and quantum error correction
• Coherence Time of a Solid-State Nuclear Qubit
• Breaking a quantum key distribution system through a timing side channel
• Brokered Graph State Quantum Computing
• Measurement based entanglement under conditions of extreme photon loss
• Burning the Trojan Horse: Defending against Side-Channel Attacks in QKD

Cited by in corpus (16)

• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• On the waiting time in quantum repeaters with probabilistic entanglement swapping
• Tools for quantum network design
• Optimal entanglement swapping in quantum repeaters
• Optimising repeater schemes for the quantum internet
• Quantum link bootstrapping using a RuleSet-based communication protocol
• Efficient computation of the waiting time and fidelity in quantum repeater chains
• Improved analytical bounds on delivery times of long-distance entanglement
• Policies for elementary links in a quantum network
• Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning
• Deep reinforcement learning for key distribution based on quantum repeaters
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• Aging and Reliability of Quantum Networks
• Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies
• Characterizing arbitrary quantum networks in the noisy intermediate-scale quantum era
• Analytical Performance Estimations for Quantum Repeater Network Scenarios