2000 character limit reached
Maximal entanglement from quantum random walks
Published 28 Nov 2010 in quant-ph and physics.comp-ph | (1011.6023v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.