In computational complexity theory, QMA, which stands for Quantum Merlin Arthur, is the quantum analog of the nonprobabilistic complexity class NP orâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Anne Broadbent, Zheng-Feng Ji, Fang Song, John Watrous
- 2016 IEEE 57th Annual Symposium on Foundations ofâ€¦
- 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

- Andrew M. Childs, David Gosset, Zak Webb
- ICALP
- 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)

Is this relevant?

2011

2011

- Sevag Gharibian, Julia Kempe
- 2011 IEEE 26th Annual Conference on Computationalâ€¦
- 2011

Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoreticalâ€¦Â (More)

Is this relevant?

2011

2011

- Daniel Nagaj, Pawel Wocjan, Yong Zhang
- Quantum Information & Computation
- 2011

Given a verifier circuit for a problem in QMA, we show how to exponentially amplify the gap between its acceptance probabilitiesâ€¦Â (More)

Is this relevant?

2011

2011

- Alessandro Chiesa, Michael A. Forbes
- Electronic Colloquium on Computational Complexity
- 2011

We present three contributions to the understanding of QMA with multiple provers: â€¢ We give a tight soundness analysis of theâ€¦Â (More)

Is this relevant?

2010

2010

- Bill Rosgen
- TQC
- 2010

Determining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problemâ€¦Â (More)

Is this relevant?

2008

2008

- Scott Aaronson
- Quantum Information & Computation
- 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)

Is this relevant?

2006

2006

This paper introduces a new technique for removing existential quantifiers over quantum states. Using this technique, we showâ€¦Â (More)

Is this relevant?

2003

2003

- Julia Kempe, Oded Regev
- Quantum Information & Computation
- 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?