798 research outputs found
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
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
Absorption phenomena in quantum walks
The quantum walk is a unitary analogue to the discrete random walk, and its properties have been increasingly studied since the turn of the millennium. In comparison with the classical random walk, the quantum walk exhibits linear spreading and initial condition dependent asymmetries. As noted early on in the conjecture and subsequent calculation of absorption probabilities in the one dimensional Hadamard walk, the interaction of the quantum walk with an absorbing boundary is fundamentally divergent from classical case. Here, we will survey absorption probabilities for a more general collection of one dimensional quantum walks and extend the method to consider d-dimensional walks in the presence of d-1 dimensional absorbing walls. However, these results are concerned only with local behavior at the boundary in the form of absorption probabilities. The main results of this thesis are concerned with the global behavior of finite quantum walks, which can be described by linear spreading in the short term, modal phenomena in the mid term, and stable distributions in the exceedingly long term. These theorems will be rigorously proved in the one-dimensional case and extrapolated to higher dimensional quantum walks. To this end we introduce QWSim, a new and robust computational engine for displaying finite two dimensional quantum walks
Discrete single-photon quantum walks with tunable decoherence
Quantum walks have a host of applications, ranging from quantum computing to
the simulation of biological systems. We present an intrinsically stable,
deterministic implementation of discrete quantum walks with single photons in
space. The number of optical elements required scales linearly with the number
of steps. We measure walks with up to 6 steps and explore the
quantum-to-classical transition by introducing tunable decoherence. Finally, we
also investigate the effect of absorbing boundaries and show that decoherence
significantly affects the probability of absorption.Comment: Published version, 5 pages, 4 figure
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
Quantum walks on two kinds of two-dimensional models
In this paper, we numerically study quantum walks on two kinds of
two-dimensional graphs: cylindrical strip and Mobius strip. The two kinds of
graphs are typical two-dimensional topological graph. We study the crossing
property of quantum walks on these two models. Also, we study its dependence on
the initial state, size of the model. At the same time, we compare the quantum
walk and classical walk on these two models to discuss the difference of
quantum walk and classical walk
- …