• Corpus ID: 16610274

Comment on "Realization of a scalable Shor algorithm"

@article{Cao2015CommentO,
  title={Comment on "Realization of a scalable Shor algorithm"},
  author={Zhengjun Cao and Lihua Liu},
  journal={IACR Cryptol. ePrint Arch.},
  year={2015},
  volume={2015},
  pages={1133}
}
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. We remark that the report is flawed 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. 

Figures from this paper

Will quantum computers be the end of public key encryption?

It is argued that there are many fields of mathematics that can be used for creating ‘quantum resistant’ cryptographic schemes and that the range of quantum algorithms that pose a threat to public key encryption schemes is likely to be limited in future.

References

SHOWING 1-8 OF 8 REFERENCES

Remarks on Quantum Modular Exponentiation and Some Experimental Demonstrations of Shor's Algorithm

An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al.,

Experimental demonstration of a compiled version of Shor's algorithm with quantum entanglement.

For the first time, the core processes, coherent control, and resultant entangled states required in a full-scale implementation of Shor's powerful quantum algorithm for factoring are demonstrated in a photonic system.

Realization of a scalable Shor algorithm

The realization of a scalable Shor algorithm, as proposed by Kitaev, is presented, which has been realized scalably within an ion-trap quantum computer and returns the correct factors with a confidence level exceeding 99%.

Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits.

An experimental demonstration of a complied version of Shor's algorithm using four photonic qubits using a simplified linear optical network to coherently implement the quantum circuits of the modular exponential execution and semiclassical quantum Fourier transformation.

Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance

A simple, parameter-free but predictive model of decoherence effects in the authors' system is presented, which is in principle scalable to systems containing many quantum bits, but such scalability is not implied by the present work.

Computing prime factors with a Josephson phase qubit quantum processor

Shor’s quantum algorithm factorizes integers, and implementing this is a benchmark test in the early development of quantum processors. Researchers now demonstrate this important test in a

Quantum measurements and the Abelian Stabilizer Problem

  • A. Kitaev
  • Mathematics
    Electron. Colloquium Comput. Complex.
  • 1996
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator.

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.