<?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="Computational complexity - Page 28 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=computational_complexity&amp;p=27">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computational_complexity&amp;p=29">3.Next</a>
</p>
<p>purely theoretical, as no one knows how to build an efficient quantum computer.</p>

<p><a href="page.php?w=Quantum_complexity_theory">Quantum complexity theory</a> has been developed to study the <a href="page.php?w=complexity_class">complexity class</a>es of problems solved using quantum computers. It is used in <a href="page.php?w=post-quantum_cryptography">post-quantum cryptography</a>, which consists of designing <a href="page.php?w=cryptographic_protocol">cryptographic protocol</a>s that are resistant to attacks by quantum computers.</p>

<p><big>Problem complexity</big></p><p>
<a accesskey="1" href="page.php?w=computational_complexity&amp;p=27">1.Previous</a><br />
<a accesskey="3" href="page.php?w=computational_complexity&amp;p=29">3.Next</a>
</p>

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

</card>
</wml>
