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

• URL: http://arxiv.org/abs/2404.07146v3
• Date: Mon, 1 Jul 2024 19:50:22 GMT
• Title: On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations
• Authors: Kenneth Goodenough, Tim Coopmans, Don Towsley,
• Abstract summary: Losses are one of the main bottlenecks for the distribution of entanglement in quantum networks. We analytically investigate the case of equally-spaced repeaters. We find exact analytic formulae for all moments of the fidelity up to 25 segments.
• Score: 9.32782060570252
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 approaches 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 when the distributed entanglement is used for quantum-key distribution, both with and without binning methods. In follow-up work we exploit a connection to a model in statistical physics to numerically calculate quantities of interest for the inhomogeneous multipartite case.

Related papers

• Quantum repeater protocol for deterministic distribution of macroscopic entanglement [0.0]
  We present a method to distribute a macroscopic amount of entanglement across long-distances using a number of operations that scales only linearly with the chain length. We show that there are particular magic'' interaction times that allow for distribution of entanglement with perfect fidelity, with no degradation with chain length.
  arXiv  Detail & Related papers  (2024-07-31T20:01:13Z)
• Relaxed Quantile Regression: Prediction Intervals for Asymmetric Noise [51.87307904567702]
  Quantile regression is a leading approach for obtaining such intervals via the empirical estimation of quantiles in the distribution of outputs. We propose Relaxed Quantile Regression (RQR), a direct alternative to quantile regression based interval construction that removes this arbitrary constraint. We demonstrate that this added flexibility results in intervals with an improvement in desirable qualities.
  arXiv  Detail & Related papers  (2024-06-05T13:36:38Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• On the Analysis of Quantum Repeater Chains with Sequential Swaps [7.885533851646292]
  We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. We consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation.
  arXiv  Detail & Related papers  (2024-05-28T15:03:09Z)
• Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions [13.16814860487575]
  We present quantum algorithms for sampling from nonlogconcave probability distributions. $f$ can be written as a finite sum $f(x):= frac1Nsum_k=1N f_k(x)$.
  arXiv  Detail & Related papers  (2023-10-17T17:55:32Z)
• Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting [64.0722630873758]
  We consider rather general and broad class of Markov chains, Ito chains, that look like Euler-Maryama discretization of some Differential Equation. We prove the bound in $W_2$-distance between the laws of our Ito chain and differential equation.
  arXiv  Detail & Related papers  (2023-10-09T18:38:56Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Self-Repellent Random Walks on General Graphs -- Achieving Minimal Sampling Variance via Nonlinear Markov Chains [11.3631620309434]
  We consider random walks on discrete state spaces, such as general undirected graphs, where the random walkers are designed to approximate a target quantity over the network topology via sampling and neighborhood exploration. Given any Markov chain corresponding to a target probability distribution, we design a self-repellent random walk (SRRW) which is less likely to transition to nodes that were highly visited in the past, and more likely to transition to seldom visited nodes. For a class of SRRWs parameterized by a positive real alpha, we prove that the empirical distribution of the process converges almost surely to the the target (
  arXiv  Detail & Related papers  (2023-05-08T23:59:09Z)
• Exact solution of a family of staggered Heisenberg chains with conclusive pretty good quantum state transfer [68.8204255655161]
  We work out the exact solutions in the one-excitation subspace. We present numerical evidence that pretty good transmission is achieved by chains whose length is not a power of two.
  arXiv  Detail & Related papers  (2022-06-28T18:31:09Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• 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.