QMA

Known as: QCMA 
In computational complexity theory, QMA, which stands for Quantum Merlin Arthur, is the quantum analog of the nonprobabilistic complexity class NP or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2017
051019762017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness… (More)
Is this relevant?
2015
2015
The class QMA plays a fundamental role in quantum complexity theory and it has found surprising connections to condensed matter… (More)
Is this relevant?
2014
2014
The Bose-Hubbard model is a system of interacting bosons that live on the vertices of a graph. The particles can move between… (More)
  • figure 1.1
  • figure 1.2
  • figure 5.1
  • figure 5.2
  • figure 5.3
Is this relevant?
2011
2011
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical… (More)
Is this relevant?
2011
2011
Given a verifier circuit for a problem in QMA, we show how to exponentially amplify the gap between its acceptance probabilities… (More)
  • figure 1
  • figure 2
Is this relevant?
2011
2011
We present three contributions to the understanding of QMA with multiple provers: • We give a tight soundness analysis of the… (More)
  • table 1
Is this relevant?
2010
2010
Determining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problem… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2008
2008
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years… (More)
  • figure 1
Is this relevant?
2006
2006
This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we show… (More)
  • figure 1
Is this relevant?
2003
2003
It has been shown by Kitaev that the 5-local Hamiltonian problem is QMA-complete. Here we reduce the locality of the problem by… (More)
Is this relevant?