California State University San Bernardino
Department of Computer Science and Engineering
Masters Project Presentation

WHAT:  Implementing Dijkstra's Pathfind Using Quantum Algorithms
WHO:   Shing-Yung "Sean" Lo
WHEN:  May 21 (Thursday), 2 PM
WHERE: JB-391

ADVISOR: Dr. Ernesto Gomez
COMMITTEE MEMBERS: Dr. Keith Schubert and Dr. Haiyan Qiao

ABSTRACT:
    With the recent rise in interest over quantum computing, several quantum
algorithms have gained prominence for their radical approaches for solving
traditional problems. This thesis explores the viability of implementing Grover's search
(a quan- tum algorithm) to implement Dijkstra's algorithm. The quantum algorithm
will be used to replace the find-minimum function. However, in order for this
to be practical, the quantum algorithm would have to return a position. In
addition, it would also have to be able to search for multiple answers within
the search space. This problem is solved by extending Grover's search,
by performing the oracle onto the values within the register that exists in
the search space, then performing the inversion about mean on the entire
register which contains both the value and position.