Add to ORKGThis paper studies whether quantum proofs are more powerful than classical proofs, or in complexity terms, whether QMA = QCMA. We prove two results about this question. First, we give a “quantum oracle separation” between QMA and QCMA. More concretely, we show that any quantum algorithm needs
Abstract. The quantum model of computation is a model, analogous to the probabilistic Turing machine...
Interactive proof systems form an important complexity model that has been central to many prominent...
In this paper we give an overview of the quantum computational complexity class QMA and a descriptio...
This paper studies whether quantum proofs are more powerful than classical proofs, or in complexity ...
We study the ability of efficient quantum verifiers to decide properties of exponentially large subs...
It is a long-standing open question in quantum complexity theory whether the definition of $\textit{...
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quant...
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we r...
Query complexity is a common tool for comparing quantum and classical computation, and it has produc...
The oracle model of computation is believed to allow a rigorous proof of quantum over classical comp...
We study how the choices made when designing an oracle affect the complexity of quantum property tes...
The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machi...
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argume...
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been...
QMA is the complexity class of computational problems that are efficiently verifiable by a quantum a...
Abstract. The quantum model of computation is a model, analogous to the probabilistic Turing machine...
Interactive proof systems form an important complexity model that has been central to many prominent...
In this paper we give an overview of the quantum computational complexity class QMA and a descriptio...
This paper studies whether quantum proofs are more powerful than classical proofs, or in complexity ...
We study the ability of efficient quantum verifiers to decide properties of exponentially large subs...
It is a long-standing open question in quantum complexity theory whether the definition of $\textit{...
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quant...
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we r...
Query complexity is a common tool for comparing quantum and classical computation, and it has produc...
The oracle model of computation is believed to allow a rigorous proof of quantum over classical comp...
We study how the choices made when designing an oracle affect the complexity of quantum property tes...
The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machi...
We show that every language in QMA admits a classical-verifier, quantum-prover zero-knowledge argume...
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been...
QMA is the complexity class of computational problems that are efficiently verifiable by a quantum a...
Abstract. The quantum model of computation is a model, analogous to the probabilistic Turing machine...
Interactive proof systems form an important complexity model that has been central to many prominent...
In this paper we give an overview of the quantum computational complexity class QMA and a descriptio...