Related papers: Almost perfect state transfer in quantum spin chai…
One spin excitation states are involved in the transmission of quantum states and entanglement through a quantum spin chain, the localization properties of these states are crucial to achieve the transfer of information from one extreme of…
The transmission of quantum states in the anisotropic Heisenberg XXZ chain model with three-spin exchange interaction is studied. The average fidelity is used to evaluate the state transfer. It is found out that quantum communication can be…
The electric control of quantum spin chains has been an outstanding goal for the few last years due to its potential use in technologies related to quantum information processing. In this work, we show the feasibility of the different steps…
We discuss pretty good state transfer of multiple qubit states and provide a model for considering state transfer of arbitrary states on unmodulated XX-type spin chains. We then provide families of paths and initial states for which we can…
Let A be the adjacency matrix of a graph $X$ and suppose U(t)=exp(itA). We view A as acting on $\cx^{V(X)}$ and take the standard basis of this space to be the vectors $e_u$ for $u$ in $V(X)$. Physicists say that we have perfect state…
A system of a two-level atom of an impurity (qubit) inserted into a periodic chain coupled to the continuum is studied with the use of the effective non-Hermitian Hamiltonian. Exact solutions are derived for the quasistationary eigenstates,…
We find analytic models that can perfectly transfer, without state initializati$ or remote collaboration, arbitrary functions in two- and three-dimensional interacting bosonic and fermionic networks. We elaborate on a possible…
We investigate the quantum-state transfer on spin-chian channels with random imperfections.Through combining the advantages of two known schemes, the dual-rail spin-chain channels[9] and the particular ihhomogenous spin-chain channel[10],…
Quantum walks on undirected graphs have been studied using symmetric matrices, such as the adjacency or Laplacian matrix, and many results about perfect state transfer are known. We extend some of those results to oriented graphs. We also…
We consider the $M$-neighbor approximation in the problem of one-qubit pure state transfer along the $N$-node zigzag and alternating spin chains governed by the $XXZ$-Hamiltonian with the dipole-dipole interaction. We show that always…
A robust quantum state transfer scheme is discussed for three atoms that are trapped by separated cavities linked via optical fibers in ring-connection. It is shown that, under the effective three-atom Ising model, arbitrary quantum state…
Regular families of coupled quantum networks are described such the unknown state of a qubit can be perfectly routed from any node to any other node in a time linear in the distance. Unlike previous constructions, the transfer can be…
In this letter we propose a superadiabatic protocol where quantum state transfer can be achieved with arbitrarily high accuracy and minimal control across long spin chains with an odd number of spins. The quantum state transfer protocol…
Faithful exchange of quantum information can in future become a key part of many computational algorithms. Some Authors suggest to use chains of mutually coupled spins as channels for quantum communication. One can divide these proposals…
We study a quantum state transfer between spins interacting with an arbitrary network of spins coupled by uniform XX interactions. It is shown that in such a system under fairly general conditions, we can expect a nearly perfect transfer of…
For any graph $X$ with the adjacency matrix $A$, the transition matrix of the continuous-time quantum walk at time $t$ is given by the matrix-valued function $\mathcal{H}_X(t)=\mathrm{e}^{itA}$. We say that there is perfect state transfer…
We analyze a recent protocol for the transmission of quantum states via a dual spin chain [Burgarth and Bose, Phys. Rev. A 71, 052315 (2005)] under the constraint that the receiver's measurement strength is finite. That is, we consider the…
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the…
Motivated by the need for communication of coherent state-based qubits in quantum computers, we introduce a method for perfect transferring of an arbitrary superposition of coherent states between two distant nodes of a linear array of…
The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various…