Quantum Walk-based Generation of Entanglement Between Two Walkers

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 15 figures

Scientific paper

Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with one coin and two walkers whose purpose is to generate entanglement between walkers. We provide several classical computer simulations of our quantum algorithm in which we show that, although the asymptotical amount of entanglement generated between walkers does not reach the highest degree of entanglement possible at each step for either coin measurement outcome, the entanglement ratio (entanglement generated/highest value of entanglement possible, for each step) tends to converge, and the actual convergence value depends on the coin initial state and on the coin measurement outcome. Furthermore, our numerical simulations show that, for the quantum walks used in our algorithm, the value towards which entanglement ratio converges also depends on the position probability distribution symmetry of a quantum walk computed with one single walker and the same coin initial state employed in the corresponding quantum walk with two walkers.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum Walk-based Generation of Entanglement Between Two Walkers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Walk-based Generation of Entanglement Between Two Walkers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Walk-based Generation of Entanglement Between Two Walkers will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-371766

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.