Related papers: Perfect state transfer in XX chains induced by bou…
We study the interplay between disorder and a quasi periodic coupling array in an external magnetic field in a spin-1/2 XXZ chain. A simple real space decimation argument is used to estimate the magnetization values where plateaux show up.…
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit…
Pure states correspond to one-dimensional subspaces of $\mathbb{C}^n$ represented by unit vectors. In this paper, we develop the theory of perfect state transfer (PST) between real pure states with emphasis on the adjacency and Laplacian…
We propose to use ferromagnetic systems for entanglement generation and distribution together with perfect state transfer between distant parties in a qubit chain. The scheme relies on an effective 2-qubit dynamics, realized by leaving two…
We study perfect state transfer on quantum networks represented by weighted graphs. Our focus is on graphs constructed from the join and related graph operators. Some specific results we prove include: (1) The join of a weighted two-vertex…
We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If $n$ is the length of the path, and the vertices are indexed…
We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. Specific results we prove include: (1) The signed join of a negative 2-clique with any positive…
There has been much recent study on the application of spin chains to quantum state transfer and communication. Here we discuss the utilisation of spin chains (set up for perfect quantum state transfer) for the knitting of distributed…
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…
In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one dimensional cases, such as 1d spin chains. We…
This work recollects a non-universal set of quantum gates described by higher-dimensional Spin groups. They are also directly related with matchgates in theory of quantum computations and complexity. Various processes of quantum state…
We consider a spin network resembling an $\alpha$-helix structure and study quantum information transfer over this bio-inspired network. The model we use is the Davydov model in its elementary version without a phononic environment. We…
In a recent work (arXiv:2207.01954), we showed that a uniformly coupled chain could be symmetrically extended by engineered spin chains in such a way that we could choose part of the spectrum of the overall system. When combined with an…
A general formalism of the problem of perfect state transfer is presented. We show that there are infinitely many Hamiltonians which may provide solution to this problem. In a first attempt to give a classification of them we investigate…
A simple method for transmitting quantum states within a quantum computer is via a quantum spin chain---that is, a path on $n$ vertices. Unweighted paths are of limited use, and so a natural generalization is to consider weighted paths;…
We study a transport phenomenon in certain coined quantum walks where a subspace of states localized at a vertex gets transferred to another vertex. We first develop characterizations for perfect and pretty good subspace state transfer…
It is shown how to perfectly transfer an arbitrary qudit state in interacting boson networks. By defining a family of Hamiltonians related to Bose-Hubbard model, we describe a possible method for state transfer through bosonic atoms trapped…
Perfect state transfer between qubits on a uniformly coupled network, with interactions specified by a graph, has advantages over an engineered chain, such as much faster transfer times (independent of the distance between the input and…
We examine the role that interference plays in quantum state transfer through several types of finite spin chains, including chains with isotropic Heisenberg interaction between nearest neighbors, chains with reduced coupling constants to…
We show that several models of interacting XXZ spin chains subject to boundary driving and dissipation possess a subtle kind of time-reversal symmetry, making their steady states exactly solvable. We focus on a model with a coherent…