It is usually calimed that quantum computer can outperform classical computer. Is this statement true? We discuss this issue, not in general, but in the context of the most famous algorithm of quantum computation: Shor's algorithm.
Accardi, L. (2013). Complexity considerations on quantum computation. In W.F. L. Accardi (a cura di), Quantum bio-informatics - 5 (pp. 1-13). World Scientific.
Complexity considerations on quantum computation
ACCARDI, LUIGI
2013-01-01
Abstract
It is usually calimed that quantum computer can outperform classical computer. Is this statement true? We discuss this issue, not in general, but in the context of the most famous algorithm of quantum computation: Shor's algorithm.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Ac10_Complexity consideretions.pdf
accesso aperto
Dimensione
273.09 kB
Formato
Adobe PDF
|
273.09 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
