Quantum computation beyond the circuit model
Author(s)
Jordan, Stephen Paul![Thumbnail](/bitstream/handle/1721.1/45448/318123001-MIT.pdf.jpg?sequence=5&isAllowed=y)
DownloadFull printable version (10.05Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Physics.
Advisor
Edward H. Farhi.
Terms of use
Metadata
Show full item recordAbstract
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other models of quantum computation exist which provide useful alternative frameworks for both discovering new quantum algorithms and devising new physical implementations of quantum computers. In this thesis, I first present necessary background material for a general physics audience and discuss existing models of quantum computation. Then, I present three new results relating to various models of quantum computation: a scheme for improving the intrinsic fault tolerance of adiabatic quantum computers using quantum error detecting codes, a proof that a certain problem of estimating Jones polynomials is complete for the one clean qubit complexity class, and a generalization of perturbative gadgets which allows k-body interactions to be directly simulated using 2-body interactions. Lastly, I discuss general principles regarding quantum computation that I learned in the course of my research, and using these principles I propose directions for future research.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 2008. Includes bibliographical references (p. 133-144).
Date issued
2008Department
Massachusetts Institute of Technology. Department of PhysicsPublisher
Massachusetts Institute of Technology
Keywords
Physics.