Related papers: Laplacian state transfer in vertex complemented co…
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…
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…
In this paper, we consider the problem on the existence of perfect state transfer(PST for short) on semi-Cayley graphs over abelian groups (which are not necessarily regular), i.e on the graphs having semiregular and abelian subgroups of…
Perfect state transfer in graphs is a concept arising from quantum physics and quantum computing. Given a graph $G$ with adjacency matrix $A_G$, the transition matrix of $G$ with respect to $A_G$ is defined as $H_{A_{G}}(t) =…
We show how two many-body, generally mixed, quantum states can be swapped via collective, all-to-all interactions. Specifically, we present an experimentally relevant implementation for quantum dots that enables coherent exchange of quantum…
Recent technological advances have allowed the fabrication of large arrays of coupled qubits serving as prototypes of quantum processors. However, the optimal control of such systems is notoriously hard, which limits the potential 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 examine the two-party perfect quantum teleportation of an unknown 1-qubit state in the case of sharing various 3-qubit entangled states between a sender and a receiver: GHZ state, W state and W-like state. We give an impossibility proof…
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…
Suppose $C$ is a subset of non-zero vectors from the vector space $\mathbb{Z}_2^d$. The cubelike graph $X(C)$ has $\mathbb{Z}_2^d$ as its vertex set, and two elements of $\mathbb{Z}_2^d$ are adjacent if their difference is in $C$. If $M$ is…
When studying the perfect transfer of a quantum state from one site to another, it is typically assumed that one can receive the arriving state at a specific instant in time, with perfect accuracy. Here, we study how sensitive perfect state…
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…
The exact solution is obtained for the eigenvalues and eigenvectors of the row-to-row transfer matrix of a two-dimensional vertex model with unlimited number of states per bond. This model is a classical counterpart of a quantum spin chain…
In this note, we give several definitions of metric corona properties which could be of interest in Set Topology, Functional Analysis and Approximation Theory, and prove that there are complete metrizable t.v.s. which are nice in the sense…
The transfer of quantum states has played an important role in quantum information processing. In fact, transfer of quantum states from point $A$ to $B$ with unit fidelity is very important for us and we focus on this case. In recent years,…
The transition matrix of a graph $G$ corresponding to the adjacency matrix $A$ is defined by $H(t):=\exp{\left(-itA\right)},$ where $t\in\mathbb{R}$. The graph is said to exhibit pretty good state transfer between a pair of vertices $u$ and…
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…
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…
Recently, Li. \emph{et. al.} [Int. J. Theor. Phys., 48, 2777 (2009)] derived a necessary and sufficient condition for LOCC cloning of a set of bipartite orthogonal partially but equally entangled state. We demonstrates that, the result is…
Perfect lattice actions are exiting with several respects: they provide new insight into conceptual questions of the lattice regularization, and quasi-perfect actions could enable a great leap forward in the non-perturbative solution of…