|
|
| Line 1: |
Line 1: |
| {{about|the mathematical theory|the coaxial RF connector|QMA and QN connector}}
| | Brendan just what people call me however don't like when people use my full list. My family lives in New Hampshire. Accounting will be the he supports his relatives and he won't change it [http://Www.Encyclopedia.com/searchresults.aspx?q=anytime anytime] fairly quickly. It's not a common thing but what she likes doing is bee keeping but she's been taking on new things lately. Go to his how does someone find out more: http://www.realcortijosanisidro.com/botas-ugg-baratas.html<br><br>Feel free to visit my site - [http://www.realcortijosanisidro.com/botas-ugg-baratas.html Botas Ugg Baratas] |
| | |
| In [[computational complexity theory]], '''QMA''', which stands for Quantum [[Arthur–Merlin protocol|Merlin Arthur]], is the quantum analog of the deterministic [[complexity class]] [[NP (complexity)|NP]] or the probabilistic complexity class [[Arthur–Merlin protocol|MA]]. It is related to [[BQP]] in the same way [[NP (complexity)|NP]] is related to [[P (complexity)|P]], or [[Arthur–Merlin protocol|MA]] is related to [[Bounded-error probabilistic polynomial|BPP]].
| |
| | |
| Informally, it is the set of [[decision problem]]s 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 greater than 1/2 and 1/3 to any constant strictly lesser than 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 (complexity)|certificate]] and Arthur verifies it as a BQP machine.
| |
| | |
| == Definition ==
| |
| | |
| A language L is in <math>\mbox{QMA}(c,s)</math> if there exists a polynomial time quantum verifier V and a polynomial p(x) such that:<ref>{{cite arxiv|eprint=quant-ph/0210077v1|author1=Dorit Aharonov|author2=Tomer Naveh|title=Quantum NP - A Survey|class=quant-ph|year=2002}}</ref><ref name="JW">{{cite arxiv|eprint=0804.3401v1|author1=John Watrous|authorlink1=John Watrous (computer scientist)|title=Quantum Computational Complexity|class=quant-ph|year=2008}}</ref>
| |
| *<math>\forall x \in L</math>, there exists a quantum state <math>|\psi\rangle</math> such that the probability that V accepts the input <math>(|x\rangle, |\psi\rangle)</math> is greater than <math>c</math>.
| |
| *<math>\forall x \notin L</math>, for all quantum states <math>|\psi\rangle</math>, the probability that V accepts the input <math>(|x\rangle, |\psi\rangle)</math> is less than <math>s</math>.
| |
| where <math>|\psi\rangle</math> ranges over all quantum states with at most p(x) qubits.
| |
| | |
| The complexity class <math>\mbox{QMA}</math> is defined to be equal to <math>\mbox{QMA}({2}/{3},1/3)</math>. However, the constants are not too important since the class remains unchanged if <math>c</math> and <math>s</math> are set to any constants such that <math>c</math> is greater than <math>s</math>. Moreover, for any polynomials <math>q(n)</math> and <math>r(n)</math>, we have
| |
| :<math>\mbox{QMA}\left(\frac{2}{3},\frac{1}{3}\right) =\mbox{QMA}\left(\frac{1}{2}+\frac{1}{q(n)},\frac{1}{2}-\frac{1}{q(n)}\right)=\mbox{QMA}(1-2^{-r(n)},2^{-r(n)})</math>.
| |
| | |
| == Problems in QMA ==
| |
| | |
| Since many interesting classes are contained in QMA, such as P, BQP and NP, all problems in those classes are also in QMA. However, there are problems that are in QMA but not known to be in NP or BQP. Some such well known problems are discussed below.
| |
| | |
| A problem is said to be QMA-hard, analogous to [[NP-hard]], if every problem in QMA can be [[Reduction (complexity)|reduced]] to it. A problem is said to be QMA-[[complete (complexity)|complete]] if it is QMA-hard and in QMA.
| |
| | |
| === The local Hamiltonian problem ===
| |
| The local Hamiltonian problem is the quantum analogue of [[Maximum satisfiability problem|MAX-SAT]]. A Hamiltonian is a [[Hermitian matrix]] acting on quantum states, thus it is <math>2^n \times 2^n</math> for a system of n [[qubit]]s. A k-local Hamiltonian is a Hamiltonian which can be written as the sum of Hamiltonians, each of which act non-trivially on at most k qubits (instead of all n qubits).
| |
| | |
| The k-local Hamiltonian problem, which is a [[promise problem]], is defined as follows. The input is a k-local Hamiltonian acting on n qubits, which is the sum of polynomially many Hermitian matrices that act on only k qubits. The input also contains two numbers <math>a< b \in [0,1]</math>, such that <math>\frac{1}{b-a}=O(n^c)</math> for some constant c. The problem is to determine whether the smallest eigenvalue of this Hamiltonian is less than a or greater than b, promised that one of these is the case.
| |
| | |
| The k-local Hamiltonian is QMA-complete for k ≥ 2.<ref>{{Cite journal | last1=Kempe | first1=Julia | last2=Kitaev | first2=Alexei | last3=Regev | first3=Oded | title=The Complexity of the Local Hamiltonian Problem | publisher=[[Society for Industrial and Applied Mathematics]] | location=Philadelphia | year=2006 | journal=SIAM Journal on Computing | issn=1095-7111 | volume=35 | issue=5 | pages=1070–1097 | arxiv=quant-ph/0406180v2 | doi=10.1137/S0097539704445226}}.</ref>
| |
| | |
| QMA-hardness results are known for even simplistic and physically realistic [[lattice models]] of [[qubits]] such as <ref>{{Cite journal | last1=Biamonte | first1=Jacob | last2=Love | first2=Peter | title=Realizable Hamiltonians for Universal Adiabatic Quantum Computers | publisher=[[Physical Review]] | year=2008 | journal= Phys. Rev. A | volume=78 | issue=1 | pages=012352 | arxiv=arXiv:0704.1287 | doi=10.1103/PhysRevA.78.012352}}.</ref>
| |
| <math>
| |
| H = \sum_{i}h_i Z_i + \sum_{i<j}J^{ij}Z_iZ_i + \sum_{i<j}K^{ij}X_iX_i
| |
| </math>
| |
| where <math>Z, X</math> represent the [[Pauli matrices]] <math>\sigma_z, \sigma_x</math>. Such models are applicable to universal [[adiabatic quantum computation]].
| |
| | |
| The Hamiltonians for the QMA-complete problem can also be restricted to act on a two dimensional grid of [[qubits]]<ref>{{cite journal
| |
| | last = Oliveira
| |
| | first = Roberto
| |
| | coauthors = Barbara M Terhal
| |
| | title = The complexity of quantum spin systems on a two-dimensional square lattice
| |
| | volume = 8
| |
| | pages = 0900–0924
| |
| | journal = Quant. Inf, Comp.
| |
| | year = 2008
| |
| | issue = 10
| |
| | arxiv = quant-ph/0504050
| |
| }}</ref> or a line of quantum particles with 12 states per particle.<ref>{{Cite journal
| |
| | doi = 10.1007/s00220-008-0710-3
| |
| | volume = 287
| |
| | issue = 1
| |
| | pages = 41–65
| |
| | last = Aharonov
| |
| | first = Dorit
| |
| | coauthors = Daniel Gottesman, Sandy Irani, Julia Kempe
| |
| | title = The Power of Quantum Systems on a Line
| |
| | journal = Communications in Mathematical Physics
| |
| | date = 2009-04-01
| |
| }}</ref>
| |
| | |
| ===Other QMA-complete problems===
| |
| A list of known QMA-complete problems can be found at http://arxiv.org/abs/1212.6312.
| |
| == Related classes ==
| |
| | |
| '''QCMA''' (or '''MQA'''<ref name="JW" />), which stands for Quantum Classical Merlin Arthur (or Merlin Quantum Arthur), is similar to QMA, but the proof has to be a classical string. It is not known whether QMA equals QCMA, although QCMA is clearly contained in QMA.
| |
| | |
| '''QIP(k)''', which stands for [[Quantum Interactive Polynomial time]] (k messages), is a generalization of QMA where Merlin and Arthur can interact for k rounds. QMA is QIP(1). QIP(2) is known to be in PSPACE.<ref>{{Cite book | last1=Jain | first1=Rahul | last2=Upadhyay | first2=Sarvagya | last3=Watrous | first3=John | author3-link=John Watrous (computer scientist) | title=FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science | publisher=IEEE Computer Society | isbn=978-0-7695-3850-1 | year=2009 | chapter=Two-Message Quantum Interactive Proofs Are in PSPACE | pages=534–543 | postscript=<!--None-->}}</ref>
| |
| | |
| '''[[QIP (complexity)|QIP]]''' is QIP(k) where k is allowed to be polynomial in the number of qubits. It is known that QIP(3) = QIP.<ref>{{Cite journal | last1=Watrous | first1=John | author1-link=John Watrous (computer scientist) | title=PSPACE has constant-round quantum interactive proof systems | publisher=Elsevier Science Publishers Ltd. | location=Essex, UK | year=2003 | journal=Theor. Comput. Sci. | issn=0304-3975 | volume=292 | issue=3 | pages=575–588 | doi=10.1016/S0304-3975(01)00375-9 | postscript=<!--None-->}}</ref> It is also known that QIP = [[IP (complexity)|IP]] = [[PSPACE]].<ref>{{cite book | last1=Jain | first1=Rahul | last2=Ji | first2=Zhengfeng | last3=Upadhyay | first3=Sarvagya | last4=Watrous | first4=John | author4-link=John Watrous (computer scientist) | title=STOC '10: Proceedings of the 42nd ACM symposium on Theory of computing | publisher=ACM | isbn=978-1-4503-0050-6 | year=2010 | chapter=QIP = PSPACE | pages=573–582 | postscript=<!--None-->}}
| |
| </ref>
| |
| | |
| == Relationship to other classes ==
| |
| | |
| QMA is related to other known [[complexity classes]] by the following relations:
| |
| :<math>\mbox{P} \subseteq \mbox{NP} \subseteq \mbox{MA} \subseteq \mbox{QCMA} \subseteq \mbox{QMA}\subseteq \mbox{PP} \subseteq \mbox{PSPACE}</math>
| |
| | |
| The first inclusion follows from the definition of [[NP (complexity)|NP]]. The next two inclusions follow from the fact that the verifier is being made more powerful in each case. QCMA is contained in QMA since the verifier can force the prover to send a classical proof by measuring proofs as soon as they are received. The fact that QMA is contained in [[PP (complexity)|PP]] was shown by [[Alexei Kitaev]] and [[John Watrous (computer scientist)|John Watrous]]. PP is also easily shown to be in [[PSPACE]].
| |
| | |
| It is unknown if any of these inclusions is strict. It is not even known whether P is strictly contained in PSPACE or P = PSPACE.
| |
| | |
| ==References==
| |
| {{reflist|2}}
| |
| | |
| ==External links==
| |
| *{{cite web|url=http://www.scottaaronson.com/democritus/lec13.html|title=PHYS771 Lecture 13: How Big are Quantum States?|last=Aaronson|first=Scott}}
| |
| *{{CZoo|QMA|Q#qma}}
| |
| | |
| {{quantum computing}}
| |
| {{ComplexityClasses}}
| |
| | |
| [[Category:Probabilistic complexity classes]]
| |
| [[Category:Quantum complexity theory]]
| |
Brendan just what people call me however don't like when people use my full list. My family lives in New Hampshire. Accounting will be the he supports his relatives and he won't change it anytime fairly quickly. It's not a common thing but what she likes doing is bee keeping but she's been taking on new things lately. Go to his how does someone find out more: http://www.realcortijosanisidro.com/botas-ugg-baratas.html
Feel free to visit my site - Botas Ugg Baratas