Prime factorization using magnonic holographic devices (original) (raw)

2016, Journal of Applied Physics

Determining the prime factors of a given number N is a problem, which requires superpolynomial time for conventional digital computers. A polynomial-time algorithm was invented by P. Shor for quantum computers. However, the realization of quantum computers is associated with significant technological challenges in achieving and preserving quantum entanglement. Prime factorization can be also solved by using classical wave interference without quantum entanglement. In this work, we present experimental data showing prime factorization by utilizing spin wave interference. The prime factorization includes three major steps. First, general type computer calculates the sequence of numbers m k mod(N), where N is the number to be factorized, m is a randomly chosen positive integer, and k=0,1,2,3,4,5,6 ... Next, the period of calculated sequence r is determined by exploiting spin wave interference. Finally, the general type

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact