相关论文: Pretty good state transfer on double stars

We introduce the concept of group state transfer on graphs, summarize its relationship to other concepts in the theory of quantum walks, set up a basic theory, and discuss examples. Let $X$ be a graph with adjacency matrix $A$ and consider…

In this paper we answer the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer. The network is described by a circulant graph $G$, which is characterized by its circulant…

An $s$-pair state in a graph is a quantum state of the form $\mathbf{e}_u+s\mathbf{e}_v$, where $u$ and $v$ are vertices in the graph and $s$ is a non-zero complex number. If $s=-1$ (resp., $s=1$), then such a state is called a pair state…

Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit…

Let $L$ denote the Laplacian matrix of a graph $G$. We study continuous quantum walks on $G$ defined by the transition matrix $U(t)=\exp\left(itL\right)$. The initial state is of the pair state form, $e_a-e_b$ with $a,b$ being any two…

A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…

We construct families of graphs from linear groups $\mathrm{SL}(2,q)$, $\mathrm{GL}(2,q)$ and $\mathrm{GU}(2,q^2)$, where $q$ is an odd prime power, with the property that the continuous-time quantum walks on the associated networks of…

We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on variants of the double cones [BCMS09,ANOPRT10,ANOPRT09] and the Cartesian graph products (which…

We prove that the only trees that admit perfect state transfer according to the adjacency matrix model are $P_2$ and $P_3$. This answers a question first asked by Godsil in 2012 and proves a conjecture by Coutinho and Liu from 2015.

We investigate fractional revival in graphs with respect to the adjacency, Laplacian, and signless Laplacian matrices. We observe that, under certain conditions, fractional revival is preserved under graph complementation. Then we establish…

We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. Specific results we prove include: (1) The signed join of a negative 2-clique with any positive…

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…

Given two graphs $G_{1}$ of order $n_{1}$ and $G_{2}$, the neighborhood corona of $G_{1}$ and $G_{2}$, denoted by $G_{1}\bigstar G_{2}$, is the graph obtained by taking one copy of $G_{1}$ and taking $n_{1}$ copies of $G_{2}$, in the…

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…

We consider graphs with two cut vertices joined by a path with one or two edges, and prove that there can be no quantum perfect state transfer between these vertices, unless the graph has no other vertex. We achieve this result by applying…

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…

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…

A vertex in a graph is said to be sedentary if a quantum state assigned on that vertex tends to stay on that vertex. Under mild conditions, we show that the direct product and join operations preserve vertex sedentariness. We also…

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…

In this paper, we study the existence of perfect state transfer and pretty good state transfer in vertex complemented coronas. We prove that perfect state transfer in vertex complemented coronas is extremely rare. In contrast, we give…