Blog de Jean-Christophe Lavocat

Mon Bioblog (humeurs, tendances et aventures en tout genres)
  • rss
  • Home
  • Plugins utilisés
  • About
  • Photos
    • San Diego en vrac
    • Surf in San Diego
    • Mon appart
    • Patriotism
    • Red Bull Air Race
    • First Month in San Diego
    • Snow in San Diego
    • Plage Law Street
    • Torrey Pines Reserve
    • UCSD
    • Arrivee a San Diego
    • Marseille
    • Corse
    • CMOI
    • Photos of Me
    • Jon's graduation party
    • Los Angeles (deuxième Journée)
    • Los Angeles (première Journée)
    • Games, Parties and ...
    • San Diego Zoo
    • Hitting San Onofre
    • Wild Animal Park
    • Surf in Del Mar
    • Quand c'est baston à San Diego
    • Winter is damn cold
    • Balagne Sauvage
    • Corsica Ferries
    • Hyères Novembre 2009
    • Presqu'île de Giens
    • Santa Manza un spot de Windsurf
    • Santa Manza - Octobre 09
    • Chèvres Corses
    • Freestyle is easy
    • Chainsaw Man
    • Atlanta/CdG Airport
    • Going Away Party
    • Ghisonaccia - 24 Décembre 2009
    • Santa Manza - Février 2010
    • Citadelle de Calvi
    • Profile Pictures
    • Neve in Toscana
    • Baux de Provence
    • Cathédrale d'Image
    • Fontaine de Vaucluse
    • Moustaches
    • Siena
    • Around Pistoia
    • Montefioralle

Impatient Learning and sub/sup Majority Problem

Jice | 16/09/2009

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 bitstrings agree on at least 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. n \ theta 0 1 2 3 4 2 1 1 X X X 4 0.6875 0.875 0.875 0.6875 X 6 0.3671875 0.6171875 0.75 0.75 0.6171875 8 0.1865234 0.36132812 0.520508 Read More

Comments
No Comments »
Categories
Quantum Learning
Comments rss Comments rss
Trackback Trackback

Grover's Search Algorithm in Python

Jice | 15/08/2009
grover_simple

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 the value of the function f. Classicaly, finding the value of will take n-1 steps. With the quantum version (Grover's Algorithm) it takes only steps. The idea (without explanations) is to take an equally distributed weights vector as input , and to iterate a sequence of unitary operations during a certain amount of time.  After this given number of steps a measurement on the input Read More

Comments
No Comments »
Categories
Quantum Information
Tags
python, Quantum Information, Quantum Oracle
Comments rss Comments rss
Trackback Trackback

Tout sur Hadamard

Jice | 20/07/2009

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 : http://chaos.if.uj.edu.pl/~karol/hadamard/index.php

Comments
No Comments »
Categories
Maths, Quantum Information
Tags
Hadamard, Histoire des Sciences, Matrices
Comments rss Comments rss
Trackback Trackback

Classical algorithm for the Majority Problem

Jice | 07/07/2009

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 (link available soon) that the classical complexity was while the quantum complexity was . In the following we show the classical bound. The classical algorithm For the classical case we will use a dichotomic process as in the binary chop. Here is the algorithm : At the first step you look the result for 0...0. If it's 1 you take all the possible weights that Read More

Comments
No Comments »
Categories
Informatique, Quantum Learning
Tags
machine learning, Majority problem, Perceptron
Comments rss Comments rss
Trackback Trackback

Some papers about Oracle identification

Jice | 01/07/2009

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

Comments
No Comments »
Categories
Quantum Learning
Tags
Quantum Information, Quantum Oracle
Comments rss Comments rss
Trackback Trackback

Latex on my blog

Jice | 19/06/2009

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 :

Comments
4 Comments »
Categories
En vrac, Quantum Learning
Tags
latex, wordpress
Comments rss Comments rss
Trackback Trackback

Portfolio

  • Apache Mod-Rewrite
  • Graphemeride
  • Site Perso
  • Surrounded by Water

Présences Web

  • Mes lectures RSS
  • Page Twitter
  • Profil Facebook

Derniers posts

  • 30DSTART - Day 4 - Startup Name
  • The 30-days Startup Challenge
  • Elevage de Sentimancho
  • How to transfer money from USD ($) to EUR (€) accounts
  • Implementing microdata schema.org in Yootheme ZOO

Shared Blog posts

  • Webbing the gap between science and the public (The Official Google Blog)
  • Hydrodynamics of a microhunter: A chemotactic scenario (PRE Rapid Communications)
  • Quantum biology: Coherence in photosynthesis (Nature Physics - Issue - nature.com science feeds)
  • Physics of life: The dawn of quantum biology (Nature - Issue - nature.com science feeds)
  • Changes to the open Internet in Kazakhstan (The Official Google Blog)
Shared Items
  • +Jean-Christophe Lavocat

    • Jean-Christophe Lavocat - PhD student, windsurfer and geek.

Navigation

  • Écologie (1)
  • En vrac (12)
  • Informatique (49)
  • Linux (3)
  • Management (5)
  • Maths (3)
  • Ma_Life.com (14)
  • Musique (11)
  • Nanosciences (1)
  • Neurosciences (6)
  • PHP (1)
  • Python (2)
  • Quantum Information (2)
  • Quantum Learning (4)
  • Sciences (17)
  • Sciences humaines (4)
  • Scientific Computations (2)
  • SEO (3)
  • Videos (7)
  • Windsurf (3)

Tags

30 days challenge Arte Bash blog Comsol Entrepreuneuriat Expatriation Google Gothique graphisme Htaccess intelligence international Joomla latex Lecture Linux machine learning Management Mind Machine Musique Mémoire nanotechnology neurosciences notepad++ numpy proxy python Quantum Information Quantum Oracle Reggae Reverse Search Russe Scattered Field SEO Spy startup theme wordpress Videos web web sémantique Windsurf wordpress YOOtheme Zoo
rss Comments rss valid xhtml 1.1 design by jide powered by Wordpress get firefox
powered byGoogle