249 research outputs found
The effect of large-decoherence on mixing-time in Continuous-time quantum walks on long-range interacting cycles
In this paper, we consider decoherence in continuous-time quantum walks on
long-range interacting cycles (LRICs), which are the extensions of the cycle
graphs. For this purpose, we use Gurvitz's model and assume that every node is
monitored by the corresponding point contact induced the decoherence process.
Then, we focus on large rates of decoherence and calculate the probability
distribution analytically and obtain the lower and upper bounds of the mixing
time. Our results prove that the mixing time is proportional to the rate of
decoherence and the inverse of the distance parameter (\emph{m}) squared.
This shows that the mixing time decreases with increasing the range of
interaction. Also, what we obtain for \emph{m}=0 is in agreement with
Fedichkin, Solenov and Tamon's results \cite{FST} for cycle, and see that the
mixing time of CTQWs on cycle improves with adding interacting edges.Comment: 16 Pages, 2 Figure
Decoherence in quantum walks - a review
The development of quantum walks in the context of quantum computation, as
generalisations of random walk techniques, led rapidly to several new quantum
algorithms. These all follow 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.Comment: 52 pages, invited review, v2 & v3 updates to include significant work
since first posted and corrections from comments received; some non-trivial
typos fixed. Comments now limited to changes that can be applied at proof
stag
Decoherence can be useful in quantum walks
We present a study of the effects of decoherence in the operation of a
discrete quantum walk on a line, cycle and hypercube. We find high sensitivity
to decoherence, increasing with the number of steps in the walk, as the
particle is becoming more delocalised with each step. However, the effect of a
small amount of decoherence is to enhance the properties of the quantum walk
that are desirable for the development of quantum algorithms. Specifically, we
observe a highly uniform distribution on the line, a very fast mixing time on
the cycle, and more reliable hitting times across the hypercube.Comment: (Imperial College London) 6 (+epsilon) pages, 6 embedded eps figures,
RevTex4. v2 minor changes to correct typos and refs, submitted version. v3
expanded into article format, extra figure, updated refs, Note on "glued
trees" adde
Decoherence vs entanglement in coined quantum walks
Quantum versions of random walks on the line and cycle show a quadratic
improvement in their spreading rate and mixing times respectively. The addition
of decoherence to the quantum walk produces a more uniform distribution on the
line, and even faster mixing on the cycle by removing the need for
time-averaging to obtain a uniform distribution. We calculate numerically the
entanglement between the coin and the position of the quantum walker and show
that the optimal decoherence rates are such that all the entanglement is just
removed by the time the final measurement is made.Comment: 11 pages, 6 embedded eps figures; v2 improved layout and discussio
Quantum speedup of classical mixing processes
Most approximation algorithms for #P-complete problems (e.g., evaluating the
permanent of a matrix or the volume of a polytope) work by reduction to the
problem of approximate sampling from a distribution over a large set
. This problem is solved using the {\em Markov chain Monte Carlo} method: a
sparse, reversible Markov chain on with stationary distribution
is run to near equilibrium. The running time of this random walk algorithm, the
so-called {\em mixing time} of , is as shown
by Aldous, where is the spectral gap of and is the minimum
value of . A natural question is whether a speedup of this classical
method to , the diameter of the graph
underlying , is possible using {\em quantum walks}.
We provide evidence for this possibility using quantum walks that {\em
decohere} under repeated randomized measurements. We show: (a) decoherent
quantum walks always mix, just like their classical counterparts, (b) the
mixing time is a robust quantity, essentially invariant under any smooth form
of decoherence, and (c) the mixing time of the decoherent quantum walk on a
periodic lattice is , which is indeed
and is asymptotically no worse than the
diameter of (the obvious lower bound) up to at most a logarithmic
factor.Comment: 13 pages; v2 revised several part
Quantum walks: a comprehensive review
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.Comment: Paper accepted for publication in Quantum Information Processing
Journa
Decoherence in Discrete Quantum Walks
We present an introduction to coined quantum walks on regular graphs, which
have been developed in the past few years as an alternative to quantum Fourier
transforms for underpinning algorithms for quantum computation. We then
describe our results on the effects of decoherence on these quantum walks on a
line, cycle and hypercube. We find high sensitivity to decoherence, increasing
with the number of steps in the walk, as the particle is becoming more
delocalised with each step. However, the effect of a small amount of
decoherence can be to enhance the properties of the quantum walk that are
desirable for the development of quantum algorithms, such as fast mixing times
to uniform distributions.Comment: 15 pages, Springer LNP latex style, submitted to Proceedings of DICE
200
- …