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:2206.13945 · The Physics Teacher

Testing a Bell Inequality with a Remote Quantum Processor

Jed Brody, Robert Avram

Published Feb 23, 2023• 8 citations
arXivHTMLPDF

Abstract

IBM Quantum offers free remote access to real quantum processors. One of the many experiments now accessible to all students is a test of Bell inequalities. This experiment introduces the rigorous mysteries that physicists have grappled with for a century. Using IBM Quantum to test Bell inequalities is not new. However, we are unaware of any single reference, appropriate for introductory students, that contains (1) the derivation of a Bell inequality, (2) the derivation of the corresponding quantum prediction, and (3) instructions for carrying out the experiment with IBM Quantum.

DOI
10.1119/5.0069073

Related papers

Bench-Testing Five Remote Quantum Computing Providers

Mica Einhorn, Jed Brody

The quantum workforce is growing, and there appears to be a need for professionals who can collect, process, and interpret quantum data; perform uncertainty analysis; and manage and execute experiments. Since these skills can be practiced on remote equipment, there is no need for local equipment that may be prohibitively expensive and labor-intensive to maintain at some institutions. Many instructional materials have been developed for use with remote quantum processors, including tests of Bell inequalities and applications of Grover's algorithm and Shor's algorithm. Although simulators may be used for all these exercises, experimental error is a major feature of today's noisy quantum computers, and we might as well obtain real data affected by real error, rather than simulating it. (There is ongoing debate about the relative merits of simulators and remote labs for science education in general. One study shows better learning outcomes from remote labs than from simulators of radioactivity experiments, though this has not been tested for quantum computing.)

The Physics Teacher•Oct 29, 2026•0 citations

Five Experimental Tests on the 5-Qubit IBM Quantum Computer

Diego García-Martín, Germán Sierra

The 5-qubit quantum computer prototypes that IBM has given open access to on the cloud allow the implementation of real experiments on a quantum processor. We present the results obtained in five experimental tests performed on these computers: dense coding, quantum Fourier transforms, Bell’s inequality, Mermin’s inequalities (up to n=5) and the construction of the prime state . These results serve to assess the functioning of the IBM 5Q chips.

arXiv:1712.05642•Journal of Applied Mathematics and Physics•Jan 1, 2018•64 citations

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

David Z. Wang, Aidan Q. Gauthier, Ashley E. Siegmund +1 more

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 θ'.

Physical Chemistry Chemical Physics•Jan 1, 2021•3 citations

Factoring 15 with a remote quantum computer: a complete guide for beginners

Jed Brody, Kristen Gram

Abstract We present, for the non-specialist, an experimental implementation of Shor’s factoring algorithm. We are unaware of any other single reference that explains, in a beginner-friendly way, complete circuits that implement Shor’s algorithm. We perform the experiment with IBM quantum processors, which are remotely accessible online for free. We reproducibly factor 15 with one 7-qubit processor (ibm_perth), while four other quantum processors exhibit excessive error.

European Journal of Physics•Mar 12, 2024•2 citations

Test of Bell’s and Mermin’s inequalities on Quantum Computer

Yangping Zheng, Xuesi Wang, Le Wang +2 more

Quantum computers have tremendous potential of simulating large quantum systems that classical computers can’t. In the theoretical verification of quantum non-locality principle, Bell’s and Mermin’s inequalities stood out, which proved to be valid in multiple empirical experiments. In this paper we report the tests of Bell and Mermin’s inequalities carried out on the 2- qubit and 3-qubit IBM quantum computer respectively. By comparing the result we obtained and the pattern predicted by the inequalities, our experimental results indicate clear violations of the two inequalities; thereby, we validate postulates in quantum mechanics and disprove the local realism argument in classical hidden variable theories proposed by Einstein, Podolsky, and Rosen on quantum circuits.

International Conference on Information Technology and Computer Application (ITCA)•Dec 1, 2020•0 citations

Testing Bell inequalities and calculating spin correlations with IBM quantum processors

Jed Brody

Bulletin of the American Physical Society•Mar 16, 2021•0 citations
IBM Quantum offers free remote access to real quantum processors. One of the many experiments now accessible to all students is a test of Bell inequalities. This experiment introduces the rigorous mysteries that physicists have grappled with for a century. Using IBM Quantum to test Bell inequalities is not new. However, we are unaware of any single reference, appropriate for introductory students, that contains (1) the derivation of a Bell inequality, (2) the derivation of the corresponding quantum prediction, and (3) instructions for carrying out the experiment with IBM Quantum.
The quantum workforce is growing, and there appears to be a need for professionals who can collect, process, and interpret quantum data; perform uncertainty analysis; and manage and execute experiments. Since these skills can be practiced on remote equipment, there is no need for local equipment that may be prohibitively expensive and labor-intensive to maintain at some institutions. Many instructional materials have been developed for use with remote quantum processors, including tests of Bell inequalities and applications of Grover's algorithm and Shor's algorithm. Although simulators may be used for all these exercises, experimental error is a major feature of today's noisy quantum computers, and we might as well obtain real data affected by real error, rather than simulating it. (There is ongoing debate about the relative merits of simulators and remote labs for science education in general. One study shows better learning outcomes from remote labs than from simulators of radioactivity experiments, though this has not been tested for quantum computing.)
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 computers have tremendous potential of simulating large quantum systems that classical computers can’t. In the theoretical verification of quantum non-locality principle, Bell’s and Mermin’s inequalities stood out, which proved to be valid in multiple empirical experiments. In this paper we report the tests of Bell and Mermin’s inequalities carried out on the 2- qubit and 3-qubit IBM quantum computer respectively. By comparing the result we obtained and the pattern predicted by the inequalities, our experimental results indicate clear violations of the two inequalities; thereby, we validate postulates in quantum mechanics and disprove the local realism argument in classical hidden variable theories proposed by Einstein, Podolsky, and Rosen on quantum circuits.