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:2504.18429 · IEEE International Conference on Quantum Computing and Engineering (QCE)

CHSH Violations Using Dynamic Circuits

Jean-Baptiste Waring, Christophe Père, Sébastien Le Beux

Published Aug 30, 2025• 2 citations
arXivHTMLPDF

Abstract

Scalable quantum computing relies on high-quality, long-range entanglement, a challenge on noisy, near-term devices. The need for practical insights for near-term algorithm design calls for trade-offs exploration in implementing dynamic circuits on current hardware. In this work, we experimentally compare three CNOT implementations for generating Bell states across varying qubit separations on a 127 -qubit IBM Quantum Eagle processor (ibm_quebec): a unitary (SWAP-based) approach, a dynamic approach with mid-circuit measurements and classical feedforward, and a post-processed approach. We use Clauser-Horne-Shimony-Holt (CHSH) inequality violations to quantify entanglement quality. We observe that, beyond 10 qubits, dynamic circuits lead to higher$\vert S \vert$values than the unitary approach, demonstrating improved distance-dependent entanglement preservation. The post-processed approach yields the highest CHSH values, reaching$\vert S \vert >2$up to 13 qubits. Our results underscore the critical need for faster classical feedforward and higher readout fidelity.

DOI
10.1109/qce65121.2025.00263

Related papers

Resilience Beyond the Light Cone: Error-Detected Primitives for Practical Dynamic Circuits

Kevin C. Smith, Bibek Pokharel, Satvik Maurya +1 more

Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity $F=0.59\pm0.02$, surpassing the entanglement-certification threshold $F>0.5$ that the baseline dynamic-circuit implementation fails to reach ($0.39\pm0.01$). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of $ΔF\approx 0.2$ across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.

quant-pharXiv:2609.08925•Sep 9, 2026•0 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

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

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

Entanglement enables coherence transfer and feedforward corrects the state in quantum teleportation on superconducting dynamic circuits

Vikas Rai, Shazan Farhat

Abstract Quantum teleportation transfers an unknown qubit state from a sender to a receiver using a shared entangled pair and a classically conditioned correction without moving the physical carrier. On the dynamic-circuit hardware, the complete protocol (which includes mid-circuit measurement and conditional feedforward) now runs on a single circuit. We use this to benchmark three-qubit teleportation on a 156-qubit IBM Heron r2 processor (ibm_fez). A single-qubit RY(θ) input was teleported at six angles along a meridian of the Bloch sphere and reconstructed by state tomography alongside two ablation controls; one without entanglement and the other without feedforward. The full protocol returns a mean fidelity of about 0.945, nearly constant across the angles and above the 2/3 full-Bloch-sphere reference at all six sampled angles. Removing feedforward lowered the fidelity to about 0.51, close to a maximally mixed state. On the other hand, removing entanglement yields (1 + cos²θ)/2 with a mean near 0.75, transferring the population but losing the coherence. Together, these results establish that entanglement and feedforward are both necessary. The calibration-limited fidelity serves as a reference for this class of hardware. A separate run returned a Bell-state fidelity value of 0.957. A branch-resolved analysis confirmed that the four measurement branches are Pauli rotations of the target realigned by feedforward. The reported fidelity depends only on the rotation angle and the device noise.

Scientific Reports•Jul 23, 2026•0 citations

Scalable Benchmarking Framework for Dynamic Quantum Circuits

Sumeet Shirgure, Efekan Kökcü, Anupam Mitra +3 more

Dynamic quantum circuits with mid-circuit measurements (MCMs) and feed-forward operations play a crucial role in various applications, such as quantum error correction and quantum algorithms. With advancements in quantum hardware enabling the implementation of MCM and feed-forward loops, the use of dynamic circuits has become increasingly prevalent. There is a significant need for a benchmarking framework specially designed for dynamic circuits to capture their unique properties, as current benchmarking tools are designed primarily for unitary circuits and cannot be trivially extended to dynamic circuits. We propose dynamarq, a scalable and hardware-agnostic benchmarking framework for dynamic circuits. We collect a set of dynamic circuit benchmarks spanning various applications and propose a broad set of circuit features to characterize the structure of these dynamic circuits. We run them on two IBM quantum processors and the Quantinuum Helios-1E emulator, and propose scalable, application-dependent fidelity scores for each benchmark based on hardware execution results. We perform statistical modeling to identify correlations between circuit features and fidelity scores, and demonstrate highly accurate fidelity prediction using our model. Our model parameters are also transferable across hardware backends and calibration cycles. Our framework facilitates the understanding of dynamic circuit structures and provides insights for designing and optimizing dynamic circuits to achieve high execution fidelity on quantum hardware.

quant-pharXiv:2604.03360•Apr 6, 2026•5 citations
Scalable quantum computing relies on high-quality, long-range entanglement, a challenge on noisy, near-term devices. The need for practical insights for near-term algorithm design calls for trade-offs exploration in implementing dynamic circuits on current hardware. In this work, we experimentally compare three CNOT implementations for generating Bell states across varying qubit separations on a 127 -qubit IBM Quantum Eagle processor (ibm_quebec): a unitary (SWAP-based) approach, a dynamic approach with mid-circuit measurements and classical feedforward, and a post-processed approach. We use Clauser-Horne-Shimony-Holt (CHSH) inequality violations to quantify entanglement quality. We observe that, beyond 10 qubits, dynamic circuits lead to higher∣S∣\vert S \vert∣S∣values than the unitary approach, demonstrating improved distance-dependent entanglement preservation. The post-processed approach yields the highest CHSH values, reaching∣S∣>2\vert S \vert >2∣S∣>2up to 13 qubits. Our results underscore the critical need for faster classical feedforward and higher readout fidelity.
Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity F=0.59±0.02F=0.59\pm0.02F=0.59±0.02, surpassing the entanglement-certification threshold F>0.5F>0.5F>0.5 that the baseline dynamic-circuit implementation fails to reach (0.39±0.010.39\pm0.010.39±0.01). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of ΔF≈0.2ΔF\approx 0.2ΔF≈0.2 across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.
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.
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.
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 θ'.
Abstract Quantum teleportation transfers an unknown qubit state from a sender to a receiver using a shared entangled pair and a classically conditioned correction without moving the physical carrier. On the dynamic-circuit hardware, the complete protocol (which includes mid-circuit measurement and conditional feedforward) now runs on a single circuit. We use this to benchmark three-qubit teleportation on a 156-qubit IBM Heron r2 processor (ibm_fez). A single-qubit RY(θ) input was teleported at six angles along a meridian of the Bloch sphere and reconstructed by state tomography alongside two ablation controls; one without entanglement and the other without feedforward. The full protocol returns a mean fidelity of about 0.945, nearly constant across the angles and above the 2/3 full-Bloch-sphere reference at all six sampled angles. Removing feedforward lowered the fidelity to about 0.51, close to a maximally mixed state. On the other hand, removing entanglement yields (1 + cos²θ)/2 with a mean near 0.75, transferring the population but losing the coherence. Together, these results establish that entanglement and feedforward are both necessary. The calibration-limited fidelity serves as a reference for this class of hardware. A separate run returned a Bell-state fidelity value of 0.957. A branch-resolved analysis confirmed that the four measurement branches are Pauli rotations of the target realigned by feedforward. The reported fidelity depends only on the rotation angle and the device noise.
Dynamic quantum circuits with mid-circuit measurements (MCMs) and feed-forward operations play a crucial role in various applications, such as quantum error correction and quantum algorithms. With advancements in quantum hardware enabling the implementation of MCM and feed-forward loops, the use of dynamic circuits has become increasingly prevalent. There is a significant need for a benchmarking framework specially designed for dynamic circuits to capture their unique properties, as current benchmarking tools are designed primarily for unitary circuits and cannot be trivially extended to dynamic circuits. We propose dynamarq, a scalable and hardware-agnostic benchmarking framework for dynamic circuits. We collect a set of dynamic circuit benchmarks spanning various applications and propose a broad set of circuit features to characterize the structure of these dynamic circuits. We run them on two IBM quantum processors and the Quantinuum Helios-1E emulator, and propose scalable, application-dependent fidelity scores for each benchmark based on hardware execution results. We perform statistical modeling to identify correlations between circuit features and fidelity scores, and demonstrate highly accurate fidelity prediction using our model. Our model parameters are also transferable across hardware backends and calibration cycles. Our framework facilitates the understanding of dynamic circuit structures and provides insights for designing and optimizing dynamic circuits to achieve high execution fidelity on quantum hardware.