Related papers: A note on perfect quantum state transfers on trees
We find a protocol transmitting K quantum states crossly in the quantum networks with K pair sender-receiver and one bottleneck channels only with sharing quantum correlations between senders. In these networks senders want to multi cast…
Quantum state transfer is a procedure, which allows to exchange quantum information between stationary qubit systems. It is anticipated that the transfer will find applications in solid-state quantum computing. In this contribution, we…
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 investigate quantum state transfer in XY spin chains and propose a recursive procedure to construct the nonuniform couplings of these chains with arbitrary length to achieve perfect state transfer(PST). We show that this method is…
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 study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
In this paper, we study pretty good state transfer (PGST) in Grover walks on graphs. We consider transfer of quantum states that are localized at the vertices of a graph and we use Chebyshev polynomials to analyze PGST between such states.…
In this work, we use the Hamiltonian of a modified Dzyaloshinskii-Moriya model and investigate the perfect transfer of the quantum state on the spin networks. In this paper, we calculate fidelity in which fidelity depends on magnetic field…
Transferring quantum states efficiently between distant nodes of an information processing circuit is of paramount importance for scalable quantum computing. We report on the first observation of a perfect state transfer protocol on a…
One of the strengths of quantum information theory is that it can treat quantum states without referring to their particular physical representation. In principle, quantum states can be therefore fully swapped between various quantum…
Valid transformations between quantum states are necessarily described by completely positive maps, instead of just positive maps. Positive but not completely positive maps such as the transposition map cannot be implemented due to the…
We study perfect state transfer in Grover walks, which are typical discrete-time quantum walk models. In particular, we focus on states associated to vertices of a graph. We call such states vertex type states. Perfect state transfer…
The transfer of data is a fundamental task in information systems. Microprocessors contain dedicated data buses that transmit bits across different locations and implement sophisticated routing protocols. Transferring quantum information…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…
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…
We investigate the effect of disorder on the transfer of quantum states across a one-dimensional lattice with varying levels of control resources. We find that the application of properly designed control signals, even when applied only to…
Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H(t):=\exp{\left(-itA\right)},\;t\in\Rl$. The graph $G$ is said to admit pretty good state transfer between a pair of vertices $u$ and…
We introduce a scheme for perfect state transfer in regular two and three dimensional structures. The interactions on the lattices are of XX spin type with uniform couplings. In two dimensions the structure is a hexagonal lattice and in…
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 develop a family of perfect quantum error correcting codes that correct for phase errors that arise on any qubit, at any time, during a perfect state transfer experiment. These ensure that we find the optimal operating regime for…