Results 1  10
of
2,082
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
BPP. The class BQP of languages that are efficiently decidable (with small errorprobability) on a quantum Turing machine satisfies BPP ⊆ BQP ⊆ P ♯P. Therefore, there is no possibility of giving a mathematical proof that quantum Turing machines are more powerful than classical probabilistic Turing
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1135 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
Stochastic Perturbation Theory
, 1988
"... . In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a firstorder perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating the variatio ..."
Abstract

Cited by 907 (36 self)
 Add to MetaCart
. In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a firstorder perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating
Tabu Search  Part I
, 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract

Cited by 680 (11 self)
 Add to MetaCart
, and more recently has demonstrated its value in treating classical problems such as the traveling salesman and graph coloring problems. Nevertheless, the approach is still in its infancy, and a good deal remains to be discovered about its most effective forms of implementation and about the range
New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic
, 2014
"... ..."
Towards unified formulations and extensions of two classical probabilistic location models
, 2005
"... ..."
Classical, Probabilistic, and Contingent Planning: Three Models, One Algorithm
"... Various forms of planning in AI can be viewed as problems of sequential decision that differ only on whether the effects of actions are predictable and/or observable. Three simple mathematical models, search, mdps and pomdps, provide the conceptual framework to understand such problems but suitable ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Various forms of planning in AI can be viewed as problems of sequential decision that differ only on whether the effects of actions are predictable and/or observable. Three simple mathematical models, search, mdps and pomdps, provide the conceptual framework to understand such problems but suitable languages and algorithms are needed to model and solve them effectively. In this paper, we analyze planning from this perspective and report the performance of a simple but general planning algorithm on various planning tasks. Actions We take an abstract view of planning as a problem of sequential decision in which actions have to be executed to achieve a goal. We distinguish two important aspects of actions: whether their effects are predictable, and whether they are observable. We assume throughout that time is discrete. In deterministic action models, the effect of actions is completely predictable and can be represented by transition function f such that s 0 = f(s; a) is the unique ...
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 446 (13 self)
 Add to MetaCart
, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical twovalued setting, but the result provides a natural semantics for distributed logic programs, including
Quantum mechanics helps in searching for a needle in a haystack
, 1997
"... Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50 % , any classical algorithm (whether deterministic or probabili ..."
Abstract

Cited by 434 (10 self)
 Add to MetaCart
Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50 % , any classical algorithm (whether deterministic
Results 1  10
of
2,082