Meeting this scalability condition is possible for a wide range of systems. However, the use of error correction brings with it the cost of a greatly increased number of required qubits. The number required to factor integers using Shor's algorithm is still polynomial, and thought to be between "L" and "L"2, where "L" is the number of digits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of "L". For a 1000-bit number, this implies a need for about 104 bits without error correction. With error correction, the figure would rise to about 107 bits. Computation time is about "L"2 or about 107 steps and at 1 MHz, about 10 seconds.