Pii: S0167-2789(98)00047-5

نویسنده

  • T. Hogg
چکیده

A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly effective for searches with many constraints. Furthermore, the algorithm provides a simple framework for utilizing search heuristics. It also exhibits the same phase transition in search difficulty as found for sophisticated classical search methods, indicating that it is effectively using the problem structure. © 1998 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pii: S0167-2789(98)00051-7

It is shown that the minimum energy required to transmit a natural unit of information (nat) over a noisy channel is k T, where T is the effective noise temperature which depends on the interaction between the information career and the environment. The result follows from the entropy defect principle and general laws of quantum dynamics without any specific assumptions. © 1998 Published by Els...

متن کامل

Data compression and learning in time sequences analysis

Motivated by the problem of the definition of a distance between two sequences of characters, we investigate the so-called learning process of a typical sequential data compression schemes. We focus on the problem of how a compression algorithm optimizes its features at the interface between two different sequences A and B while zipping the sequence A+ B obtained by simply appending B after A. ...

متن کامل

Pii: S0167-2789(98)00168-7

We compare two algorithms for the numerical estimation of the correlation dimension from a finite set of vectors: the "classical" algorithm of Grassberger and Procaccia (GPA) and the recently proposed algorithm of Judd (JA). Data set size requirements and their relations to systematic and statistical errors of the estimates are investigated. It is demonstrated that correlation dimensions of the...

متن کامل

Pii: S0167-2789(98)00054-2

We discuss the problem of counting the maximum number of distinct states that an isolated physical system can pass through in a given period of time its maximum speed of dynamical evolution. Previous analyses have given bounds in terms of AE, the standard deviation of the energy of the system; here we give a strict bound that depends only on E E0, the system's average energy minus its ground st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998