1,644 research outputs found
Hitting time for quantum walks on the hypercube
Hitting times for discrete quantum walks on graphs give an average time
before the walk reaches an ending condition. To be analogous to the hitting
time for a classical walk, the quantum hitting time must involve repeated
measurements as well as unitary evolution. We derive an expression for hitting
time using superoperators, and numerically evaluate it for the discrete walk on
the hypercube. The values found are compared to other analogues of hitting time
suggested in earlier work. The dependence of hitting times on the type of
unitary ``coin'' is examined, and we give an example of an initial state and
coin which gives an infinite hitting time for a quantum walk. Such infinite
hitting times require destructive interference, and are not observed
classically. Finally, we look at distortions of the hypercube, and observe that
a loss of symmetry in the hypercube increases the hitting time. Symmetry seems
to play an important role in both dramatic speed-ups and slow-downs of quantum
walks.Comment: 8 pages in RevTeX format, four figures in EPS forma
Analysis of Absorbing Times of Quantum Walks
Quantum walks are expected to provide useful algorithmic tools for quantum
computation. This paper introduces absorbing probability and time of quantum
walks and gives both numerical simulation results and theoretical analyses on
Hadamard walks on the line and symmetric walks on the hypercube from the
viewpoint of absorbing probability and time.Comment: LaTeX2e, 14 pages, 6 figures, 1 table, figures revised, references
added, to appear in Physical Review
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 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
- …