Decoherence in quantum walks - A review

286Citations
Citations of this article
134Readers
Mendeley users who have this article in their library.

Abstract

The development of quantum walks in the context of quantum computation, as generalisations of random walk techniques, has led rapidly to several new quantum algorithms. These all follow a unitary quantum evolution, apart from the final measurement. Since logical qubits in a quantum computer must be protected from decoherence by error correction, there is no need to consider decoherence at the level of algorithms. Nonetheless, enlarging the range of quantum dynamics to include non-unitary evolution provides a wider range of possibilities for tuning the properties of quantum walks. For example, small amounts of decoherence in a quantum walk on the line can produce more uniform spreading (a top-hat distribution), without losing the quantum speed up. This paper reviews the work on decoherence, and more generally on non-unitary evolution, in quantum walks and suggests what future questions might prove interesting to pursue in this area. © 2007 Cambridge University Press.

Cite

CITATION STYLE

APA

Kendon, V. (2007). Decoherence in quantum walks - A review. Mathematical Structures in Computer Science, 17(6), 1169–1220. https://doi.org/10.1017/S0960129507006354

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free