The 7 faces of quantum NP
| Autor: | Gharibian, Sevag |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | ACM SIGACT News, 54(4):54-91, 2024 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1145/3639528.3639535 |
| Popis: | When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell far from the tree of NP. Two decades since the first definitions of quantum NP started rolling in, quantum complexity theorists face a stark reality: There's QMA, QCMA, QMA1, QMA(2), StoqMA, and NQP. In this article aimed at a general theoretical computer science audience, I survey these various definitions of quantum NP, their strengths and weaknesses, and why most of them, for better or worse, actually appear to fit naturally into the complexity zoo. Comment: 37 pages, 5 figures. To appear as ACM SIGACT News guest column |
| Databáze: | arXiv |
| Externí odkaz: |
|