Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/QMA> ?p ?o }
Showing triples 1 to 57 of
57
with 100 triples per page.
- QMA abstract "In computational complexity theory, QMA, which stands for Quantum Merlin Arthur, is the quantum analog of the nonprobabilistic 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.Informally, it is the set of decision problems for which when the answer is YES, there is a polynomial-size quantum proof (a quantum state) which convinces a polynomial-time quantum verifier of the fact with high probability. Moreover, when the answer is NO, every polynomial-size quantum state is rejected by the verifier with high probability.More precisely, the proofs have to be verifiable in polynomial time on a quantum computer, such that if the answer is indeed YES, the verifier accepts a correct proof with probability greater than 2/3, and if the answer is NO, then there is no proof which convinces the verifier to accept with probability greater than 1/3. As is usually the case, the constants 2/3 and 1/3 can be changed. Changing 2/3 to any constant strictly between 1/2 and 1, or changing 1/3 to any constant strictly between 0 and 1/2, does not change the class QMA.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.".
- QMA wikiPageExternalLink 1212.6312..
- QMA wikiPageID "23545978".
- QMA wikiPageLength "10127".
- QMA wikiPageOutDegree "38".
- QMA wikiPageRevisionID "705708899".
- QMA wikiPageWikiLink Adiabatic_quantum_computation.
- QMA wikiPageWikiLink Alexei_Kitaev.
- QMA wikiPageWikiLink Arthur–Merlin_protocol.
- QMA wikiPageWikiLink BPP_(complexity).
- QMA wikiPageWikiLink BQP.
- QMA wikiPageWikiLink Category:Probabilistic_complexity_classes.
- QMA wikiPageWikiLink Category:Quantum_complexity_theory.
- QMA wikiPageWikiLink Certificate_(complexity).
- QMA wikiPageWikiLink Complete_(complexity).
- QMA wikiPageWikiLink Complexity_class.
- QMA wikiPageWikiLink Computational_complexity_theory.
- QMA wikiPageWikiLink Decision_problem.
- QMA wikiPageWikiLink Hermitian_matrix.
- QMA wikiPageWikiLink IP_(complexity).
- QMA wikiPageWikiLink John_Watrous_(computer_scientist).
- QMA wikiPageWikiLink Lattice_model_(physics).
- QMA wikiPageWikiLink Maximum_satisfiability_problem.
- QMA wikiPageWikiLink NP-hardness.
- QMA wikiPageWikiLink NP_(complexity).
- QMA wikiPageWikiLink PP_(complexity).
- QMA wikiPageWikiLink PSPACE.
- QMA wikiPageWikiLink P_(complexity).
- QMA wikiPageWikiLink Pauli_matrices.
- QMA wikiPageWikiLink Promise_problem.
- QMA wikiPageWikiLink QIP_(complexity).
- QMA wikiPageWikiLink Quantum_computing.
- QMA wikiPageWikiLink Qubit.
- QMA wikiPageWikiLink Reduction_(complexity).
- QMA wikiPageWikiLink Time_complexity.
- QMA wikiPageWikiLinkText "QMA".
- QMA wikiPageWikiLinkText "QMA#Related_classes".
- QMA wikiPageUsesTemplate Template:About.
- QMA wikiPageUsesTemplate Template:CZoo.
- QMA wikiPageUsesTemplate Template:Cite_web.
- QMA wikiPageUsesTemplate Template:ComplexityClasses.
- QMA wikiPageUsesTemplate Template:Quantum_computing.
- QMA wikiPageUsesTemplate Template:Reflist.
- QMA subject Category:Probabilistic_complexity_classes.
- QMA subject Category:Quantum_complexity_theory.
- QMA hypernym Analog.
- QMA type Drug.
- QMA type Class.
- QMA comment "In computational complexity theory, QMA, which stands for Quantum Merlin Arthur, is the quantum analog of the nonprobabilistic 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.Informally, it is the set of decision problems for which when the answer is YES, there is a polynomial-size quantum proof (a quantum state) which convinces a polynomial-time quantum verifier of the fact with high probability.".
- QMA label "QMA".
- QMA sameAs Q4047721.
- QMA sameAs QMA.
- QMA sameAs m.06w9zw7.
- QMA sameAs QMA.
- QMA sameAs Q4047721.
- QMA wasDerivedFrom QMA?oldid=705708899.
- QMA isPrimaryTopicOf QMA.