Pith. sign in

REVIEW 3 cited by

Local distinguishability of quantum states in bipartite systems

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 1712.08830 v3 pith:AWFEIE6S submitted 2017-12-23 quant-ph

Local distinguishability of quantum states in bipartite systems

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

In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way LOCC indistinguishable quantum state sets. As long as an indistinguishable subset exists in a state set, the set is not distinguishable. We also list several distinguishable sets as instances.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Local state antimarking : Nonlocality without entanglement

    quant-ph 2026-05 unverdicted novelty 7.0

    Certain sequences of product states allow global but not local identification of excluded sequences via the new LSAM task, showing nonlocality without entanglement.

  2. Dynamic Edge Coloring of Forests

    cs.DS 2026-05 unverdicted novelty 6.0

    Greedy and randomized algorithms for dynamic edge coloring on forests achieve specific amortized recourse bounds in incremental and fully dynamic settings, with tightness results for some cases.

  3. Dynamic Edge Coloring of Forests

    cs.DS 2026-05 unverdicted novelty 6.0

    On forests, dynamic edge coloring with Δ+c colors admits tight amortized recourse bounds for greedy and randomized algorithms, plus O(1) deterministic recourse for rooted forests when c=Δ−2.