| Information | |
|---|---|
| has gloss | eng: In computational complexity theory, QMA, which stands for Quantum Merlin Arthur, is the quantum analog of the deterministic complexity class NP or the probabilistic complexity class MA. It is related to BQP in the same way NP is related to P, or MA is related to BPP. |
| lexicalization | eng: QMA |
| instance of | c/Probabilistic complexity classes |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint