Paper 2015/1207

Comment on Demonstrations of Shor's Algorithm in the Past Decades

Zhengjun Cao, Zhenfu Cao, and Lihua Liu

Abstract

We remark that the experimental demonstrations of Shor's algorithm in the past decades are falsely claimed and flawed, because they had used too less qubits in the first quantum register to accomplish the step of Continued Fraction Expansion in Shor's algorithm. More worse, the amount of qubits used in some experiments are too less to represent all residues modulo n, which means that the number n cannot be truly involved in the related computations.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Shor's algorithmcontinued fraction expansionquantum Fourier transformationquantum modular exponentiation
Contact author(s)
caozhj @ shu edu cn
History
2015-12-19: received
Short URL
https://ia.cr/2015/1207
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/1207,
      author = {Zhengjun Cao and Zhenfu Cao and Lihua Liu},
      title = {Comment on  Demonstrations of  Shor's Algorithm  in the Past Decades},
      howpublished = {Cryptology ePrint Archive, Paper 2015/1207},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/1207}},
      url = {https://eprint.iacr.org/2015/1207}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.