General introduction of quantumn computer

Abstract

     Cryptography is based on hard problems such as prime factorization problem or discrete logarithm problem. Currently, there doesn’t exist any efficient algorithm (implemented on binary computer) to solve these hard problems, but we do have quantumn efficient algorithms (implemented on quantumn computer) to solve several aforementioned
hard problems. For examples, we have Shor algorithm to efficently solve the prime factorization problem and Grover algorithm to efficently solve the discrete logarithm
problem. However, to implement Shor algorithm or Grover algorithm we need to have a quantumn computer with around 2000 Qbits. Unfortunatelly, we currently can only build a
quantumn computer with around 50 Qbits. In this paper, we first present the architecture of a quantumn computer and how a quantumn computer works. We then discuss some remaining technical problems and the latest researching results of building a practical quantumn computer. Finally, we present the predictions of researchers on this direction of research.