Complexity considerations quantum computation

Luigi Accardi · 2010

It is usually claimed 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.

Read the paper · More papers on PaperTik