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

Physical Review A

Bell-type inequalities embedded in the subgraph of graph states

Li‐Yi Hsu

Published Apr 10, 2006• 11 citations
Publisher

Abstract

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.

DOI
10.1103/physreva.73.042308

Related papers

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•230 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•54 citations

Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices

Bo Yang, Rudy Raymond, Hiroshi Imai +2 more

Testing and verifying imperfect multi-qubit quantum devices are important as such noisy quantum devices are widely available today. Bell inequalities are known to be useful for testing and verifying the quality of the quantum devices from their nonlocal quantum states and local measurements. There have been many experiments demonstrating the violations of Bell inequalities, but they are limited in the number of qubits and the types of quantum states. We report violations of Bell inequalities on IBM Quantum devices based on the scalable and robust inequalities maximally violated by graph states as proposed by Baccari et al.. The violations are obtained from the quantum states of path graphs up to 57 and 21 qubits on a 65-qubit and two 27-qubit IBM Quantum devices, respectively, and from those of star graphs up to 11 qubits with quantum readout error mitigation (QREM). We are able to show violations of the inequalities on various graph states by constructing low-depth quantum circuits and by applying the QREM technique. We also point out that quantum circuits for star graph states of size$N$can be realized with circuits of depth$O(\sqrt {N})$on subdivided honeycomb lattices which are the topology of the 65-qubit IBM Quantum device. Our experiments show encouraging results on the ability of existing quantum devices to prepare entangled quantum states and provide experimental evidence on the benefit of scalable Bell inequalities for testing them.

arXiv:2101.10307•IEEE Journal on Emerging and Selected Topics in Circuits and Systems•Aug 25, 2022•16 citations

Tracing the bounds on Bell-type inequalities

Stefan Filipp, Karl Svozil

Bell-type inequalities and violations thereof reveal the fundamental differences between standard probability theory and its quantum counterpart. In the course of previous investigations ultimate bounds on quantum mechanical violations have been found. For example, Tsirelson's bound constitutes a global upper limit for quantum violations of the Clauser-Horne-Shimony-Holt (CHSH) and the Clauser-Horne (CH) inequalities. Here we investigate a method for calculating the precise quantum bounds on arbitrary Bell-type inequalities by solving the eigenvalue problem for the operator associated with each Bell-type inequality. Thereby, we use the min-max principle to calculate the norm of these self-adjoint operators from the maximal eigenvalue yielding the upper bound for a particular set of measurement parameters. The eigenvectors corresponding to the maximal eigenvalues provide the quantum state for which a Bell-type inequality is maximally violated.

•Jan 1, 2004•9 citations

Tracing the bounds on Bell-type inequalities

Stefan Filipp

Bell‐type inequalities and violations thereof reveal the fundamental differences between standard probability theory and its quantum counterpart. In the course of previous investigations ultimate bounds on quantum mechanical violations have been found. For example, Tsirelson’s bound constitutes a global upper limit for quantum violations of the Clauser‐Horne‐Shimony‐Holt (CHSH) and the Clauser‐Horne (CH) inequalities. Here we investigate a method for calculating the precise quantum bounds on arbitrary Bell‐type inequalities by solving the eigenvalue problem for the operator associated with each Bell‐type inequality. Thereby, we use the min‐max principle to calculate the norm of these self‐adjoint operators from the maximal eigenvalue yielding the upper bound for a particular set of measurement parameters. The eigenvectors corresponding to the maximal eigenvalues provide the quantum state for which a Bell‐type inequality is maximally violated.

arXiv:quant-ph/0407145•AIP conference proceedings•Jan 1, 2005•5 citations

Correlations in star networks: from Bell inequalities to network inequalities

Armin Tavakoli, Marc-Olivier Renou, Nicolas Gisin +1 more

The problem of characterizing classical and quantum correlations in networks is considered. Contrary to the usual Bell scenario, where distant observers share a physical system emitted by one common source, a network features several independent sources, each distributing a physical system to a subset of observers. In the quantum setting, the observers can perform joint measurements on initially independent systems, which may lead to strong correlations across the whole network. In this work, we introduce a technique to systematically map a Bell inequality to a family of Bell-type inequalities bounding classical correlations on networks in a star-configuration. Also, we show that whenever a given Bell inequality can be violated by some entangled state ρ , then all the corresponding network inequalities can be violated by considering many copies of ρ distributed in the star network. The relevance of these ideas is illustrated by applying our method to a specific multi-setting Bell inequality. We derive the corresponding network inequalities, and study their quantum violations.

arXiv:1702.03866•New Journal of Physics•Jul 5, 2017•52 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 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 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.
Testing and verifying imperfect multi-qubit quantum devices are important as such noisy quantum devices are widely available today. Bell inequalities are known to be useful for testing and verifying the quality of the quantum devices from their nonlocal quantum states and local measurements. There have been many experiments demonstrating the violations of Bell inequalities, but they are limited in the number of qubits and the types of quantum states. We report violations of Bell inequalities on IBM Quantum devices based on the scalable and robust inequalities maximally violated by graph states as proposed by Baccari et al.. The violations are obtained from the quantum states of path graphs up to 57 and 21 qubits on a 65-qubit and two 27-qubit IBM Quantum devices, respectively, and from those of star graphs up to 11 qubits with quantum readout error mitigation (QREM). We are able to show violations of the inequalities on various graph states by constructing low-depth quantum circuits and by applying the QREM technique. We also point out that quantum circuits for star graph states of sizeNNNcan be realized with circuits of depthO(N)O(\sqrt {N})O(N​)on subdivided honeycomb lattices which are the topology of the 65-qubit IBM Quantum device. Our experiments show encouraging results on the ability of existing quantum devices to prepare entangled quantum states and provide experimental evidence on the benefit of scalable Bell inequalities for testing them.
Bell-type inequalities and violations thereof reveal the fundamental differences between standard probability theory and its quantum counterpart. In the course of previous investigations ultimate bounds on quantum mechanical violations have been found. For example, Tsirelson's bound constitutes a global upper limit for quantum violations of the Clauser-Horne-Shimony-Holt (CHSH) and the Clauser-Horne (CH) inequalities. Here we investigate a method for calculating the precise quantum bounds on arbitrary Bell-type inequalities by solving the eigenvalue problem for the operator associated with each Bell-type inequality. Thereby, we use the min-max principle to calculate the norm of these self-adjoint operators from the maximal eigenvalue yielding the upper bound for a particular set of measurement parameters. The eigenvectors corresponding to the maximal eigenvalues provide the quantum state for which a Bell-type inequality is maximally violated.
Bell‐type inequalities and violations thereof reveal the fundamental differences between standard probability theory and its quantum counterpart. In the course of previous investigations ultimate bounds on quantum mechanical violations have been found. For example, Tsirelson’s bound constitutes a global upper limit for quantum violations of the Clauser‐Horne‐Shimony‐Holt (CHSH) and the Clauser‐Horne (CH) inequalities. Here we investigate a method for calculating the precise quantum bounds on arbitrary Bell‐type inequalities by solving the eigenvalue problem for the operator associated with each Bell‐type inequality. Thereby, we use the min‐max principle to calculate the norm of these self‐adjoint operators from the maximal eigenvalue yielding the upper bound for a particular set of measurement parameters. The eigenvectors corresponding to the maximal eigenvalues provide the quantum state for which a Bell‐type inequality is maximally violated.
The problem of characterizing classical and quantum correlations in networks is considered. Contrary to the usual Bell scenario, where distant observers share a physical system emitted by one common source, a network features several independent sources, each distributing a physical system to a subset of observers. In the quantum setting, the observers can perform joint measurements on initially independent systems, which may lead to strong correlations across the whole network. In this work, we introduce a technique to systematically map a Bell inequality to a family of Bell-type inequalities bounding classical correlations on networks in a star-configuration. Also, we show that whenever a given Bell inequality can be violated by some entangled state ρ , then all the corresponding network inequalities can be violated by considering many copies of ρ distributed in the star network. The relevance of these ideas is illustrated by applying our method to a specific multi-setting Bell inequality. We derive the corresponding network inequalities, and study their quantum violations.