Award Date
12-15-2019
Degree Type
Thesis
Degree Name
Master of Science (MS)
Department
Physics and Astronomy
First Committee Member
Bernard Zygelman
Second Committee Member
Stephen Lepp
Third Committee Member
Rebecca Martin
Fourth Committee Member
Laxmi Gewali
Number of Pages
74
Abstract
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.
Keywords
decidability; incompleteness; quantum computation; quantum logic
Disciplines
Physics
File Format
File Size
0.499 MB
Degree Grantor
University of Nevada, Las Vegas
Language
English
Repository Citation
Kachroo, Pushkin, "An Introduction to the Exposition on Soundness, Completeness, and Decidability in Quantum Logic and Quantum Computation" (2019). UNLV Theses, Dissertations, Professional Papers, and Capstones. 3812.
http://dx.doi.org/10.34917/18608681
Rights
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/