Abstract
Quantum walks are a fundamental tool in the study of quantum information, bridging the gap between quantum computation and modelling complex systems. In this thesis, we present a software package for simulation of multiparticle continuous-time quantum walks (CTQWs) using high performance computation, and detail a method of systematic dimensionalty reduction for fermionic CTQWs. We then consider CTQW applications; proving that the single particle CTQW is unsuited for determining graph isomorphism, and proposing a CTQW-based network centrality algorithm. This algorithm is utilized in the first successful physical quantum centrality implementation. Finally, we extend our centrality algorithm to PT-symmetric directed graphs.
Original language | English |
---|---|
Qualification | Doctorate |
Awarding Institution |
|
Supervisors/Advisors |
|
Award date | 1 Aug 2017 |
DOIs | |
Publication status | Unpublished - 2017 |