QMA
Complexity class
QMA, as an abbreviation for Quantum Merlin Arthur, refers to a complexity class in computational complexity theory. It is the set of all formal languages that satisfy the following properties: If a string is in the language, then there is a polynomial-size quantum proof (representable as a quantum state) that convinces a polynomial-time quantum verifier (running on a quantum computer) of this fact with high probability.
Nº Q4047721 ★
Common · Knowledge
QMA
Complexity class
QMA, as an abbreviation for Quantum Merlin Arthur, refers to a complexity class in computational complexity theory. It is the set of all formal languages that satisfy the following properties: If a string is in the language, then there is a polynomial-size quantum proof (representable as a quantum state) that convinces a polynomial-time quantum verifier (running on a quantum computer) of this fact with high probability.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
QMA, as an abbreviation for Quantum Merlin Arthur, refers to a complexity class in computational complexity theory. It is the set of all formal languages that satisfy the following properties: If a string is in the language, then there is a polynomial-size quantum proof (representable as a quantum state) that convinces a polynomial-time quantum verifier (running on a quantum computer) of this fact with high probability. If a string is not in the language, every polynomial-size quantum state is rejected by the verifier with high probability. The relationship between QMA and BQP is analogous to the relationship between the complexity classes NP and P. It is also analogous to the relationship between the probabilistic complexity classes MA and BPP. QAM is a related complexity class, in which fictional agents Arthur and Merlin carry out the sequence: Arthur generates a random string, Merlin answers with a quantum certificate and Arthur verifies it as a BQP machine.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
P
P (complexity)
Computational complexity class of problems
Nº Q846354 ★★
Not listed
-
BQP
Complexity class
Nº Q601325 ★
Not listed
-
E
E (complexity)
Complexity class
Nº Q1276623 ★
Not listed
-
P
P-complete
Class in computational complexity theory
Nº Q905789 ★★★
Not listed
-
R
RE (complexity)
Complexity class
Nº Q905621 ★★
Not listed
-
PSPACE
Complexity class
Nº Q500716 ★
Not listed