par Massar, Serge 
;Santha, Miklos
Référence Quantum Information Processing, 20, 1, 35
Publication Publié, 2021-01-01
;Santha, MiklosRéférence Quantum Information Processing, 20, 1, 35
Publication Publié, 2021-01-01
Article révisé par les pairs
| Résumé : | The complexity class QMA is the quantum analog of the classical complexity class NP. The functional analogs of NP and QMA , called functional NP (FNP) and functional QMA (FQMA), consist in either outputting a (classical or quantum) witness or outputting NO if there does not exist a witness. The classical complexity class total functional NP (TFNP) is the subset of FNP for which it can be shown that the NO outcome never occurs. TFNP includes many natural and important problems. Here we introduce the complexity class total functional QMA (TFQMA), the quantum analog of TFNP. We show that FQMA and TFQMA can be defined in such a way that they do not depend on the values of the completeness and soundness probabilities. We provide examples of problems that lie in TFQMA , coming from areas such as the complexity of k-local Hamiltonians and public key quantum money. In the context of black-box groups, we note that group non-membership, which was known to belong to QMA , in fact belongs to TFQMA. We also provide a simple oracle with respect to which we have a separation between FBQP and TFQMA. |
