<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Shor&#039;s algorithm - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=Shor%27s_algorithm&amp;p=2">3.Next</a>
</p>
<p><b>Shor's algorithm</b> is a <a href="page.php?w=quantum_algorithm">quantum algorithm</a> for finding the <a href="page.php?w=prime_factor">prime factor</a>s of an integer. It was developed in 1994 by the American mathematician <a href="page.php?w=Peter_Shor">Peter Shor</a>. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (non-quantum) algorithms. However, beating classical computers may require quantum computers with millions</p><p>
<a accesskey="3" href="page.php?w=Shor%27s_algorithm&amp;p=2">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
