The 7 faces of quantum NP

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Gharibian, Sevag
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916083082985472
author Gharibian, Sevag
author_facet Gharibian, Sevag
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2310_18010
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle The 7 faces of quantum NP
Gharibian, Sevag
Quantum Physics
Computational Complexity
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.
title The 7 faces of quantum NP
topic Quantum Physics
Computational Complexity
url https://arxiv.org/abs/2310.18010