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

Bell Inequalities and a Hardware Noise Fingerprint on Real Superconducting Quantum Hardware

Paul Jarvis

Published Sep 14, 2026• 0 citations
Publisher

Abstract

We prepare a two-qubit Bell state on a real, publicly accessible superconducting quantum processor and measure CHSH correlations, obtaining a ten-run mean S = 2.7269 (classical bound 2, Tsirelson bound 2.828), with all ten runs individually violating the classical bound. We extend to a three-qubit GHZ state and the Mermin inequality (mean M = 3.7565, classical bound 2, quantum maximum 4, 100% of runs violating). We document two sign-convention bugs caught via verification against ideal statevector simulation before touching hardware. Finally, we port a probe-geometry backreaction reproducibility diagnostic from a companion project onto real hardware as a noise probe, catching and fixing two further bugs (a qubit-indexing error and a Qiskit transpilation layout bug) along the way, each reported alongside its correction. The corrected noise-fingerprint result is real and reproduced across independent hardware batches, but only partially understood: circuit depth alone does not explain it. We report this honestly as an open question rather than retrofitting a cleaner story.

DOI
10.5281/zenodo.22753678

Related papers

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

Generalized Mermin Inequalities for Benchmarking Large-Scale GHZ States

Jianbin Cai, Junxiang Huang, Fynn Otto +15 more

Multipartite Bell tests provide a correlation-only route to benchmarking quantum processors, but their application at large scales is hindered by the rapid decay of many-body correlators under noise and exponentially many terms in conventional Bell expressions. Here we address these scalability obstacles by introducing a finite-setting generalized Mermin family of state-tailored Bell inequalities with analytic certification bounds, in which the measurement-setting number $m$ provides an additional certification dimension complementary to the system size $n$. We show that, for the powers-of-two setting choices considered here, increasing $m$ leaves the ideal normalized multipartite quantum value unchanged while lowering the relevant classical bounds, thereby strengthening the Bell-violation ratios and yielding an improved noise-robustness scaling compared to the standard Mermin inequality. We test this construction experimentally on a programmable superconducting processor by preparing Greenberger-Horne-Zeilinger (GHZ) states of up to 80 qubits. Using randomized sampling for direct Bell-operator estimation, we observe Bell ratios that grow exponentially with system size, certify a nonlocality depth of 14, and show that increasing $m$ strengthens both the Bell ratio and depth certification. All results are obtained solely from measured correlators and analytical bounds, without readout correction, tomography, or model-based mitigation. Generalized Mermin inequalities therefore provide a sharper Bell benchmark for noisy large-scale GHZ states.

quant-pharXiv:2607.23574•Jul 28, 2026•1 citation

Investigation of Hardware Architecture Effects on Quantum Algorithm Performance: A Comparative Hardware Study

Askar Oralkhan, Temirlan Zhaxalykov

Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms. Unlike classical systems, however, identical quantum circuits may exhibit substantially different behavior across devices due to architectural variations in qubit connectivity, gate fidelity, and coherence times. In this work, we systematically benchmark five representative quantum algorithms - Bell state preparation, GHZ state generation, Quantum Fourier Transform (QFT), Grover's Search, and the Quantum Approximate Optimization Algorithm (QAOA) - across trapped-ion, superconducting, and simulator backends using Amazon Braket. Performance metrics including fidelity, CHSH violation, success probability, circuit depth, and gate counts are evaluated. Our results demonstrate a strong dependence of algorithmic performance on hardware topology and noise characteristics. For example, 10-qubit GHZ states achieved fidelities above 0.8 on trapped-ion hardware, while superconducting platforms dropped below 0.15 due to routing overhead and accumulated two-qubit gate errors. These findings highlight the importance of hardware-aware algorithm selection and provide practical guidance for benchmarking in the NISQ era.

quant-pharXiv:2601.05286•Jan 8, 2026•1 citation

Practical Guide to Using a Quantum Computer (Based on Materials from the International Quantum Center at CERN, Switzerland) # 4

Mikhail Pavlov

Abstract This laboratory work presents a practical implementation of the CHSH game using the Qiskit framework and IBM quantum hardware. The material is based on educational resources developed by the International Quantum Center at CERN (Switzerland) and aims to provide an experimental demonstration of quantum nonlocality and Bell inequality violation. In Laboratory Work No. 4, participants implement a simplified version of the Clauser–Horne–Shimony–Holt (CHSH) game to test whether IBM quantum processors exhibit genuinely quantum behavior. The CHSH game is a fundamental protocol in quantum information theory that distinguishes classical correlations from quantum correlations through statistical violation of Bell inequalities. Using Qiskit, a two-qubit entangled state is prepared and measurement settings corresponding to different basis choices are applied. By executing the circuit multiple times on a simulator and real quantum hardware, participants collect measurement statistics and compute the CHSH correlation parameter. If the experimentally obtained value exceeds the classical bound, the results provide empirical evidence of quantum entanglement and nonlocal correlations. This laboratory exercise demonstrates how foundational concepts of quantum mechanics—entanglement, superposition, and measurement basis dependence—can be directly tested using cloud-accessible quantum processors. The experiment not only reinforces theoretical understanding of Bell inequalities but also introduces practical skills in circuit construction, parameterized measurements, statistical analysis, and noise considerations in real quantum devices.

•Mar 3, 2026•0 citations

Experimental violations of Leggett-Garg inequalities on a quantum computer

Alessandro Santini, Vittorio Vitale

Leggett-Garg's inequalities predict sharp bounds for some classical correlation functions that address the quantum or classical nature of real-time evolutions. We experimentally observe the violations of these bounds on single- and multiqubit systems, in different settings, exploiting the IBM Quantum platform. In the multiqubit case, we introduce the Leggett-Garg-Bell's inequalities as an alternative to the previous ones. Measuring these correlation functions, we find quantum error mitigation to be essential to spot inequalities violations. Accessing only two qubit readouts, we assess Leggett-Garg-Bell's inequalities to emerge as the most efficient quantum coherence witnesses to be used for investigating quantum hardware, among those introduced. Our analysis highlights the limits of current quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.

arXiv:2109.02507•Physical Review A•Mar 24, 2022•21 citations

Experimental Violation of Bell’s Inequality beyond Tsirelson’s Bound

Yu-Ao Chen, Tao Yang, An‐Ning Zhang +3 more

The correlations between two qubits belonging to a three-qubit system can violate the Clauser-Horne-Shimony-Holt-Bell inequality beyond Tsirelson's bound [A. Cabello, Phys. Rev. Lett. 88, 060403 (2002)]. We experimentally demonstrate such a violation by 7 standard deviations by using a three-photon polarization-entangled Greenberger-Horne-Zeilinger state produced by Type-II spontaneous parametric down-conversion. In addition, using part of our results, we obtain a violation of the Mermin inequality by 39 standard deviations.

arXiv:quant-ph/0607194•Physical Review Letters•Oct 27, 2006•21 citations
We prepare a two-qubit Bell state on a real, publicly accessible superconducting quantum processor and measure CHSH correlations, obtaining a ten-run mean S = 2.7269 (classical bound 2, Tsirelson bound 2.828), with all ten runs individually violating the classical bound. We extend to a three-qubit GHZ state and the Mermin inequality (mean M = 3.7565, classical bound 2, quantum maximum 4, 100% of runs violating). We document two sign-convention bugs caught via verification against ideal statevector simulation before touching hardware. Finally, we port a probe-geometry backreaction reproducibility diagnostic from a companion project onto real hardware as a noise probe, catching and fixing two further bugs (a qubit-indexing error and a Qiskit transpilation layout bug) along the way, each reported alongside its correction. The corrected noise-fingerprint result is real and reproduced across independent hardware batches, but only partially understood: circuit depth alone does not explain it. We report this honestly as an open question rather than retrofitting a cleaner story.
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 θ'.
Multipartite Bell tests provide a correlation-only route to benchmarking quantum processors, but their application at large scales is hindered by the rapid decay of many-body correlators under noise and exponentially many terms in conventional Bell expressions. Here we address these scalability obstacles by introducing a finite-setting generalized Mermin family of state-tailored Bell inequalities with analytic certification bounds, in which the measurement-setting number mmm provides an additional certification dimension complementary to the system size nnn. We show that, for the powers-of-two setting choices considered here, increasing mmm leaves the ideal normalized multipartite quantum value unchanged while lowering the relevant classical bounds, thereby strengthening the Bell-violation ratios and yielding an improved noise-robustness scaling compared to the standard Mermin inequality. We test this construction experimentally on a programmable superconducting processor by preparing Greenberger-Horne-Zeilinger (GHZ) states of up to 80 qubits. Using randomized sampling for direct Bell-operator estimation, we observe Bell ratios that grow exponentially with system size, certify a nonlocality depth of 14, and show that increasing mmm strengthens both the Bell ratio and depth certification. All results are obtained solely from measured correlators and analytical bounds, without readout correction, tomography, or model-based mitigation. Generalized Mermin inequalities therefore provide a sharper Bell benchmark for noisy large-scale GHZ states.
Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms. Unlike classical systems, however, identical quantum circuits may exhibit substantially different behavior across devices due to architectural variations in qubit connectivity, gate fidelity, and coherence times. In this work, we systematically benchmark five representative quantum algorithms - Bell state preparation, GHZ state generation, Quantum Fourier Transform (QFT), Grover's Search, and the Quantum Approximate Optimization Algorithm (QAOA) - across trapped-ion, superconducting, and simulator backends using Amazon Braket. Performance metrics including fidelity, CHSH violation, success probability, circuit depth, and gate counts are evaluated. Our results demonstrate a strong dependence of algorithmic performance on hardware topology and noise characteristics. For example, 10-qubit GHZ states achieved fidelities above 0.8 on trapped-ion hardware, while superconducting platforms dropped below 0.15 due to routing overhead and accumulated two-qubit gate errors. These findings highlight the importance of hardware-aware algorithm selection and provide practical guidance for benchmarking in the NISQ era.
Abstract This laboratory work presents a practical implementation of the CHSH game using the Qiskit framework and IBM quantum hardware. The material is based on educational resources developed by the International Quantum Center at CERN (Switzerland) and aims to provide an experimental demonstration of quantum nonlocality and Bell inequality violation. In Laboratory Work No. 4, participants implement a simplified version of the Clauser–Horne–Shimony–Holt (CHSH) game to test whether IBM quantum processors exhibit genuinely quantum behavior. The CHSH game is a fundamental protocol in quantum information theory that distinguishes classical correlations from quantum correlations through statistical violation of Bell inequalities. Using Qiskit, a two-qubit entangled state is prepared and measurement settings corresponding to different basis choices are applied. By executing the circuit multiple times on a simulator and real quantum hardware, participants collect measurement statistics and compute the CHSH correlation parameter. If the experimentally obtained value exceeds the classical bound, the results provide empirical evidence of quantum entanglement and nonlocal correlations. This laboratory exercise demonstrates how foundational concepts of quantum mechanics—entanglement, superposition, and measurement basis dependence—can be directly tested using cloud-accessible quantum processors. The experiment not only reinforces theoretical understanding of Bell inequalities but also introduces practical skills in circuit construction, parameterized measurements, statistical analysis, and noise considerations in real quantum devices.
Leggett-Garg's inequalities predict sharp bounds for some classical correlation functions that address the quantum or classical nature of real-time evolutions. We experimentally observe the violations of these bounds on single- and multiqubit systems, in different settings, exploiting the IBM Quantum platform. In the multiqubit case, we introduce the Leggett-Garg-Bell's inequalities as an alternative to the previous ones. Measuring these correlation functions, we find quantum error mitigation to be essential to spot inequalities violations. Accessing only two qubit readouts, we assess Leggett-Garg-Bell's inequalities to emerge as the most efficient quantum coherence witnesses to be used for investigating quantum hardware, among those introduced. Our analysis highlights the limits of current quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
The correlations between two qubits belonging to a three-qubit system can violate the Clauser-Horne-Shimony-Holt-Bell inequality beyond Tsirelson's bound [A. Cabello, Phys. Rev. Lett. 88, 060403 (2002)]. We experimentally demonstrate such a violation by 7 standard deviations by using a three-photon polarization-entangled Greenberger-Horne-Zeilinger state produced by Type-II spontaneous parametric down-conversion. In addition, using part of our results, we obtain a violation of the Mermin inequality by 39 standard deviations.