A Post Processing Method for Quantum Prime Factorization Algorithm based on Randomized Approach

نویسندگان

  • Mir Shahriar Emami
  • Mohammad Reza Meybodi
چکیده

Prime Factorization based on Quantum approach in two phases has been performed. The first phase has been achieved at Quantum computer and the second phase has been achieved at the classic computer (Post Processing). At the second phase the goal is to estimate the period r of equation 1 N r x ≡ and to find the prime factors of the composite integer N in classic computer. In this paper we present a method based on Randomized Approach for estimation the period r with a satisfactory probability and the composite integer N will be factorized therefore with the Randomized Approach even the gesture of the period is not exactly the real period at least we can find one of the prime factors of composite N. Finally we present some important points for designing an Emulator for Quantum Computer Simulation. Keywords—Quantum Prime Factorization, Randomized Algorithms, Quantum Computer Simulation, Quantum Computation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voice-based Age and Gender Recognition using Training Generative Sparse Model

Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...

متن کامل

Designing a quantum genetic controller for tracking the path of quantum systems

Based on learning control methods and computational intelligence, control of quantum systems is an attractive field of study in control engineering. What is important is to establish control approach ensuring that the control process converges to achieve a given control objective and at the same time it is simple and clear. In this paper, a learning control method based on genetic quantum contr...

متن کامل

Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division

Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P syste...

متن کامل

A Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting

Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...

متن کامل

On computing ordN(2) and its application

Shor proposed a polynomial time algorithm for prime factorization on quantum computers. For a given number N, he gave an algorithm for finding the order r of an element x in the multiplicative group (mod N). The method succeeds because factorization can be reduced to finding the order of an element using randomization. But the algorithm has two shortcomings, the order of the number must be even...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012