2019/06/30 by Aikaterini Gratsea, Maciej Lewenstein, Alexandre Dauphin
Computer Science · Physics and Astronomy · #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum algorithm #Quantum discord #Quantum entanglement #Quantum error correction #Quantum network #Quantum sensor #Quantum teleportation #Quantum walk #W state #physics.optics #quant-ph
paper · pdf · doi:10.1088/2058-9565/ab6ce6
published as Quantum Sci. Technol. 5, 025002 (2020) · 6 pages, 7 figures, comments are welcome
openalex created_date 2019/06/27 · arxiv created 2019/12/12 · openalex publication_date 2020/01/16 · arxiv updated 2020/02/12 · openalex updated_date 2026/08/05
Abstract We study the generation of hybrid entanglement in a one-dimensional quantum walk. In particular, we explore the preparation of maximally entangled states between position and spin degrees of freedom. We address it as an optimization problem, where the cost function is the Schmidt norm. We then benchmark the algorithm and compare the generation of entanglement between the Hadamard quantum walk, the random quantum walk and the optimal quantum walk. Finally, we discuss an experimental scheme with a photonic quantum walk in the orbital angular momentum of light. The experimental measurement of entanglement can be achieved with quantum state tomography.