In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...

Joël De Coninck, François Dunlop, Thierry Huillet Abstract: We consider random walks Xn in Z+, obeying a detailed balance condition, with a weak drift towards the origin when Xn ր ∞. We reconsider the equivalence in law between a random walk bridge and a 1+1 dimensional Solid-On-Solid bridge with a corresponding Hamiltonian. Phase diagrams are discussed in terms of recurrence versus wetting. A ...

Quantum walks (QWs) exhibit different properties compared with classical random (RWs), most notably by linear spreading and localization. In the meantime, that replicate quantum walks, which we refer to as quantum-walk-replicating (QWRWs), have been studied in literature where eventual of QWRW coincide those QWs. However, consider unique attributes QWRWs not fully utilized former studies obtain...