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:2607.13090

Loophole-Robust Certification of Quantum Advantage

Prosanta Pal, Gargee Sharma, Ramakrishna Podila

quant-phcond-mat.supr-conSubmitted Jul 13, 2026• Announced Jul 15, 2026• 1 citation
arXivHTMLPDF

Abstract

Claims of quantum advantage should remain robust even when classical strategies have access to side information correlated with the benchmark under evaluation, just as Bell certification must account for measurement dependence. We formalize such correlations as benchmark dependence, a task-level generalization of measurement dependence. For every bounded-reward task, we show that the optimal benchmark-dependent classical score obeys $S_η\leq\min\{1,S_{\mathrm{cl}}+η\}$, and construct a family of tasks that saturates this bound, showing that the linear dependence on $η$ is tight without further assumptions. For repeated product tasks with roundwise dependence, we obtain the stronger multiplicative bound $S_η^{(n)}\leq(ω_{\mathrm c}+η)^n$, and extend the framework to finite-sample data, mutual-information constraints, multipartite tasks, and correlations distributed along a causal path. Applying these results to aggregated IBM hardware data, we obtain positive raw-count cycle-product certificates of 0.0812 for CHSH and 0.2178 for Mermin--GHZ, while the nine-context magic-square construction remains uncertified; readout-mitigated values are reported separately as sensitivity estimates. We also analyze a non-Bell quantum-kernel benchmark, where a label-construction variable has measured conditional dependence $\widehatη_λ^{(Y)}=0.5$, above the threshold $η_{\mathrm{req}}=0.375$, required to close the reported score gap, and yields perfect classical classification. The framework therefore converts a quantum--classical score separation into a quantitative lower bound on the benchmark-correlated classical information required to explain the score separation.

Comments
18 pages, 2 figures

Related papers

Fisher-Information Certification from Bell Statistics: CHSH Bounds, Information Loss, and Finite-Data Guarantees

Juan Sumaya-Martínez, Omar Olmos-López, Jorge Mulia Rodríguez

Bell-test data are typically used to certify nonlocal correlations, while quantum metrology is concerned with the sensitivity of measurement statistics to unknown parameters. Here we connect these tasks at the level of experimentally accessible Bell statistics. Using standard moment-based Fisher-information inequalities, we derive lower bounds on the classical Fisher information directly from Bell scores and their parameter dependence, without requiring full state tomography. For CHSH measurements we establish a hierarchy between the information contained in the full outcome record, the set of individual correlators, and the compressed Bell parameter, thereby quantifying the metrological cost of data compression. In polarization-phase sensing, this hierarchy reveals a Bell-metrology tradeoff: the point of maximal CHSH violation need not maximize, and can even suppress, the Fisher information carried by the Bell score itself. We further derive finite-sample lower-confidence bounds from coincidence counts and analyze the effects of biased marginals, accidental coincidences, visibility loss, and multipair emission. The framework provides a practical route for extracting metrological guarantees from Bell-type experiments using only standard correlation measurements.

quant-pharXiv:2610.16702•Oct 13, 2026•0 citations

Sharp Target-Domain Certificates for Quantum-Kernel Advantage under Distribution Shift

Roberto Fernández-Barrios, Iker Pastor-López, Asier González-Santocildes +1 more

Quantum predictive advantage under shift usually requires known target labels. We derive the assumption-free sharp identified interval for the finite-batch advantage of a fixed candidate over the best member of a prespecified fixed classical-kernel family under any bounded loss and unrestricted completions of the unaudited labels; zero-one accuracy has exact closed-form partial-label updates. Across eight security shifts, zero-label upper endpoints against 115 classical kernels span 0.002-0.088. Retrospective auditing reduces every endpoint to 0.010 with 0-33 of 500 labels, including entangling-ZZ models. Prospective corroboration on two eligible tasks met predefined criteria: four task-classifier medians require 0-3 labels (overall median 0; maximum 76), and all 20 realized effects are negative; a third task fails its feature gate. Protocol controls reverse an apparent advantage, while finite-shot noise can increase predictive distinctness without useful advantage. The framework separates protocol validity, target predictive indispensability, and quantum relevance.

quant-pharXiv:2610.00080•Sep 8, 2026•2 citations

Causal Fisher-Information Inequalities: Classical Causal Model Falsification and Metrological Advantage

Jeongho Bang, Su-Yong Lee

Fisher-information inequalities have recently been used as operational witnesses of nonclassical metrological behavior, but their physical meaning is often tied to a particular narrative, such as, segmented dynamics or discrete trajectories. We show that a broader interpretation is available and, in fact, more natural: once an experiment is assumed to admit a classical causal model specified by a directed acyclic graph, conditional independences, and modular parameter dependence, the corresponding Fisher informations are forced to obey causal Fisher-information inequalities (CFIIs). The backbone result is a causal-path series law: for an additive causal parameter that propagates through a classical path $A \to C \to B$, the inverse Fisher information behaves as an information resistance and must add in series. Consequently, any CFII violation is a rigorous falsification of the entire classical causal model class. We then show that the violation is automatically a metrological resource certificate, because it implies a precision that no member of the classical causal class can attain. The gain mechanism is identified as Fisher-information synergy, i.e. off-diagonal score correlations that classical modularity forbids. A single-qubit coherent-rotation example demonstrates the deterministic CFII violation, estimator-level achievability of the resulting gain, robustness against split-optimized classical benchmarks, and a chain-amplified advantage in long causal decompositions. Finally, an AI-assisted adversarial finite-data stress test shows that the witness remains certifiable under the realistic visibility loss and readout error, while optimized modular classical causal models saturate but do not cross the CFII frontier.

quant-pharXiv:2605.19198•May 20, 2026•0 citations

Robust Device-Independent Certification of Boolean-Phase Gates

Yunguang Han, Xingyuan Bu, Aleksandra Gočanin +1 more

Device-independent certification of a quantum gate requires the input and output tests to identify the same reference qubits. Self-testing the output Choi state alone does not guarantee this consistency. We develop a robust certification scheme for Boolean-phase gates, a broad family of computational-basis diagonal gates specified by Boolean functions. Boolean derivatives convert the target-dependent phase information into classical signs that can be evaluated from local measurement outcomes. This leads to Bell tests built from CHSH blocks using two binary measurements per party and no entangling measurements. At maximal violation, the tests self-test the normalized Choi state and the measured observables. Away from the maximum, they give an explicit affine lower bound on the extracted-state squared fidelity that is uniform over all Boolean functions and valid in arbitrary local dimensions. We then combine an identity test and a gate-output test in an independent-source network in which the reference devices use the same physical observables, obtaining a closed-form Choi-fidelity bound for an effective \(n\)-qubit channel. For CCZ, a joint six-party analysis gives a stronger robustness bound without changing the Bell expression or measurement settings. The construction shows how the algebraic structure of a gate can shift target-dependent information from quantum measurement design to classical processing of local outcomes.

quant-pharXiv:2609.09836•Sep 10, 2026•0 citations

From information tasks to exclusivity and Bell bounds

Samuel Mausberg

Can possible information tasks explain the quantum bound on Bell correlations? We obtain a conditional bound, without assuming a quantum state space, and identify the additional task requirements that recover the quantum value. Homogeneous frequency limits and common calibration domains imply consistent exclusivity. Completing two-copy parity measurements with an “other” outcome gives a Bell bound controlled by the weights of these residual records. Marletto’s T2 supplies four aligned parity sectors. A missing domain then requires an extra distinguishable label. An upper bound on readable labels, stable under adjoining spectators, and a reversible setting interchange remove the residual records. No-hypersignaling supplies this capacity bound when the relevant preparations are accessible and local signaling dimensions match the label counts. The result separates measurement existence, domain coverage, and readout weights.

•Oct 4, 2026•0 citations

Quantum information advantage based on Bell inequalities

Rahul Jain, Srijita Kundu

Recently, Kretschmer et al. [KGD+25] presented an experimental demonstration of a proposed quantum information advantage protocol. We present an alternate proposal based on a relation derived from parallel-repeated CHSH games. Our memory measure is based on an information measure and is different from [KGD+25], where they count the number of qubits. Our proposal has an efficient verifier and a noise-robust quantum prover which is arguably much more efficient compared to [KGD+25].

quant-pharXiv:2603.07930•Mar 10, 2026•1 citation
Claims of quantum advantage should remain robust even when classical strategies have access to side information correlated with the benchmark under evaluation, just as Bell certification must account for measurement dependence. We formalize such correlations as benchmark dependence, a task-level generalization of measurement dependence. For every bounded-reward task, we show that the optimal benchmark-dependent classical score obeys Sη≤min⁡{1,Scl+η}S_η\leq\min\{1,S_{\mathrm{cl}}+η\}Sη​≤min{1,Scl​+η}, and construct a family of tasks that saturates this bound, showing that the linear dependence on ηηη is tight without further assumptions. For repeated product tasks with roundwise dependence, we obtain the stronger multiplicative bound Sη(n)≤(ωc+η)nS_η^{(n)}\leq(ω_{\mathrm c}+η)^nSη(n)​≤(ωc​+η)n, and extend the framework to finite-sample data, mutual-information constraints, multipartite tasks, and correlations distributed along a causal path. Applying these results to aggregated IBM hardware data, we obtain positive raw-count cycle-product certificates of 0.0812 for CHSH and 0.2178 for Mermin--GHZ, while the nine-context magic-square construction remains uncertified; readout-mitigated values are reported separately as sensitivity estimates. We also analyze a non-Bell quantum-kernel benchmark, where a label-construction variable has measured conditional dependence η^λ(Y)=0.5\widehatη_λ^{(Y)}=0.5η​λ(Y)​=0.5, above the threshold ηreq=0.375η_{\mathrm{req}}=0.375ηreq​=0.375, required to close the reported score gap, and yields perfect classical classification. The framework therefore converts a quantum--classical score separation into a quantitative lower bound on the benchmark-correlated classical information required to explain the score separation.
Bell-test data are typically used to certify nonlocal correlations, while quantum metrology is concerned with the sensitivity of measurement statistics to unknown parameters. Here we connect these tasks at the level of experimentally accessible Bell statistics. Using standard moment-based Fisher-information inequalities, we derive lower bounds on the classical Fisher information directly from Bell scores and their parameter dependence, without requiring full state tomography. For CHSH measurements we establish a hierarchy between the information contained in the full outcome record, the set of individual correlators, and the compressed Bell parameter, thereby quantifying the metrological cost of data compression. In polarization-phase sensing, this hierarchy reveals a Bell-metrology tradeoff: the point of maximal CHSH violation need not maximize, and can even suppress, the Fisher information carried by the Bell score itself. We further derive finite-sample lower-confidence bounds from coincidence counts and analyze the effects of biased marginals, accidental coincidences, visibility loss, and multipair emission. The framework provides a practical route for extracting metrological guarantees from Bell-type experiments using only standard correlation measurements.
Quantum predictive advantage under shift usually requires known target labels. We derive the assumption-free sharp identified interval for the finite-batch advantage of a fixed candidate over the best member of a prespecified fixed classical-kernel family under any bounded loss and unrestricted completions of the unaudited labels; zero-one accuracy has exact closed-form partial-label updates. Across eight security shifts, zero-label upper endpoints against 115 classical kernels span 0.002-0.088. Retrospective auditing reduces every endpoint to 0.010 with 0-33 of 500 labels, including entangling-ZZ models. Prospective corroboration on two eligible tasks met predefined criteria: four task-classifier medians require 0-3 labels (overall median 0; maximum 76), and all 20 realized effects are negative; a third task fails its feature gate. Protocol controls reverse an apparent advantage, while finite-shot noise can increase predictive distinctness without useful advantage. The framework separates protocol validity, target predictive indispensability, and quantum relevance.
Fisher-information inequalities have recently been used as operational witnesses of nonclassical metrological behavior, but their physical meaning is often tied to a particular narrative, such as, segmented dynamics or discrete trajectories. We show that a broader interpretation is available and, in fact, more natural: once an experiment is assumed to admit a classical causal model specified by a directed acyclic graph, conditional independences, and modular parameter dependence, the corresponding Fisher informations are forced to obey causal Fisher-information inequalities (CFIIs). The backbone result is a causal-path series law: for an additive causal parameter that propagates through a classical path A→C→BA \to C \to BA→C→B, the inverse Fisher information behaves as an information resistance and must add in series. Consequently, any CFII violation is a rigorous falsification of the entire classical causal model class. We then show that the violation is automatically a metrological resource certificate, because it implies a precision that no member of the classical causal class can attain. The gain mechanism is identified as Fisher-information synergy, i.e. off-diagonal score correlations that classical modularity forbids. A single-qubit coherent-rotation example demonstrates the deterministic CFII violation, estimator-level achievability of the resulting gain, robustness against split-optimized classical benchmarks, and a chain-amplified advantage in long causal decompositions. Finally, an AI-assisted adversarial finite-data stress test shows that the witness remains certifiable under the realistic visibility loss and readout error, while optimized modular classical causal models saturate but do not cross the CFII frontier.
Device-independent certification of a quantum gate requires the input and output tests to identify the same reference qubits. Self-testing the output Choi state alone does not guarantee this consistency. We develop a robust certification scheme for Boolean-phase gates, a broad family of computational-basis diagonal gates specified by Boolean functions. Boolean derivatives convert the target-dependent phase information into classical signs that can be evaluated from local measurement outcomes. This leads to Bell tests built from CHSH blocks using two binary measurements per party and no entangling measurements. At maximal violation, the tests self-test the normalized Choi state and the measured observables. Away from the maximum, they give an explicit affine lower bound on the extracted-state squared fidelity that is uniform over all Boolean functions and valid in arbitrary local dimensions. We then combine an identity test and a gate-output test in an independent-source network in which the reference devices use the same physical observables, obtaining a closed-form Choi-fidelity bound for an effective nnn-qubit channel. For CCZ, a joint six-party analysis gives a stronger robustness bound without changing the Bell expression or measurement settings. The construction shows how the algebraic structure of a gate can shift target-dependent information from quantum measurement design to classical processing of local outcomes.
Can possible information tasks explain the quantum bound on Bell correlations? We obtain a conditional bound, without assuming a quantum state space, and identify the additional task requirements that recover the quantum value. Homogeneous frequency limits and common calibration domains imply consistent exclusivity. Completing two-copy parity measurements with an “other” outcome gives a Bell bound controlled by the weights of these residual records. Marletto’s T2 supplies four aligned parity sectors. A missing domain then requires an extra distinguishable label. An upper bound on readable labels, stable under adjoining spectators, and a reversible setting interchange remove the residual records. No-hypersignaling supplies this capacity bound when the relevant preparations are accessible and local signaling dimensions match the label counts. The result separates measurement existence, domain coverage, and readout weights.