Quantum information advantage based on Bell inequalities
This work addresses the problem of demonstrating quantum information advantage for researchers in quantum computing, offering a potentially more efficient and robust experimental setup.
This paper proposes an alternative quantum information advantage protocol based on parallel-repeated CHSH games, differing from a prior work by Kretschmer et al. by using an information-based memory measure instead of qubit counts. The new proposal features an efficient verifier and a noise-robust quantum prover, which is claimed to be significantly more efficient.
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].