Pith. sign in

REVIEW

Local indistinguishability: more nonlocality with less entanglement

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/0301106 v1 pith:WRR3VQME submitted 2003-01-20 quant-ph

Local indistinguishability: more nonlocality with less entanglement

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

We provide a first operational method for checking indistinguishability of orthogonal states by local operations and classical communication (LOCC). This method originates from the one introduced by Ghosh et al. (Phys. Rev. Lett. 87, 5807 (2001) (quant-ph/0106148)), though we deal with pure states. We apply our method to show that an arbitrary complete multipartite orthogonal basis is indistinguishable by LOCC, if it contains at least one entangled state. We also show that probabilistic local distinguishing is possible for full basis if and only if all vectors are product. We employ our method to prove local indistinguishability in an example with sets of pure states of 3X3, which shows that one can have ``more nonlocality with less entanglement'', where ``more nonlocality'' is in the sense of ``increased local indistinguishability of orthogonal states''. This example also provides, to our knowledge, the only known example where d orthogonal states in dXd are locally indistinguishable.

discussion (0)

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