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 Chemistry Chemical Physics

Bell inequalities for entangled qubits: quantitative tests of quantum character and nonlocality on quantum computers

David Z. Wang, Aidan Q. Gauthier, Ashley E. Siegmund, Katharine L. C. Hunt

Published Jan 1, 2021• 3 citations
Publisher

Abstract

This work provides quantitative tests of the extent of violation of two inequalities applicable to qubits coupled into Bell states, using IBM's publicly accessible quantum computers. Violations of the inequalities are well established. Our purpose is not to test the inequalities, but rather to determine how well quantum mechanical predictions can be reproduced on quantum computers, given their current fault rates. We present results for the spin projections of two entangled qubits, along three axes A, B, and C, with a fixed angle θ between A and B and a range of angles θ' between B and C. For any classical object that can be characterized by three observables with two possible values, inequalities govern relationships among the probabilities of outcomes for the observables, taken pairwise. From set theory, these inequalities must be satisfied by all such classical objects; but quantum systems may violate the inequalities. We have detected clear-cut violations of one inequality in runs on IBM's publicly accessible quantum computers. The Clauser-Horne-Shimony-Holt (CHSH) inequality governs a linear combination S of expectation values of products of spin projections, taken pairwise. Finding S > 2 rules out local, hidden variable theories for entangled quantum systems. We obtained values of S greater than 2 in our runs prior to error mitigation. To reduce the quantitative errors, we used a modification of the error-mitigation procedure in the IBM documentation. We prepared a pair of qubits in the state |00〉, found the probabilities to observe the states |00〉, |01〉, |10〉, and |11〉 in multiple runs, and used that information to construct the first column of an error matrix M. We repeated this procedure for states prepared as |01〉, |10〉, and |11〉 to construct the full matrix M, whose inverse is the filtering matrix. After applying filtering matrices to our averaged outcomes, we have found good quantitative agreement between the quantum computer output and the quantum mechanical predictions for the extent of violation of both inequalities as functions of θ'.

DOI
10.1039/d0cp05444e

Related papers

Testing nonlocality in quantum networks using iteratively obtained Bell inequalities

Rik van Heerden

Quantum networks play an important role in the fields of quantum information and quantum computation. One of the current problems for these networks concerns nonlocality. Characterizing and detecting nonlocality is relevant to the implementation of quantum networks and quantum repeaters, where Bell inequalities can be used to test if configurations are prepared correctly. This report contains an overview of an iterative method to find Bell inequalities for networks. Starting from a given network, this method constructs a new Bell inequality for a network containing one additional source and one additional party. We use this procedure to find new Bell inequalities for specific network structures and analyse how these can be used to detect nonlocality within a network. In the first part the Bell inequalities are considered from a more theoretical point of view. We focus on star-shaped networks and discuss violations predicted by quantum mechanics. We look for quantitative bounds describing a set of states that lead to violation, giving an indication of the required quality of the sources. Finally this method is applied to a setup similar to the one described by Bernien et al. We consider a network consisting of three parties and two sources. The effect of errors during preparation of an entangled pair of photons on the ability to detect nonlocality is evaluated. The same is done for the effect of measurement errors. Using numerical computations we show that violation of the Bell inequality can be improved by choosing different measurement angles.

•Jan 1, 2018•0 citations

Detection of entanglement and Bell's inequality violation

Kai Chen, Ling-An Wu

We propose a new method for detecting entanglement of two qubits and discuss its relation with the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality. Without the need for full quantum tomography for the density matrix we can experimentally detect the entanglement by measuring less than 9 local observables for any given state. We show that this test is stronger than the CHSH-Bell inequality and also gives an estimation for the degree of entanglement. If prior knowledge is available we can further greatly reduce the number of required local observables. The test is convenient and feasible with present experimental technology.

arXiv:quant-ph/0306137•Jun 20, 2003•2 citations

EXPERIMENTAL PROOF OF THE VIOLATION OF THE BELL INEQUALITY USING QUANTUM COMPUTERS

Tobias Worledge

With quantum computing’s potential to be exponentially more powerful than classical computing, due to superposition and entanglement, several companies including IBM have started to develop quantum computers. Since 2016, IBM has developed publicly accessible cloud-based quantum computers. While the development of quantum computing can revolutionize decryption, optimization, and the simulation of quantum systems, quantum computers must maintain a high level of accuracy as they are scaled up. This paper introduces the fundamental gates used on IBM’s quantum computers and provides visualizations of each gate. A thought experiment involving two quantum entangled particles is used to explain the Einstein-Podolsky-Rosen Paradox, and two potential explanations are introduced: violation of locality and the Hidden Variable Theory. Experimental results are reported for the quality of entanglement created on IBM’s publicly accessible 5-qubit quantum computers by creating entanglement between 2 qubits and then measuring both qubits along a set combination of axes, and demonstrating the violation of the Bell-CHSH Inequality. Six out of seven 5-qubit quantum computers violated the Bell-CHSH Inequality, thus demonstrating strong quantum entanglement between 2 qubits, a standard crucial for scaling up quantum computers to harness their exponentially scaling power.

Journal of applied physical science international•Aug 13, 2020•0 citations

Quantum nonlocality, Bell inequalities, and the memory loophole

Jonathan Barrett, Daniel Collins, Lucién Hardy +2 more

In the analysis of experiments designed to reveal violation of Bell-type inequalities, it is usually assumed that any hidden variables associated with the $n\mathrm{th}$ particle pair would be independent of measurement choices and outcomes for the first $(n\ensuremath{-}1)$ pairs. Models which violate this assumption exploit what we call the memory loophole. We focus on the strongest type of violation, which uses the two-sided memory loophole, in which the hidden variables for pair n can depend on the previous measurement choices and outcomes in both wings of the experiment. We show that the two-sided memory loophole allows a systematic violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality when the data are analyzed in the standard way, but cannot produce a violation if a CHSH expression depending linearly on the data is used. In the first case, the maximal CHSH violation becomes small as the number of particle pairs tested becomes large. Hence, although in principle the memory loophole implies a slight flaw in the existing analyses of Bell experiments, the data still strongly confirm quantum mechanics against local hidden variables. We consider also a related loophole, the simultaneous measurement loophole, which applies if all measurements on each side are carried out simultaneously. We show that this can increase the probability of violating the linearized CHSH inequality as well as other Bell-type inequalities.

arXiv:quant-ph/0205016•Physical Review A•Oct 21, 2002•135 citations

Entanglement estimation from Bell inequality violation

Karol Bartkiewicz, Bohdan Horst, Karel Lemr +1 more

It is well known that the violation of Bell's inequality in the form given by Clauser, Horne, Shimony, and Holt (CHSH) in two-qubit systems requires entanglement, but not vice versa, i.e., there are entangled states which do not violate the CHSH inequality. Here we compare some standard entanglement measures with violations of the CHSH inequality (as given by the Horodecki measure) for two-qubit states generated by Monte Carlo simulations. We describe states that have extremal entanglement according to the negativity, concurrence, and relative entropy of entanglement for a given value of the CHSH violation. We explicitly find these extremal states by applying the generalized method of Lagrange multipliers based on the Karush-Kuhn-Tucker conditions. The found minimal and maximal states define the range of entanglement accessible for any two-qubit states that violate the CHSH inequality by the same amount. We also find extremal states for the concurrence versus negativity by considering only such states which do not violate the CHSH inequality. Furthermore, we describe an experimentally efficient linear-optical method to determine the highest Horodecki degree of the CHSH violation for arbitrary mixed states of two polarization qubits. By assuming to have access simultaneously to two copies of the states, our method requires only six discrete measurement settings instead of nine settings, which are usually considered.

arXiv:1306.6504•Physical Review A•Nov 7, 2013•95 citations

Maximal nonlocality from maximal entanglement and mutually unbiased bases, and self-testing of two-qutrit quantum systems

Jędrzej Kaniewski, Ivan Šupić, Jordi Tura +3 more

Bell inequalities are an important tool in device-independent quantum information processing because their violation can serve as a certificate of relevant quantum properties. Probably the best known example of a Bell inequality is due to Clauser, Horne, Shimony and Holt (CHSH), which is defined in the simplest scenario involving two dichotomic measurements and whose all key properties are well understood. There have been many attempts to generalise the CHSH Bell inequality to higher-dimensional quantum systems, however, for most of them the maximal quantum violation---the key quantity for most device-independent applications---remains unknown. On the other hand, the constructions for which the maximal quantum violation can be computed, do not preserve the natural property of the CHSH inequality, namely, that the maximal quantum violation is achieved by the maximally entangled state and measurements corresponding to mutually unbiased bases. In this work we propose a novel family of Bell inequalities which exhibit precisely these properties, and whose maximal quantum violation can be computed analytically. In the simplest scenario it recovers the CHSH Bell inequality. These inequalities involve d measurements settings, each having d outcomes for an arbitrary prime number d ≥ 3 . We then show that in the three-outcome case our Bell inequality can be used to self-test the maximally entangled state of two-qutrits and three mutually unbiased bases at each site. Yet, we demonstrate that in the case of more outcomes, their maximal violation does not allow for self-testing in the standard sense, which motivates the definition of a new weak form of self-testing. The ability to certify high-dimensional MUBs makes these inequalities attractive from the device-independent cryptography point of view.

arXiv:1807.03332•Quantum•Oct 24, 2019•75 citations
This work provides quantitative tests of the extent of violation of two inequalities applicable to qubits coupled into Bell states, using IBM's publicly accessible quantum computers. Violations of the inequalities are well established. Our purpose is not to test the inequalities, but rather to determine how well quantum mechanical predictions can be reproduced on quantum computers, given their current fault rates. We present results for the spin projections of two entangled qubits, along three axes A, B, and C, with a fixed angle θ between A and B and a range of angles θ' between B and C. For any classical object that can be characterized by three observables with two possible values, inequalities govern relationships among the probabilities of outcomes for the observables, taken pairwise. From set theory, these inequalities must be satisfied by all such classical objects; but quantum systems may violate the inequalities. We have detected clear-cut violations of one inequality in runs on IBM's publicly accessible quantum computers. The Clauser-Horne-Shimony-Holt (CHSH) inequality governs a linear combination S of expectation values of products of spin projections, taken pairwise. Finding S > 2 rules out local, hidden variable theories for entangled quantum systems. We obtained values of S greater than 2 in our runs prior to error mitigation. To reduce the quantitative errors, we used a modification of the error-mitigation procedure in the IBM documentation. We prepared a pair of qubits in the state |00〉, found the probabilities to observe the states |00〉, |01〉, |10〉, and |11〉 in multiple runs, and used that information to construct the first column of an error matrix M. We repeated this procedure for states prepared as |01〉, |10〉, and |11〉 to construct the full matrix M, whose inverse is the filtering matrix. After applying filtering matrices to our averaged outcomes, we have found good quantitative agreement between the quantum computer output and the quantum mechanical predictions for the extent of violation of both inequalities as functions of θ'.
Quantum networks play an important role in the fields of quantum information and quantum computation. One of the current problems for these networks concerns nonlocality. Characterizing and detecting nonlocality is relevant to the implementation of quantum networks and quantum repeaters, where Bell inequalities can be used to test if configurations are prepared correctly. This report contains an overview of an iterative method to find Bell inequalities for networks. Starting from a given network, this method constructs a new Bell inequality for a network containing one additional source and one additional party. We use this procedure to find new Bell inequalities for specific network structures and analyse how these can be used to detect nonlocality within a network. In the first part the Bell inequalities are considered from a more theoretical point of view. We focus on star-shaped networks and discuss violations predicted by quantum mechanics. We look for quantitative bounds describing a set of states that lead to violation, giving an indication of the required quality of the sources. Finally this method is applied to a setup similar to the one described by Bernien et al. We consider a network consisting of three parties and two sources. The effect of errors during preparation of an entangled pair of photons on the ability to detect nonlocality is evaluated. The same is done for the effect of measurement errors. Using numerical computations we show that violation of the Bell inequality can be improved by choosing different measurement angles.
We propose a new method for detecting entanglement of two qubits and discuss its relation with the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality. Without the need for full quantum tomography for the density matrix we can experimentally detect the entanglement by measuring less than 9 local observables for any given state. We show that this test is stronger than the CHSH-Bell inequality and also gives an estimation for the degree of entanglement. If prior knowledge is available we can further greatly reduce the number of required local observables. The test is convenient and feasible with present experimental technology.
With quantum computing’s potential to be exponentially more powerful than classical computing, due to superposition and entanglement, several companies including IBM have started to develop quantum computers. Since 2016, IBM has developed publicly accessible cloud-based quantum computers. While the development of quantum computing can revolutionize decryption, optimization, and the simulation of quantum systems, quantum computers must maintain a high level of accuracy as they are scaled up. This paper introduces the fundamental gates used on IBM’s quantum computers and provides visualizations of each gate. A thought experiment involving two quantum entangled particles is used to explain the Einstein-Podolsky-Rosen Paradox, and two potential explanations are introduced: violation of locality and the Hidden Variable Theory. Experimental results are reported for the quality of entanglement created on IBM’s publicly accessible 5-qubit quantum computers by creating entanglement between 2 qubits and then measuring both qubits along a set combination of axes, and demonstrating the violation of the Bell-CHSH Inequality. Six out of seven 5-qubit quantum computers violated the Bell-CHSH Inequality, thus demonstrating strong quantum entanglement between 2 qubits, a standard crucial for scaling up quantum computers to harness their exponentially scaling power.
In the analysis of experiments designed to reveal violation of Bell-type inequalities, it is usually assumed that any hidden variables associated with the nthn\mathrm{th}nth particle pair would be independent of measurement choices and outcomes for the first $(n\ensuremath{-}1)$ pairs. Models which violate this assumption exploit what we call the memory loophole. We focus on the strongest type of violation, which uses the two-sided memory loophole, in which the hidden variables for pair n can depend on the previous measurement choices and outcomes in both wings of the experiment. We show that the two-sided memory loophole allows a systematic violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality when the data are analyzed in the standard way, but cannot produce a violation if a CHSH expression depending linearly on the data is used. In the first case, the maximal CHSH violation becomes small as the number of particle pairs tested becomes large. Hence, although in principle the memory loophole implies a slight flaw in the existing analyses of Bell experiments, the data still strongly confirm quantum mechanics against local hidden variables. We consider also a related loophole, the simultaneous measurement loophole, which applies if all measurements on each side are carried out simultaneously. We show that this can increase the probability of violating the linearized CHSH inequality as well as other Bell-type inequalities.
It is well known that the violation of Bell's inequality in the form given by Clauser, Horne, Shimony, and Holt (CHSH) in two-qubit systems requires entanglement, but not vice versa, i.e., there are entangled states which do not violate the CHSH inequality. Here we compare some standard entanglement measures with violations of the CHSH inequality (as given by the Horodecki measure) for two-qubit states generated by Monte Carlo simulations. We describe states that have extremal entanglement according to the negativity, concurrence, and relative entropy of entanglement for a given value of the CHSH violation. We explicitly find these extremal states by applying the generalized method of Lagrange multipliers based on the Karush-Kuhn-Tucker conditions. The found minimal and maximal states define the range of entanglement accessible for any two-qubit states that violate the CHSH inequality by the same amount. We also find extremal states for the concurrence versus negativity by considering only such states which do not violate the CHSH inequality. Furthermore, we describe an experimentally efficient linear-optical method to determine the highest Horodecki degree of the CHSH violation for arbitrary mixed states of two polarization qubits. By assuming to have access simultaneously to two copies of the states, our method requires only six discrete measurement settings instead of nine settings, which are usually considered.
Bell inequalities are an important tool in device-independent quantum information processing because their violation can serve as a certificate of relevant quantum properties. Probably the best known example of a Bell inequality is due to Clauser, Horne, Shimony and Holt (CHSH), which is defined in the simplest scenario involving two dichotomic measurements and whose all key properties are well understood. There have been many attempts to generalise the CHSH Bell inequality to higher-dimensional quantum systems, however, for most of them the maximal quantum violation---the key quantity for most device-independent applications---remains unknown. On the other hand, the constructions for which the maximal quantum violation can be computed, do not preserve the natural property of the CHSH inequality, namely, that the maximal quantum violation is achieved by the maximally entangled state and measurements corresponding to mutually unbiased bases. In this work we propose a novel family of Bell inequalities which exhibit precisely these properties, and whose maximal quantum violation can be computed analytically. In the simplest scenario it recovers the CHSH Bell inequality. These inequalities involve d measurements settings, each having d outcomes for an arbitrary prime number d ≥ 3 . We then show that in the three-outcome case our Bell inequality can be used to self-test the maximally entangled state of two-qutrits and three mutually unbiased bases at each site. Yet, we demonstrate that in the case of more outcomes, their maximal violation does not allow for self-testing in the standard sense, which motivates the definition of a new weak form of self-testing. The ability to certify high-dimensional MUBs makes these inequalities attractive from the device-independent cryptography point of view.