With more scientific breakthroughs both in algorithmic and physical side, the study of quantum computing which is a new comprehensive and cross science of quantum mechanics and computer science has become a more sought-after and highly charged issue in recent years. This essay aims to give a brief overall introduction of quantum computing that is simple but still conveys the essential ideas and principles to general engineers who have some basic knowledge of linear algebra. In this essay, five primary parts of quantum computing are covered in order. First of all, three reasons for developing quantum computing, including its marvellous performance on some certain computational tasks, high efficiency on simulating other quantum systems and some physical limits to classical computing, will be illustrated in detail. After that, three basic concepts namely quantum bit, quantum gate and quantum computing process will be explained convincingly by comparing their classical counterparts. The different parts between them such as ‘superposition’ and ‘probabilistic’ will be focused on, because they are where the unique properties of quantum computing come from. In the third part, Shor’s factorizing algorithm will be set as an example to demonstrate its prominent computational power. In the final part, its rapid development and tremendous potentials both in physical research and market promise a visible future.

Table of Content

Introduction…………………………………………………………………………………...1 Why quantum computing………………………………………………………………...2 Basic Concepts…………………………………………………………………………….3 Computational Power…………………………………………………………………….9 Quantum Computer……………………………………………………………………..10 Future Perspectives and Potentials……………………………………………………..12 Conclusion……………………………………………………………………………………13 Reference List………………………………………………………………………………..14

Quantum Computing

Introduction

Combining quantum mechanics and computer science, quantum computing as an interdisciplinary and cutting-edge...

(1)