Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [qma]

For question about Quantum Merlin Arthur (QMA), a computational complexity class. QMA is the 'quantum analogue' of NP, that is QMA is to BQP as NP is to P.

6
votes
1answer
61 views

Relation between $\mathrm{QMA}$ and $\mathrm{P^{QMA}}$

What is the relation between $\mathrm{QMA}$ and $\mathrm{P^{QMA}}$ and how do we prove it? Are these classes equal?
7
votes
1answer
67 views

What classical public key cryptography protocols exist for which hacking is QMA complete or QMA hard?

Such a public key cryptosystem would be "quantum safe" in the sense that quantum computers cannot efficiently solve QMA hard problems.
8
votes
2answers
118 views

Quantum Chemistry and Quantum Computing

Predicting the energy of molecules to high accuracy during the course of a chemical reaction, which in turn allows us to predict reaction rates, equilibrium geometries, transition states among others ...
6
votes
1answer
60 views

Upper Bounds for QMA Quantum Merlin Arthur, and QMA(k)

QMA(Quantum Merlin Arthur), is the quantum analog of NP, and QMA(k) is the class with $k$ verifiers. These are important classes when studying Quantum Complexity theory. QMA(k) is QMA with $k$ ...