Perfect state transfer using Markovian quantum walk

Abstract

The quantum Perfect State Transfer (PST) is a fundamental tool of quantum communication in a network. It is not easy to achieve in practice. The original idea of PST depends on the fundamentals of the continuous-time quantum walk. A path graph with at most three vertices allows PST based on continuous-time quantum walk. Based on the Markovian quantum walk, we introduce a significantly powerful method for PST in this article. We establish PST between the extreme vertices of a path graph of arbitrary length. Moreover, any pair of symmetric vertices in a path graph allows PST under Markovian quantum walks. We extend our investigations for the cycle graphs. The cycle graphs with more than $4$ vertices do not allow the PST based on the continuous-time quantum walk. In contrast, a cycle graph with $2m$ vertices exhibits PST based on Markovian quantum walk between the vertices $j$ and $j+m$ for $j=0,1,\dots (m-1)$, where $m>0$ is an integer.

This is the accepted manuscript of the published work

References in corpus (18)

• Quantum Communication Through an Unmodulated Spin Chain
• Perfect state transfer in quantum spin networks
• Universal computation by quantum walk
• Quantum walks: a comprehensive review
• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
• Implementing the quantum random walk
• Controlling discrete quantum walks: coins and intitial states
• Dynamics and manipulation of entanglement in coupled harmonic systems with many degrees of freedom
• Experimental Perfect Quantum State Transfer
• Quantum Speed Limit for Perfect State Transfer in One Dimension
• Number-Theoretic Nature of Communication in Quantum Spin Systems
• Perfect state transfer in cubelike graphs
• Perfect state transfer and efficient quantum routing: a discrete-time quantum walk approach
• Discrete Time Quantum Walk Approach to State Transfer
• Staggered Quantum Walks with Hamiltonians
• Statics and Dynamics of Quantum XY and Heisenberg Systems on Graphs
• Probability distributions for Markov chains based quantum walks