Related papers: State transfers in vertex complemented coronas
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 study perfect state transfer and multiple state transfer in oriented normal Cayley graphs. We construct examples in a variety of groups, ranging from abelian to nonsolvable, and establish some general restrictions and nonexistence…
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…
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…
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…
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with…
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…
Chains of transmon qubits are considered promising systems to implement different quantum information tasks. In particular as channels that perform high-quality quantum state transfer. We study how changing the interaction strength between…
Perfect state transfer is significant in quantum communication networks. There are very few graphs having this property. So, it is useful to find some new graphs having perfect state transfer. A good way to construct new graphs is by…
We consider an inhomogeneous XX spin chain which interpolates between the Krawtchouk one with perfect state transfer and the homogeneous XX chain. This model can be exploited in order to perform state transfer of a qubit with sufficiently…
We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part…
We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they…
In this paper, we study quantum walks on the extension of association schemes. Various state transfers can be achieved on these graphs, such as multiple state transfer among extreme points of a simplex, fractional revival on subsimplexes.…
We study state transfer in quantum walk on graphs relative to the adjacency matrix. Our motivation is to understand how the addition of pendant subgraphs affect state transfer. For two graphs $G$ and $H$, the Frucht-Harary corona product $G…
Twin vertices in simple unweighted graphs are vertices that have the same neighbours and, in the case of weighted graphs with possible loops, the corresponding incident edges have equal weights. In this paper, we explore the role of twin…
Quantum spin networks can be used to transport information between separated registers in a quantum information processor. To find a practical implementation, the strict requirements of ideal models for perfect state transfer need to be…
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…
In this paper, we first give a necessary and sufficient condition for a graph to have Laplacian pretty good pair state transfer. As an application of such result, we give a complete characterization of Laplacian pretty good edge state…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
We introduce and study peak state transfer, a notion of high state transfer in qubit networks modeled by continuous-time quantum walks. Unlike perfect or pretty good state transfer, peak state transfer does not require fidelity arbitrarily…