<p> In previous papers about searches on star graphs several patterns have been made apparent; the speed up only occurs when graphs are ''tuned'' so that their time step operators have degenerate eigenvalues, and only certain initial states are effective. More than that, the searches are never faster than order square root of N time. In this thesis the problem is defined rigorously, the causes for all of these patterns are identified, sufficient and necessary conditions for quadratic-speed searches for any connected subgraph are demonstrated, the tolerance of these conditions is investigated, and it is shown that (unfortunately) we can do no better than order square root of N time. Along the way, a useful formalism is established that may be useful in future work involving highly symmetric graphs.</p><p> The tools and techniques so derived are then used to demonstrate that tree graphs can be used for the computation of Boolean functions. The philosophy of Farhi's work on the continuous-time NAND tree is applied to a discrete-time walk with any (AND, OR, NAND, or NOR) gate at each vertex. Tentative results show that the vast majority of possible Boolean functions on <i>N</i> bits can be calculated in order square root of N time.</p>
| Identifer | oai:union.ndltd.org:PROQUEST/oai:pqdtoai.proquest.com:3665129 |
| Date | 19 December 2014 |
| Creators | Cottrell, Seth S. |
| Publisher | New York University |
| Source Sets | ProQuest.com |
| Language | English |
| Detected Language | English |
| Type | thesis |
Page generated in 0.0012 seconds