Local state antimarking : Nonlocality without entanglement

This paper introduces the task of local state antimarking (LSAM) to demonstrate a form of nonlocality without entanglement, showing that while any ensemble of mutually orthogonal multipartite pure states is locally antidistinguishable, there exist product-state ensembles that are globally antidistinguishable but not locally so, thereby revealing that no strict hierarchy exists between local state antidistinguishability, antimarking, and their conclusive discrimination and marking counterparts.

The Gist

Imagine you are playing a high-stakes game of "Guess Who?" but with a twist. Instead of trying to figure out exactly which character your opponent has picked, your goal is simply to say, "I know for a fact it is not this character."

This paper explores a new way of playing quantum games to understand a strange phenomenon called "nonlocality without entanglement."

Here is the breakdown of the paper's ideas using simple analogies:

1. The Big Mystery: "Nonlocality Without Entanglement"

Usually, in quantum physics, things get "spooky" (nonlocal) when particles are entangled—like two dice that always roll the same number no matter how far apart they are.

However, scientists discovered something weird: even if particles are not entangled (they are just separate, independent "product" states), they can still be impossible to identify if you are stuck in separate rooms and can only talk to each other via phone calls (Local Operations and Classical Communication, or LOCC).

• The Analogy: Imagine you and a friend are in separate rooms. You each have a deck of cards. You are told a specific card was picked from a known set. If you could meet up, you could easily identify the card. But if you are stuck in separate rooms, you might find that you simply cannot figure out which card it is, even though the cards themselves aren't "magic" or entangled. This is "nonlocality without entanglement."

2. The Old Game: "Exclusion" (Antidistinguishability)

The paper starts by looking at a task called Local State Antidistinguishability (LSAD).

• The Goal: You don't need to guess the exact card. You just need to point to one card and say, "It is definitely not this one."
• The Finding: The authors found that if you have a set of cards that are all completely different from each other (orthogonal), you can always play this game successfully, even if you are in separate rooms.
• The Twist: Famous "spooky" card sets that were impossible to identify in the past (like the 9-card set by Bennett) are actually easy to play this "exclusion" game with. They lose their "spookiness" when you just try to rule out one option.

3. The New Game: "Anti-Marking" (LSAM)

The authors then invented a harder, more interesting game called Local State Antimarking (LSAM).

• The Setup: Instead of one card, the referee gives you a sequence of cards (e.g., Card A, then Card B, then Card C).
• The Twist: The cards are drawn without replacement (you can't get the same card twice in the sequence).
• The Goal: You and your friend must use your phone calls to identify a sequence that definitely did not happen. You don't need to guess the right order; you just need to prove one wrong order is impossible.

4. The Surprising Discoveries

Discovery A: The "Activation" of Spookiness
The paper found a strange phenomenon where a set of cards might seem "normal" (easy to play) in the old game, but becomes "spooky" (impossible to play) in the new game.

• The Analogy: Imagine a set of cards that is easy to rule out one wrong card from. But if you try to rule out a sequence of three cards, suddenly you and your friend get stuck. You can't prove any sequence is wrong, even though a third person (who can see both cards at once) could easily do it.
• The Result: This reveals a stronger form of nonlocality. The cards aren't entangled, but the sequence of them creates a barrier that local communication cannot break.

Discovery B: No Strict Hierarchy
The authors compared four different ways to play these quantum games:

1. LSD: Guess the exact card. (Hardest)
2. LSM: Guess the exact sequence.
3. LSAD: Rule out one wrong card.
4. LSAM: Rule out one wrong sequence.

They found that there is no simple "easiest to hardest" ladder.

• Some card sets are impossible to guess exactly (LSD) but easy to rule out a sequence (LSAM).
• Other card sets are easy to rule out a single card (LSAD) but impossible to rule out a sequence (LSAM).
• The Takeaway: You can't say one game is always "harder" than the other. A set of cards can be "local" (easy) in one game and "nonlocal" (spooky) in another.

5. Why This Matters (According to the Paper)

The paper argues that by changing the rules of the game from "Guess the exact state" to "Rule out a sequence," we can see different layers of quantum weirdness.

• Some states that look "normal" (local) under strict identification rules turn out to be "spooky" (nonlocal) when we just try to rule out sequences.
• Conversely, some states that look "spooky" under strict rules turn out to be "normal" when we just try to rule out options.

In Summary:
The paper introduces a new game called Local State Antimarking. By playing this game, the authors show that quantum nonlocality is not a single "on/off" switch. It is a spectrum. You can have sets of quantum states that are perfectly normal in one context but become impossible to solve locally in another, all without using any entanglement. This helps scientists understand the subtle, hidden limits of what we can know about quantum systems when we are separated.

Technical Summary

Technical Summary: Local State Antimarking: Nonlocality without Entanglement

Problem Statement
Quantum nonlocality without entanglement describes the phenomenon where sets of product states cannot be perfectly distinguished by Local Operations and Classical Communication (LOCC) despite being globally distinguishable. While extensively studied in the context of state discrimination (LSD), recent research has explored whether "nonlocality" persists under less demanding tasks, such as state exclusion (identifying a state that was not prepared) or state marking (identifying the permutation of a sequence).

This work addresses a gap in the hierarchy of nonlocality by investigating two specific tasks:

1. Local State Antidistinguishability (LSAD): The ability to identify at least one state from an ensemble that was not prepared, using only LOCC.
2. Local State Antimarking (LSAM): A unified task where parties receive a non-repetitive sequence of states and must identify at least one permutation (sequence) that was not the one supplied, using only LOCC.

The central problem is to determine the relationship between these exclusion-based paradigms and established discrimination paradigms (LSD, Conclusive LSD, Conclusive Local State Marking), and to identify whether new forms of nonlocality emerge when moving from single-state exclusion to sequence exclusion.

Methodology
The authors employ a rigorous theoretical framework based on quantum information theory, specifically focusing on:

• Definitions of Antidistinguishability: Distinguishing between "strong" antidistinguishability (where every outcome excludes a specific state and every state is excludable) and "weak" versions. The paper adopts the strong definition.
• LOCC Protocols: Analyzing the capabilities of spatially separated parties to perform projective measurements and communicate classically to rule out specific states or sequences.
• Theoretical Proofs: Utilizing theorems regarding the decomposition of state sets and the properties of mutually orthogonal pure states to derive conditions for local antidistinguishability.
• Counter-Examples: Constructing specific ensembles of product states (both orthogonal and non-orthogonal) to test the boundaries of these paradigms.

Key Contributions and Results

1. Local Antidistinguishability of Orthogonal States:
   The paper proves a fundamental result: Any ensemble of mutually orthogonal multipartite pure states is locally antidistinguishable.

   • Method: Building on the seminal result by Walgate et al. regarding the local distinguishability of two orthogonal states, the authors construct a protocol where parties can eliminate at least one state from any pair. By utilizing shared randomness to select pairs, they demonstrate that the entire set can be antidistinguished.
   • Implication: This implies that the famous "nonlocal" product states introduced by Bennett et al. (which are locally indistinguishable) are actually locally antidistinguishable. The nonlocality of these states vanishes under the LSAD paradigm.

2. Inequivalence of Paradigms (LSAD vs. CLSD):
   The authors demonstrate that LSAD and Conclusive Local State Discrimination (CLSD) are incomparable.

   • There exist product-state ensembles that are nonlocal under CLSD but local under LSAD.
   • Conversely, there exist ensembles (e.g., the Duan states) that are nonlocal under LSAD but local under CLSD.
   • This establishes that LSAD provides a distinct, refined metric for quantifying the "strength" of nonlocality, revealing nuances that CLSD misses.

3. Introduction of Local State Antimarking (LSAM):
   The paper introduces LSAM, defined as the task of excluding at least one sequence from a set of possible non-repetitive sequences.

   • Hierarchy: The authors establish the implication chains: $LSD \implies LSM \implies LSAM$ and $LSD \implies LSAD \implies LSAM$. Consequently, if a set fails LSAM, it fails all other tasks, indicating a stronger form of nonlocality.
   • Activation of Nonlocality: A significant finding is the "activation" of nonlocality. The authors present ensembles of product states that are not globally antidistinguishable (and thus the question of local antidistinguishability is moot for the single states). However, when these states are arranged into sequences (permutations), the resulting set of sequences becomes globally antidistinguishable but not locally antidistinguishable.
   • This reveals a form of nonlocality that is hidden in the parent states but unlocked only when considering sequences, a phenomenon not observed in standard discrimination tasks.

4. Specific Counter-Examples:

   • Manna et al. States: States previously shown to be nonlocal under LSAD are demonstrated to be locally antimarkable (admitting LSAM), showing that LSAM is a more lenient task.
   • Duan States: While nonlocal under LSAD, these states admit LSAM, further highlighting the hierarchy.
   • Tripartite Example ($S_{NL2}$): A set of tripartite product states is shown to be globally antidistinguishable and locally conclusively distinguishable (admitting CLSD/CLSM), yet it fails LSAM. This proves that LSAM can detect nonlocality that is suppressed in both CLSD and CLSM paradigms.
   • Bipartite Example ($S_U$): A set of states is presented that is not even globally antidistinguishable, yet the sequences formed from them are globally antimarkable but not locally antimarkable.

Significance and Claims
The paper claims that the LSAM framework offers a powerful tool for characterizing quantum nonlocality without entanglement. By unifying exclusion and marking, it reveals a stricter hierarchy of nonlocality.

• Refined Characterization: The work argues that single-framework analyses can be misleading; two ensembles may appear identical (both local or both nonlocal) in one paradigm (e.g., CLSD) but diverge significantly in another (e.g., LSAD or LSAM).
• Stronger Nonlocality: The inability to perform LSAM is presented as a signature of a "stronger" form of nonlocality than the inability to perform LSAD, LSM, or LSD.
• No Strict Hierarchy: The paper concludes that no strict hierarchy exists between LSAD/LSAM and CLSD/CLSM. There are sets that permit one task while strictly forbidding the other, and vice versa.

The authors modestly note that while they have found examples of nonlocality in LSAM that are hidden in other paradigms, the question of whether mutually orthogonal states can ever be non-locally antidistinguishable remains open (suggesting such states would necessarily be mixed). They also identify the need for a bipartite example of a set that is globally antidistinguishable but not locally antimarkable, as their current example is tripartite.