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

International Journal of Theoretical Physics

A Note of Bell Inequalities for Graph States

Mengfei Niu, Zhengli Chen, Xiaole Lv, Wenhua Wang

Published Apr 14, 2021• 1 citation
Publisher
DOI
10.1007/s10773-020-04647-2

Related papers

A Note on the Geometric Interpretation of Bell’s Inequalities

Paolo Dai Pra, Michele Pavon, Neeraja Sahasrabudhe

arXiv:1301.4823•Letters in Mathematical Physics•May 30, 2013•3 citations

Some results and problems on quantum Bell-type inequalities

Boris S. Tsirelson

•Jan 1, 1993•202 citations

Bell-type inequalities embedded in the subgraph of graph states

Li‐Yi Hsu

We investigate the Bell-type inequalities of graph states. In this paper, Bell-type inequalities can be derived based on two kinds of the associated subgraphs of the graph states. First, the star subgraphs lead to the maximal violation of the modified Seevinck-Svetlichny inequalities. Second, cycle subgraphs lead to maximal violation of Bell-type inequalities. As a result, once the associated graph of a graph state is given, the corresponding Bell operators can be immediatedly determined using stabilizing generators. In the above Bell-type inequalities, two measurement settings for each party are required.

Physical Review A•Apr 10, 2006•10 citations

Bell inequalities for arbitrary situations

Mohammad Heshmatpour

Physics Letters A•Jan 19, 2015•3 citations

Two-setting Bell inequalities for graph states

Géza Tóth, Otfried Gühne, Hans J. Briegel

We present Bell inequalities for graph states with a high violation of local realism. In particular, we show that there is a basic Bell inequality for every nontrivial graph state which is violated by the state at least by a factor of 2. This inequality needs the measurement of, at most, two operators for each qubit and involves only some of the qubits. We also show that for some families of graph states composite Bell inequalities can be constructed such that the violation of local realism increases exponentially with the number of qubits. We prove that some of our inequalities are facets of the convex polytope containing the many-body correlations consistent with local hidden variable models. Our Bell inequalities are built from stabilizing operators of graph states.

arXiv:quant-ph/0510007•Physical Review A•Feb 2, 2006•61 citations

An application of Bell's inequalities to a quantum state extension problem

Reinhard F. Werner

Letters in Mathematical Physics•May 1, 1989•92 citations
We investigate the Bell-type inequalities of graph states. In this paper, Bell-type inequalities can be derived based on two kinds of the associated subgraphs of the graph states. First, the star subgraphs lead to the maximal violation of the modified Seevinck-Svetlichny inequalities. Second, cycle subgraphs lead to maximal violation of Bell-type inequalities. As a result, once the associated graph of a graph state is given, the corresponding Bell operators can be immediatedly determined using stabilizing generators. In the above Bell-type inequalities, two measurement settings for each party are required.
We present Bell inequalities for graph states with a high violation of local realism. In particular, we show that there is a basic Bell inequality for every nontrivial graph state which is violated by the state at least by a factor of 2. This inequality needs the measurement of, at most, two operators for each qubit and involves only some of the qubits. We also show that for some families of graph states composite Bell inequalities can be constructed such that the violation of local realism increases exponentially with the number of qubits. We prove that some of our inequalities are facets of the convex polytope containing the many-body correlations consistent with local hidden variable models. Our Bell inequalities are built from stabilizing operators of graph states.