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
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.
Forward citations
Cited by 1 Pith paper
-
Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network
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.
Discussion (0). Continue with ORCID to comment.