翻訳と辞書 Words near each other ・ Qol Qol, Kerman ・ Qol Qoleh ・ Qol Qoleh, Dalahu ・ Qol Quchan ・ Qol Rumzi ・ Qolaji-ye Fatabeygi ・ Qolalu ・ Qolamhossein Bigjekhani ・ Qoldarreh ・ Qoldarreh-ye Olya ・ Qoldarreh-ye Sofla ・ Qlucore ・ QM ・ QM investment ・ QM/MM ・ QMA ・ QMA and QN connector ・ Qmail ・ Qmake ・ QMAP ・ QMAS ・ Qmatiye ・ QMC ・ QMC@Home ・ QMCF Technology ・ QME ・ QMF ・ QMI ・ Qmillion ・ Qminas Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク QMA ： ウィキペディア英語版 QMA 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. 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. == Definition == A language L is in $\backslash mbox(c,s)$ if there exists a polynomial time quantum verifier V and a polynomial p(x) such that: *$\backslash forall\; x\; \backslash in\; L$, there exists a quantum state $|\backslash psi\backslash rangle$ such that the probability that V accepts the input $(|x\backslash rangle,\; |\backslash psi\backslash rangle)$ is greater than $c$. *$\backslash forall\; x\; \backslash notin\; L$, for all quantum states $|\backslash psi\backslash rangle$, the probability that V accepts the input $(|x\backslash rangle,\; |\backslash psi\backslash rangle)$ is less than $s$. where $|\backslash psi\backslash rangle$ ranges over all quantum states with at most p(x) qubits. The complexity class $\backslash mbox$ is defined to be equal to $\backslash mbox(/,1/3)$. However, the constants are not too important since the class remains unchanged if $c$ and $s$ are set to any constants such that $c$ is greater than $s$. Moreover, for any polynomials $q(n)$ and $r(n)$, we have :$\backslash mbox\backslash left(\backslash frac,\backslash frac\backslash right)\; =\backslash mbox\backslash left(\backslash frac+\backslash frac,\backslash frac-\backslash frac\backslash right)=\backslash mbox(1-2^,2^)$. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「QMA」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.