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

arXiv:quant-ph/0510007 · Physical Review A

Two-setting Bell inequalities for graph states

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

Published Feb 2, 2006• 61 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.73.022303

Related papers

All tight correlation Bell inequalities have quantum violations

Llorenç Escolà-Farràs, John Calsamiglia, Andreas Winter

The authors show that tight Bell inequalities always have a quantum violation for any bipartite setting of binary measurements. Operationally, this means that all tight XOR game inequalities can be used to test local realism. In geometric terms, the result shows that any correlation Bell inequality for which the classical and quantum values coincide, does not define a facet of the Bell polytope.

arXiv:1908.06669•Physical Review Research•Feb 24, 2020•8 citations

Scalable Bell Inequalities for Qubit Graph States and Robust Self-Testing

F. Baccari, Remigiusz Augusiak, Ivan Šupić +2 more

Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a general construction of Bell inequalities that are maximally violated by the multiqubit graph states and can be used for their robust self-testing. Apart from their theoretical relevance, our inequalities offer two main advantages from an experimental viewpoint: (i) they present a significant reduction of the experimental effort needed to violate them, as the number of correlations they contain scales only linearly with the number of observers; (ii) numerical results indicate that the self-testing statements for graph states derived from our inequalities tolerate noise levels that are met by present experimental data. We also discuss possible generalizations of our approach to entangled states whose stabilizers are not tensor products of Pauli matrices. Our work introduces a promising approach for the certification of complex many-body quantum states.

arXiv:1812.10428•Physical Review Letters•Jan 17, 2020•100 citations

Error-Tolerating Bell Inequalities via Graph States

Qing Chen, Sixia Yu, C. H. Oh

We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly we construct a family of valid Bell inequalities tolerating arbitrary $t$-qubit errors involving $3(t+1)$ qubits, e.g., 6 qubits suffice to tolerate single qubit errors. Secondly we construct also a single-error-tolerating Bell inequality with a violation that increases exponentially with the number of qubits. Exhaustive computer search for optimal error-tolerating Bell inequalities based on graph states on no more than 10 qubits shows that our constructions are optimal for single- and double-error tolerance.

arXiv:0903.3318•Mar 19, 2009•1 citation

Bell Inequalities for Graph States

Otfried Gühne, Géza Tóth, Philipp Hyllus +1 more

We investigate the nonlocal properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positivity of the partial transpose or the geometric measure of entanglement.

arXiv:quant-ph/0410059•Physical Review Letters•Sep 14, 2005•236 citations

Experimental Violation of Multipartite Bell Inequalities with Trapped Ions

B. P. Lanyon, Michael J. Zwerger, Petar Jurcevic +5 more

We report on the experimental violation of multipartite Bell inequalities by entangled states of trapped ions. First, we consider resource states for measurement-based quantum computation of between 3 and 7 ions and show that all strongly violate a Bell-type inequality for graph states, where the criterion for violation is a sufficiently high fidelity. Second, we analyze Greenberger-Horne-Zeilinger states of up to 14 ions generated in a previous experiment using stronger Mermin-Klyshko inequalities, and show that in this case the violation of local realism increases exponentially with system size. These experiments represent a violation of multipartite Bell-type inequalities of deterministically prepared entangled states. In addition, the detection loophole is closed.

arXiv:1312.4810•Physical Review Letters•Mar 13, 2014•83 citations

Variants of Bell inequalities

Zeqian Chen

A family of Bell-type inequalities is present, which are constructed directly from the "standard" Bell inequalities involving two dichotomic observables per site. It is shown that the inequalities are violated by all the generalized Greenberger-Horne-Zeilinger states of multiqubits. Remarkably, our new inequalities can provide stronger non-locality tests in a sense that the local reality inequalities are exponentially stronger than the corresponding multipartite separability inequalities. This reveals that the exponential violation of local realism by separable states is an interesting consequence of quantum fluctuation of multipartite systems.

arXiv:quant-ph/0611126•Nov 13, 2006•2 citations
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.
Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a general construction of Bell inequalities that are maximally violated by the multiqubit graph states and can be used for their robust self-testing. Apart from their theoretical relevance, our inequalities offer two main advantages from an experimental viewpoint: (i) they present a significant reduction of the experimental effort needed to violate them, as the number of correlations they contain scales only linearly with the number of observers; (ii) numerical results indicate that the self-testing statements for graph states derived from our inequalities tolerate noise levels that are met by present experimental data. We also discuss possible generalizations of our approach to entangled states whose stabilizers are not tensor products of Pauli matrices. Our work introduces a promising approach for the certification of complex many-body quantum states.
We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly we construct a family of valid Bell inequalities tolerating arbitrary ttt-qubit errors involving 3(t+1)3(t+1)3(t+1) qubits, e.g., 6 qubits suffice to tolerate single qubit errors. Secondly we construct also a single-error-tolerating Bell inequality with a violation that increases exponentially with the number of qubits. Exhaustive computer search for optimal error-tolerating Bell inequalities based on graph states on no more than 10 qubits shows that our constructions are optimal for single- and double-error tolerance.
We investigate the nonlocal properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positivity of the partial transpose or the geometric measure of entanglement.
We report on the experimental violation of multipartite Bell inequalities by entangled states of trapped ions. First, we consider resource states for measurement-based quantum computation of between 3 and 7 ions and show that all strongly violate a Bell-type inequality for graph states, where the criterion for violation is a sufficiently high fidelity. Second, we analyze Greenberger-Horne-Zeilinger states of up to 14 ions generated in a previous experiment using stronger Mermin-Klyshko inequalities, and show that in this case the violation of local realism increases exponentially with system size. These experiments represent a violation of multipartite Bell-type inequalities of deterministically prepared entangled states. In addition, the detection loophole is closed.
A family of Bell-type inequalities is present, which are constructed directly from the "standard" Bell inequalities involving two dichotomic observables per site. It is shown that the inequalities are violated by all the generalized Greenberger-Horne-Zeilinger states of multiqubits. Remarkably, our new inequalities can provide stronger non-locality tests in a sense that the local reality inequalities are exponentially stronger than the corresponding multipartite separability inequalities. This reveals that the exponential violation of local realism by separable states is an interesting consequence of quantum fluctuation of multipartite systems.