Local State Antimarking (LSAM)
- Local State Antimarking (LSAM) is a sequence-level exclusion task in quantum information where spatially separated parties using LOCC certify that a given ordered sequence was not supplied.
- LSAM extends local state antidistinguishability by leveraging sequence sampling without replacement, revealing sequence activation and distinct nonlocal properties.
- The framework offers both theoretical criteria and explicit LOCC protocols, highlighting its practical implications and contrasts with LSAD, CLSD, and CLSM.
Searching arXiv for the specified paper and closely related context. arXiv search: (Chatterjee et al., 10 May 2026) "Local state antimarking : Nonlocality without entanglement" Local State Antimarking (LSAM) is a sequence-level exclusion task in multipartite quantum information in which spatially separated parties, restricted to LOCC, must certify at least one ordered sequence of states that was not supplied. It is introduced as an extension of local state antidistinguishability (LSAD), itself an exclusion-based analogue of local state discrimination, and is used to study nonlocality without entanglement in a setting that is weaker than identification but still operationally stringent. The central results show that any ensemble of mutually orthogonal multipartite pure states is locally antidistinguishable, while certain product-state ensembles exhibit a sequence-level activation phenomenon: they become globally antidistinguishable when sampled without replacement into sequences, yet remain impossible to antimark locally. The framework also establishes that LSAD, LSAM, conclusive local state discrimination (CLSD), and conclusive local state marking (CLSM) are pairwise incomparable in general (Chatterjee et al., 10 May 2026).
1. Formal framework
The starting point is antidistinguishability. Let be a finite set of quantum states on a finite-dimensional Hilbert space . The set is strongly antidistinguishable if there exists a POVM such that each labeled state is perfectly excluded by its corresponding outcome,
while every outcome is relevant,
and the POVM obeys the usual normalization and positivity conditions,
If only the exclusion condition is imposed and some outcomes are allowed never to click, the notion reduces to weak antidistinguishability. The treatment of LSAM uses strong antidistinguishability throughout (Chatterjee et al., 10 May 2026).
For three pure states , the Caves–Fuchs–Schack criterion gives necessary and sufficient conditions. Writing
the set is strongly antidistinguishable iff
and
The trine states provide a standard example, with antidistinguishing POVM 0 (Chatterjee et al., 10 May 2026).
LSAD is the multipartite LOCC-restricted version. For a multipartite ensemble 1 on 2, LSAD means there exists a finite-round LOCC protocol whose effective POVM elements 3 satisfy
4
together with relevance and completeness. The paper works in the LOCC model rather than in the larger class of separable POVMs; its possibility and impossibility results are formulated accordingly (Chatterjee et al., 10 May 2026).
LSAM generalizes from single states to ordered sequences. Let 5 be a known set of multipartite states. A referee samples without replacement an ordered sequence
6
of 7 distinct indices and distributes the corresponding product state
8
with local tensor factors rearranged into the natural party-wise partition 9. The task 0-LSAM asks the parties, using LOCC only, to output 1 distinct strings
2
where 3 is the set of all ordered length-4 tuples of distinct indices from 5, such that
6
with unit success probability in every run. The paper adopts the weakest exclusion requirement: excluding at least one constituent product state is already sufficient to exclude the ordered tuple as a whole (Chatterjee et al., 10 May 2026).
2. Structural lemmas and technical criteria
A central sufficient condition is the union-of-antidistinguishable-subsets theorem. If a finite state set 7 can be written as
8
with every 9 strongly antidistinguishable, then 0 itself is strongly antidistinguishable. The proof constructs a single POVM by averaging the antidistinguishing POVMs of the subsets:
1
Completeness and positivity are immediate, while exclusion and relevance are inherited from the individual subset measurements (Chatterjee et al., 10 May 2026).
LSAM also obeys a monotonicity relation in the sequence length. If a set 2 permits 3-LSAM, then for any 4 with 5, the same set permits 6-LSAM with
7
The construction simply applies the successful 8-LSAM protocol to the first 9 positions of a longer sequence. Each excluded ordered 0-tuple extends to exactly 1 ordered length-2 sequences by filling the remaining positions from the unused symbols without replacement (Chatterjee et al., 10 May 2026).
For qubit pure-state ensembles, the paper uses another criterion repeatedly: a set 3 in 4 is strongly antidistinguishable iff there exist positive coefficients 5 such that
6
This criterion is employed to rule out local antidistinguishability of certain single-party factors, which in turn precludes strong LOCC exclusion for the associated product ensembles (Chatterjee et al., 10 May 2026).
The paper’s LOCC impossibility arguments do not rely on separable-POVM impossibility theorems. Instead, they proceed by reducing LSAD or LSAM for product ensembles to antidistinguishability of the local single-system ensembles. In particular, when the local single-system sets fail strong antidistinguishability, strong LOCC antidistinguishability of the corresponding multipartite product ensemble fails as well (Chatterjee et al., 10 May 2026).
3. LSAD for orthogonal multipartite pure states
One of the main structural results is that every ensemble of mutually orthogonal multipartite pure states is locally antidistinguishable. The proof uses Walgate–Short–Hardy–Vedral’s local discrimination theorem for pairs of orthogonal bipartite pure states. For any such pair 7, there exists a local basis 8 such that
9
with
0
Alice measures in 1, Bob performs the conditional orthogonality-resolving measurement, and the pair is perfectly discriminated by LOCC. The LSAD theorem then partitions the full orthogonal set into pairs, applies the pairwise exclusion subprotocols, and combines them using the union theorem. Shared randomness is used to select one of the pair subprotocols, giving a strong LOCC antidistinguishing measurement in which every state has an outcome that never occurs when that state is present (Chatterjee et al., 10 May 2026).
The Bell basis in 2 yields an explicit example:
3
Alice and Bob both measure in the computational basis 4. The joint outcomes exclude Bell states according to
5
Each excluded state assigns zero probability to its corresponding outcome, and each outcome occurs with nonzero probability on at least one of the other Bell states, so strong LSAD holds (Chatterjee et al., 10 May 2026).
A second explicit protocol applies to Bennett’s nine orthogonal product states in 6,
7
with the unnormalized shorthand 8. Alice measures in the orthogonal basis
9
Bob measures in
0
and the joint outcome excludes one of the nine states. The paper provides the complete mapping table. This shows that the canonical “nonlocality without entanglement” states become local under LSAD, even though they are famous for LOCC discrimination obstructions (Chatterjee et al., 10 May 2026).
4. Sequence activation and LSAM nonlocality without entanglement
The defining LSAM phenomenon is that sequence formation can activate global antidistinguishability while LOCC exclusion remains impossible. The basic example is
1
with 2. In the single-shot setting this set is not globally antidistinguishable: the three-state Caves conditions fail. At sequence length 3 without replacement, however, one obtains the six ordered product states
4
with local partition 5 (Chatterjee et al., 10 May 2026).
The paper constructs three triples,
6
each of which satisfies the Caves conditions and is therefore strongly globally antidistinguishable. By the union theorem, the full six-state sequence ensemble 7 is strongly globally antidistinguishable (Chatterjee et al., 10 May 2026).
The same activation does not occur locally. The local factor sets for both parties are
8
and these fail the Caves conditions. Since neither local party possesses an antidistinguishing measurement on the corresponding local three-state ensemble, one cannot realize a strong LOCC antidistinguishing measurement on the product sequence set. Consequently, 9 is globally antimarkable at 0 but not 1-LSAM. This is a direct instance of nonlocality without entanglement in LSAM: the underlying states are product states, yet sequence-level exclusion becomes globally possible and remains LOCC-impossible (Chatterjee et al., 10 May 2026).
This example also clarifies the operational role of sampling without replacement. LSAM is not merely repeated LSAD on independent copies. The exclusion target is an ordered tuple in 2, and the combinatorics of distinct indices create new global antidistinguishability structures that are absent in the single-shot ensemble. A plausible implication is that LSAM isolates sequence-level nonlocal effects that are invisible to state-by-state exclusion (Chatterjee et al., 10 May 2026).
5. Incomparability with LSAD, CLSD, and CLSM
The paper formulates CLSD and CLSM as conclusive, error-free tasks with permitted inconclusive outcomes. For CLSD, a LOCC POVM 3 must satisfy
4
with 5. For CLSM, for each ordered sequence 6 there is a LOCC effect 7 such that
8
where
9
and an inconclusive 0 completes the POVM (Chatterjee et al., 10 May 2026).
The general implication structure includes
1
Thus failure of LSAM implies failure of LSD, LSAD, and LSM. However, the paper shows that no strict hierarchy exists among LSAD, LSAM, CLSD, and CLSM (Chatterjee et al., 10 May 2026).
A first inequivalence comes from Duan’s four-state product ensemble
2
with
3
Globally, the subsets 4 and 5 satisfy the Caves conditions, so their union 6 is strongly antidistinguishable. Locally, for the single-system set
7
there do not exist positive weights 8 such that
9
This precludes local antidistinguishability of the qubit factor set and therefore rules out LSAD for 0. Yet at sequence length 1, the local two-copy sets can be partitioned into antidistinguishable triples satisfying the Caves conditions, so a LOCC protocol excludes at least one sequence; 2 admits 3-LSAM. The set is therefore CLSD-nonlocal and LSAD-nonlocal, while remaining LSAM-local (Chatterjee et al., 10 May 2026).
A second separation is provided by
4
The single-shot product ensemble fails LSAD locally because its local single-system factors violate the Caves conditions. Nonetheless, the paper shows that the two-copy local sets split into antidistinguishable triples, and the union theorem then implies 5-LSAM via LOCC (Chatterjee et al., 10 May 2026).
A sharper LSAM-versus-LSAD separation is the PBR-like ensemble
6
It is not LSAD, because the local single-system set 7 is not strongly antidistinguishable. For 8, however, there is an explicit local projective measurement on 9 and on 00 in the orthonormal basis 01: 02
03
where 04. Each outcome excludes at least three sequences, yielding 05-LSAM by LOCC (Chatterjee et al., 10 May 2026).
The anti-parallel double-SIC construction gives the opposite direction. Let
06
where 07 is a qubit SIC, i.e. four states forming a regular tetrahedron on the Bloch sphere. This set is globally and locally strongly antidistinguishable; for example, Alice may measure 08. At the same time, known results show that it is not locally conclusively distinguishable. This establishes LSAD-locality without CLSD-locality (Chatterjee et al., 10 May 2026).
6. Stronger nonlocality, explicit LSAM constructions, and open directions
The paper also presents a tripartite product ensemble showing that LSAM can reveal nonlocality even when CLSD and CLSM succeed. Consider
09
where
10
Global antidistinguishability holds for this three-state set when
11
equivalently for
12
For 13-LSAM, the local two-copy factor sets become
14
for Alice and Bob, and
15
for Charlie. These local three-state sets are strongly antidistinguishable only when
16
which holds for
17
Outside that interval, but still inside the globally antidistinguishable regime, 18-LSAM fails. In the same parameter range, CLSD and CLSM succeed: Alice and Bob measure in 19 and Charlie in 20. This establishes that LSAM can exhibit a stronger nonlocal obstruction than CLSD or CLSM (Chatterjee et al., 10 May 2026).
Another explicit sequence-level construction is given for the Manna–Bhowmik 21-ensemble
22
For 23, the ensemble fails 24-LSAM, i.e. LSAD. At 25, however, there is an explicit Alice POVM 26 with
27
and
28
29
such that
30
31
32
33
The six outcomes exclude the local pattern pairs
34
and when Bob applies the same POVM, at least eight global sequences are excluded, yielding 35-LSAM (Chatterjee et al., 10 May 2026).
Operationally, LSAM is the sequence-level counterpart of exclusion: the parties need not identify the true sequence, only guarantee that at least one proposed ordered sequence did not occur. Because exclusion is weaker than discrimination, failure of LSAM signals a particularly strong form of nonlocality. The paper’s examples show both upward propagation with sequence length, via the monotonicity lemma, and nontrivial dependence on 36, since 37-LSAM may hold even when 38-LSAM does not, and may fail even when CLSD and CLSM are possible (Chatterjee et al., 10 May 2026).
All constructive positive results are realized by finite-round LOCC, and for the explicit protocols the number of rounds is one: parties measure locally, communicate once, and map outcomes to excluded states or sequences. Negative results are derived from single-system antidistinguishability criteria on the local factors rather than from separable-measurement impossibility theorems. Two open directions are identified: whether there exist mutually orthogonal mixed-state ensembles that fail LSAD, and whether there exist bipartite ensembles that are globally antidistinguishable yet fail LSAM. Tripartite examples already exist, but the bipartite case remains unresolved (Chatterjee et al., 10 May 2026).