In this paper, we characterize the existence of perfect state transfer (PST) and fractional revival in continuous-time quantum walks on the zero-divisor graph $Γ(\mathbb{Z}_n)$. By using the canonical equitable partition of $Γ(\mathbb{Z}_n)$ induced by the proper divisors of $n$, we derive a sufficient condition on $n$ for PST to occur between a pair of vertices. We show that fractional revival is restricted to cells of size $2$ within the equitable partition. Furthermore, assuming $-1$ is not an eigenvalue of the quotient spectrum, we establish that two vertices in $Γ(\mathbb{Z}_n)$ are strongly cospectral if and only if they form a cell of size $2$ within the equitable partition that is either a set of false twins or true twins. Finally, we provide a characterization of fractional revival on bipartite $Γ(\mathbb{Z}_n)$ and prove the non-existence of fractional revival on $Γ(\mathbb{Z}_{p^2q})$.
Quantum fractional revival on zero-divisor graphs over Zn
In this paper, we characterize the existence of perfect state transfer (PST) and fractional revival in continuous-time quantum walks on the zero-divisor graph Γ(Zn). By using the canonical equitable partition of Γ(Zn) induced by the proper divisors of n, we derive a sufficient condition on n for PST to occur between a pair of vertices. We show that fractional revival is restricted to cells of size 2 within the equitable partition. Furthermore, assuming −1 is not an eigenvalue of the quotient spectrum, we establish that two vertices in Γ(Zn) are strongly cospectral if and only if they form a cell of size 2 within the equitable partition that is either a set of false twins or true twins. Finally, we provide a characterization of fractional revival on bipartite Γ(Zn) and prove the non-existence of fractional revival on Γ(Zp2q).
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.
This paper investigates perfect state transfer (PST) in discrete-time quantum walks constructed via the shunt decomposition method. The walks are defined on a graph G and its associated quotient graph G/π, induced by an equitable partition π. Through the shunt decomposition of G, we derive an explicit relation between the shift operator of the parent graph G and that of its quotient graph G/π. We construct a reflection operator based on the characteristic matrix, which establishes a connection between the transition operator of the parent graph and that of its lower-dimensional quotient graph. We then prove that PST occurs on G if and only if it occurs on G/π. Furthermore, we express the unitary evolution operator of the quotient graph in terms of Chebyshev polynomials of the first kind, from which we derive explicit criteria for PST. As an application, we establish PST on the cycle graph Cn at time k=n/2, and lift the result to the parent graph C2n via the equitable partition π. We further show that if an equitable partition π of G induces a quotient isomorphic to Kn↺, the complete digraph on n vertices with a loop at every vertex, then PST occurs at step k=n, and the walk is periodic at k=2n. This framework is applied to two families of graphs, which are the complete bipartite digraph Kn,n⇌ and the circulant graph Circ(2n,S), where S consists of all odd residues modulo 2n and n=2s for some s≥1, establishing PST in their respective line digraphs. Collectively, these results also answer the question posed by Godsil and Zhan concerning which shunt decompositions or embeddings of a graph admit PST.
We prove new results on perfect state transfer of quantum walks on quotient graphs. Since a graph G has perfect state transfer if and only if its quotient G/\pi, under any equitable partition \pi, has perfect state transfer, we exhibit graphs with perfect state transfer between two vertices but which lack automorphism swapping them. This answers a question of Godsil (Discrete Mathematics 312(1):129-147, 2011). We also show that the Cartesian product of quotient graphs \Box_{k} G_{k}/\pi_{k} is isomorphic to the quotient graph \Box_{k} G_{k}/\pi, for some equitable partition \pi. This provides an algebraic description of a construction due to Feder (Physical Review Letters 97, 180502, 2006) which is based on many-boson quantum walk.
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
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 revival.
The continuous-time quantum walk on an oriented circulant graph is determined by the Fourier eigenvalues of its Hermitian adjacency matrix. We classify perfect state transfer (PST) between distinct vertices in every nonempty oriented circulant graph. We show that each such graph is described by an odd primitive quadratic Dirichlet character of conductor Δ, a set of gcd-classes, and a choice between the two orientations of each selected class. For a graph of order n, we derive an explicit formula for every Fourier eigenvalue without assuming that n/Δ is coprime to Δ. We prove that PST occurs only for Δ∈{3,4,8} and give necessary and sufficient conditions on the connection set for each conductor. Equivalently, the square-free radicands of oriented circulant graphs with PST are exactly 1, 2, and 3. More generally, when λj=Dηj with ηj∈Z, congruences satisfied by the integers ηj determine all PST pairs and times, the minimum period, and the largest vertex sets supporting multiple state transfer (MST). In this class, pretty good state transfer is equivalent to PST. We also determine the connected orders and enumerate the resulting graphs.