Related papers: Engineering Perfect State Transfer Graphs via Give…
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,…
Given a graph with Hermitian adjacency matrix $H$, perfect state transfer occurs from vertex $a$ to vertex $b$ if the $(b,a)$-entry of the unitary matrix $\exp(-iHt)$ has unit magnitude for some time $t$. This phenomenon is relevant for…
In the light of recent advances in fabricating single layer quantum chips and a possible road toward development of multi-layer quantum chips, we review, in a detailed way, the subject of quantum state transfer with particular emphasis on…
Quantum information transfer is an important part of quantum information processing. Several proposals for quantum information transfer along linear arrays of nearest-neighbor coupled qubits or spins were made recently. Perfect transfer was…
We review the subject of perfect state transfer; how one designs the (fixed) interactions of a chain of spins so that a quantum state, initially inserted on one end of the chain, is perfectly transferred to the opposite end in a fixed time.…
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 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…
The question of perfect state transfer existence in quantum spin networks based on weighted graphs has been recently presented by many authors. We give a simple condition for characterizing weighted circulant graphs allowing perfect state…
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an…
The study of perfect state transfer on graphs has attracted a great deal of attention during the past ten years because of its applications to quantum information processing and quantum computation. Perfect state transfer is understood to…
The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time…
We study perfect state transfer in Kendon's model of discrete quantum walks. In particular, we give a characterization of perfect state transfer purely in terms of the graph spectra, and construct an infinite family of $4$-regular circulant…
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 a quantum state between distant nodes in two-dimensional networks, is considered. The fidelity of state transfer is calculated as a function of the number of interactions in networks that are described by regular graphs. It…
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in…
Perfect transfer of a quantum state through a one-dimensional chain is now well understood, allowing one not only to decide whether a fixed Hamiltonian achieves perfect transfer, but to design a suitable one. We are particularly interested…
We construct infinite families of graphs in which pretty good state transfer can be induced by adding a potential to the nodes of the graph (i.e. adding a number to a diagonal entry of the adjacency matrix). Indeed, we show that given any…
We consider quantum state transfer on finite graphs which are attached to infinite paths. The finite graph represents an operational quantum system for performing useful quantum information tasks. In contrast, the infinite paths represent…
We study transfer of single photon in an one-dimensional finite Glauber-Fock cavity array whose coupling strengths satisfy a square root law. The evolved state in the array can be mapped to an upper truncated coherent state if the cavities…
We consider the representation of a continuous-time quantum walk in a graph $X$ by the matrix $\exp(itA(X))$. We provide necessary and sufficient criteria for distance-regular graphs and, more generally, for graphs in association schemes to…