Related papers: Pretty good state transfer in graphs with an invol…
We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and Graph Theory. In these setups, the paths of photons are identified such that the photon-source information is never created.…
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…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
We consider the Grover walk model on a connected finite graph with two infinite length tails and we set an $\ell^\infty$-infinite external source from one of the tails as the initial state. We show that for any connected internal graph, a…
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…
As generalizations of results of Christandl et al.\cite{8,9""} and Facer et al.\cite{Facer}, Bernasconi et al.\cite{godsil,godsil1} studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of…
We consider quantum walks on the cycle in the non-stationary case where the `coin' operation is allowed to change at each time step. We characterize, in algebraic terms, the set of possible state transfers and prove that, as opposed to the…
We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim…
In this paper, we investigate a high-dimensional quantum state transfer protocol. An arbitrary unknown high-dimensional state can be transferred with high fidelity between two remote registers through a XX coupling spin chain of arbitrary…
Let $X$ be a graph on $n$ vertices with with adjacency matrix $A$ and let $H(t)$ denote the matrix-valued function $\exp(iAt)$. If $u$ and $v$ are distinct vertices in $X$, we say perfect state transfer}from $u$ to $v$ occurs if there is a…
Finding minimal time and establishing the structure of the corresponding optimal controls which can transfer a given initial state of a quantum system into a given target state is a key problem of quantum control. In this work, this problem…
Using a global optimization algorithm we obtain spin chains with site-dependent exchange coefficients which allow almost perfect quantum state transfer between the extremes of the chains without any further time-dependent external control.…
Quantum state transfer is one of the basic tasks in quantum information processing. We here propose a theoretical approach to realize arbitrary entangled state transfer through a qubit chain, which is a class of extended…
The Quantum Speed Limit can be found in many different situations, in particular in the propagation of information through quantum spin chains. In homogeneous chains it implies that taking information from one extreme of the chain to the…
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…
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…
State transfer is a well-known routine for various systems of spins-$\frac{1}2$. Still, it is not well studied for chains of spins of larger magnitudes. In this contribution we argue that while perfect state transfer may seem unnatural in…
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
High-fidelity quantum state transfer is critical for quantum communication and scalable quantum computation. Current quantum state transfer algorithms on the complete bipartite graph, which are based on discrete-time quantum walk search…
As quantum information technologies advance, challenges in scaling and connectivity persist, particularly the need for long-range qubit connectivity and efficient entanglement generation. Perfect State Transfer enables time-optimal state…