Pith. sign in

REVIEW 1 cited by

Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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/0506170 v2 pith:2KOPN76P submitted 2005-06-20 quant-ph

M. Hayashi , D. Markham , M. Murao , M. Owari , S. Virmani This is my paper · ORCID
classification quant-ph
keywords entanglementmultipartitestatesclassicalcommunicationdiscriminationlocaloperations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total dimension over the average entanglement. A similar, general condition is also shown for pure and mixed states. These results offer a rare operational interpretation for three abstractly defined distance like measures of multipartite entanglement.

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. Relative entropy of entanglement of Haar random states

    quant-ph 2026-08 accept novelty 7.0 of 10

    For a bipartite mixed state obtained by tracing out one subsystem of a tripartite Haar-random pure state, the relative entropy of entanglement equals log(d_A d_B / max(d_A,d_B,d_C)) plus an absolute constant, with hig...

Pith tools