Logo

Quantum Walks: A Comprehensive Review

Small book cover: Quantum Walks: A Comprehensive Review

Quantum Walks: A Comprehensive Review
by

Publisher: arXiv
Number of pages: 88

Description:
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. 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.

Home page url

Download or read it online for free here:
Download link
(1.5MB, PDF)

Similar books

Book cover: Quantum Information: primitive notions and quantum correlationsQuantum Information: primitive notions and quantum correlations
by - arXiv
I rapidly review the basic notions of quantum physics and many primitives of quantum information. The second part is devoted to a detailed introduction to the topic of quantum correlations, covering the evidence for failure of alternative theories...
(8692 views)
Book cover: An Introduction to Quantum Computing for Non-PhysicistsAn Introduction to Quantum Computing for Non-Physicists
by - arXiv
This paper will guide computer scientists and other non-physicists through the barriers that separate quantum computing from conventional computing. We introduce basics of quantum mechanics to explain where the power of quantum computers comes from.
(12224 views)
Book cover: Quantum CryptographyQuantum Cryptography
by - arXiv
Quantum cryptography could well be the first application of quantum mechanics at the individual quanta level. The fast progress in theory and experiments over the recent years are reviewed, with emphasis on open questions and technological issues.
(17184 views)
Book cover: Quantum Computing Since DemocritusQuantum Computing Since Democritus
by - University of Waterloo
We'll start out with various scientific problems that predate quantum computing: for example, the measurement problem, P versus NP, the existence of secure cryptography, the Humean problem of induction, or the possibility of closed timelike curves.
(10799 views)