Impatient Learning and sub/sup Majority Problem
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 $$\theta$$. The oracle will respond 0 if $$d(a,x)\leq \theta$$ if queried with x and 1 otherwise. In other terms this oracle reply yes if two bitstrings agree on at least $$\theta$$ bit.
Here are the probability with a simple membership oracle (used with the usual phase kickback trick). Only even n gives an invertible matrix for the use of impatient learning.
»






Résumé des points importants du Chapitre 1
Dans les billets qui vont suivre et s’intituler ‘The Mind Machine – Chapitre x’ je ferai un petit compte-rendu des informations apprises en lisant le livre ‘


