Order from chaos in quantum walks on cyclic graphs

It has been shown classically that combining two chaotic random walks can yield an ordered(periodic) walk. Our aim in this paper is to find a quantum analog for this rather counter-intuitive result. We study chaotic and periodic nature of cyclic quantum walks and focus on an unique situation wherein a periodic quantum walk on $3-$cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. Our results will be relevant in quantum cryptography and quantum chaos control.