Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Conference on Computational Complexity (CCC)

Arthur and Merlin in a quantum world

John Watrous

Published Jun 25, 2003• 0 citations
Publisher

Abstract

Arthur does not have a lot of time to spend performing difficult computations. He's recently obtained a quantum computer, but often it seems not to help - he only has a few quantum algorithms, and Merlin maintains that there aren't any other interesting ones, so Merlin is forced to convince the untrusting Arthur of the truth of various facts. However, Arthur and Merlin have a new resource at their disposal: quantum information. Some relationships among complexity classes defined by quantum Arthur-Merlin games and other commonly studied complexity classes are known, but many open questions remain. In this paper, I discuss quantum Arthur-Merlin games in detail, with an emphasis on open problems.

DOI
10.1109/ccc.2002.1004351

Related papers

The geometry of quantum computation

Mark R. Dowling, Michael A. Nielsen

Whether the class Quantum Merlin Arthur is equal to QMA_1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a quantum oracle relative to which QMA\neqQMA_1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not quantumly relativizing, among them such trivial containments as BQP\subseteq{ZQEXP}.

Quantum Information and Computation•Nov 1, 2008•148 citations

On Perfect Completeness for QMA

Scott Aaronson

Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a "quantum oracle" relative to which QMA ≠ QMA1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not quantumly relativizing, among them such "trivial" containments as BQP ⊆ ZQEXP.

•Jun 3, 2008•4 citations

On perfect completeness for QMA

Scott Aaronson

Whether the class QMA (Quantum Merlin Arthur)\ is equal to QMA_1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult,\ by using ideas from real analysis to give a "quantum" relative to which QMA \neq QMA_1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not quantumly relativizing, among them such "trivial" containments as BQP \subseteq ZQEXP.

arXiv:0806.0450•Quantum Information and Computation•Jan 1, 2009•45 citations

Introduction and Background

Phillip Kaye, Raymond Laflamme, Michele Mosca

A computer is a physical device that helps us process information by executing algorithms. An algorithm is a well-defined procedure, with finite description, for realizing an information-processing task. An information-processing task can always be translated into a physical task. When designing complex algorithms and protocols for various information-processing tasks, it is very helpful, perhaps essential, to work with some idealized computing model. However, when studying the true limitations of a computing device, especially for some practical reason, it is important not to forget the relationship between computing and physics. Real computing devices are embodied in a larger and often richer physical reality than is represented by the idealized computing model. Quantum information processing is the result of using the physical reality that quantum theory tells us about for the purposes of performing tasks that were previously thought impossible or infeasible. Devices that perform quantum information processing are known as quantum computers. In this book we examine how quantum computers can be used to solve certain problems more efficiently than can be done with classical computers, and also how this can be done reliably even when there is a possibility for errors to occur. In this first chapter we present some fundamental notions of computation theory and quantum physics that will form the basis for much of what follows. After this brief introduction, we will review the necessary tools from linear algebra in Chapter 2, and detail the framework of quantum mechanics, as relevant to our model of quantum computation, in Chapter 3. In the remainder of the book we examine quantum teleportation, quantum algorithms and quantum error correction in detail. We are often interested in the amount of resources used by a computer to solve a problem, and we refer to this as the complexity of the computation. An important resource for a computer is time. Another resource is space, which refers to the amount of memory used by the computer in performing the computation. We measure the amount of a resource used in a computation for solving a given problem as a function of the length of the input of an instance of that problem.

Oxford University Press eBooks•Nov 16, 2006•0 citations

Quantum Merlin-Arthur with Clifford Arthur

Tomoyuki Morimae, Masahito Hayashi, Harumichi Nishimura +1 more

We show that the class QMA does not change even if we restrict Arthur’s computing ability to only Clifford gate operations (plus classical XOR gate). The idea is to use the fact that the preparation of certain single-qubit states, so called magic states, plus any Clifford gate operations are universal for quantum computing. If Merlin is honest, he sends the witness plus magic states to Arthur. If Merlin is malicious, he might send other states to Arthur, but Arthur can verify the correctness of magic states by himself. We also generalize the result to QIP(3): we show that the class QIP(3) does not change even if the computational power of the verifier is restricted to only Clifford gate operations (plus classical XOR gate).

arXiv:1506.06447•Quantum Information and Computation•Nov 1, 2015•7 citations

An Introduction to Quantum Complexity Theory

Richard Cleve

We give a basic overview of computational complexity, query complexity, and communication complexity, with quantum information incorporated into each of these scenarios. The aim is to provide simple but clear definitions, and to highlight the interplay between the three scenarios and currently-known quantum algorithms.

arXiv:quant-ph/9906111•WORLD SCIENTIFIC eBooks•Jan 1, 2001•94 citations
Arthur does not have a lot of time to spend performing difficult computations. He's recently obtained a quantum computer, but often it seems not to help - he only has a few quantum algorithms, and Merlin maintains that there aren't any other interesting ones, so Merlin is forced to convince the untrusting Arthur of the truth of various facts. However, Arthur and Merlin have a new resource at their disposal: quantum information. Some relationships among complexity classes defined by quantum Arthur-Merlin games and other commonly studied complexity classes are known, but many open questions remain. In this paper, I discuss quantum Arthur-Merlin games in detail, with an emphasis on open problems.
Whether the class QMA (Quantum Merlin Arthur)\ is equal to QMA_1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult,\ by using ideas from real analysis to give a "quantum" relative to which QMA \neq QMA_1. As a byproduct, we find that there are facts about quantum complexity classes that are classically relativizing but not quantumly relativizing, among them such "trivial" containments as BQP \subseteq ZQEXP.
A computer is a physical device that helps us process information by executing algorithms. An algorithm is a well-defined procedure, with finite description, for realizing an information-processing task. An information-processing task can always be translated into a physical task. When designing complex algorithms and protocols for various information-processing tasks, it is very helpful, perhaps essential, to work with some idealized computing model. However, when studying the true limitations of a computing device, especially for some practical reason, it is important not to forget the relationship between computing and physics. Real computing devices are embodied in a larger and often richer physical reality than is represented by the idealized computing model. Quantum information processing is the result of using the physical reality that quantum theory tells us about for the purposes of performing tasks that were previously thought impossible or infeasible. Devices that perform quantum information processing are known as quantum computers. In this book we examine how quantum computers can be used to solve certain problems more efficiently than can be done with classical computers, and also how this can be done reliably even when there is a possibility for errors to occur. In this first chapter we present some fundamental notions of computation theory and quantum physics that will form the basis for much of what follows. After this brief introduction, we will review the necessary tools from linear algebra in Chapter 2, and detail the framework of quantum mechanics, as relevant to our model of quantum computation, in Chapter 3. In the remainder of the book we examine quantum teleportation, quantum algorithms and quantum error correction in detail. We are often interested in the amount of resources used by a computer to solve a problem, and we refer to this as the complexity of the computation. An important resource for a computer is time. Another resource is space, which refers to the amount of memory used by the computer in performing the computation. We measure the amount of a resource used in a computation for solving a given problem as a function of the length of the input of an instance of that problem.
We show that the class QMA does not change even if we restrict Arthur’s computing ability to only Clifford gate operations (plus classical XOR gate). The idea is to use the fact that the preparation of certain single-qubit states, so called magic states, plus any Clifford gate operations are universal for quantum computing. If Merlin is honest, he sends the witness plus magic states to Arthur. If Merlin is malicious, he might send other states to Arthur, but Arthur can verify the correctness of magic states by himself. We also generalize the result to QIP(3): we show that the class QIP(3) does not change even if the computational power of the verifier is restricted to only Clifford gate operations (plus classical XOR gate).