Quantum information advantage based on Bell inequalities

TL;DR

This paper proposes a new quantum information advantage protocol based on parallel-repeated CHSH games, offering an efficient verifier and noise-robust quantum prover, improving upon previous experimental demonstrations.

Contribution

It introduces an alternative quantum advantage protocol utilizing a different memory measure and provides a more efficient, noise-robust quantum prover compared to prior work.

Findings

Efficient verifier for the quantum protocol.

Noise-robust quantum prover design.

Improved quantum advantage demonstration.

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