BEGIN:VCALENDAR
PRODID:-//AddEvent Inc//AddEvent.com v1.7//EN
VERSION:2.0
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20231105T010000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20231201T224803Z
STATUS:CONFIRMED
UID:1701470883addeventcom
SEQUENCE:0
DTSTART;TZID=America/New_York:20230809T120000
DTEND;TZID=America/New_York:20230809T130000
SUMMARY:IQC Student Seminar Featuring Yuming Zhao
DESCRIPTION:Positivity and sum-of-squares in quantum information\n\nA multivariate polynomial is said to be positive if it takes only non-negative values over reals. Hilbert's 17th problem concerns whether every positive polynomial can be expressed as a sum of squares of other polynomials. In general\, we say a noncommutative polynomial is positive (resp. matrix positive) if plugging operators (resp. matrices) always yields a positive operator. Many problems in math and computer science are closely connected to deciding whether a given polynomial is positive and finding certificates (e.g.\, sum-of-squares) of positivity.\n\nIn the study of nonlocal games in quantum information\, we are interested in tensor product of free algebras. Such an algebra models a physical system with two spatially separated subsystems\, where in each subsystem we can make different quantum measurements. The recent and remarkable MIP*=RE result shows that it is undecidable to determine whether a polynomial in a tensor product of free algebras is matrix positive. In this talk\, I'll present joint work with Arthur Mehta and William Slofstra\, in which we show that it is undecidable to determine positivity in tensor product of free algebras. As a consequence\, there is no sum-of-square certificate for positivity in such algebras.
X-ALT-DESC;FMTTYPE=text/html:**Positivity and sum-of-squares in quantum information**

A multivariate polynomial is said to be positive if it takes only non-negative values over reals. Hilbert's 17th problem concerns whether every positive polynomial can be expressed as a sum of squares of other polynomials. In general, we say a noncommutative polynomial is positive (resp. matrix positive) if plugging operators (resp. matrices) always yields a positive operator. Many problems in math and computer science are closely connected to deciding whether a given polynomial is positive and finding certificates (e.g., sum-of-squares) of positivity.

In the study of nonlocal games in quantum information, we are interested in tensor product of free algebras. Such an algebra models a physical system with two spatially separated subsystems, where in each subsystem we can make different quantum measurements. The recent and remarkable MIP*=RE result shows that it is undecidable to determine whether a polynomial in a tensor product of free algebras is matrix positive. In this talk, I'll present joint work with Arthur Mehta and William Slofstra, in which we show that it is undecidable to determine positivity in tensor product of free algebras. As a consequence, there is no sum-of-square certificate for positivity in such algebras.
LOCATION:QNC 1201
BEGIN:VALARM
TRIGGER:-PT30M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR