Quantum pseudo-telepathy¶
A nonlocal-game phenomenon in which entangled players win with certainty without communication although no classical no-communication strategy can do so.
Core Idea¶
Quantum pseudo-telepathy occurs when entangled separated players win a nonlocal game with certainty although every classical no-communication strategy fails on some inputs. Quantum pseudo-telepathy is perfect quantum victory in a nonlocal game whose classical no-communication value is below one. Players pre-share entanglement, receive separate inputs, and output without exchanging messages. The effect cannot signal faster than light. Shared randomness is part of the classical comparison, while noise reduces experimental success. Not every Bell violation or quantum advantage qualifies; one must state the game, classical bound, quantum strategy, and communication prohibition.
Scope of Application¶
The concept applies in quantum foundations and related work when its identity and evidence are explicit. Use it only with the same game, explicit resource rules, proven classical bound, perfect ideal quantum strategy, and no in-game communication; distinguish signalling, teleportation, generic Bell violations, and imperfect advantage.
- Quantum foundations. Demonstrates nonlocality.
- Nonlocal games. Compares resource models.
- Quantum information. Studies entanglement advantages.
- Experimental physics. Tests correlations under noise.
- Communication complexity. Shows tasks with eliminated communication.
Clarity¶
State game, inputs, winning condition, allowed shared randomness/entanglement, communication prohibition, classical bound, ideal quantum strategy, and experimental deviations. The closest near miss sets the boundary: Quantum advantage is the closest miss when quantum value exceeds classical value but remains below one.
Manages Complexity¶
The concept compresses a complex nonlocal correlation into an operational separation while preventing it from being misread as signalling. Pseudo-telepathy does not transmit a message and cannot be used for faster-than-light signalling. Before play, parties share entanglement and agree on measurements; after spatial separation they receive inputs and return outputs without communication. The quantum correlations satisfy every winning constraint of a specified nonlocal game, while the best classical no-communication strategy has value strictly below one. The separation depends on the resource model: shared randomness is allowed classically, communication is forbidden during the game, and exact success can be degraded by noise or detector limitations experimentally. The magic-square game is a canonical example, but not every Bell-inequality violation gives perfect quantum victory, and not every quantum advantage is pseudo-telepathy. Certification requires the game, classical bound, quantum strategy, and no-communication assumptions. The central nonlocal correlation–no signalling tradeoff is this: Correlations exceed classical limits but marginals cannot carry messages.
Abstract Reasoning¶
Use three linked moves: define one game for both resource models; prove the classical value is below one; construct shared state and local measurements. As a collapse test, identity collapses if communication occurs, quantum success is imperfect in the ideal model, or a perfect classical strategy exists.
Knowledge Transfer¶
Nonlocal-game separation transfers across games, but pseudo-telepathy stops without perfect quantum and imperfect classical values. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. It supplies the nonclassical resource.
Neighborhood in Abstraction Space¶
Quantum pseudo-telepathy sits in a moderately populated region (40th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Strategic Decision Biases & Mechanisms (29 abstractions)
Nearest neighbors
- Correlated equilibrium — 0.88
- Rubinstein bargaining model — 0.88
- Max-dominated strategy — 0.88
- Strong Nash equilibrium — 0.88
- Computability logic — 0.87
Computed from structural-signature embeddings · 2026-10-08