Pith. Sign in

REVIEW

Bell inequalities: many questions, a few answers

Quantum Physics · Submitted 2 Feb 2007 · 68 references

Pith's verdict: A Festschrift review with one real technical addition: the AS_n family is worth checking, but its general-n local bound is asserted rather than proved.

T0 · AI review

How this review was made: An AI referee (selfhosted/deepseek-v4.1-flash) read the paper on November 11, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 3 major objections · 11 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/0702021 (version 2)
Pith ID5CIJBIC5, Pith's permanent record of this paper and its review
CitationNicolas Gisin. "Bell inequalities: many questions, a few answers." arXiv:quant-ph/0702021 (2007). https://pith.science/paper/5CIJBIC5
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report
The paper

The paper claims

Gisin lays out what is still unknown about Bell inequalities, and adds a new family of them for any even number of measurement settings.

The reading

Gisin writes this as a Festschrift survey: his aim is to state plainly what is still unknown about Bell inequalities and to organise those unknowns into three groups — foundational questions, questions that matter for real experiments, and questions about nonlocality treated as a resource. Alongside the survey he adds a concrete piece of new mathematics: a family of bipartite correlation Bell inequalities, indexed by any even number of measurement settings per side with binary outcomes, whose local bounds he writes down for four, six and eight settings. He reports that these inequalities are tight, that they are violated by maximally entangled qubit states down to a visibility threshold, and that the threshold rises toward $0.75$ as the number of settings grows. If that holds, the family gives experimenters a tunable sequence of tests sitting between the two-setting CHSH inequality and the many-setting regime, and it sharpens the question of how much noise a maximally entangled state can tolerate before it stops being provably nonlocal.

What carries the argument

The machinery is the local polytope: for any fixed finite number of players, inputs and outcomes, the set of correlations admitting a shared-randomness local model is a convex polytope bounded by facets, and each facet is a tight Bell inequality. Correlation inequalities are the special case written only in terms of expectation values $E(x,y)$, which is what makes the AS$_n$ matrices compact. The figure of merit throughout is the visibility threshold $V_n$: the smallest admixture of white noise at which a maximally entangled state still violates the inequality, so that a lower $V_n$ means a more noise-tolerant test. Appendix B carries a second device, the Bechmann-Pasquinucci-Gisin inequality $S_{3 times 4}$, whose quantum maximum $4 sqrt 3$ exceeds the best real-amplitude value $2 + 2 sqrt 5$, making it a candidate separator between real and complex Hilbert spaces.

Extended reading notes

Core claim

The new result is the AS$_n$ family of bipartite correlation Bell inequalities, valid for any even number $n$ of inputs per side with binary outcomes. Each member is written as a matrix whose entries are coefficients on the expectation values $E(x,y) = p(a=b|x,y) - p(a=b|x,y)$; the displayed cases have local bounds $6$ for $n=4$, $12$ for $n=6$ and $20$ for $n=8$. The pattern is a first row of all $+1$, then successive rows shifted left with the falling entry re-entering with a changed coefficient, ending in a row $+1,-1,0,0,0,0$; $n=2$ reduces to CHSH. Gisin reports that these inequalities are tight and maximally violated by maximally entangled qubit states for visibilities above $V_2 = 1/2$, $V_4 = 0.7348$, $V_{10} = 0.7469$, $V_{50} = 0.7499$, apparently tending to $0.75$. That contrasts with the earlier Inn22 family, whose threshold appears to tend to $1$ as the number of inputs grows. All the settings can be chosen on a great circle of the Poincar sphere. A second, diagonal D-family found by numerical search for five and six inputs is listed in Appendix A.

Load-bearing premise

The step from the explicitly verified four-setting case to every even number of settings is asserted rather than proved: the paper calls the generalization straightforward and backs the local bounds and tightness with numerical search at a few values of $n$ rather than an analytic derivation.

Editorial extensions

If this is right

  • Experimenters gain a tunable family that interpolates between the two-setting CHSH test and many-setting tests, so measurement settings can be traded against noise tolerance.
  • Because the threshold visibility rises toward about $0.75$, the family certifies nonlocality for Werner states in a visibility range where CHSH, which stops at $1/sqrt 2$ approximately $0.7071$, cannot.
  • The contrast with the Inn22 family, whose threshold appears to tend to $1$, shows that adding settings does not automatically buy noise tolerance; placing all settings on a great circle of the Poincar sphere is what makes the AS$_n$ family work.
  • The $S_{3 times 4}$ inequality gives a concrete test that separates real-number quantum strategies from complex ones, provided the gap survives in Hilbert spaces larger than the one used to compute it.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the AS$_n$ thresholds really saturate near $0.75$, a gap remains between that value and the best known local model for Werner states, around $0.66$; no member of this family closes it, so a different construction would be needed.
  • The local bounds $6, 12, 20$ grow quadratically in $n$; a proof of that scaling would likely double as the missing general-$n$ facet proof, and might also suggest the matching quantum strategy.
  • The open-question list works as a checklist that later work can be scored against: POVM necessity, bound entanglement violating some Bell inequality, and real-versus-complex separations are all natural first targets for the new inequalities as test cases.
  • The detection-loophole discussion suggests a follow-up calculation: compute the detection efficiency required by AS$_n$ for large $n$ and compare it with the $81.65$ percent achieved by the three-setting inequality of Massar and co-workers, to see whether the new family also helps in the laboratory.
Original abstract

What can be more fascinating than {\it experimental metaphysics}, to quote one of Abner Shimony's enlightening expressions? Bell inequalities are at the heart of the study of nonlocality. I present a list of open questions, organised in three categories: fundamental; linked to experiments; and exploring nonlocality as a resource. New families of inequalities for binary outcomes are presented.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,471 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.11 · human participants 0.04 · controlled comparison 0.01 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.05 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

What can be more fascinating than {\it experimental metaphysics}, to quote one of Abner Shimony's enlightening expressions? Bell inequalities are at the heart of the study of nonlocality. I present a list of open questions, organised in three categories: fundamental; linked to experiments; and exploring nonlocality as a resource. New families of inequalities for binary outcomes are presented.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 What can be more fascinating than {\it experimental metaphysics}, to quote one of Abner Shimony's enlightening expressions? background 1.00 0.03 0.02 unclear 0.88
s1 Bell inequalities are at the heart of the study of nonlocality. background 1.00 0.05 0.08 asserted 1.00
s2 I present a list of open questions, organised in three categories: fundamental; linked to experiments; and exploring nonlocality as a resource. contribution 0.96 0.89 0.19 asserted 0.98
s3 New families of inequalities for binary outcomes are presented. contribution 0.93 0.92 0.21 asserted 1.00

What kind of paper the classifier reports this is: position or commentary 0.58 · evidence from proof or derivation 0.72.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures
Figure 1. FIG. 1: (Color online) Number of occurrences of the
Figure 2. FIG. 2: (Color online) Measurement settings represented on

Figures reproduced from arXiv:quant-ph/0702021 by the authors.

References
How later papers used it

63 later papers cite it

Evidence: substantial. 61 of the citing papers share no author with it, and 6 of those carry a confident label from Pith's citation classifier.

Pith read 32 of the 106 citing sentences, choosing only those whose citation markers point at this paper alone, and wrote the paraphrases from them. The summary, the counts, the evidence level, the links and the quotes come from code; the summary counts the papers listed below. A later paper is listed under a label when Pith's citation classifier gives one of its sentences that label at probability 0.8 or more (0.95 for support), Pith's reading finds that the citing paper itself did it, and a second check confirms the paraphrase against the sentence. This section lists uses only. It does not list criticism or disagreement, so their absence here says nothing about how the paper has been received. Papers that share an author with this one are listed apart, under "By the same authors". A quote is the citing authors' own sentence, shown when their paper's licence is CC BY, CC BY-SA or CC0. JSON

Uses its method or tool 1 paper
How the literature uses it

62 arXiv papers cite this in 105 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 82 sentences without a confident label

Builds on it 1 paper
Uses its method or tool 1 paper
Compares with it 4 papers
Cites it as background 16 papers

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.