BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1599
DTSTAMP:20250730T042810Z
SUMMARY:Hardness of Computing Graph State Distance
DESCRIPTION:Speaker: Vatsal Jha (Purdue University)\n\nAbstract: \nThe prob
 lem of computing the distance of classical error-correcting codes was show
 n to be NP-hard by Alexander Vardy in 1997. Recently\, Kapshikar and Kundu
  extended this result by proving the hardness of computing distances of qu
 antum codes. In this talk\, I will prove the hardness of computing the min
 imum distance of a specific class of quantum codes defined using graphs\, 
 referred to as graph states. Graph states play a key role in various quan
 tum applications\, including cryptography and communication. As a further 
 application of our techniques\, we also prove the hardness of computing th
 e distance of classical codes with constant rate in the interval (0\,1/2]
 .\nThis work is in collaboration with Elena Grigorescu (University of Wate
 rloo) and Eric Samperton (Purdue University).\nShort Bio:I am currently a 
 PhD student in the Department of Computer Science at Purdue University\, j
 ointly advised by Elena Grigorescu and Eric Samperton. My research interes
 ts lie in Coding Theory (both classical and quantum) and the Analysis of B
 oolean Functions.\n
URL:https://www.tcs.tifr.res.in/web/events/1599
DTSTART;TZID=Asia/Kolkata:20250731T160000
DTEND;TZID=Asia/Kolkata:20250731T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR