The relation between the quantum games, communication complexity problems and Bell inequalities

Simple item page
dc.creatorPawlowski, Marcin
dc.date2007-10-22
dc.date.accessioned2026-07-07T08:37:37Z
dc.date.available2026-07-07T08:37:37Z
dc.descriptionWe study the relation between the quantum games, communication complexity problems and Bell inequalities. In particular we are interested in answering the question whether for every element of one of these groups there is a corresponding element in the other two. We show that there are cases where there is no such relation. Moreover, in the communication complexity problems for which there is no Bell inequality the advantage of the quantum strategies over the classical ones is much higher.
dc.descriptionPreliminary version, comments welcome
dc.identifierhttps://arxiv.org/abs/0710.3881
dc.identifierhttp://arxiv.org/abs/0710.3881
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140463
dc.subjectQuantum Physics
dc.titleThe relation between the quantum games, communication complexity problems and Bell inequalities
dc.typetext

Files

Collections

arXiv