Review on Quantum Walk Computing: Theory, Implementation, and Application
Xiaogang Qiang, Shixin Ma, and Haijing Song

TL;DR
This review comprehensively covers quantum walk theories, implementations, and applications, highlighting their potential for advancing quantum computing beyond classical methods, especially in the noisy intermediate-scale quantum era.
Contribution
It provides a thorough summary of quantum walk models, recent implementation advances, and diverse applications, emphasizing their role in practical quantum computing development.
Findings
Quantum walks enable universal quantum computation.
Recent implementations demonstrate practical feasibility.
Quantum walk applications span multiple fields.
Abstract
Classical random walk formalism shows a significant role across a wide range of applications. As its quantum counterpart, the quantum walk is proposed as an important theoretical model for quantum computing. By exploiting the quantum effects such as superposition, interference and entanglement, quantum walks and their variety have been extensively studied for achieving beyond classical computing power, and they have been broadly used in designing quantum algorithms in fields ranging from algebraic and optimization problems, graph and network analysis, to quantum Hamiltonian and biochemical process simulations, and even further quantum walk models have proven their capabilities for universal quantum computation. Compared to the conventional quantum circuit models, quantum walks show a feasible path for implementing application-specific quantum computing in particularly the noisy…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCloud Computing and Resource Management · Quantum Computing Algorithms and Architecture
