BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:On equivalence between Popescu-Rohrlich boxes and random access co
 des - Horodecki\, M (University of Gdansk)
DTSTART:20130926T123000Z
DTEND:20130926T133000Z
UID:TALK47462@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:We study a problem of interconvertibility of two supra-quantum
  resources: one is so called PR-box\, which violates CHSH inequality up to
  maximal algebraic bound\, and second is so called random access code (RAC
 ). The latter is a functionality that enables Bob (receiver) to choose one
  of two bits of Alice. It has been known\, that PR-box supplemented with o
 ne bit of communication can be used to simulate RAC. We ask the converse q
 uestion: to what extent RAC can simulate PR-box? To this end we introduce 
 "racbox": a box such that supplemented with one bit of communication offer
 s RAC. As said\, PR-box can simulate racbox. The question we raise\, is wh
 ether any racbox can simulate PR-box. We show that a non-signaling racbox 
 indeed can simulate PR-box\, hence those two resources are equivalent. We 
 also provide an example of signalling racbox which cannot simulate PR-box.
  We give a resource inequality between racboxes and PR-boxes\, and show th
 at it is saturated.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR