Quantum information advantage based on Bell inequalities

2026-03-09

AI Summary

This work proposes a novel verification protocol to efficiently and robustly certify quantum information advantage by leveraging parallel repetitions of the CHSH game combined with information-theoretic measures. Instead of relying on traditional qubit-counting to quantify memory resources, the protocol uses information content as a more refined metric. By integrating Bell inequality violations with a noise-resilient quantum prover design, the approach significantly enhances both verification efficiency and robustness against experimental noise. This method outperforms existing qubit-counting-based schemes, offering a more scalable and reliable framework for demonstrating quantum advantage in practical settings.

Technology Category

• Machine Learning: Quantum Machine Learning
• Game Theory and Economic Paradigms: Adversarial Learning
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Security and Privacy: Large-scale security measurements
• Economics, Online Markets and Human Computation: LLM based quality controls for crowd work
• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics

Abstract

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].

Problem

• quantum information advantage
• Bell inequalities
• CHSH games
• quantum prover
• information measure

Innovation

• quantum information advantage
• CHSH games
• noise-robust prover
• efficient verifier
• information-based memory measure