Discretization of continuous-time quantum walks via the staggered model with Hamiltonians

@article{Coutinho2017DiscretizationOC,
  title={Discretization of continuous-time quantum walks via the staggered model with Hamiltonians},
  author={Gabriel Coutinho and Renato Portugal},
  journal={Natural Computing},
  year={2017},
  volume={18},
  pages={403-409}
}
We characterize a close connection between the continuous-time quantum-walk model and a discrete-time quantum-walk version, based on the staggered model with Hamiltonians in a class of Cayley graphs, which can be considered as a discretization of continuous-time quantum walks. This connection provides examples of perfect state transfer and instantaneous uniform mixing in the staggered model. On the other hand, we provide some more examples of perfect state transfer and instantaneous uniform… 

Simplifying continuous-time quantum walks on dynamic graphs

Six scenarios under which a dynamic graph can be simplified are given, and they exploit commuting graphs, identical graphs, perfect state transfer, complementary graphs, isolated vertices, and uniform mixing on the hypercube.

The role of tessellation intersection in staggered quantum walks

The staggered quantum walk (SQW) model is defined by partitioning the graph into cliques, which are called polygons. We analyze the role that the size of the polygon intersection plays on the