Quantum-computer technology can solve what is known as “NP-complete” problems. These are the problems where the sheer volume of complex data and variables prevent digital computers from achieving results in a reasonable amount of time. Such problems are associated with life sciences, biometrics, logistics, parametric database search and quantitative finance, among many other commercial and scientific areas.
To je dost velka lez, o vztah umezi NP a BQP se zatim nevi vubec nic [ani jedna inkluze].
Nevite navic nekdo, kolik ma ten jejich pocitac qubitu? Nikde jsem to nenasel...
NP-uplne problemy idu riesit aj na obycajnom PC, ide o to jak rychlo (minimalne v tej citovanej casti sa nehovori nic o rychlosti). V povodnom oznameni (v diskusii http://dwave.wordpress.com/2007/01/19/quantum-computing-demo-announcement/) sa hovori o kvadratickom zrychleni oproti "klasickej" architekture (su tam nejake narazky na Groverov algoritmus, ale jak presne pocita ten stroj, nebolo tusim pisane nikde).
