相关论文: Fractional revival between twin vertices
Fractional revival occurs between two vertices in a graph if a continuous-time quantum walk unitarily maps the characteristic vector of one vertex to a superposition of the characteristic vectors of the two vertices. This phenomenon is…
We develop the theory of fractional revival in the quantum walk on a graph using its Laplacian matrix as the Hamiltonian. We first give a spectral characterization of Laplacian fractional revival, which leads to a polynomial time algorithm…
Fractional revival, known as a quantum transport phenomenon, is essential for entanglement generation in quantum spin networks. The concept of fractional revival is a generalization of perfect state transfer and periodicity on graphs. In…
An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each…
In this article, we give characterization for existence of quantum fractional revival in unitary Cayley graph utilizing adjacency matrix Hamiltonian. Unitary Cayley graph $X=( Z_n, S)$ is a special graph as connection set $S \subseteq Z_n$…
We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the…
In this paper, we investigate the existence of fractional revival on Cayley graphs over finite abelian groups. We give a necessary and sufficient condition for Cayley graphs over finite abelian groups to have fractional revival. As…
Let $\Gamma$ be a graph with the adjacency matrix $A$. The transition matrix of $\Gamma$, denoted $H(t)$, is defined as $H(t) := \exp(-\textbf{i}tA)$, where $\textbf{i} := \sqrt{-1}$ and $t$ is a real variable. The graph $\Gamma$ is said to…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
New analytic spin chains with fractional revival are introduced. Their nearest-neighbor couplings and local magnetic fields correspond to the recurrence coefficients of para-Racah polynomials which are orthogonal on quadratic bi-lattices.…
The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…
In this paper, we investigate the existence of fractional revival on semi-Cayley graphs over finite abelian groups. We give some necessary and sufficient conditions for semi-Cayley graphs over finite abelian groups admitting fractional…
This paper studies the problem of recovering a hidden vertex correspondence between two correlated graphs when both edge weights and node features are observed. While most existing work on graph alignment relies primarily on edge…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
Dual multiplicity graphs are those simple, undirected graphs that have a weighted Hermitian adjacency matrix with only two distinct eigenvalues. From the point of view of frame theory, their characterization can be restated as which graphs…
A number of recent papers have considered signed graph Laplacians, a generalization of the classical graph Laplacian, where the edge weights are allowed to take either sign. In the classical case, where the edge weights are all positive,…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…