Technical analysis of the Resource-efficient Quantum Walkers Quantum Random Access Memory
This article formalizes the routing, message-copy, and walker retrieval phases for both variants and shows how the short-range approach improves the architecture's feasibility for near-term experimental implementation, and confirms that the short-range approach achieves the optimal $\mathcal{O}(n+m)$ circuit depth.