Serially Factoring large prime numbers --- Shor's algorithm modification

Hi,
I'm sorry I got carried away.
I believe Shor's algorithm uses a quantum computer to factor large prime numbers product. To crack the RSA algorithm you need to factor the product of two large prime numbers.

Now for that you do not need a large number of qubits quantum computer.

Dwave Systems (http://www.dwavesys.com) claims it has a 16 bit quantum computer.

How does one use that 16 bit quantum computer to factor large prime numbers to crack the RSA algorithm (or indeed even a "small number of bits" quantum computer which has say 10^300 states which is larger than the number of protons in the entire known Universe).

You can get Shor's algorithm from Wikipedia or arxiv.org
Take a look at Grover's algorithm too.

1. Use a recursive, output-feedforward algorithm as below.

1. Feed the problem into the "X" qubit quantum computer.
2. When the X qubits settle down, you have obtained the first X bits of the solution.

RECURSION, FEED-FORWARD
1A. Feed the problem into the "X" qubit quantum computer along with the first X bits of the solution.
1B. When the X qubits settle down you have obtained the second X qubits of the solution.

RECURSION, Feed-forward
1C. Feed the problem into the "X" qubit quantum computer along with the first X qubits of the solution and the second X qubits of the solution.
2C. When the X qubits settle down you have obtained the third X qubits of the solution.

Repeat the recursion and feedforward above until the entire solution is obtained.

Erach
.

Relevant Pages

  • Re: How long would it take a computer to completely "solve" chess?
    ... The kind of tree search you need to do to determine the ... a quantum computer will turn it into an easy one. ... the types of problem for which there's an algorithm to solve it using ... because each other type of problem in PSPACE can be reduced to it. ...
    (sci.math)
  • Re: Symmetric Encryption attacked by quantum computers?
    ... > I have read that if you are using a symmetric cipher with a 256 bit ... it would take a quantum computer about 2^128 steps to break. ... Grover's algorithm: ... doesn't automatically get fast computation from superposition -- one needs ...
    (sci.crypt)
  • Re: Quantum Computing and protein folding
    ... >> Would a quantum computer be able to efficiently, and accurately, solve ... a protein polypeptide itself is a quantum mechanical system that seems ... > problem any fatser using brute force as an algorithm. ... Maybe someone will someday figure out how to make such an algorithm ...
    (comp.theory)
  • Re: Quantum Computers breaking ciphers
    ... >> quantum computer and used itbto run Shor's Algorithm works and to ... >one qubit that can be chained with other qubits to do a computation. ... but not a quantum computer. ... >investigation of the spin states of some particular molecule. ...
    (sci.crypt)
  • Re: JSH: Easy math, easy solution
    ... > That depends on the speed of your quantum computer. ... > speed, and for some values to be factored, a Pollard-style algorithm ... A quantum computer can implement a polynomial-time algorithm ... the requirement of a classical computer in the algorithm is much ...
    (sci.math)