Cryptology ePrint Archive: Report 2015/1207

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

Zhengjun Cao and 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.

Category / Keywords: foundations / Shor's algorithm; continued fraction expansion; quantum Fourier transformation; quantum modular exponentiation

Date: received 16 Dec 2015

Contact author: caozhj at shu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20151219:174740 (All versions of this report)

Short URL: ia.cr/2015/1207

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]