2004/08/13 by Michel Boyer, Boyer, Michel
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0408090
4 pages, RevTeX4. Expanded text
openalex publication_date 2004/08/13 · arxiv created 2004/08/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 1990, Mermin presented a n player game that is won with certainty using n spin-1/2 particles in a GHZ state whilst no classical strategy (or local theory) can win with probability higher than 1/2 + \frac12\lceil n/2 \rceil (which is larger than 1/2). This article first introduces a class of arithmetic games containing Mermin's and gives a quantum algorithm based on a generalized n party GHZ state that wins those games with certainty. It is then proved for a subclass of those games where each player is given a single bit of input that no classical strategy can win with a probability that is asymptotically larger than 1.6 times the inverse of the square root of n, thus giving a new and stronger Bell inequality.