Quantum Algorithms and Hard Problems
Any computation is necessarily a physical process. The current drive towards increasing speed and miniaturization of computers lead modern technology towards the subatomic domain - Quantum computing, where strange quantum behavior takes over from familiar classical notions. The quantum computers have the ability to solve problems with varied computational complexities and more importantly hard problems. A problem is said to be hard, if the best possible algorithm requires exponential resources. This exponential quantum parallelism is the basis for me quantum speedup of many algorithms, and has made the construction of fast algorithms for quantum computers possible. Various proposals exist for modeling and devising procedures on computational problems related to factoring, searching, quantum counting, generalization of quantum algorithms etc.1. In this paper, we have discussed the importance of algorithms such as order-finding, factoring and quantum searching which require exorbitant resources for their solution which otherwise is impossible on a classical computer.
Quantum computer quantum algorithms hard problem factoring qubits.
Vidya Raj C. Phaneendra H. D. Dr. Shivakumar M.S.
Dept of CS & Engg. NIE, Mysore-570008 Karnataka, India Principal NIE, Mysore-570008 Karnataka, India
国际会议
Firth IEEE International Conference on Cognitive Informatics(第五届认知信息国际会议)
北京
英文
783-787
2006-07-17（万方平台首次上网日期，不代表论文的发表时间）