On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations
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 probabili...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2025-05-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2025-05-15-1744/pdf/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850272815570223104 |
|---|---|
| author | Kenneth Goodenough Tim Coopmans Don Towsley |
| author_facet | Kenneth Goodenough Tim Coopmans Don Towsley |
| author_sort | Kenneth Goodenough |
| collection | DOAJ |
| description | 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 $\textit{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 $\textit{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. |
| format | Article |
| id | doaj-art-2215d4e80a4a4cf6b3ddd3c8e709df7b |
| institution | OA Journals |
| issn | 2521-327X |
| language | English |
| publishDate | 2025-05-01 |
| publisher | Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften |
| record_format | Article |
| series | Quantum |
| spelling | doaj-art-2215d4e80a4a4cf6b3ddd3c8e709df7b2025-08-20T01:51:41ZengVerein zur Förderung des Open Access Publizierens in den QuantenwissenschaftenQuantum2521-327X2025-05-019174410.22331/q-2025-05-15-174410.22331/q-2025-05-15-1744On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximationsKenneth GoodenoughTim CoopmansDon TowsleyLosses 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 $\textit{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 $\textit{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.https://quantum-journal.org/papers/q-2025-05-15-1744/pdf/ |
| spellingShingle | Kenneth Goodenough Tim Coopmans Don Towsley On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations Quantum |
| title | On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations |
| title_full | On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations |
| title_fullStr | On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations |
| title_full_unstemmed | On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations |
| title_short | On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations |
| title_sort | on noise in swap asap repeater chains exact analytics distributions and tight approximations |
| url | https://quantum-journal.org/papers/q-2025-05-15-1744/pdf/ |
| work_keys_str_mv | AT kennethgoodenough onnoiseinswapasaprepeaterchainsexactanalyticsdistributionsandtightapproximations AT timcoopmans onnoiseinswapasaprepeaterchainsexactanalyticsdistributionsandtightapproximations AT dontowsley onnoiseinswapasaprepeaterchainsexactanalyticsdistributionsandtightapproximations |