Pith. sign in

REVIEW

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 quant-ph/0411209 v2 pith:RTCBBCEN submitted 2004-11-30 quant-ph

Multipartite secure state distribution

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

We introduce the distribution of a secret multipartite entangled state in a real-world scenario as a quantum primitive. We show that in the presence of noisy quantum channels (and noisy control operations) any state chosen from the set of two-colorable graph states (CSS codewords) can be created with high fidelity while it remains unknown to all parties. This is accomplished by either blind multipartite entanglement purification, which we introduce in this paper, or by multipartite entanglement purification of enlarged states, which offers advantages over an alternative scheme based on standard channel purification and teleportation. The parties are thus provided with a secret resource of their choice for distributed secure applications.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.