Approximation Complexity of QMA-hard Optimization Problems
Event details
| Date | 16.06.2026 |
| Hour | 16:00 › 18:00 |
| Speaker | Petra Arabadjieva |
| Location | |
| Category | Conferences - Seminars |
EDIC candidacy exam
Exam president: Prof. Nicolas Macris
Thesis advisor: Prof. Thomas Vidick
Co-examiner: Prof. Yihui Quek
Abstract
coming soon
Selected papers
Exam president: Prof. Nicolas Macris
Thesis advisor: Prof. Thomas Vidick
Co-examiner: Prof. Yihui Quek
Abstract
coming soon
Selected papers
- Relations between average case complexity and approximation complexity (https://dl.acm.org/doi/abs/10.1145/509907.509985)
- Efficient algorithm for a quantum analogue of 2-SAT (https://arxiv.org/abs/quant-ph/0602108)
- An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem (https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.59)
Practical information
- General public
- Free