poster: Quantum walks on embedded hypercubes
speaker: Adi Makmal (University of Innsbruck, Austria )abstract: It has been proved by Kempe (2003) that discrete quantum walks on the hypercube (HC) hit exponentially faster than the classical analog. The same was also observed numerically by Krovi and Brun (2006) for a slightly different property, namely, the expected hitting time. Yet, to what extent this striking result survives in more general graphs, is to date an open question. Here we tackle this question by studying the expected hitting time for quantum walks on HCs that are embedded into larger symmetric structures. By performing numerical simulations of the discrete quantum walk and deriving a general expression for the classical hitting time, we observe an exponentially increasing gap between the expected classical and quantum hitting times, not only for walks on the bare HC, but also for a large family of embedded HCs. This suggests that the quantum speedup is stable with respect to such embeddings.
<< Go back