BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Andrey Khesin (MIT Mathematics) DTSTART:20220407T213000Z DTEND:20220407T230000Z DTSTAMP:20260423T035419Z UID:SPAMS/14 DESCRIPTION:Title: B ound Secrecy and Bound Entanglement: Where (Qu)Bits Go to Die\nby Andr ey Khesin (MIT Mathematics) as part of MIT Simple Person's Applied Mathema tics Seminar\n\nLecture held in Room: 2 - 132 in the Simons Building.\n\nA bstract\nThere is a surprising result in information theory where the quan tum version of a conjecture is known to be true\, and the classical one re mains open. The conjecture is that there exists a joint probability distri bution for three parties\, Alice\, Bob\, and Eve\, that exhibits bound sec recy. Simply put\, bound secrecy is the idea that there can secret informa tion present in the correlations of the random variables belonging to Alic e and Bob but that is completely unknown to Eve\, and yet despite this\, n o matter what Alice and Bob say to each other publicly\, they will be unab le to distill any bits of a secret key\, random bits completely unknown to Eve. This is a very surprising fact\, as it seems that there is a secret that Alice and Bob share and yet cannot access despite their best efforts. The quantum version of this conjecture states that there exist joint stat es for Alice and Bob which are entangled and therefore cannot be created w ithout spending some amount of entanglement\, but from which no pure entan gled states\, such as Bell pairs\, can be distilled. These joint states ar e called bound entangled\, and not only are they known to exist\, some sma ll examples have been found.\n LOCATION:https://researchseminars.org/talk/SPAMS/14/ END:VEVENT END:VCALENDAR