We develop a general spectral framework to analyze quantum fractional revival in quantum spin networks. In particular, we introduce generalizations of the notions of cospectral and strongly cospectral vertices to arbitrary subsets of vertices, and give various examples. This work resolves two open questions of Chan et.~al. ["Quantum Fractional Revival on graphs". Discrete Applied Math, 269:86-98, 2019.]
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 this paper, we propose a sufficient and necessary condition for abelian Cayley graphs having fractional revival between any two distinct vertices. With this characterization, two general constructions of abelian Cayley graphs having fractional revival is presented. Meanwhile, we establish several new families of abelian Cayley graphs admitting fractional reviv…
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 to check this phenomenon and find the earliest time when it occurs. We then apply the characterization theorem to special families of graphs. In particular, we show that no tree admits Laplacian fractional revival except for the paths on two and three vertices, and the only graphs on a prime number of vertices that admit Laplacian fractional revival are doub…
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 eigenvalues and eigenvectors of the adjacency matrix of a graph. This characterization follows from a lemma due to Kronecker on Diophantine approximation, and is similar to the spectral characterization of pretty good state transfer in graphs. Using this, we give a complete characterizations of when approximate fractional revival can occur in paths and in cycl…
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 relevant in quantum information in particular for entanglement generation in spin networks. We study fractional revival in graphs whose adjacency matrices belong to the Bose-Mesner algebra of association schemes. A specific focus is a characterization of balanced fractional revival (which corresponds to maximal entanglement) in graphs that belong to the Hamming …
We develop the theory of pretty good fractional revival in quantum walks on graphs using their Laplacian matrices as the Hamiltonian. We classify the paths and the double stars that have Laplacian pretty good fractional revival.
Perfect state transfer and fractional revival can be used to move information between pairs of vertices in a quantum network. While perfect state transfer has received a lot of attention, fractional revival is newer and less studied. One problem is to determine the differences between perfect state transfer and fractional revival. If perfect state transfer occurs between two vertices in a graph, the vertices must be cospectral. Further if there is perfect state transfer between vertices $a$ and $b$ in a graph, there cannot be perfect state transfer from $a$ to any other vertex. No examples of …
Fractional revival is a quantum transport phenomenon important for entanglement generation in spin networks. This takes place whenever a continuous-time quantum walk maps the characteristic vector of a vertex to a superposition of the characteristic vectors of a subset of vertices containing the initial vertex. A main focus will be on the case when the subset has two vertices. We explore necessary and sufficient spectral conditions for graphs to exhibit fractional revival. This provides a characterization of fractional revival in paths and cycles. Our work builds upon the algebraic machinery d…
Quantum fractional revival on zero-divisor graphs over $\mathbb{Z}_n$
Mahidol University(玛希隆大学);Centre of Excellence in Mathematics, MHESI(数学卓越中心,高等教育委员会);King Mongkut’s University of Technology Thonburi (KMUTT)(蒙固皇家理工大学)
Fractional revival on oriented Cayley and semi-Cayley graphs over abelian groups
School of Mathematics and Statistics,Northwestern Polytechnical University(西北工业大学数学与统计学院);Xi’an-Budapest Joint Research Center for Combinatorics,Northwestern Polytechnical University(西北工业大学西安-布达佩斯组合学联合研究中心);School of Mathematics and Statistics,Shaanxi Normal University(陕西师范大学数学与统计学院)
We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian groups, called extraspecial groups. By applying general results for graphs in association schemes we determine the precise conditions for perfect state transfer and fractional revival, and use partial spreads to construct graphs on extraspecial $2$-groups admitting these various phenomena. Lastly, we use a result of Ada Chan to show that there is no normal Cayley graph of an extraspecial group that admits instantaneous uniform mixing.
Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of fractional colorings. We thus present closed formulas for the "fractional" chromatic polynomial - a function that counts the number of distinct $b$-fold $λ$-colorings on a given graph - of complete graphs, trees and forests, as well as a generalized form of the Fundamental Reduction Theorem.