International audienceA new model of quantum random walks is introduced, on lattices as well as on nite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogue of classical Markov chains. We explore the \quantum trajectory" point of view on these quantum random walks, that is, we show that measuring the position of the particle after each time-step gives rise to a classical Markov chain, on the lattice times the state space of the particle. This quantum trajectory is a simulation of the master equation of the quantum random walk. The physical pertinence of such quantum random walks and the way they can be concretely realized is discussed. Connections and di erences with ...
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we ar...
International audienceWe consider open quantum walks on a graph, and consider the random variables d...
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses q...
International audienceA new model of quantum random walks is introduced, on lattices as well as on n...
International audienceOpen Quantum Random Walks are the exact quantum generalization of Markov chain...
In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum rando...
For a continuous-time quantum walk on a line the variance of the position observable grows quadratic...
Abstract: Classical Random walks and their behaviour have become a major part of applications in sci...
The focus of this project is continuous time quantum walks (QW) on finite graphs. QW are important b...
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of...
Open Quantum Random Walks, as developed in [2], are a quantum generalization of Markov chains on fin...
The development of quantum algorithms based on quantum versions of random walks is placed in the con...
International audienceOpen quantum walks (OQW) are formulated as quantum Markov chains on graphs. It...
Random walks have been applied in a many different fields for a long time. More recently, classical ...
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for...
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we ar...
International audienceWe consider open quantum walks on a graph, and consider the random variables d...
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses q...
International audienceA new model of quantum random walks is introduced, on lattices as well as on n...
International audienceOpen Quantum Random Walks are the exact quantum generalization of Markov chain...
In this paper we construct (nonhomogeneous) quantum Markov chains associated with open quantum rando...
For a continuous-time quantum walk on a line the variance of the position observable grows quadratic...
Abstract: Classical Random walks and their behaviour have become a major part of applications in sci...
The focus of this project is continuous time quantum walks (QW) on finite graphs. QW are important b...
Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of...
Open Quantum Random Walks, as developed in [2], are a quantum generalization of Markov chains on fin...
The development of quantum algorithms based on quantum versions of random walks is placed in the con...
International audienceOpen quantum walks (OQW) are formulated as quantum Markov chains on graphs. It...
Random walks have been applied in a many different fields for a long time. More recently, classical ...
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for...
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we ar...
International audienceWe consider open quantum walks on a graph, and consider the random variables d...
We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses q...