We investigate the entanglement transfer in two parallel 1D spin chains of a quantum spin network, and show that the perfect entanglement transfer can be realized at some special times. In addition, the so-called `sudden death' phenomenon of entanglement is found in the spin network system.
With the effects of Dzialoshinski–Moriya interaction and external magnetic field, the entanglement transfer has been investigated in a parallel spin-chain system. Our results imply that the perfect transfer can be realized at some special times, and the transfer time can be greatly condensed with the rising of the spin-orbit coupling strength. The entanglement sudden death phenomenon is sensitive to the initial condition. In addition, due to the application of magnetic field on the channel spins, the reliability and efficiency of the transmission are greatly challenged.
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).