Search results for "complex"

Improved constructions of quantum automata

2008

We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use \frac{4}{\epsilon} \log 2p + O(1) states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of \log p than the previously known construction of Ambainis and Freivalds (quant-ph/9802062). Similarly to Ambainis and Freivalds, our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some results in this direction.

Symmetry-assisted adversaries for quantum state generation

2011

We introduce a new quantum adversary method to prove lower bounds on the query complexity of the quantum state generation problem. This problem encompasses both, the computation of partial or total functions and the preparation of target quantum states. There has been hope for quite some time that quantum state generation might be a route to tackle the $backslash$sc Graph Isomorphism problem. We show that for the related problem of $backslash$sc Index Erasure our method leads to a lower bound of $backslash Omega(backslash sqrt N)$ which matches an upper bound obtained via reduction to quantum search on $N$ elements. This closes an open problem first raised by Shi [FOCS'02]. Our approach is …

2014

Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms operate. First, we show that for any problem that is invariant under permuting inputs and outputs (like the collision or the element distinctness problems), the quantum query complexity is at least the 9 th root of the classical randomized query complexity. This resolves a conjecture of Watrous from 2002. Second, inspired by recent work of O’Donnell et al. and Dinur et al., we conjecture that every bounded low-degree polynomial has a “highly influential” …

Any AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer

2007

Consider the problem of evaluating an AND-OR formula on an $N$-bit black-box input. We present a bounded-error quantum algorithm that solves this problem in time $N^{1/2+o(1)}$. In particular, approximately balanced formulas can be evaluated in $O(\sqrt{N})$ queries, which is optimal. The idea of the algorithm is to apply phase estimation to a discrete-time quantum walk on a weighted tree whose spectrum encodes the value of the formula.

Circular sturmian words and Hopcroft’s algorithm

2009

AbstractIn order to analyze some extremal cases of Hopcroft’s algorithm, we investigate the relationships between the combinatorial properties of a circular sturmian word (x) and the run of the algorithm on the cyclic automaton Ax associated to (x). The combinatorial properties of words taken into account make use of sturmian morphisms and give rise to the notion of reduction tree of a circular sturmian word. We prove that the shape of this tree uniquely characterizes the word itself. The properties of the run of Hopcroft’s algorithm are expressed in terms of the derivation tree of the automaton, which is a tree that represents the refinement process that, in the execution of Hopcroft’s alg…

Efficient algorithm for learning simple regular expressions from noisy examples

1994

We present an efficient algorithm for finding approximate repetitions in a given sequence of characters. First, we define a class of simple regular expressions which are of star-height one and do not contain union operations, and a stochastic mutation process of a given length over a string of characters. Then, assuming that a given string of characters is obtained corrupted by the defined mutation process from some long enough word generated by a simple regular expression, we try to restore the expression. We prove that to within some reasonable accuracy it is always possible if the length of the mutation process is bounded comparing to the length of the example. We provide an algorithm by…

Locality of order-invariant first-order formulas

1998

A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.

Isometries of weighted spaces of holomorphic functions on unbounded domains

2009

We study isometries between weighted spaces of holomorphic functions on unbounded domains in ℂn. We show that weighted spaces of holomorphic functions on unbounded domains may exhibit behaviour different from that observed on bounded domains. We calculate the isometries for specific weights on the complex plane and the right half-plane.

Characterizing varieties of colength ≤4

2009

Let A be an associative algebra over a field F of characteristic zero, and let χ n (A), n = 1,2,…, be the sequence of cocharacters of A. For every n ≥ 1, let l n (A) denote the nth colength of A, counting the number of S n -irreducibles appearing in χ n (A). In this article, we classify the algebras A such that the sequence of colengths l n (A), n = 1,2,…, is bounded by four. Moreover we construct a finite number of algebras A 1,…, A d , such that l n (A) ≤ 4 if and only if A 1,…, A d  ∉ var(A).

Complemented Subspaces and Interpolation Properties in Spaces of Polynomials

1997

LetXbe a Banach space whose dualX* has typep ∈ (1, 2]. Ifmis an integer greater thanp/(p − 1) and (xn) is a seminormalized sequence weakly convergent to zero, there is a subsequence (yn) of (xn) such that, for each element (an) ofl∞, there is anm-homogeneous continuous polynomialPonXwithP(yn) = an,n = 1, 2,… . Some interpolation and complementation properties are also given in P(mlp), form < p, as well as in other spaces of polynomials and multilinear functionals.