Quantum walks driven by many coins

@article{Brun2003QuantumWD,
  title={Quantum walks driven by many coins},
  author={T. Brun and H. Carteret and A. Ambainis},
  journal={Physical Review A},
  year={2003},
  volume={67},
  pages={052317}
}
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple quantum “coins” in order to diminish the effects of interference between paths. We find solutions to this system in terms of the single coin random walk, and compare the asymptotic limit of these solutions to numerical simulations. We find exact analytical… Expand

Figures from this paper

Quantum random walks with decoherent coins
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walkExpand
Quantum walks with random phase shifts
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases.Expand
Asymptotic distributions of quantum walks on the line with two entangled coins
  • C. Liu
  • Physics, Computer Science
  • Quantum Inf. Process.
  • 2012
TLDR
It is shown that the weak limit for the present quantum walks can be of the form in the basic scenario of quantum walks on the line, for certain initial states of the walk and certain values of the coin parameter. Expand
Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations
TLDR
This paper analyze the long-time behavior of a particular class of decoherent quantum walks, which was only studied at the level of numerical simulations before, and yields an explicit expression for the covariance matrix of the asymptotic Gaussian in terms of the randomness parameters. Expand
Two Quantum Coins Sharing a Walker
For classical random walks, changing or not changing coins makes a trivial influence on the random-walk behaviors. In this paper, we investigate the quantum walk where a walker’s movement isExpand
Asymptotic evolution of quantum walks with random coin
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitaryExpand
Properties of long quantum walks in one and two dimensions
  • Hao Luo, P. Xue
  • Physics, Computer Science
  • Quantum Inf. Process.
  • 2015
TLDR
This work performs a detailed numerical study of discrete-time quantum walks, characterized the properties of both walks, demonstrating maximal speed-up and emerging semi-classical behavior in the maximally entangled QW. Expand
Discrete-time quantum walks on one-dimensional lattices
Abstract. In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size ofExpand
Quantum walks: Decoherence and coin-flipping games
We investigate the global chirality distribution of the quantum walk on the line when decoherence is introduced either through simultaneous measurements of the chirality and particle position, or asExpand
LIMIT THEOREMS FOR QUANTUM WALKS DRIVEN BY MANY COINS
We obtain some rigorous results on limit theorems for quantum walks driven by many coins introduced by Brun et al. in the long time limit. The results imply that whether the behavior of a particle isExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 43 REFERENCES
Quantum to classical transition for random walks.
TLDR
The position variance is used as an indicator of classical behavior and it is seen that the multicoin walk retains the "quantum" quadratic growth of the variance except in the limit of a new coin for every step, while the walk with decoherence exhibits "classical" linear growth ofThe variance even for weakDecoherence. Expand
Quantum Random Walks in One Dimension
  • N. Konno
  • Physics, Computer Science
  • Quantum Inf. Process.
  • 2002
TLDR
The results show that the behavior of quantum random walk is striking different from that of the classical ramdom walk. Expand
One-dimensional quantum walks with absorbing boundaries
TLDR
This paper presents several new results for the absorption probabilities in systems with both one and two absorbing walls for the one-dimensional case and outlines the solution of the absorption probability problem of a (D-1)-dimensional wall in a D-dimensional space. Expand
Quantum Walks on the Hypercube
TLDR
Two quantum walks on the n-dimensional hypercube are studied, one in discrete time and one in continuous time, showing that the instantaneous mixing time is (π/4)n steps, faster than the Θ(n log n) steps required by the classical walk. Expand
Quantum Walk on the Line
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider {\em quantum\/} walks on graphs. We analyse in detail the behaviour ofExpand
Quantum quincunx in cavity quantum electrodynamics
We introduce the quantum quincunx, which physically demonstrates the quantum walk and is analogous to Galton's quincunx for demonstrating the random walk by employing gravity to draw pellets throughExpand
Quantum Random Walks Hit Exponentially Faster
  • J. Kempe
  • Computer Science, Mathematics
  • ArXiv
  • 2002
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classicalExpand
A new type of limit theorems for the one-dimensional quantum random walk
In this paper we consider the one-dimensional quantum random walk X^{varphi} _n at time n starting from initial qubit state varphi determined by 2 times 2 unitary matrix U. We give a combinatorialExpand
Quantum walks in optical lattices
We propose an experimental realization of discrete quantum walks using neutral atoms trapped in optical lattices. The quantum walk is taking place in position space and experimental implementationExpand
Exponential algorithmic speedup by a quantum walk
TLDR
A black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer is constructed and it is proved that no classical algorithm can solve the problem in subexponential time. Expand
...
1
2
3
4
5
...