Maximal entanglement from quantum random walks

Authors:
B. Allés;S. Gündüç;Y. Gündüç
Affiliations:
INFN Sezione di Pisa, Pisa, Italy;Hacettepe Vocational School, Hacettepe University, Beytepe, Turkey 06800;Department of Physics, Hacettepe University, Beytepe, Turkey 06800
Venue:
Quantum Information Processing
Year:
2012

Citing 5
Cited 2

Quantum simulations of classical random walks and undirected graph connectivity

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
One-dimensional quantum walks

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
Quantum Random Walks in One Dimension

Quantum Information Processing
Decoherence in quantum walks – a review

Mathematical Structures in Computer Science

Entanglement for discrete-time quantum walks on the line

Quantum Information & Computation
Quantum walks: a comprehensive review

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The conditions under which entanglement becomes maximal are sought in the general one-dimensional quantum random walk with two walkers. Moreover, a one-dimensional shift operator for the two walkers is introduced and its performance in generating entanglement is analyzed as a function of several free parameters, some of them coming from the shift operator itself and some others from the coin operator. To simplify the investigation an averaged entanglement is defined.