In this article, we show several results obtained by combining the use of stable distributions
with pseudorandom generators for bounded space. In particular:---We show that, for any …

What is this? Well its a PDF version of the website www. ComplexityZoo. com typeset in
LATEX using the complexity package. Well, what's that? The original Complexity Zoo is a …

In this paper, we show that one-qubit polynomial time computations are as powerful as NC1
circuits. More generally, we define syntactic models for quantum and stochastic branching …

Reversible cellular automata (RCA) are models of massively parallel computation that
preserve information. This paper is a short survey of research on reversible cellular …

In this paper, the space complexity of non-uniform quantum algorithms is investigated using
the model of quantum branching programs (QBPs). In order to clarify the relationship …

Ideally, a quantum computation is a sequence of local unitary transformations applied to a
register of qubits which are initially in the state 10n); followed by a measurement. Initializing …

We present two different types of complexity lower bounds for quantum uniform automata
(finite automata) and nonuniform automata (OBDDs). We call them “metric” and “entropic” …

Device initialization is a difficult challenge in some proposed realizations of quantum
computers, and as such, must be treated as a computational resource. The degree of …

It is known that for some languages quantum finite automata are more efficient than classical
counterparts. Particularly, a QFA recognizing the language has an exponential advantage …

The paper presents the first nontrivial upper and lower bounds for (non-oblivious) quantum
read-once branching programs. It is shown that the computational power of quantum and …