# A method for calculating only part of an eigenstate and

an application to quantum walks

## Seth Cottrell, New York City Technical College (CUNY)

## March 8, 2016

In this talk I'll briefly introduce the key differences between random
walks on a graph and quantum walks on a graph. We'll then look at a
quantum search algorithm and talk about a new technique for calculating
part (but not all) of an eigenstate and then investigate how this
technique can be applied. This talk will be aimed at a fairly general
audience, requiring only a little graph theory and linear algebra.
You definitely won't need to understand quantum theory.