论文信息 - Complexity considerations quantum computation

Complexity considerations quantum computation

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.

Luigi Accardi | L. Accardi

[1] R. Jozsa,et al. Quantum Computation and Shor's Factoring Algorithm , 1996 .

[2] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[4] Daniel R. Simon. On the Power of Quantum Computation , 1997, SIAM J. Comput..