Topic

# Quantum walk

About: Quantum walk is a research topic. Over the lifetime, 3632 publications have been published within this topic receiving 88894 citations. The topic is also known as: quantum random walk.

##### Papers published on a yearly basis

##### Papers

More filters

[...]

01 Jan 2001

TL;DR: Estimates on the important parameters of access time, commute time, cover time and mixing time are discussed and recent algorithmic applications of random walks are sketched, in particular to the problem of sampling.

Abstract: Various aspects of the theory of random walks on graphs are surveyed In particular, estimates on the important parameters of access time, commute time, cover time and mixing time are discussed Connections with the eigenvalues of graphs and with electrical networks, and the use of these connections in the study of random walks is described We also sketch recent algorithmic applications of random walks, in particular to the problem of sampling

1,548 citations

••

[...]

TL;DR: This article will introduce quantum random walks, review some of their properties and outline their striking differences to classical walks, introducing some of the main concepts and language of present day quantum information science in this context.

Abstract: This article aims to provide an introductory survey on quantum random walks. Starting from a physical effect to illustrate the main ideas we will introduce quantum random walks, review some of their properties and outline their striking differences to classical walks. We will touch upon both physical effects and computer science applications, introducing some of the main concepts and language of present day quantum information science in this context. We will mention recent developments in this new area and outline some open questions.

1,459 citations

••

[...]

TL;DR: The concept of quantum random walk is introduced, and it is shown that due to quantum interference effects the average path length can be much larger than the maximum allowed path in the corresponding classical random walk.

Abstract: We introduce the concept of quantum random walk, and show that due to quantum interference effects the average path length can be much larger than the maximum allowed path in the corresponding classical random walk A quantum-optics application is described

1,304 citations

••

[...]

TL;DR: A theoretical framework for studying the role of quantum interference effects in energy transfer dynamics of molecular arrays interacting with a thermal bath within the Lindblad formalism is developed and an effective interplay between the free Hamiltonian evolution and the thermal fluctuations in the environment is demonstrated.

Abstract: Energy transfer within photosynthetic systems can display quantum effects such as delocalized excitonic transport. Recently, direct evidence of long-lived coherence has been experimentally demonstrated for the dynamics of the Fenna-Matthews-Olson (FMO) protein complex [Engel et al., Nature (London) 446, 782 (2007)]. However, the relevance of quantum dynamical processes to the exciton transfer efficiency is to a large extent unknown. Here, we develop a theoretical framework for studying the role of quantum interference effects in energy transfer dynamics of molecular arrays interacting with a thermal bath within the Lindblad formalism. To this end, we generalize continuous-time quantum walks to nonunitary and temperature-dependent dynamics in Liouville space derived from a microscopic Hamiltonian. Different physical effects of coherence and decoherence processes are explored via a universal measure for the energy transfer efficiency and its susceptibility. In particular, we demonstrate that for the FMO complex, an effective interplay between the free Hamiltonian evolution and the thermal fluctuations in the environment leads to a substantial increase in energy transfer efficiency from about 70% to 99%.

1,058 citations

••

[...]

TL;DR: This work devise a quantum-mechanical algorithm that evolves a state, initially localized at the root, through the tree, and proves that if the classical strategy succeeds in reaching level $n$ in time polynomial in $n,$ then so does the quantum algorithm.

Abstract: Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node $n$ level from the root. We devise a quantum-mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level $n$ in time polynomial in $n,$ then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in $n,$ but for which the quantum algorithm succeeds in polynomial time. The examples we have so far, however, could also be solved in polynomial time by different classical algorithms.

980 citations