Pith. sign in

REVIEW 5 cited by

A simple demonstration of Bell's theorem involving two observers and no probabilities or inequalities

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/0206070 v2 pith:GFP5WM2O submitted 2002-06-11 quant-ph

A simple demonstration of Bell's theorem involving two observers and no probabilities or inequalities

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

This paper describes a device, consisting of a central source and two widely separated detectors with six switch settings each, that provides a simple gedanken demonstration of Bell's theorem without relying on either statistical effects or the occurrence of rare events. The mechanism underlying the operation of the device is revealed for readers with a knowledge of quantum mechanics.

discussion (0)

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

Forward citations

Cited by 5 Pith papers

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

  1. Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement

    quant-ph 2025-05 unverdicted novelty 9.0

    Constructs relation problems with zero entanglement-assisted quantum communication complexity but Omega(n) complexity without shared entanglement via parallel repetition of suitable non-local games, refuting quantum N...

  2. A Modular Approach to Succinct Arguments for QMA

    quant-ph 2026-06 unverdicted novelty 8.0

    Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.

  3. Multi-Prover Interactive Proof Systems with Leakage

    quant-ph 2026-05 unverdicted novelty 8.0

    Two-prover one-round MIP protocols for NEXP and MIP* protocols for RE remain sound against any polynomial bits of leakage between provers.

  4. Multi-Prover Interactive Proof Systems with Leakage

    quant-ph 2026-05 unverdicted novelty 8.0

    Multi-prover interactive proof systems for NEXP and RE can be made robust against polynomial bits of leakage between provers via parallel repetition and PCP conversions.

  5. All pure entangled states can lead to fully nonlocal correlations

    quant-ph 2026-04 unverdicted novelty 7.0

    Non-maximally entangled states exhibit full nonlocality under simple Schmidt coefficient conditions, and all pure entangled states can be activated to full nonlocality with multiple copies.