2026-09-18T22:54:10Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/612692022-01-13T07:54:41Zcom_1721.1_7582com_1721.1_7581col_1721.1_131024
Edward Farhi.
Zhan, Bohua
Massachusetts Institute of Technology. Dept. of Physics.
Massachusetts Institute of Technology. Department of Physics
2011-02-23T14:39:17Z
2011-02-23T14:39:17Z
2010
2010
http://hdl.handle.net/1721.1/61269
701926125
Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 61).
In this thesis, I will investigate the running time of quantum algorithms for evaluating boolean functions when the input is promised to satisfy certain conditions. The two quantum algorithms considered in this paper are the quantum walk algorithm for NAND trees given by Farhi and Gutmann [2], and an algorithm for more general boolean formulas based on span programs, given by Reichardt and Spalek [6]. I will show that these algorithms can run much faster on a certain set of inputs, and that there is a super-polynomial separation between the quantum algorithm and the classical lower bound on this problem. I will apply this analysis to quantum walks on decision trees, as described in [3], giving a class of decision trees that can be penetrated quickly by quantum walk but may not be efficiently searchable by classical algorithms.
by Bohua Zhan.
S.B.
61 p.
eng
Massachusetts Institute of Technology
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
Physics.
Evaluation of boolean formulas with restricted inputs
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="eea00ee7-0e10-44cb-b8ff-417321f4faee">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Evaluation of boolean formulas with restricted inputs</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2010</PublicationDate>
<Authors>
<Author>
<DisplayName>Zhan, Bohua</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Physics.</Keyword>
<Abstract>In this thesis, I will investigate the running time of quantum algorithms for evaluating boolean functions when the input is promised to satisfy certain conditions. The two quantum algorithms considered in this paper are the quantum walk algorithm for NAND trees given by Farhi and Gutmann [2], and an algorithm for more general boolean formulas based on span programs, given by Reichardt and Spalek [6]. I will show that these algorithms can run much faster on a certain set of inputs, and that there is a super-polynomial separation between the quantum algorithm and the classical lower bound on this problem. I will apply this analysis to quantum walks on decision trees, as described in [3], giving a class of decision trees that can be penetrated quickly by quantum walk but may not be efficiently searchable by classical algorithms.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>