A Comparative Study of Classical and Quantum Computing with the Analysis of Logic Gates

Abstract

Quantum computing is a quickly growing research field. This thesis introduces the basic concepts of quantum computing .Quantum computing combines science with mechanics and it is a fast-growing research field. In 1982, Feynman pointed out that to simulate a quantum system; the computer has to be working quantum mechanically. An effort has been made to explain how quantum computer can simulate with the help of quantum mechanics. We compare the Classical and quantum computing through the analysis of quantum and classical logic gate. Corresponding to each logic gate there exists equivalent hardamard transformation. Here given the proof of no cloning theorem i.e. no quantum system can be cloned by unitary transformation. This thesis contains analysis of different quantum gates, there operations, Quantum flourier transform. Further with the help of quantum programming, Alice and Bob communication problem evaluated. A special effort is made to explain programming basics of quantum computing, develop quantum bubble sort algorithm, insertion sort.