Dear Prof. Kim,
Many thanks for your comments.
Let me share our latest updates as follows;
1. The 14-bit number we performed is five decimal digits. In particular, it was not performed for a "specific number" in factoring five digits.
It is possible for any semi-prime number of five digits for the factorization.
2. A quantum computation was utilized. (In fact, since the performance of quantum computers is not remarkably good, a quantum simulator implemented in a classical computer was used.)
Currently, classical computers perform better than quantum computers in factoring. The first reason is that factoring of appropriately sized numbers is necessary to bring realistic results,
and the second reason is that quantum computers have not yet been developed enough to produce meaningful results.
However, for numbers larger than 512-bit (binary), quantum computers will show better performance. (Ref: KK Berggren (2004). Quantum computing with superconductors. Proceedings of the IEEE)
Particularly, if quantum computers evolve to the extent where the (required) time factor stands out, this will become a real threat to RSA encryption, which has not been achieved by classical computers.