Definitions from Wikipedia (QMA)
▸ noun: In computational complexity theory, QMA, which stands for Quantum Merlin Arthur, is the set of languages for which, when a string is in the language, there is a polynomial-size quantum proof (a quantum state) that convinces a polynomial time quantum verifier (running on a quantum computer) of this fact with high probability.
▸ Words similar to QMA
▸ Usage examples for QMA
▸ Idioms related to QMA
▸ Wikipedia articles (New!)
▸ Popular adjectives describing QMA
▸ Words that often appear near QMA
▸ Rhymes of QMA
▸ Invented words related to QMA
▸ noun: In computational complexity theory, QMA, which stands for Quantum Merlin Arthur, is the set of languages for which, when a string is in the language, there is a polynomial-size quantum proof (a quantum state) that convinces a polynomial time quantum verifier (running on a quantum computer) of this fact with high probability.
Phrases:
▸ Words similar to QMA
▸ Usage examples for QMA
▸ Idioms related to QMA
▸ Wikipedia articles (New!)
▸ Popular adjectives describing QMA
▸ Words that often appear near QMA
▸ Rhymes of QMA
▸ Invented words related to QMA