2026-09-20T06:52:25Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/327502022-01-13T07:54:41Zcom_1721.1_7582com_1721.1_7581col_1721.1_131024
Edward Farhi.
Zhao, Fen, 1982-
Massachusetts Institute of Technology. Dept. of Physics.
Massachusetts Institute of Technology. Department of Physics
2006-05-15T20:27:20Z
2006-05-15T20:27:20Z
2004
2004
http://hdl.handle.net/1721.1/32750
56747648
Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2004.
Includes bibliographical references (p. 47-48).
In this thesis, we present a quantum walk algorithm for spatial search of a periodic lattice. Our algorithm is a variation of the Childs and Goldstone algorithm for spatial search, but begins in a randomly selected local initial state rather than a uniformly delocalized one. We analytically calculate the running time of our algorithm on the complete graph and find it to be O([square root]N). We reduce the analysis of our algorithm to that of the Childs and Goldstone algorithm by comparing the eigenvalue conditions of the Hamiltonians used in the two algorithms. We numerically show that the two Hamiltonians have similar eigenvalue conditions when the starting state is a certain extremal vertex of the lattice. We also study the behavior of the algorithm when we move the start state away from this extremal vertex. Finally, we numerically analyze the behavior of our algorithm on 5 and 4 dimensional lattices. In the 5 dimensional case, we appear to be able to achieve a O([square root]N) running time. In the 4 dimensional case, previous analysis indicates there may be additional factors of logc N in the running time of our algorithm. Numerically, we are not able to determine whether this logarithmic factor exists. However, the numerical evidence does indicate that the running time of our algorithm is O([square root]N), up to some factor of logc N.
by Fen Zhao.
S.B.
48 p.
1471941 bytes
1472379 bytes
application/pdf
application/pdf
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.
Spatial search by quantum walk with a randomized local start state
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="c1695c03-358f-4a72-8884-7f83163676ae">
<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>Spatial search by quantum walk with a randomized local start state</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2004</PublicationDate>
<Authors>
<Author>
<DisplayName>Zhao, Fen, 1982-</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, we present a quantum walk algorithm for spatial search of a periodic lattice. Our algorithm is a variation of the Childs and Goldstone algorithm for spatial search, but begins in a randomly selected local initial state rather than a uniformly delocalized one. We analytically calculate the running time of our algorithm on the complete graph and find it to be O([square root]N). We reduce the analysis of our algorithm to that of the Childs and Goldstone algorithm by comparing the eigenvalue conditions of the Hamiltonians used in the two algorithms. We numerically show that the two Hamiltonians have similar eigenvalue conditions when the starting state is a certain extremal vertex of the lattice. We also study the behavior of the algorithm when we move the start state away from this extremal vertex. Finally, we numerically analyze the behavior of our algorithm on 5 and 4 dimensional lattices. In the 5 dimensional case, we appear to be able to achieve a O([square root]N) running time. In the 4 dimensional case, previous analysis indicates there may be additional factors of logc N in the running time of our algorithm. Numerically, we are not able to determine whether this logarithmic factor exists. However, the numerical evidence does indicate that the running time of our algorithm is O([square root]N), up to some factor of logc N.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>