Cumulative effects in quantum algorithms and quantum process tomography

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2014.

Bibliographic Details
Main Author: Hess, Shelby Kimmel
Other Authors: Edward Farhi.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2016
Subjects:
Online Access:http://hdl.handle.net/1721.1/100678
_version_ 1811082823927332864
author Hess, Shelby Kimmel
author2 Edward Farhi.
author_facet Edward Farhi.
Hess, Shelby Kimmel
author_sort Hess, Shelby Kimmel
collection MIT
description Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2014.
first_indexed 2024-09-23T12:09:37Z
format Thesis
id mit-1721.1/100678
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T12:09:37Z
publishDate 2016
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/1006782019-04-12T21:36:57Z Cumulative effects in quantum algorithms and quantum process tomography Hess, Shelby Kimmel Edward Farhi. Massachusetts Institute of Technology. Department of Physics. Massachusetts Institute of Technology. Department of Physics. Physics. Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2014. Cataloged from PDF version of thesis. Includes bibliographical references (pages 129-134). This thesis comprises three results on quantum algorithms and quantum process tomography. In the first section, I create a tool that uses properties of the quantum general adversary bound to upper bound the query complexity of Boolean functions. Using this tool I prove the existence of O(1)-query quantum algorithms for a set of functions called FAULT TREES. To obtain these results, I combine previously known properties of the adversary bound in a new way, as well as extend an existing proof of a composition property of the adversary bound. The second result is a method for characterizing errors in a quantum computer. Many current tomography procedures give inaccurate estimates because they do not have adequate methods for handling noise associated with auxiliary operations. The procedure described here provides two ways of dealing with this noise: estimating the noise independently so its effect can be completely understood, and analyzing the worst case effect of this noise, which gives better bounds on standard estimates. The final section describes a quantum analogue of a classical local search algorithm for Classical k-SAT. I show that for a restricted version of Quantum 2-SAT, this quantum algorithm succeeds in polynomial time. While the quantum algorithm ultimately performs similarly to the classical algorithm, quantum effects, like the observer effect, make the analysis more challenging. by Shelby Kimmel. Ph. D. 2016-01-04T20:52:37Z 2016-01-04T20:52:37Z 2014 2014 Thesis http://hdl.handle.net/1721.1/100678 932610000 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 134 pages application/pdf Massachusetts Institute of Technology
spellingShingle Physics.
Hess, Shelby Kimmel
Cumulative effects in quantum algorithms and quantum process tomography
title Cumulative effects in quantum algorithms and quantum process tomography
title_full Cumulative effects in quantum algorithms and quantum process tomography
title_fullStr Cumulative effects in quantum algorithms and quantum process tomography
title_full_unstemmed Cumulative effects in quantum algorithms and quantum process tomography
title_short Cumulative effects in quantum algorithms and quantum process tomography
title_sort cumulative effects in quantum algorithms and quantum process tomography
topic Physics.
url http://hdl.handle.net/1721.1/100678
work_keys_str_mv AT hessshelbykimmel cumulativeeffectsinquantumalgorithmsandquantumprocesstomography