A Note On One Realization of a Scalable Shor Algorithm
Zhengjun Cao, Lihua Liu

TL;DR
This paper critiques a recent demonstration of a scalable Shor algorithm on ion-trap quantum computers, highlighting flaws in the circuit design and lack of clear explanation of its principles, correctness, and complexity.
Contribution
It identifies critical flaws in a recent experimental implementation of a scalable Shor algorithm and clarifies the underlying principles and complexities involved.
Findings
The reported circuit diagram has three flaws.
The principles and correctness of the demonstration are not properly explained.
The complexity analysis of the algorithm is lacking.
Abstract
Very recently, Monz, et al. [arXiv:1507.08852] have reported the demonstration of factoring 15 using a scalable Shor algorithm with an ion-trap quantum computer. In this note, we remark that the report is somewhat misleading because there are three flaws in the proposed circuit diagram of Shor algorithm. We also remark that the principles behind the demonstration have not been explained properly, including its correctness and complexity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Optical Network Technologies
