1,041 research outputs found
Quantum walks on Cayley graphs
We address the problem of the construction of quantum walks on Cayley graphs.
Our main motivation is the relationship between quantum algorithms and quantum
walks. In particular, we discuss the choice of the dimension of the local
Hilbert space and consider various classes of graphs on which the structure of
quantum walks may differ. We completely characterise quantum walks on free
groups and present partial results on more general cases. Some examples are
given, including a family of quantum walks on the hypercube involving a
Clifford Algebra.Comment: J. Phys. A (accepted for publication
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
Bounds for mixing time of quantum walks on finite graphs
Several inequalities are proved for the mixing time of discrete-time quantum
walks on finite graphs. The mixing time is defined differently than in
Aharonov, Ambainis, Kempe and Vazirani (2001) and it is found that for
particular examples of walks on a cycle, a hypercube and a complete graph,
quantum walks provide no speed-up in mixing over the classical counterparts. In
addition, non-unitary quantum walks (i.e., walks with decoherence) are
considered and a criterion for their convergence to the unique stationary
distribution is derived.Comment: This is the journal version (except formatting); it is a significant
revision of the previous version, in particular, it contains a new result
about the convergence of quantum walks with decoherence; 16 page
Decoherence in Quantum Walks on the Hypercube
We study a natural notion of decoherence on quantum random walks over the
hypercube. We prove that in this model there is a decoherence threshold beneath
which the essential properties of the hypercubic quantum walk, such as linear
mixing times, are preserved. Beyond the threshold, we prove that the walks
behave like their classical counterparts.Comment: 7 pages, 3 figures; v2:corrected typos in references; v3:clarified
section 2.1; v4:added references, expanded introduction; v5: final journal
versio
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
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
- …