The QMA(2) UniverseComplexity, Entanglement, and Optimization
ACM SIGACT News · 31.03.2026 · 57 (1) · 64-99
DOI: 10.1145/3802807.3802814 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM SIGACT News, online erschienen am 31.03.2026. Verfasst von Fernando Granha Jeronimo und 2 weiteren Autor:innen. Die Arbeit nennt 89 Literaturangaben.
Abstract (Originalsprache)
The complexity class QMA(2), featuring two unentangled quantum provers, occupies a central yet poorly understood position in quantum complexity theory. While superficially a modest extension of QMA, unentanglement fundamentally changes both the algorithmic and complexitytheoretic landscape, connecting QMA(2) to deep questions in separability testing, polynomial optimization, and hardness of approximation. Over the past two decades, QMA(2) has inspired a rich body of work spanning restricted verification models, semidefinite and Sum-of-Squares hierarchies, and surprising links to classical problems such as the Unique Games Conjecture. This survey provides an overview of these developments, emphasizing structural insights, algorithmic techniques, and known barriers, while highlighting how progress on QMA(2) continues to illuminate the interplay between quantum information, convex optimization, and classical complexity theory.
Zitieren
APA
Jeronimo, F. G., Wu, P., & Leigh, I. (2026). The QMA(2) UniverseComplexity, Entanglement, and Optimization. ACM SIGACT News, 57(1), 64-99. https://doi.org/10.1145/3802807.3802814
Vancouver
Jeronimo FG, Wu P, Leigh I. The QMA(2) UniverseComplexity, Entanglement, and Optimization. ACM SIGACT News. 2026;57(1):64-99. doi:10.1145/3802807.3802814
BibTeX
@article{Jeronimo2026,
author = {Jeronimo, Fernando Granha and Wu, Pei and Leigh, Itai},
title = {The QMA(2) UniverseComplexity, Entanglement, and Optimization},
journal = {ACM SIGACT News},
year = {2026},
volume = {57},
number = {1},
pages = {64--99},
doi = {10.1145/3802807.3802814}
}
EUVIMED