Introduction to classical computation

Pushkin P.E. Kachroo

This thesis provides an introduction to the concepts of soundness and completeness in the context of quantum logic. As quantum logic is based on a lattice and not Boolean logic as is the case of classical logic, its meta analysis is very different. This thesis is devoted to studying the differences that this structure provides. In terms of quatum computation, the thesis provides an introduction to decidability as it is used in classical computation theory using Turing machines and then presents a comparison to quantum computation structure. The aim of the thesis is to present the existing basic structures of classical and quantum logic, as well as classical and quantum computation that will enable the development of the technical connections between the two in terms of specific models and finally to their relationship to classical and quantum complexity.

A. Kitaev, Alexander Khanievich Shen', M. Vyalyi

Introduction Classical computation Quantum computation Solutions Elementary number theory Bibliography Index.

A. Kitaev, Alexander Khanievich Shen', M. Vyalyi

Kwabena Mensah Sarpong