Quantum Walk-based Generation of Entanglement Between Two Walkers - Quantum PhysicsReport as inadecuate

Quantum Walk-based Generation of Entanglement Between Two Walkers - Quantum Physics - Download this document for free, or read online. Document in PDF available to download.

Abstract: Quantum walks can be used either as tools for quantum algorithm developmentor as entanglement generators, potentially useful to test quantum hardware. Wepresent a novel algorithm based on a discrete Hadamard quantum walk on a linewith one coin and two walkers whose purpose is to generate entanglement betweenwalkers. We provide several classical computer simulations of our quantumalgorithm in which we show that, although the asymptotical amount ofentanglement generated between walkers does not reach the highest degree ofentanglement possible at each step for either coin measurement outcome, theentanglement ratio entanglement generated-highest value of entanglementpossible, for each step tends to converge, and the actual convergence valuedepends on the coin initial state and on the coin measurement outcome.Furthermore, our numerical simulations show that, for the quantum walks used inour algorithm, the value towards which entanglement ratio converges alsodepends on the position probability distribution symmetry of a quantum walkcomputed with one single walker and the same coin initial state employed in thecorresponding quantum walk with two walkers.

Author: Salvador E. Venegas-Andraca, Sougato Bose

Source: https://arxiv.org/


Related documents