No abstract

No abstract

We initiate the study of pretty good quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of pretty good 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 complete characterizations of when pretty good fractional revival can occur in paths and in cycles. Manuscript

No abstract