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

International Conference on Quantum Communications, Networking, and Computing (QCNC)

Leggett-Type Tests as a Benchmark for Entanglement Quality

Alex Radocea

Published Apr 6, 2026• 0 citations
Publisher

Abstract

Noisy qubits pose a fundamental bottleneck for quantum machine learning on near-term hardware, making the characterization of entanglement quality essential. This work uses the Leggett inequalities introduced by Branciard et al. as a probe of bipartite entanglement quality, tested across ideal simulation, noisy simulation, and circuit execution on multiple platforms, including IonQ Forte-1 and IBM Heron R3 Pittsburgh. IonQ Forte-1 demonstrated robust Leggett violations under default transpilation, while IBM Pittsburgh required informed qubit selection to achieve violations. CZ gates on neighboring qubit pairs degraded entanglement correlations on IBM Pittsburgh, even without simultaneous gate execution. For systems that support mid-circuit measurement, the benchmark scales across circuit depth through sequential testing, and parallel singlet pairs extend it across circuit width. The high visibility requirements of the Leggett bound make it a sensitive and lightweight diagnostic for identifying high-quality entanglement resources and detecting correlated errors on quantum hardware.

DOI
10.1109/qcnc69040.2026.00158

Related papers

Entanglement detection with quantum support vector machine (QSVM) on near-term quantum devices

M. Mahdian, Zahra Beygom Mousavi

Detecting and quantifying quantum entanglement remain significant challenges in the noisy intermediate-scale quantum (NISQ) era. This study presents the implementation of quantum support vector machines (QSVMs) on IBM quantum devices to identify and classify entangled states. By employing quantum variational circuits, the proposed framework achieves a runtime complexity of [Formula: see text], where N is the number of qubits, t is the number of iterations, and ε is the acceptable error margin. We investigate various quantum circuits with multiple blocks and obtain the accuracy of QSVM as measures of expressibility and entangling capability. Our results demonstrate that the QSVM framework achieves over 90% accuracy in distinguishing entangled states, despite hardware noise such as decoherence and gate errors. Benchmarks across superconducting qubit platforms (e.g., IBM Perth, Lagos, and Nairobi) highlight the robustness of the model. Furthermore, the QSVM framework effectively classifies two-qubit states and extends its predictive capabilities to three-qubit entangled states. This work marks a significant advancement in quantum machine learning for entanglement detection.

arXiv:2503.23443•Scientific Reports•Apr 7, 2025•29 citations

An entanglement-based volumetric benchmark for near-term quantum hardware

Kathleen E. Hamilton, Nouamane Laanait, Akhil Francis +8 more

We introduce a volumetric benchmark for near-term quantum platforms based on the generation and verification of genuine entanglement across n-qubits using graph states and direct stabilizer measurements. Our benchmark evaluates the robustness of multipartite and bipartite n-qubit entanglement with respect to many sources of hardware noise: qubit decoherence, CNOT and swap gate noise, and readout error. We demonstrate our benchmark on multiple superconducting qubit platforms available from IBM (ibmq_belem, ibmq_toronto, ibmq_guadalupe and ibmq_jakarta). Subsets of $n<10$ qubits are used for graph state preparation and stabilizer measurement. Evaluation of genuine and biseparable entanglement witnesses we report observations of $5$ qubit genuine entanglement, but robust multipartite entanglement is difficult to generate for $n>4$ qubits and identify two-qubit gate noise as strongly correlated with the quality of genuine multipartite entanglement.

arXiv:2209.00678•Sep 1, 2022•10 citations

Experimental Evaluation of Multipartite Entanglement Across Trapped-Ion and Superconducting NISQ Architectures

Askar Oralkhan, Temirlan Zhaxalykov

The practical performance of Noisy Intermediate-Scale Quantum (NISQ) processors is strongly influenced by hardware architecture, connectivity, and noise characteristics. In this work, we present an experimental benchmarking study of multipartite entanglement across cloud-accessible trapped-ion and superconducting quantum processors. Using Bell-state CHSH violation and GHZ-state fidelity as quantitative metrics, we evaluate entanglement generation on IonQ (trapped-ion) and IQM and Rigetti (superconducting) platforms under consistent compilation and execution settings via Amazon Braket. Experimental results demonstrate that trapped-ion processors sustain high-fidelity multipartite entanglement for up to 10 qubits, while superconducting architectures exhibit rapid fidelity degradation as circuit depth and routing overhead increase. These findings highlight the critical role of qubit connectivity and two-qubit gate performance in near-term entanglement scalability and provide an empirical comparison of architectural trade-offs in current NISQ hardware.

IEEE International Conference on Smart Information Systems and Technologies (SIST)•May 13, 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

From Circuits to Hardware: Benchmarking Standard and Qubit-Efficient Quantum Optimization on Real Hardware

Monit Sharma, Hoong Chuin Lau

Despite rapid progress in quantum optimization, broad real-hardware benchmarks comparing multiple algorithmic families across diverse combinatorial problems under a common protocol remain limited. We benchmark gate-based quantum optimization on four NP-hard problems: multi-dimensional knapsack (MDKP), maximum independent set (MIS), quadratic assignment (QAP), and market-share (MSP). We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO, on IBM Heron r1/r2 processors using resilience-level-2 mitigation. To our knowledge, this includes the first real-hardware QRAO results and the first multi-problem PCE hardware benchmark. Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy, $F_{\mathrm{est}}$. For MDKP and MIS, an empirical operating point near $F_{\mathrm{est}}\approx 0.1$, corresponding to about 770 two-qubit gates at the median Heron-r2 CZ error rate, marks the onset of noise-dominated execution. QAP exposes a separate bottleneck: dense one-hot encodings and an exponentially sparse feasible manifold, with feasible fraction $10!/2^{100}$ at $n=10$; no tested hardware method produces a feasible assignment. Compiled QAOA-family circuits are generally noise dominated, and a matched uniform-random control shows that most feasible low-fidelity outcomes fall within the random range, apart from one finite-sample MIS warm-start exception. A SWAP-aware, fractional-gate, Nighthawk-topology compilation counterfactual reduces two-qubit counts but leaves all circuits below $F_{\mathrm{est}}=10^{-3}$. These conclusions apply to the tested implementations rather than QAOA in general. Qubit-efficient methods extend runnable instance sizes, but only within the empirical fidelity budget.

quant-pharXiv:2607.11637•Quantum Science and Technology•Jul 14, 2026•3 citations

Verified IBM Quantum Hardware Experiments: Bell State Entanglement, BB84 QKD, and Variational Quantum Circuits on ibm_fez Heron R2 and ibm_torino Heron R1

Dino Hatibovic

Eight verified quantum computing jobs executed on IBM Quantum hardware (ibm_fez Heron R2, 156 qubits; ibm_torino Heron R1, 133 qubits) between January 27 and March 15, 2026. User ID: IBMid-692001DJRD. Experiments include: 1. Bell State Entanglement — 96.3% fidelity on ibm_fez Heron R2 (Concurrence C = 0.926, Tangle T = 0.858, 1,000 shots). Cross-platform benchmark: Heron R2 vs Heron R1 (+8.3 pp fidelity advantage, noise ratio 2.43×). 2. Reproducibility Test — Two independent runs of identical circuit (χ² = 2.70, p = 0.44, df = 3). H₀ not rejected: statistically indistinguishable results at 95% confidence. 3. BB84 Quantum Key Distribution — Full Alice/Eve/Bob protocol implementation. Alice baseline error 0.60% → Bob QBER 49.0% under eavesdropping (82× degradation). Experimental demonstration of the quantum no-cloning theorem. Control group design isolates eavesdropper signal from hardware noise baseline. 4. Variational Quantum Circuit (VQC) — 2-qubit circuit, 10 trained parameters with tied weights (θ₃ = θ₄), 8 CZ gates in 4 entangling layers. 4-qubit ansatz: Shannon entropy 3.885/4.000 bits (97.1%), ground-state bias confirmed (χ² = 300.94, p ≈ 0). 5. Quantum Random Number Generation (QRNG) — 8-bit outputs, 10/10 unique values per shot (range 16–254). Total: 39,010 quantum measurements across 8 jobs and 10 circuits. QPU time: 4.8 seconds. Job completion rate: 100%. All results decoded from raw IBM SamplerV2 BitArray binary archives (zlib + base64 + NumPy .npy pipeline). No simulations. Statistical validation applied throughout (Wilson 95% CIs, chi-squared tests). Stack: Qiskit Runtime SamplerV2 · QPY · OpenQASM 2.0 · Python · NumPy · SciPy Repository: https://github.com/dinohatibovicWhitepaper: https://dinohatibovic.github.io (Doc QAI-WP-2026-01-28-V4)

•Jun 19, 2026•0 citations
Noisy qubits pose a fundamental bottleneck for quantum machine learning on near-term hardware, making the characterization of entanglement quality essential. This work uses the Leggett inequalities introduced by Branciard et al. as a probe of bipartite entanglement quality, tested across ideal simulation, noisy simulation, and circuit execution on multiple platforms, including IonQ Forte-1 and IBM Heron R3 Pittsburgh. IonQ Forte-1 demonstrated robust Leggett violations under default transpilation, while IBM Pittsburgh required informed qubit selection to achieve violations. CZ gates on neighboring qubit pairs degraded entanglement correlations on IBM Pittsburgh, even without simultaneous gate execution. For systems that support mid-circuit measurement, the benchmark scales across circuit depth through sequential testing, and parallel singlet pairs extend it across circuit width. The high visibility requirements of the Leggett bound make it a sensitive and lightweight diagnostic for identifying high-quality entanglement resources and detecting correlated errors on quantum hardware.
Detecting and quantifying quantum entanglement remain significant challenges in the noisy intermediate-scale quantum (NISQ) era. This study presents the implementation of quantum support vector machines (QSVMs) on IBM quantum devices to identify and classify entangled states. By employing quantum variational circuits, the proposed framework achieves a runtime complexity of [Formula: see text], where N is the number of qubits, t is the number of iterations, and ε is the acceptable error margin. We investigate various quantum circuits with multiple blocks and obtain the accuracy of QSVM as measures of expressibility and entangling capability. Our results demonstrate that the QSVM framework achieves over 90% accuracy in distinguishing entangled states, despite hardware noise such as decoherence and gate errors. Benchmarks across superconducting qubit platforms (e.g., IBM Perth, Lagos, and Nairobi) highlight the robustness of the model. Furthermore, the QSVM framework effectively classifies two-qubit states and extends its predictive capabilities to three-qubit entangled states. This work marks a significant advancement in quantum machine learning for entanglement detection.
We introduce a volumetric benchmark for near-term quantum platforms based on the generation and verification of genuine entanglement across n-qubits using graph states and direct stabilizer measurements. Our benchmark evaluates the robustness of multipartite and bipartite n-qubit entanglement with respect to many sources of hardware noise: qubit decoherence, CNOT and swap gate noise, and readout error. We demonstrate our benchmark on multiple superconducting qubit platforms available from IBM (ibmq_belem, ibmq_toronto, ibmq_guadalupe and ibmq_jakarta). Subsets of n<10n<10n<10 qubits are used for graph state preparation and stabilizer measurement. Evaluation of genuine and biseparable entanglement witnesses we report observations of 555 qubit genuine entanglement, but robust multipartite entanglement is difficult to generate for n>4n>4n>4 qubits and identify two-qubit gate noise as strongly correlated with the quality of genuine multipartite entanglement.
The practical performance of Noisy Intermediate-Scale Quantum (NISQ) processors is strongly influenced by hardware architecture, connectivity, and noise characteristics. In this work, we present an experimental benchmarking study of multipartite entanglement across cloud-accessible trapped-ion and superconducting quantum processors. Using Bell-state CHSH violation and GHZ-state fidelity as quantitative metrics, we evaluate entanglement generation on IonQ (trapped-ion) and IQM and Rigetti (superconducting) platforms under consistent compilation and execution settings via Amazon Braket. Experimental results demonstrate that trapped-ion processors sustain high-fidelity multipartite entanglement for up to 10 qubits, while superconducting architectures exhibit rapid fidelity degradation as circuit depth and routing overhead increase. These findings highlight the critical role of qubit connectivity and two-qubit gate performance in near-term entanglement scalability and provide an empirical comparison of architectural trade-offs in current NISQ hardware.
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.
Despite rapid progress in quantum optimization, broad real-hardware benchmarks comparing multiple algorithmic families across diverse combinatorial problems under a common protocol remain limited. We benchmark gate-based quantum optimization on four NP-hard problems: multi-dimensional knapsack (MDKP), maximum independent set (MIS), quadratic assignment (QAP), and market-share (MSP). We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO, on IBM Heron r1/r2 processors using resilience-level-2 mitigation. To our knowledge, this includes the first real-hardware QRAO results and the first multi-problem PCE hardware benchmark. Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy, FestF_{\mathrm{est}}Fest​. For MDKP and MIS, an empirical operating point near Fest≈0.1F_{\mathrm{est}}\approx 0.1Fest​≈0.1, corresponding to about 770 two-qubit gates at the median Heron-r2 CZ error rate, marks the onset of noise-dominated execution. QAP exposes a separate bottleneck: dense one-hot encodings and an exponentially sparse feasible manifold, with feasible fraction 10!/210010!/2^{100}10!/2100 at n=10n=10n=10; no tested hardware method produces a feasible assignment. Compiled QAOA-family circuits are generally noise dominated, and a matched uniform-random control shows that most feasible low-fidelity outcomes fall within the random range, apart from one finite-sample MIS warm-start exception. A SWAP-aware, fractional-gate, Nighthawk-topology compilation counterfactual reduces two-qubit counts but leaves all circuits below Fest=10−3F_{\mathrm{est}}=10^{-3}Fest​=10−3. These conclusions apply to the tested implementations rather than QAOA in general. Qubit-efficient methods extend runnable instance sizes, but only within the empirical fidelity budget.
Eight verified quantum computing jobs executed on IBM Quantum hardware (ibm_fez Heron R2, 156 qubits; ibm_torino Heron R1, 133 qubits) between January 27 and March 15, 2026. User ID: IBMid-692001DJRD. Experiments include: 1. Bell State Entanglement — 96.3% fidelity on ibm_fez Heron R2 (Concurrence C = 0.926, Tangle T = 0.858, 1,000 shots). Cross-platform benchmark: Heron R2 vs Heron R1 (+8.3 pp fidelity advantage, noise ratio 2.43×). 2. Reproducibility Test — Two independent runs of identical circuit (χ² = 2.70, p = 0.44, df = 3). H₀ not rejected: statistically indistinguishable results at 95% confidence. 3. BB84 Quantum Key Distribution — Full Alice/Eve/Bob protocol implementation. Alice baseline error 0.60% → Bob QBER 49.0% under eavesdropping (82× degradation). Experimental demonstration of the quantum no-cloning theorem. Control group design isolates eavesdropper signal from hardware noise baseline. 4. Variational Quantum Circuit (VQC) — 2-qubit circuit, 10 trained parameters with tied weights (θ₃ = θ₄), 8 CZ gates in 4 entangling layers. 4-qubit ansatz: Shannon entropy 3.885/4.000 bits (97.1%), ground-state bias confirmed (χ² = 300.94, p ≈ 0). 5. Quantum Random Number Generation (QRNG) — 8-bit outputs, 10/10 unique values per shot (range 16–254). Total: 39,010 quantum measurements across 8 jobs and 10 circuits. QPU time: 4.8 seconds. Job completion rate: 100%. All results decoded from raw IBM SamplerV2 BitArray binary archives (zlib + base64 + NumPy .npy pipeline). No simulations. Statistical validation applied throughout (Wilson 95% CIs, chi-squared tests). Stack: Qiskit Runtime SamplerV2 · QPY · OpenQASM 2.0 · Python · NumPy · SciPy Repository: https://github.com/dinohatibovicWhitepaper: https://dinohatibovic.github.io (Doc QAI-WP-2026-01-28-V4)