[isoprophlex]

Thanks, interesting idea but it seems the practical applicability is still far away.

> One of the most celebrated results in quantum computing is the development of a quantum algorithm for factorization that works in time polynomial in n. This algorithm, due to Peter Shor and known as Shor’s algorithm, runs in O (n3 log n) time and uses O (n2 log n log log n) gates. The first experimental implementation of this algorithm on a quantum computer was reported in 2001, when the number 15 was factored. The largest integer factored by Shor’s algorithm so far is 21.