Quantum simulation is the process of simulating a quantum mechanical system using either a quantum or a classical computer. Because quantum mechanical systems contain a large number of entangled particles, they are hard to simulate on a classical computer. It is the task of computational complexity theorists to estimate the amount of resources to do the same number of operations on either classical or quantum devices. This report first summarizes the state of the art in the field of quantum computing, and gives an example of a model of quantum computer and examples of quantum algorithms that are currently being researched. Then our own research about k-local quantum Hamiltonians is discussed. We developed programs to determine if a particular kind of k-local Hamiltonian has zero-energy solutions. First, to familiarize ourselves with quantum algorithms, we implemented a recently discovered polynomial-time 2-QSAT algorithm called SolveQ. Then we wrote several versions of brute force 7-variable 3-QSAT solvers and conducted experiments for the threshold of satisfiability. We empirically determined that the thresholds for the four versions, Versions 3, 4, 5, and 6, are 0.741, 1.714, 1.714, and 0.571, respectively. In addition, experiments were conducted involving the 6-qubit Ising model, working on which caused us to realize how inefficient the classical computer really is at simulating quantum mechanical systems. Our conclusion is that quantum simulation is much less feasible than classical simulation on a classical computer.
|Commitee:||Beyersdorf, Peter, Madura, Thomas|
|School:||San Jose State University|
|School Location:||United States -- California|
|Source:||MAI 81/2(E), Masters Abstracts International|
|Subjects:||Computer science, Physics|
|Keywords:||Ion trap, Quantum algorithms, Quantum computing, Quantum simulation|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be