10,064 research outputs found
On computational power of classical and quantum Branching programs
We present a classical stochastic simulation technique of quantum Branching programs. This technique allows to prove the following relations among complexity classes: PrQP-BP ⊆ PP-BP and BQP-BP ⊆ PP-BP. Here BPP-BP and PP-BP stands for the classes of functions computable with bounded error and unbounded error respectively by stochastic branching program of polynomial size. BQP-BP and PrQP-BP stands the classes of functions computable with bounded error and unbounded error respectively by quantum branching program of polynomial size. Second. We present two different types. of complexity lower bounds for quantum nonuniform automata (OBDDs). We call them "metric" and "entropic" lower bounds in according to proof technique used. We present explicit Boolean functions that show that these lower bounds are tight enough. We show that when considering "almost all Boolean functions" on n variables our entropic lower bounds gives exponential (2c(δ)(n-logn)) lower bound for the width of quantum OBDDs depending on the error δ allowed
New Bounds for the Garden-Hose Model
We show new results about the garden-hose model. Our main results include
improved lower bounds based on non-deterministic communication complexity
(leading to the previously unknown bounds for Inner Product mod 2
and Disjointness), as well as an upper bound for the
Distributed Majority function (previously conjectured to have quadratic
complexity). We show an efficient simulation of formulae made of AND, OR, XOR
gates in the garden-hose model, which implies that lower bounds on the
garden-hose complexity of the order will be
hard to obtain for explicit functions. Furthermore we study a time-bounded
variant of the model, in which even modest savings in time can lead to
exponential lower bounds on the size of garden-hose protocols.Comment: In FSTTCS 201
On Computational Power of Quantum Read-Once Branching Programs
In this paper we review our current results concerning the computational
power of quantum read-once branching programs. First of all, based on the
circuit presentation of quantum branching programs and our variant of quantum
fingerprinting technique, we show that any Boolean function with linear
polynomial presentation can be computed by a quantum read-once branching
program using a relatively small (usually logarithmic in the size of input)
number of qubits. Then we show that the described class of Boolean functions is
closed under the polynomial projections.Comment: In Proceedings HPC 2010, arXiv:1103.226
Better Pseudorandom Generators from Milder Pseudorandom Restrictions
We present an iterative approach to constructing pseudorandom generators,
based on the repeated application of mild pseudorandom restrictions. We use
this template to construct pseudorandom generators for combinatorial rectangles
and read-once CNFs and a hitting set generator for width-3 branching programs,
all of which achieve near-optimal seed-length even in the low-error regime: We
get seed-length O(log (n/epsilon)) for error epsilon. Previously, only
constructions with seed-length O(\log^{3/2} n) or O(\log^2 n) were known for
these classes with polynomially small error.
The (pseudo)random restrictions we use are milder than those typically used
for proving circuit lower bounds in that we only set a constant fraction of the
bits at a time. While such restrictions do not simplify the functions
drastically, we show that they can be derandomized using small-bias spaces.Comment: To appear in FOCS 201
Challenges in computational lower bounds
We draw two incomplete, biased maps of challenges in computational complexity
lower bounds
- …