Unitary Noise and the Mermin-GHZ Game

  title={Unitary Noise and the Mermin-GHZ Game},
  author={Ivan Fial{\'i}k},
  • Ivan Fialík
  • Published in GANDALF 7 June 2010
  • Physics, Computer Science
Pseudotelepaticka hra je hra pro dva ci vice hraců, pro kterou neexistuje klasicka vitězna strategie, ale existuje vitězna strategie založena na sdileni kvantove informace. Poněvadž bezchybna implementace kvantove vitězne strategie je obecně velmi obtižný ukol, je vysoce pravděpodobne, že se hraci dopusti chyb i v připadě použiti kvantove vitězne strategie. Po uvedeni modelu pro pseudotelepaticke hry vysetřime vliv několika zakladnich kvantových sumových kanalů na kvantovou vitěznou strategii… 

Figures from this paper

Noise and the magic square game

After introducing a model for pseudo-telepathy games, the impact of erroneously performed unitary transformations and also of noisy measurement devices on the quantum winning strategy for the magic square game is investigated.

Perspectiva cuántica de la cooperación para el manejo de recursos de uso común

In the economics of Common Pool Resources (CPR) the emergence of cooperation is associated with the achievement of the social optimum, while its absence derives in overharvesting. Local management



Noise and the Mermin-GHZ Game

Quantum pseudo-telepathy games

Seven pseudo-telepathy games which appear in the physics and quantum information processing literature are described and presented frohi a computer scientist’s perspective, and in a uniform way, in order to facilitate comparison.

Minimum entangled state dimension required for pseudo-telepathy

It is shown that any two-player pseudo-telepathy game requires the quantum players to share an entangled quantum system of dimension at least 3 × 3, which is optimal for twoplayer games, but the most efficient pseudo- telepathy game possible, in terms of total dimension, involves three players who share a quantumSystem of dimension 2 ×2 × 2.

Quantum Pseudo-Telepathy

Pseudo-telepathy is a surprising application of quantum information processing to communication complexity and a survey of recent and not-so-recent work on the subject is presented.

Some complexity questions related to distributive computing(Preliminary Report)

The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm.

Bell’s theorem without inequalities

It is demonstrated that the premisses of the Einstein–Podolsky–Rosen paper are inconsistent when applied to quantum systems consisting of at least three particles. The demonstration reveals that the

Quantum computation and quantum information

  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal

Extreme quantum entanglement in a superposition of macroscopically distinct states.

  • Mermin
  • Physics
    Physical review letters
  • 1990
A Bell inequality is derived for a state of n spin-1/2 particles which superposes two macroscopically distinct states. Quantum mechanics violates this inequality by an amount that grows exponentially

Combinatorics and quantum nonlocality.

The amount of superluminal classical communication required to reproduce the correlations of quantum correlations occurring in Einstein-Podolsky-Rosen-type experiments with classical local hidden-variable theories is shown to be at least n(log((2)n-3) bits) and the maximum detector efficiency eta(*) is upper bounded by etA(*) and thus decreases with n.