Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants optimization. Here we introduce the semiclassical in discrete time, which algorithms that combines and quantum dynamics. Specifically, a walk can be understood where transition matrix encodes evolution. We have applied this algorithm to Szegedy’s walk, any arbitrary weighted grap...