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.
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 a connection between fractional revival in a graph and in its double cover, and obtain a complete characterization of pretty good plus state transfer in cycles and their complements. This leads to characterizations of pretty good vertex state transfer in weighted paths with potential.
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 cycles.
Fractional revival (FR), a generalization of perfect state transfer (PST), is a significant phenomenon in quantum state transfer that allows quantum information to be transmitted between two qubits with a certain probability. The existence of FR has been extensively studied on many classes of graphs. However, oriented graphs have not yet been investigated. In this paper, we investigate the existence of proper FR on oriented graphs. We first establish necessary and sufficient conditions for oriented graphs to admit proper FR between strongly cospectral vertices. Furthermore, we prove that oriented Cayley graphs over abelian groups do not admit proper FR, and we subsequently characterize the conditions under which oriented semi-Cayley graphs over abelian groups admit proper FR.
A continuous-time quantum walk is a process on a network of quantum particles that is governed by the transition matrix
U(t)=e−itA, where is
A is the adjacency matrix of the graph representing the network. Certain instantaneous phenomena occuring in quantum walks can be utilized in quantum computing algorithms. The two-vertex phenomenon fractional revival occurs between vertices
u and
v at time
t if the columns of
U(t) corresponding to
u and
v are only supported on the rows indexed by those same two vertices. This means that given any initial state supported only on vertices
u and
v, the state of the system at time
t will again be supported only on those same two vertices. Fractional revival can be used to generate entanglement between two quantum particles. We will discuss
K-fractional revival, the generalization of fractional revival to
K, a larger subset of the vertices in our graph. We will also explore the related concept approximate
K-fractional revival, which denotes the existence of a sequence of times for which
U(t) comes arbitrarily close to achieving
K-fractional revival. Next, we will examine some spectral characterizations of these phenomena, which will allow us to determine if a given graph exhibits either
K-fractional revival or approximate
K-fractional revival. Lastly, we will detail families of examples of approximate
K-fractional revival on path graphs.--Author's abstract