2016•Unpublished venueRequires access
Quantum computation: From Church-Turing thesis to Qubits
Shankhadip Kundu, Rajdeep Kundu, Shubhabrata Kundu, Anubhab Bhattachaijee, Sayantan Gupta, Souvik Ghosh, Indranil Basu
Open publisher page 7 citations
Abstract
In the paper we interpret the Church Turing thesis of Computation Algorithm and how it differs from the strong Church Turing thesis in the field of computation. Church Turing thesis can be classified as Strong Church Turing thesis and Normal Church Turing thesis. Church Turing hypothesis says “that a computing problem can be solved in any computer if and only if it can be solved on a very simple ‘machine’, named TURING MACHINE”. We introspect the difference in the model of computers that are developed on these two competitive algorithms. We will also be studying the physical realization of bits in a quantum computer with special mention to the commercial quantum computer systems offered at the moment. Our objective is to find out the relation of a quantum bit and the Strong Church Turing Thesis converging the gap between theoretical model and physical structure.