STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum Random Walks in One Dimension
Quantum Information Processing
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Coins make quantum walks faster
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Realization of the probability laws in the quantum central limit theorems by a quantum walk
Quantum Information & Computation
| Hi-index | 0.00 |
We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle system resembles the single-particle quantum walk evolution when the number of steps is greater than the number of particles in the system. For non-uniform initial states we show that the quantum walks can be effectively used to separate the basis states of the particle in position space and grouping like state together. We also discuss a two-particle quantum walk on a two-dimensional lattice and demonstrate an evolution leading to the localization of both particles at the center of the lattice. Finally we discuss the outcome of a quantum walk of two indistinguishable particles interacting at some point during the evolution.