BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Approximation Complexity of QMA-hard Optimization Problems
DTSTART:20260616T160000
DTEND:20260616T180000
DTSTAMP:20260524T114931Z
UID:17a60656b7b415258e53585acd28ac3d8a09ab4de778be10034fb2e3
CATEGORIES:Conferences - Seminars
DESCRIPTION:Petra Arabadjieva \nEDIC candidacy exam\nExam president: Pro
 f. Nicolas Macris\nThesis advisor: Prof. Thomas Vidick\nCo-examiner: Prof.
  Yihui Quek\n\nAbstract\ncoming soon\n\nSelected papers\n\n	Relations be
 tween average case complexity and approximation complexity (https://dl.acm
 .org/doi/abs/10.1145/509907.509985)\n	Efficient algorithm for a quantum an
 alogue of 2-SAT (https://arxiv.org/abs/quant-ph/0602108) \n	An Approximat
 ion Algorithm for the MAX-2-Local Hamiltonian Problem (https://drops.dagst
 uhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.59)\n
LOCATION:BC 129 https://plan.epfl.ch/?room==BC%20129
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR