Return to search

QUANTUM SEARCH ON RANDOM GRAPHS

This project was motivated by the following question: what information do the properties of a random graph contain about the performance of a quantum search acting on it? To investigate this problem, we define a notion of search time to quantify the behavior of a quantum search, and find strong evidence of a relation between its distribution and the model of random graph on which the search was performed. Surprisingly, we also find strong evidence that the return time of a classical random walk initialized at the marked vertex is closely related to its search time, and that the distribution of degrees over the graph vertices may play a significant role in this relation. / Mathematics

Identiferoai:union.ndltd.org:TEMPLE/oai:scholarshare.temple.edu:20.500.12613/6489
Date January 2021
CreatorsAhn, Alexander Song
ContributorsYang, Wei-Shih, 1954-, Futer, David, Queisser, Gillian, Shi, Justin Y.
PublisherTemple University. Libraries
Source SetsTemple University
LanguageEnglish
Detected LanguageEnglish
TypeThesis/Dissertation, Text
Format70 pages
RightsIN COPYRIGHT- This Rights Statement can be used for an Item that is in copyright. Using this statement implies that the organization making this Item available has determined that the Item is in copyright and either is the rights-holder, has obtained permission from the rights-holder(s) to make their Work(s) available, or makes the Item available under an exception or limitation to copyright (including Fair Use) that entitles it to make the Item available., http://rightsstatements.org/vocab/InC/1.0/
Relationhttp://dx.doi.org/10.34944/dspace/6471, Theses and Dissertations

Page generated in 0.0017 seconds