13,861 research outputs found
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
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
Quantum walks on general graphs
Quantum walks, both discrete (coined) and continuous time, on a general graph
of N vertices with undirected edges are reviewed in some detail. The resource
requirements for implementing a quantum walk as a program on a quantum computer
are compared and found to be very similar for both discrete and continuous time
walks. The role of the oracle, and how it changes if more prior information
about the graph is available, is also discussed.Comment: 8 pages, v2: substantial rewrite improves clarity, corrects errors
and omissions; v3: removes major error in final section and integrates
remainder into other sections, figures remove
Quantum Walks with Entangled Coins
We present a mathematical formalism for the description of unrestricted
quantum walks with entangled coins and one walker. The numerical behaviour of
such walks is examined when using a Bell state as the initial coin state, two
different coin operators, two different shift operators, and one walker. We
compare and contrast the performance of these quantum walks with that of a
classical random walk consisting of one walker and two maximally correlated
coins as well as quantum walks with coins sharing different degrees of
entanglement.
We illustrate that the behaviour of our walk with entangled coins can be very
different in comparison to the usual quantum walk with a single coin. We also
demonstrate that simply by changing the shift operator, we can generate widely
different distributions. We also compare the behaviour of quantum walks with
maximally entangled coins with that of quantum walks with non-entangled coins.
Finally, we show that the use of different shift operators on 2 and 3 qubit
coins leads to different position probability distributions in 1 and 2
dimensional graphs.Comment: Two new sections and several changes from referees' comments. 12
pages and 12 (colour) figure
Control Theoretical Expression of Quantum Systems And Lower Bound of Finite Horizon Quantum Algorithms
We provide a control theoretical method for a computational lower bound of quantum algorithms based on quantum walks of a finite time horizon. It is shown that given a quantum network, there exists a control theoretical expression of the quantum system and the transition probability of the quantum walk is related to a norm of the associated transfer function
- …