Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Progress in physics

On the Applicability of Bell's Inequality

Pierre A. Millette

Published Jul 1, 2016• 0 citations
OpenAlex

Related papers

Bell inequality for qubits based on the Cauchy-Schwarz inequality

Jing‐Ling Chen, Dong-Ling Deng

We develop a systematic approach to establish Bell inequalities for qubits based on the Cauchy-Schwarz inequality. We also use the concept of distinct ``roots'' of the Bell function to classify some well-known Bell inequalities for qubits. As applications of the approach, we present three unique and tight Bell inequalities for four and three qubits, respectively.

arXiv:0808.2287•Physical Review A•Jan 30, 2009•11 citations

A limitation on Bell's inequality

V. Buonomano

Annales De L Institut Henri Poincare-physique Theorique•Jan 1, 1978•9 citations

Inadequacy of the CHSH Bell inequality for an application to the photon correlation experiments of Aspect et al

G. Coddens

\n We explain that the CHSH Bell inequality cannot be applied to the photon correlation experiments of Aspect {\\em et al.} In fact, when we apply the inequality to these experiments its derivation would imply that a single photon can have two different linear polarization states at the same time, while they cannot be measured at the same time. The issue is a consequence of the special experimental context we try to impose themathematics on. We are able to pinpoint the exact place in the derivation of the inequality where the application of the mathematics to the physics causes a problem.We then derive a Bell inequality that is appropriate for an application to the experiments.The boundaries of this corrected inequality are much less stringent and the experiments do not violate this inequality.\n

•Dec 16, 2021•0 citations

On Bell’s inequality

Ivanović, I. D.

•Jan 1, 1980•0 citations

Family of Bell-like Inequalities as Device-Independent Witnesses for Entanglement Depth

Yeong-Cherng Liang, Denis Rosset, Jean-Daniel Bancal +3 more

We present a simple family of Bell inequalities applicable to a scenario involving arbitrarily many parties, each of which performs two binary-outcome measurements. We show that these inequalities are members of the complete set of full-correlation Bell inequalities discovered by Werner-Wolf-Żukowski-Brukner. For scenarios involving a small number of parties, we further verify that these inequalities are facet defining for the convex set of Bell-local correlations. Moreover, we show that the amount of quantum violation of these inequalities naturally manifests the extent to which the underlying system is genuinely many-body entangled. In other words, our Bell inequalities, when supplemented with the appropriate quantum bounds, naturally serve as device-independent witnesses for entanglement depth, allowing one to certify genuine k-partite entanglement in an arbitrary n≥k-partite scenario without relying on any assumption about the measurements being performed, or the dimension of the underlying physical system. A brief comparison is made between our witnesses and those based on some other Bell inequalities, as well as quantum Fisher information. A family of witnesses for genuine k-partite nonlocality applicable to an arbitrary n≥k-partite scenario based on our Bell inequalities is also presented.

arXiv:1411.7385•Physical Review Letters•May 12, 2015•85 citations

Efficiently Optimizing the Quantum Value of Bell Inequalities using Batched Gradient Descent

Xinyu Xu, Ping Zhu, Weikang Li +3 more

Exploring the world of Bell inequalities requires numerical methods that scale effectively with the number of parties, inputs, and outputs. Such methods can be used to study large-scale Bell inequalities beyond the reach of analytic methods, to design experiments for violating more complicated Bell inequalities, and to enable applications of Bell inequality violation. Such applications include randomness generation and multi-agent coordination with restricted communication. However, current general purpose optimizers such as the see-saw method struggle to handle Bell inequalities with only a dozen inputs and outputs. We introduce an optimizer for the quantum value of a Bell inequality based on batched gradient descent (BGD). More precisely, our BGD optimizer is a differentiable search over feasible quantum strategies in which states and projective measurements are generated from unconstrained variables. The Bell expression is evaluated by a direct tensor contraction without forming the prohibitively large Bell operator. This formulation makes parallel random restarts inexpensive and is thus naturally implemented by a GPU. We evaluate our optimizer against the see-saw method and find a significant speedup for a wide variety of Bell inequality families. Implemented on a GPU, our BGD optimizer can optimize Bell inequalities in our numerical experiments with more than a thousand inputs or outputs within minutes. For these large-scale Bell inequalities, we also efficiently compute the classical value by enumerating possible strategies using a GPU or expressing the optimization as a mixed-integer linear program. Our optimizers can serve as numerical evaluation tools for Bell experiments and multi-agent coordination problems modeled by Bell inequalities with many inputs and outputs, a common feature of real-world scenarios such as high frequency trading and distributed systems.

quant-pharXiv:2610.01699•Oct 2, 2026•0 citations
\n We explain that the CHSH Bell inequality cannot be applied to the photon correlation experiments of Aspect {\\em et al.} In fact, when we apply the inequality to these experiments its derivation would imply that a single photon can have two different linear polarization states at the same time, while they cannot be measured at the same time. The issue is a consequence of the special experimental context we try to impose themathematics on. We are able to pinpoint the exact place in the derivation of the inequality where the application of the mathematics to the physics causes a problem.We then derive a Bell inequality that is appropriate for an application to the experiments.The boundaries of this corrected inequality are much less stringent and the experiments do not violate this inequality.\n
We present a simple family of Bell inequalities applicable to a scenario involving arbitrarily many parties, each of which performs two binary-outcome measurements. We show that these inequalities are members of the complete set of full-correlation Bell inequalities discovered by Werner-Wolf-Żukowski-Brukner. For scenarios involving a small number of parties, we further verify that these inequalities are facet defining for the convex set of Bell-local correlations. Moreover, we show that the amount of quantum violation of these inequalities naturally manifests the extent to which the underlying system is genuinely many-body entangled. In other words, our Bell inequalities, when supplemented with the appropriate quantum bounds, naturally serve as device-independent witnesses for entanglement depth, allowing one to certify genuine k-partite entanglement in an arbitrary n≥k-partite scenario without relying on any assumption about the measurements being performed, or the dimension of the underlying physical system. A brief comparison is made between our witnesses and those based on some other Bell inequalities, as well as quantum Fisher information. A family of witnesses for genuine k-partite nonlocality applicable to an arbitrary n≥k-partite scenario based on our Bell inequalities is also presented.
Exploring the world of Bell inequalities requires numerical methods that scale effectively with the number of parties, inputs, and outputs. Such methods can be used to study large-scale Bell inequalities beyond the reach of analytic methods, to design experiments for violating more complicated Bell inequalities, and to enable applications of Bell inequality violation. Such applications include randomness generation and multi-agent coordination with restricted communication. However, current general purpose optimizers such as the see-saw method struggle to handle Bell inequalities with only a dozen inputs and outputs. We introduce an optimizer for the quantum value of a Bell inequality based on batched gradient descent (BGD). More precisely, our BGD optimizer is a differentiable search over feasible quantum strategies in which states and projective measurements are generated from unconstrained variables. The Bell expression is evaluated by a direct tensor contraction without forming the prohibitively large Bell operator. This formulation makes parallel random restarts inexpensive and is thus naturally implemented by a GPU. We evaluate our optimizer against the see-saw method and find a significant speedup for a wide variety of Bell inequality families. Implemented on a GPU, our BGD optimizer can optimize Bell inequalities in our numerical experiments with more than a thousand inputs or outputs within minutes. For these large-scale Bell inequalities, we also efficiently compute the classical value by enumerating possible strategies using a GPU or expressing the optimization as a mixed-integer linear program. Our optimizers can serve as numerical evaluation tools for Bell experiments and multi-agent coordination problems modeled by Bell inequalities with many inputs and outputs, a common feature of real-world scenarios such as high frequency trading and distributed systems.