BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:af4b95f6-b45f-47a2-a025-bfc0310f0748
X-WR-CALNAME:[ICQ] Gerard Munné (Jagiellonian University Kraków) Semidefini
 te programming bounds for quantum codes
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20260329T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:af4b95f6-b45f-47a2-a025-bfc0310f0748
DTSTAMP:20260531T120012Z
CLASS:PUBLIC
DESCRIPTION:The fundamental problem in coding theory is to determine the ma
 ximum\nsize of an error-correcting code of given distance and block length
 . Here we approach this\nquestion by providing a semidefinite programming 
 hierarchy to determine the existence\nof quantum codes with given paramete
 rs. The hierarchy is complete in the sense that\nevery set of parameters f
 or which no code exists is detected at some level of the hierarchy.\n\n\nh
 ttps://combalgo.labri.fr/pmwiki.php/Groupe/Info-Quantique
DTSTART;TZID=Europe/Paris:20240430T150000
DTEND;TZID=Europe/Paris:20240430T160000
LOCATION:Amphi
SEQUENCE:0
SUMMARY:[ICQ] Gerard Munné (Jagiellonian University Kraków) Semidefinite pr
 ogramming bounds for quantum codes
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
