I offer a case that quantum query complexity still has loads of enticing and fundamental open
problems—from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs …

A computer is generally considered to be a universal computational device; ie, it is believed
able to simulate any physical computational device with a cost in computation time of at most …

This book is an introduction to a new rapidly develo** topic: the theory of quantum
computing. It begins with the basics of classical theory of computation: Turing machines …

We give a new characterization of NP: the class NP contains exactly those languages L for
which membership proofs (a proof that an input x is in L) can be verified probabilistically in …

A new algebraic technique for the construction of interactive proof systems is presented. Our
technique is used to prove that every language in the polynomial-time hierarchy has an …

We determine the exact power of two-prover interactive proof systems introduced by Ben-Or,
Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

A complete treatment of fundamentals and recent advances in complexity theory Complexity
theory studies the inherent difficulties of solving algorithmic problems by digital computers …

Publisher Summary This chapter discusses the concepts needed for defining the complexity
classes. A complexity class is a set of problems of related resource-based complexity. A …

We look at complexity issues of interactive proof systems with multiple provers separated
from each other. This model, developed by Ben-Or et al.(1988) allows the verifier to play the …