In this article I present some probabilities of 1-step learning optimized by Impatient Learning (http://www.citebase.org/abstract?id=oai:arXiv.org:quant-ph/0309059) for the sub/sup Majority Learning. The (Sub/Sup) Majority Learning Take a bitstring a, and an integer . The oracle will respond 0 if   if queried with x and 1 otherwise. In other terms this oracle reply yes if two [...]

As you may have read in some previous post I am actually working on a modified version of the Grover's Algorithm. For those who don't know the principles of Grover's Algorithm, here is a quick explanation. We have a function that is True for only one . We also have a quantum oracle that returns [...]

Qui est donc ce fameux Hadamard dont tout le monde parle en informatique quantique? Jacques Hadamard est un mathématicien français (1865-1963) à qui l'on doit les célèbres matrices (encore un normalien). Je vous conseille la biographie suivante sur Jacques Hadamard : Jacques Hadamard un mathématicien universel Ainsi que ce site regroupant les propriétés des-dites matrices [...]

Presentation of the problem : The majority problem is equivalent to the perceptron learning. For each define a function : Where wt is the weight of a bit-string (number of 1). Alternatively we can write : . The problem is : determine a given an access to answers from . We saw in the presentation [...]

There is a bunch of interesting papers dealing with Oracle Identification. Here is a list of the ones I found interesting to read :

WordPress permet d'inclure du Latex dans ses pages grace a un script hébergé sur ses propres serveur. Voila qui va me rendre heureux tout ca :