Quantum Randomness and Nondeterminism
ثبت نشده
چکیده
Does the notion of a quantum randomized or nondeterministic algorithm make sense, and if so, does quantum randomness or nonde-terminism add power? Although reasonable quantum random sources do not add computational power, the discussion of quantum random-ness naturally leads to several deenitions of the complexity of quantum states. Unlike classical string complexity, both deterministic and non-deterministic quantum state complexities are interesting. A notion of total quantum nondeterminism is introduced for decision problems. This notion may be a proper extension of classical nondeterminism.
منابع مشابه
Quantum Weakly Nondeterministic Communication Complexity
In this paper, we study a weak version of quantum nondeterministic communication complexity, corresponding to the most natural generalization of classical nondeterminism, in which a classical proof has to be checked with probability one by a quantum protocol. Another stronger definition of quantum nondeterminism has already been extensively studied, corresponding to the view of quantum nondeter...
متن کاملCS 810 : Complexity Theory 1 / 22 / 2007 Lecture 1 : Introduction
This course provides a graduate-level introduction to computational complexity theory, the study of the power and limitations of efficient computation. In the first part of the course we focus on the standard setting, in which one tries to realize a given mapping of inputs to outputs in a timeand space-efficient way. We develop models of computation that represent the various capabilities of di...
متن کاملTeaching Nondeterminism as a Special Case of Randomization
Nondeterminism is a central concept in computer science. Every student of computer science is faced with this concept, since it is the basis of the -completeness theory and is applied in automata theory, formal languages, and many more areas. Students tend to have difficulties with the abstract concept of nondeterminism. Here a different approach to nondeterminism is proposed. Students should f...
متن کاملOn Nondeterminism versus Randomness for Read-Once Branching Programs
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing machines. In this paper, we present complexity theoretic results for randomized read-once branching programs. Our main result shows that nondeterminism can be more powerful than randomness for read-once branching programs. We present a function which is computable by ...
متن کاملTensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
In this paper we study quantum nondeterminism in multiparty communication. There are three (possibly) different types of nondeterminism in quantum computation: i) strong, ii) weak with classical proofs, and iii) weak with quantum proofs. Here we focus on the first one. A strong quantum nondeterministic protocol accepts a correct input with positive probability, and rejects an incorrect input wi...
متن کامل