Pith. sign in

REVIEW 1 cited by

Generalized Quantum Repeater Graph States

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 2407.01429 v2 pith:DIR46PCU submitted 2024-07-01 quant-ph

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

All-photonic quantum repeaters are essential for establishing long-range quantum entanglement. Within repeater nodes, reliably performing entanglement swapping is a key component of scalable quantum communication. To tackle the challenge of probabilistic Bell state measurement in linear optics, which often leads to information loss, various approaches have been proposed to ensure the loss tolerance of distributing a single ebit. We have generalized previous work regarding repeater graph states with elaborate connectivity, enabling the efficient establishment of exploitable ebits at a finite rate with high probability. We demonstrate that our new scheme significantly outperforms the previous work with much flexibility and discuss the generation overhead of such resource states. These findings offer new insights into the scalability and reliability of loss-tolerant quantum networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network

    quant-ph 2024-12 conditional novelty 7.0 of 10

    A peer-to-peer protocol, P2PGSD, distributes arbitrary graph states over quantum networks, with hardness proofs and simulations showing up to 50% resource savings for sparse graphs.

Pith tools