<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quantum Information on Jice Lavocat</title><link>https://jice.lavocat.name/categories/quantum-information/</link><description>Recent content in Quantum Information on Jice Lavocat</description><generator>Hugo</generator><language>en-us</language><copyright>All rights reserved - 2016</copyright><lastBuildDate>Sat, 15 Aug 2009 00:00:00 +0000</lastBuildDate><atom:link href="https://jice.lavocat.name/categories/quantum-information/index.xml" rel="self" type="application/rss+xml"/><item><title>Grover’s Search Algorithm in Python</title><link>https://jice.lavocat.name/blog/2009/grovers-search-algorithm-in-python/</link><pubDate>Sat, 15 Aug 2009 00:00:00 +0000</pubDate><guid>https://jice.lavocat.name/blog/2009/grovers-search-algorithm-in-python/</guid><description>&lt;p style="text-align: justify;"&gt;
 As you may have read in some previous post I am actually working on a modified version of the &lt;a title="Lee Grover" href="http://www1.bell-labs.com/user/lkgrover/" target="_blank"&gt;Grover&lt;/a&gt;&amp;#8216;s &lt;a title="Grover's Search Algorithm" href="http://arxiv.org/abs/quant-ph/9605043" target="_blank"&gt;Algorithm&lt;/a&gt;. For those who don&amp;#8217;t know the &lt;a title="Explanations of Grover's Algorithm" href="http://www.quantiki.org/wiki/index.php/Grover%27s_search_algorithm" target="_blank"&gt;principles of Grover&amp;#8217;s Algorithm&lt;/a&gt;, here is a quick explanation.
&lt;/p&gt;
&lt;p style="text-align: justify;"&gt;
 We have a function $$f : \mathbb{Z}_2^n\rightarrow \mathbb{Z}_2$$ that is True for only one $$a \in \mathbb{Z}_2^n$$. We also have a quantum oracle that returns the value of the function f. Classicaly, finding the value of $$a$$ will take n-1 steps. With the quantum version (Grover&amp;#8217;s Algorithm) it takes only $$\sqrt{n}$$ steps.
&lt;/p&gt;</description></item><item><title>Tout sur Hadamard</title><link>https://jice.lavocat.name/blog/2009/tout-sur-hadamard/</link><pubDate>Mon, 20 Jul 2009 00:00:00 +0000</pubDate><guid>https://jice.lavocat.name/blog/2009/tout-sur-hadamard/</guid><description>&lt;p&gt;Qui est donc ce fameux Hadamard dont tout le monde parle en informatique quantique? &lt;a title="Jacques Hadamard" href="http://fr.wikipedia.org/wiki/Jacques_Hadamard" target="_blank"&gt;Jacques Hadamard&lt;/a&gt; est un mathématicien français (1865-1963) à qui l’on doit les célèbres matrices (encore un normalien).&lt;/p&gt;
&lt;p&gt;Je vous conseille la biographie suivante sur Jacques Hadamard : &lt;a title="Jacques Hadamard" href="http://books.google.fr/books?id=NhK6LIApE8UC&amp;printsec=frontcover" target="_blank"&gt;Jacques Hadamard un mathématicien universel&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Ainsi que ce site regroupant les propriétés des-dites matrices : &lt;a title="Propriétés des matrices de Hadamard" href="http://chaos.if.uj.edu.pl/~karol/hadamard/index.php" target="_blank"&gt;&lt;a href="http://chaos.if.uj.edu.pl/~karol/hadamard/index.php" target="_blank" rel="noopener noreferrer"&gt;http://chaos.if.uj.edu.pl/~karol/hadamard/index.php&lt;svg class="external-link-icon" aria-hidden="true" focusable="false" width="0.8em" height="0.8em" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2.5" stroke-linecap="round" stroke-linejoin="round" style="display:inline-block;vertical-align:baseline;margin-left:0.15em;"&gt;&lt;path d="M14 4h6v6"/&gt;&lt;path d="M20 4 10 14"/&gt;&lt;path d="M18 13v6a1 1 0 0 1-1 1H5a1 1 0 0 1-1-1V7a1 1 0 0 1 1-1h6"/&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/a&gt;&lt;/p&gt;</description></item></channel></rss>