Search results

1. Integer factorization

   In number theory, integer factorization is the process of breaking down a composite number into ...

   Wiki article - Anonymous (not verified) - 26/10/2015 - 17:37 - 0 comments

2. BQP

   ... P. Currently, only three such problems are known: Integer factorization (see Shor's algorithm ) Discrete logarithm ...

   Wiki article - JMiszczak - 26/10/2015 - 17:56 - 0 comments

3. Computational complexity

   ... strict superset of P , but that is not known. Both integer factorization and discrete log are in BQP . Both of these ...

   Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments

4. Shor's factoring algorithm

   ...

   Wiki article - JMiszczak - 26/10/2015 - 17:56 - 0 comments

5. Los Alamos National Laboratory

   ... most difficult problems in computational science, such as integer factorization, discrete logarithms, and quantum modeling that are ...

   Research group - Rsomma - 26/10/2015 - 17:05 - 0 comments

6. Quantum computing

   ... most difficult problems in computational science, such as integer factorization, quantum simulation and modeling, intractable on any ...

   Wiki article - Anonymous (not verified) - 26/10/2015 - 17:56 - 0 comments