Pith. sign in

REVIEW 1 cited by

Simple loss-tolerant protocol for GHZ-state distribution in a quantum network

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 2404.19458 v3 pith:LFMOPCNI submitted 2024-04-30 quant-ph

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

Distributed quantum entanglement plays a crucial role in realizing networks that connect quantum devices. However, sharing entanglement between distant nodes by means of photons is a challenging process primary due to unavoidable losses in the linking channels. In this paper, we propose a simple loss-tolerant protocol for the Greenberger-Horne-Zeilinger state distribution. We analyze the distribution rate under feasible experimental conditions and demonstrate the advantages of rate-loss scaling with respect to direct transmission. Our protocol does not use quantum repeaters and is achievable with current quantum optics technology. The result has direct application to tasks such as conference key agreement or distributed sensing. Moreover, it reduces the requirements for implementing distributed quantum error correction codes such as the surface code.

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. A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks

    quant-ph 2024-12 conditional novelty 6.0 of 10

    A greedy star-merging protocol distributes GHZ states over arbitrary Bell-pair networks with O(N) gates, N-1 Bell pairs in the complete case, and a polynomial-time alternative to Steiner-tree-based methods.

Pith tools