Pith. sign in

REVIEW 2 cited by

On the Analysis of Quantum Repeater Chains with Sequential Swaps

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.18252 v1 pith:WSVIVOUG submitted 2024-05-28 quant-ph

classification quant-ph
keywords chainsentanglementfidelityquantumrepeateranalysisend-to-endgate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We evaluate the performance of two-way quantum repeater chains with sequential entanglement swapping. Within the analysis we consider memory decoherence, gate imperfections, and imperfect link-level entanglement generation. Our main results include closed-form expressions for the average entanglement fidelity of the generated end-to-end entangled states. We generalize previous findings for the one-shot fidelity analysis and study the case where repeater chains serve end-to-end requests continuously. We provide solutions to the continuous request scenario by combining results from quantum information theory and queuing theory. Finally, we apply the formulas obtained to analyze the impacts of hardware parameters, i.e., coherence times and gate fidelity, and distance on the entanglement fidelity and secret key rate of homogeneous quantum repeater chains.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. To Purify or Not to Purify: Entanglement Purification under Input Fidelity Asymmetry in Quantum Networks

    quant-ph 2026-05 unverdicted novelty 6.0 of 10

    Purifying two quantum links only pays off when their fidelities differ by less than about 0.076, so under realistic memory decay most purification attempts should be skipped.

  2. Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning

    quant-ph 2024-12 conditional novelty 6.0 of 10

    For quantum repeater chains with classical communication delays, predictive and reinforcement-learning policies that act on partial information deliver end-to-end entanglement faster than wait-for-broadcast swap-asap ...

Pith tools