Abstract
We study discrete-time quantum walks on the complete and bipartite graphs. We show how they can be used to perform searches. The symmetry of these graphs leads to a significant dimensional reduction of the problem.
© 2008 Optical Society of America
PDF ArticleMore Like This
I. Jex, M. Štefaňák, and T. Kiss
QTuC4 International Conference on Quantum Information (QIM) 2008
M. Štefaňák, I. Jex, and T. Kiss
JMB55 International Conference on Quantum Information (QIM) 2008
Fabian Elster, Sonja Barkhofen, Thomas Nitsche, Jaroslav Novotný, Aurél Gábris, Igor Jex, and Christine Silberhorn
FTu4A.6 CLEO: QELS_Fundamental Science (CLEO:FS) 2015