BEGIN:VCALENDAR VERSION:2.0 PRODID:ILLC Website X-WR-TIMEZONE:Europe/Amsterdam BEGIN:VTIMEZONE TZID:Europe/Amsterdam X-LIC-LOCATION:Europe/Amsterdam BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:19700329T020000 RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:19701025T030000 RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU END:STANDARD END:VTIMEZONE BEGIN:VEVENT UID:/NewsandEvents/Archives/2015/newsitem/6934/16- June-2015-Theoretical-Computer-Science-Seminar-Jer emy-Ribeiro DTSTAMP:20150611T000000 SUMMARY:Theoretical Computer Science Seminar, Jere my Ribeiro ATTENDEE;ROLE=Speaker:Jeremy Ribeiro DTSTART;TZID=Europe/Amsterdam:20150616T150000 DTEND;TZID=Europe/Amsterdam:20150616T160000 LOCATION:CWI room L017, Science Park 123, Amsterda m DESCRIPTION:We use the entanglement sampling techn iques developed in (Dupuis et al., 2015) to find a lower bound on the entanglement needed by a coali tion of cheaters attacking the quantum postition v erification protocol using the four BB84 states (Q PVBB84) in the scenario where the cheaters have no access to a quantum channel but share a (possibly mixed) entangled state Φ. For a protocol using n qubits, a necessary condition for cheating is that the max-relative entropy of entanglement E_max(Φ) ≥ n − O(log n). This improves previously known be st lower bound by a factor approx. 4, and it is es sentially tight, since the protocol is vulnerable to a teleportation-based attack using n − O(1) ebi ts of entanglement. For more information, see the article at http://arxiv.org/abs/1504.07171 or con tact Christian Schaffner (c.schaffner at uva.nl). X-ALT-DESC;FMTTYPE=text/html:\n
We use t he entanglement sampling techniques developed in ( Dupuis et al., 2015) to find a lower bound on the entanglement needed by a coalition of cheaters att acking the quantum postition verification protocol using the four BB84 states (QPVBB84) in the scena rio where the cheaters have no access to a quantum channel but share a (possibly mixed) entangled st ate Φ. For a protocol using n qubits, a necess ary condition for cheating is that the max-relativ e entropy of entanglement E_max(Φ) ≥ n &min us; O(log n). This improves previously known best lower bound by a factor approx. 4, and it is essen tially tight, since the protocol is vulnerable to a teleportation-based attack using n − O(1) ebits of entanglement.
\n \nFor m ore information, see the article at http:/ /arxiv.org/abs/1504.07171 or contact Christian Schaffner (c.schaffner at uva.nl).
URL:/NewsandEvents/Archives/2015/newsitem/6934/16- June-2015-Theoretical-Computer-Science-Seminar-Jer emy-Ribeiro END:VEVENT END:VCALENDAR