Quantum walks: a comprehensive review

Abstract: Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of exciting open problems for physicists, computer scientists, mathematicians and engineers. In this paper we review theoretical advances on the foundations of both discrete- and continuous-time quantum walks, together with the role that randomness plays in quantum walks, the connections between the mathematical models of coined discrete quantum walks and continuous quantum walks, the quantumness of quantum walks, a summary of papers published on discrete quantum walks and entanglement as well as a succinct review of experimental proposals and realizations of discrete-time quantum walks. Furthermore, we have reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks.

• The paper establishes quantum walks as a universal model of quantum computation through comprehensive theoretical analyses.
• It details both discrete-time and continuous-time models, emphasizing quadratic and exponential speedups in algorithmic applications.
• The review highlights experimental implementations in optical systems and trapped ions, underlining practical advances in quantum technologies.

Comprehensive Review of Quantum Walks

Introduction

The paper "Quantum walks: a comprehensive review" authored by Salvador E. Venegas-Andraca provides an exhaustive examination of quantum walks, the quantum mechanical equivalent of classical random walks. The paper discusses both discrete- and continuous-time quantum walks and their significance as foundational elements for quantum algorithms, as well as their role in the broader scope of quantum computation as a universal model. The review encapsulates the theoretical advancements and discusses various quantum walk-based algorithms, emphasizing their computational universality.

Fundamentals of Quantum Walks

The review delineates the foundational aspects of quantum walks, distinguishing between discrete and continuous models. In discrete-time quantum walks, a particle resides in a superposition of positions, with its state evolving via operations mediated by a quantum coin. The discussion includes technical analyses of the Hadamard walk, highlighting its superior variance compared to classical random walks—a quadratic speedup critical in computational contexts. Continuous-time walks, on the other hand, are described via Hamiltonians that govern the walker’s evolution without explicit time steps, offering alternative algorithmic solutions.

Quantum Walk-Based Algorithms

Quantum walks are posited as powerful tools in algorithm development. The paper reviews quantum algorithms that outperform classical counterparts, particularly in search problems. The discrete-time quantum walk algorithms achieve notable speedup in unordered search and element distinctness problems. Continuous-time quantum walks demonstrate exponential speedup in traversing structured graph problems, undeterred by classical constraints. These quantum walk algorithms leverage interference and entanglement—a testament to the quantum nature underlying their computational advantages.

Computational Universality and Theoretical Implications

A seminal contribution discussed is the establishment of quantum walks as a universal model of quantum computation, equating their computational power to that of other quantum computing paradigms like quantum circuits. This universality establishes quantum walks not just as algorithmic tools but as a potential framework for future quantum computers, offering insights into their implementation and scalability.

Quantum Walks and Randomness

The paper addresses the interplay between quantum walks and randomness, clarifying that randomness in quantum walks primarily arises from measurements and decoherence rather than from the deterministic quantum mechanical evolution. This understanding is crucial for developing quantum algorithms that harness such randomness without undermining computational accuracy.

Experimental Realizations

The paper also touches upon experimental realizations, highlighting implementations using optical systems and trapped ions. These realizations underline the potential of quantum walks not only in abstract computation but in tangible physical systems, paving the way for advances in quantum technologies.

Conclusion

Venegas-Andraca's review of quantum walks serves as a pivotal reference in the field, offering a comprehensive synthesis of theoretical advancements and practical applications. The establishment of computational universality and the exploration of quantum walk properties begin to shape a nuanced understanding of quantum algorithms and their feasibility, setting the stage for further research in quantum information processing systems.

In summary, the paper provides a critical analysis and synthesis of quantum walks, establishing their relevance in quantum computing and their potential as universal computational models. It outlines the theoretical groundwork and showcases how adapting properties of quantum mechanics can revolutionize computational paradigms. This review is indispensable for researchers aiming to leverage quantum walks in advancing both theoretical insights and practical implementations in quantum computation.