Published in: LIPIcs, Volume 325, 16th Innovations in Theoretical Computer Science Conference (ITCS 2025)
Hamoon Mousavi and Taro Spirig. A Quantum Unique Games Conjecture. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 76:1-76:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{mousavi_et_al:LIPIcs.ITCS.2025.76, author = {Mousavi, Hamoon and Spirig, Taro}, title = {{A Quantum Unique Games Conjecture}}, booktitle = {16th Innovations in Theoretical Computer Science Conference (ITCS 2025)}, pages = {76:1--76:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-361-4}, ISSN = {1868-8969}, year = {2025}, volume = {325}, editor = {Meka, Raghu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.76}, URN = {urn:nbn:de:0030-drops-227047}, doi = {10.4230/LIPIcs.ITCS.2025.76}, annote = {Keywords: hardness of approximation, quantum computing, noncommutative constraint satisfaction problems, Fourier analysis} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Hamoon Mousavi, Seyed Sajjad Nezhadi, and Henry Yuen. On the Complexity of Zero Gap MIP*. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 87:1-87:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{mousavi_et_al:LIPIcs.ICALP.2020.87, author = {Mousavi, Hamoon and Nezhadi, Seyed Sajjad and Yuen, Henry}, title = {{On the Complexity of Zero Gap MIP*}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {87:1--87:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.87}, URN = {urn:nbn:de:0030-drops-124940}, doi = {10.4230/LIPIcs.ICALP.2020.87}, annote = {Keywords: Quantum Complexity, Multiprover Interactive Proofs, Computability Theory} }
Feedback for Dagstuhl Publishing