Related papers: Perfect state transfer over distance-regular spin …

Preparation of pure states on networks of quantum systems by controlled dissipative dynamics offers important advantages with respect to circuit-based schemes. Unlike in continuous-time scenarios, when discrete-time dynamics are considered,…

We suggest a protocol for perfect quantum communication through spin chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success…

Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H_{A}(t):=\exp{(-itA)},\;t\in\Rl$. We say that the graph $G$ admits perfect state transfer between the verteices $u$ and $v$ at…

In this paper we give a general introduction to supersymmetric spin networks. Its construction has a direct interpretation in context of the representation theory of the superalgebra. In particular we analyze a special kind of spin networks…

We introduce and study peak state transfer, a notion of high state transfer in qubit networks modeled by continuous-time quantum walks. Unlike perfect or pretty good state transfer, peak state transfer does not require fidelity arbitrarily…

We construct the exact solution for a family of one-half spin chains explicitly. The spin chains Hamiltonian corresponds to an isotropic Heisenberg Hamiltonian, with staggered exchange couplings that take only two different values. We work…

Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ is denoted by $H(t)$ and it is defined by $H(t):=\exp{\left(itA\right)},\;t\in\mathbb{R}.$ The graph $G$ has perfect state transfer (PST) from a vertex $u$ to…

We study the time evolution of a single spin excitation state in certain linear spin chains, as a model for quantum communication. Some years ago it was discovered that when the spin chain data (the nearest neighbour interaction strengths…

We study the existence of quantum state transfer on non-integral circulant graphs. We find that continuous time quantum walks on quantum networks based on certain circulant graphs with $2^k$ $\left(k\in\mathbb{Z}\right)$ vertices exhibit…

Connections between the 1-excitation dynamics of spin lattices and quantum walks on graphs will be surveyed. Attention will be paid to perfect state transfer (PST) and fractional revival (FR) as well as to the role played by orthogonal…

In this paper, we show our discovery that state-transition networks in several chaotic dynamical systems are "scale-free networks," with a technique to understand a dynamical system as a whole, which we call the analysis for…

Hamiltonian inverse engineering enables the design of protocols for specific quantum evolutions or target state preparation. Perfect state transfer (PST) and remote entanglement generation are notable examples, as they serve as key…

Precise knowledge of the Hamiltonian of a system is a key to many of its applications. Tasks such state transfer or quantum computation have been well studied with a linear chain, but hardly with systems, which do not possess a linear…

We investigate the most general conditions under which a finite ferromagnetic long-range inter- acting spin chain achieves unitary fidelity and the shortest transfer time in transmitting an unknown input qubit. A deeper insight into system…

We explore the physical mechanism to coherently transfer the quantum information of spin by connecting two spins to an isotropic antiferromagnetic spin ladder system as data bus. Due to a large spin gap existing in such a perfect medium,…

This paper discusses continuous-time quantum walks and asymptotic state transfer in graphs with an involution. By providing quantitative bounds on the eigenvectors of the Hamiltonian, it provides an approach to achieving high-fidelity state…

We investigate the dynamics of large heterogeneous network dynamical systems composed of nonlocally coupled chaotic maps. We show that the mean-field limit of such systems is governed by a suitably defined Self-Consistent Transfer Operator…

We consider the high probability state transfers and entanglements between different nodes of the spin-1/2 chains governed by the XXZ-Hamiltonian using the inhomogeneous stationary external magnetic field. Examples of three-, four-, ten-…

Quantum walks, an important tool in quantum computing, have been very successfully investigated using techniques in algebraic graph theory. We are motivated by the study of state transfer in continuous-time quantum walks, which is…

The \textit{transition matrix} of a graph $\Gamma$ with adjacency matrix $A$ is defined by $H(\tau ) := \exp(-\mathbf{i}\tau A)$, where $\tau \in \mathbb{R}$ and $\mathbf{i} = \sqrt{-1}$. The graph $\Gamma$ exhibits \textit{perfect state…