Total Functions in QMA
Serge Massar, Miklos Santha

TL;DR
This paper introduces the class TFQMA, a quantum analog of TFNP, exploring its properties, examples, and relationships with quantum money, complexity of quantum states, and providing separations from other complexity classes.
Contribution
It defines TFQMA independently of verification probabilities, introduces new quantum notions, and provides examples and separations illustrating its significance.
Findings
TFQMA is a well-defined class independent of completeness and soundness.
Examples include problems from k-local Hamiltonians and quantum money.
A separation between FBQP and TFQMA is demonstrated using an oracle.
Abstract
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. In the present work we introduce the complexity class of 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. In so doing we introduce new notions such as the eigenbasis and spectrum of a quantum verification procedure which are of interest by themselves. We then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
