{
  "annotation_id": "b4b47095-5462-44ad-a92e-f2f180337ac4",
  "date_created": "2026-03-02T18:02:10.378000Z",
  "date_modified": "2026-03-02T18:02:10.378000Z",
  "file_hash": "c1352aa775eabb3949e52223f8b03fce0ad64fc7f209d8fc7cabb529e64a9f7f",
  "private": false,
  "record": {
    "abstract": "In 1990, Mermin presented a n player game that is won with certainty using n\nspin-1/2 particles in a GHZ state whilst no classical strategy (or local\ntheory) can win with probability higher than ${1/2} + \\frac{1}{2^{\\lceil n/2\n\\rceil}}$ (which is larger than 1/2). This article first introduces a class of\narithmetic games containing Mermin\u0027s and gives a quantum algorithm based on a\ngeneralized n party GHZ state that wins those games with certainty. It is then\nproved for a subclass of those games where each player is given a single bit of\ninput that no classical strategy can win with a probability that is\nasymptotically larger than 1.6 times the inverse of the square root of n, thus\ngiving a new and stronger Bell inequality.",
    "arxiv_id": "quant-ph/0408090",
    "authors": [
      "Michel Boyer"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Extended GHZ n-player games with classical probability of winning   tending to 0",
    "url": "https://arxiv.org/abs/quant-ph/0408090"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d5953813-696e-458a-924f-b04498b29f80",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}