Perfect State Transfer on Quotient Graphs in Shunt Decomposition-Based Quantum Walks


Abstract

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/\pi\), induced by an equitable partition \(\pi\). 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/\pi\). 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/\pi\). 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 \(C_{n}\) at time \(k = n/2\), and lift the result to the parent graph \(C_{2n}\) via the equitable partition \(\pi\). We further show that if an equitable partition \(\pi\) of \(G\) induces a quotient isomorphic to \(K_n^{\circlearrowleft}\), 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 \(K_{n,n}^{\rightleftharpoons}\) and the circulant graph \(\operatorname{Circ}(2n, S)\), where \(S\) consists of all odd residues modulo \(2n\) and \(n = 2^s\) for some \(s \geq 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.
 
Keywords: quantum walks, perfect state transfer, quotient graph, shunt decomposition walks, Chebyshev polynomial
MSC 2020 subject classifications: 05C50; 81Q99

1 Introduction↩︎

Quantum walks are the quantum analogue of classical random walks [1] and serve as a primary framework for designing quantum algorithms [2]. Beyond their algorithmic utility, they have been proven universal for quantum computation, implying that any quantum circuit can be encoded into a quantum walk evolution [3]. Notably, quantum walk-based search algorithms provide a quadratic speedup over classical search, analogous to the speedup achieved by Grover’s algorithm [4]. In fact, both the continuous- and discrete-time quantum walk models can be used to derive and justify Grover’s search algorithm as a special case of quantum walk dynamics on graphs [3], [5]. Quantum walks are broadly categorized into two primary frameworks: continuous-time quantum walks (CTQW) [3], [6], [7] and discrete-time quantum walks (DTQW) [2], [8]. In a CTQW, the evolution is driven by a Hamiltonian typically derived from the adjacency or Laplacian matrix of the underlying graph. In contrast, a DTQW evolves through the repeated application of a unitary coin operator followed by a shift operator.

Within the discrete-time setting, several models have been developed to describe the walker’s dynamics, including the arc-reversal, two-reflection, sedentary, and vertex-face models [9], [10]. Among these, the shunt-decomposition model stands out as one of the most computationally efficient [11], [12] frameworks in which the evolution alternates between a coin unitary and a shift that moves the walker along an outgoing arc inside a given shunt or arc-class [5], [9]. Originally introduced by Aharonov et al. [8], this model was later reformulated in a combinatorial context [5], [9]. They explored its spectral properties and established conditions for uniform average mixing using the Grover coin. Due to its structural simplicity, the shunt-decomposition model is particularly well-suited for quantum circuit implementations [11], [13] and has been applied to diverse problems, such as the development of quantum search complement algorithm [12], quantum channel [13].

A central phenomenon in quantum-walk-based protocols is PST [14]. PST occurs when a quantum state localized at a vertex \(a\) is transferred to a vertex \(b\) with unit fidelity at a specific time \(t\in \mathbb{R}\). In CTQW, this is expressed as: \[| \langle e_b \mid e^{-iAt} \mid e_a \rangle | = 1,\] while in DTQW, it requires: \[| \langle e_b \mid U^k \mid e_a \rangle | = 1,\] for some step \(k \in \mathbb{Z}\). A substantial body of work has identified families of graphs that exhibit PST in both continuous and discrete settings [15][21]. One of the method for analyzing PST is the theory of quotient graphs [22], [23], where a large, highly symmetric graph can be reduced (collapsed) into a smaller graph while preserving quantum walk behavior a technique known as path collapsing.

This argument was used by Christandl et al. [24] to show that weighted paths exhibit PST, derived from the fact that the unweighted \(n\)-dimensional hypercube \(Q_n\) has PST and can be collapsed into a weighted path. This follows earlier work by Childs et al. [25] in the context of exponential algorithmic speedup for graph search problems, observing that CTQW on unweighted layered graphs has polynomial hitting times due to their behavior on corresponding weighted paths. In the continuous-time framework, Bachman et al. [26] established a fundamental equivalence: a graph \(G\) admits perfect state transfer (PST) if and only if its quotient graph \(G/\pi\), modulo an equitable partition \(\pi\), also admits PST. This theorem provided a systematic methodology for constructing graphs where PST occurs between vertices that lack a “swapping” automorphism. This was instrumental in addressing a significant open question posed by Godsil [14], who had demonstrated that while PST implies the equality of stabilizer subgroups (\(\text{Aut}(X)_u = \text{Aut}(X)_v\)) and the identity of distance partitions (\(\Delta_u = \Delta_v\)), it remained unclear whether a global swapping automorphism was strictly necessary for the phenomenon to occur.

Bachman et al. provided the definitive counter-example to this conjecture by constructing a graph using two non-isomorphic regular graphs of the same valency and size. By joining these graphs such that the distance partition of a vertex \(a\) remained equitable, they proved that PST can occur between vertices \(a\) and \(b\) even when no automorphism maps one to the other. Their work further showed that Feder’s graphs are quotients of a \(k\)-fold Cartesian product of PST graphs and provided an extensive treatment of graphs whose quotients are weighted \(P_4\) paths. This confirmed that state transfer is governed by spectral properties and equitable structures rather than global symmetries. Subsequently, Coutinho and Godsil [7] reinforced these findings by identifying PST timings for specific quotient structures, such as the \(d\)-cube at \(t = \pi/2\) and the complete bipartite graph \(K_{2,n}\) at \(t = \pi/\sqrt{2n}\). Similarly, Yang et al. [17] used generalized path-collapsing to revisit graphs of diameter three and compare them to weighted paths \(P_4\), providing PST conditions for paths \(P_4(\gamma, \kappa)\) with middle edge weight \(\gamma\) and internal self-loops with weight \(\kappa\). Furthermore, Kim et al. [27] introduced the notion of \(s\)-pair state transfer, providing a systematic method for identifying PST by analyzing lower-dimensional quotient matrices.

While the relationship between quotient graphs and PST is well-established in the continuous-time framework, the discrete-time counterpart remains a significant research gap. This motivates our central research question “Is it possible to define a discrete-time quantum walk on a graph \(G\) such that PST occurs if and only if it occurs on the quotient graph \(G/\pi\)?” This approach offers two key advantages. First, it allows PST to be studied on smaller quotient graphs, which in turn facilitates the identification of PST in larger graphs; that is, establishing PST on a quotient graph \(G/\pi\) is equivalent to demonstrating PST on the corresponding larger graph \(G\). Second, it addresses the question raised by Godsil and Zhan in [9] “Which shunt-decompositions or embeddings give perfect state transfer?” To this end, we employ the shift operator arising from the shunt decomposition of a graph and define a reflection operator for both \(G\) and \(G/\pi\).

Moreover, Zhan [28] previously considered \(Q^*UQ\) as the transition matrix relative to \(\pi\) and provided conditions for pretty good state transfer in this context. Crucially, they showed that if \(\pi\) is an equitable partition of \(G\), then \(\pi'\) is an induced equitable partition of the line digraph \(LD(G)\). In the discrete framework, Krovi and Brun [29], studied quantum walks on quotient graphs using graph automorphisms. They demonstrated that symmetries of a subgroup \(H\) induce invariant subspaces, and restricting the walk to such subspaces yields an equivalent walk on a quotient graph obtained by identifying vertex and edge orbits. They observed that quotient graphs with significantly fewer vertices, such as those reducing to paths in hypercubes and glued trees, can lead to exponentially faster hitting times. This highlights the fundamental role of symmetry and quotient graph structure in optimizing quantum walk dynamics.

The remainder of this paper is organized as follows. Section 2 presents the preliminaries required for the subsequent developments. Section 3 establishes the relationship between the shift matrix of a graph \(G\) and its quotient graph \(G/\pi\) via the shunt-decomposition model. Subsection 3.1 facilitates the transition to arc partitions by demonstrating that \(G\) is isomorphic to the arc partition of its line digraph \(LD(G)\), establishing that \[LD(G)/\tau \cong G, \qquad LD(G/\pi)/\sigma \cong G/\pi,\] where \(\tau\) is the full arc equitable partition of \(LD(G)\), \(\pi\) is the vertex equitable partition of \(G\), and \(\sigma\) is the arc equitable partition of \(LD(G/\pi)\). Section 4 defines the transition matrices of \(G\) and its quotient \(G/\pi\). Subsection 4.1 derives the relationship between these transition matrices and establishes the condition under which PST occurs in \(G\) if and only if it occurs in \(G/\pi\). Section 5 defines the transition matrix on the line digraph \(LD(G)\) and on \(LD(G/\pi)\), and provides the condition under which \(LD(G/\pi)/\sigma\) exhibits PST if and only if \(LD(G)\) exhibits PST. Section 6 expresses the unitary evolution operator in terms of Chebyshev polynomials of the first kind, yielding a representation analogous to the Grover walk and providing criteria for PST in quotient graphs. Section 7 establishes PST on the quotient of the cycle graph \(C_{2n}\) with even \(n\) at time \(k = n/2\), and uses the results of Subsection 4.1 to derive the PST condition on the parent graph \(C_{2n}\) at \(k = n/2\). Section 8 shows that if a graph reduces to the quotient graph \(K_n^{\circlearrowleft}\), that is, the complete digraph with loops at every vertex, then under a specific characteristic matrix \(\widetilde{Q}\), PST occurs at step \(k = n\) and the walk is periodic at \(k = 2n\). Sections 9 and 10 reduce the complete bipartite digraph \(K_{n,n}^{\rightleftharpoons}\) and the circulant graph \(\operatorname{Circ}(2n, S)\) to quotient graphs isomorphic to \(K_n^{\circlearrowleft}\), and establish that the line digraphs \(LD(K_{n,n}^{\rightleftharpoons})\) and \(LD(\operatorname{Circ}(2n,S))\) exhibit PST at \(k = n\) and are periodic at \(k = 2n\). Finally, Section 11 summarizes the conclusions and outlines directions for future research. T

2 Preliminaries↩︎

2.1 Equitable Partitions↩︎

The concept of equitable partitions in algebraic graph theory has been studied for a long time; foundational results on this topic can be found in [22], [23]. More precisely, let \(G = (V, E)\) be a connected graph, let \(\pi = \{C_1, C_2, \dots, C_r\}\) be a partition of the vertex set \(V(G)\) into \(r\) cells, and let \(Q \in \{0,1\}^{|V| \times r}\) be the characteristic matrix associated with \(\pi\), which is defined as \[Q_{uj} = \begin{cases} 1, & \text{if } u \in C_j, \\ 0, & \text{otherwise.} \end{cases}\] A partition \(\pi\) is called equitable if, for all \(i, j \in \{1, \dots, r\}\), every vertex \(u \in C_i\) has the same number of neighbours in \(C_j\), denoted by \(b_{ij}\), independent of the choice of \(u\). Equivalently, if \(\pi\) is equitable, then \[\label{eq:equitable} AQ = Q\widetilde{A},\tag{1}\] where \(A\) is the adjacency matrix of \(G\) and \(\widetilde{A} \in \mathbb{R}^{r \times r}\) is the quotient matrix of \(G\) with respect to \(\pi\) [23]. The matrix \(\widetilde{A} = (b_{ij})\) records the number of edges from each vertex in cell \(C_i\) to cell \(C_j\). In particular, the diagonal entry \(b_{ii}\) counts the number of neighbours of any vertex \(u \in C_i\) that lie within the same cell \(C_i\). Note that when \(i = j\), each edge inside \(C_i\) connects two vertices of the same cell and contributes exactly \(1\) to the neighbour count of each of its endpoints; if \(b_{ii} = 0\), there are no edges within \(C_i\), and the cells are said to be independent sets. The graph \(\widetilde{G}\) with adjacency matrix \(\widetilde{A}\) is called the quotient graph of \(G\) with respect to \(\pi\), denoted \(G/\pi\).

The following lemma gives three equivalent characterisations of equitable partitions that will be used throughout.

Lemma 1 (Lemma 3.1.1  [7]). Let \(\pi\) be a partition of \(V(G)\) with normalized characteristic matrix \(Q\). Then the following statements are equivalent:

  1. The partition \(\pi\) is equitable.

  2. The column space of \(Q\), denoted \(\operatorname{col}(Q)\), is invariant under \(A\).

  3. The matrices \(A\) and \({Q}{Q}^\top\) commute.

2.2 Shunt Decomposition Walks and Perfect State Transfer (PST)↩︎

The shunt decomposition provides a systematic method for partitioning the arc set of a \(d\)-regular directed graph (where each vertex has \(d\) in-neighbors and \(d\) out-neighbors) into disjoint permutations of the vertex set. This decomposition plays a fundamental role in the construction of discrete-time quantum walks, as it allows the adjacency matrix to be expressed as a sum of permutation matrices. These matrices directly form the basis of the shift operator \(S\) and the transition matrix \(U\).

A shunt on a directed graph \(G\) is a permutation of \(V(G)\) where each vertex maps to one of its out-neighbors. For a \(d\)-regular directed graph, it comprises exactly \(d\) shunts. A shunt decomposition of \(G\) partitions its arcs into such shunts. This yields permutation matrices \(P_1, \dots, P_d \in \mathbb{C}^{n \times n}\) such that \[A = \sum_{j=1}^{d} P_j,\] where \(A\) is the adjacency matrix of \(G\). The existence of such a decomposition is guaranteed by Lemma 7.1.1 in [5].

In the discrete-time quantum walk, the state space is the Hilbert space \(\mathcal{H} = \mathbb{C}^n \otimes \mathbb{C}^d,\) where \(n = |V(G)|\) and \(d\) is the degree of the graph \(G\) (or equivalently, the coin dimension). The unitary evolution operator is given by \[U = SC,\] where \(S\) is the shift operator and \(C\) is the coin operator. Using the natural isomorphism between \(\mathbb{C}^d\otimes \mathbb{C}^n\) and \(\mathbb{C}^n\otimes \mathbb{C}^d\), the operator \(U\) can be expressed as \[U = \left( \sum_{j=1}^{d} E_{jj} \otimes P_j \right) \left( \sum_{v \in V(G)} C_v \otimes E_{vv} \right),\] where \(P_j\) are permutation matrices acting on \(\mathbb{C}^n\), \(E_{jj}\) and \(E_{vv}\) are matrix units, and each \(C_v\) is a coin operator acting on \(\mathbb{C}^d\). The shift operator \(S\) is defined by \[\label{shift95matrix95} S = \sum_{j=1}^{d}E_{jj}\otimes P_j ,\tag{2}\] which can be written in block diagonal form as \[S = \begin{pmatrix} P_{1} & 0 & \cdots & 0 \\ 0 & P_{2} & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & P_{d} \end{pmatrix},\] where \(E_{jj}\) is the \(d \times d\) matrix with a \(1\) in the \((j,j)\)-entry and zeros elsewhere. The operator \(S\) shifts the amplitude associated with label \(j\) according to the permutation \(P_j\), as described in [9] and  [5]. This framework is particularly useful for studying equitable partitions: if the permutation matrices \(P_j\) respect a partition \(\pi\), then the operator \(U\) reduces to a smaller operator \(\widetilde{U}\) acting on the quotient graph, thereby confining the quantum dynamics to a lower-dimensional invariant subspace. The state evolves in time according to \[\psi_k = U^k x.\] Following [18], we say that there is PSTfrom a unit state \(x \in \mathcal{H}\) to \(y \in \mathcal{H}\) if there exists an integer \(k\) such that \[U^k x = \gamma y,\] for some \(\gamma \in \mathbb{C}\) with \(|\gamma| = 1\). Equivalently, \[|\langle U^k x, y \rangle| = 1.\]

2.3 Chebyshev Polynomials of the First Kind↩︎

The Chebyshev polynomials of the first kind, denoted by \(T_n(p)\), form a sequence of orthogonal polynomials that play a significant role in the spectral analysis of quantum walks. They are defined recursively by \[T_0(p) = 1, \quad T_1(p) = p,\] and for \(n \geq 2\), \[T_n(p) = 2pT_{n-1}(p) - T_{n-2}(p).\] A fundamental property of these polynomials is their trigonometric representation. For \(p \in [-1,1]\), let \(p = \cos \theta\). Then, \[T_n(\cos \theta) = \cos(n\theta).\] This identity immediately implies that \[|T_n(p)| \leq 1 \quad \text{for all } p \in [-1,1],\] a property that ensures the stability of amplitudes in quantum walk dynamics.

In the context of state transfer, Kubota and Segawa [16] employed Chebyshev polynomials of the first kind to analyze perfect state transfer (PST) between vertex-type states, that is, states associated with the vertices of a graph. By expressing powers of the transition operator in terms of these polynomials, they derived necessary conditions on the eigenvalues of the underlying graph. Their results show that PST between vertex-type states can occur only if the spectral structure of the graph satisfies certain algebraic constraints determined by the roots and values of the Chebyshev polynomials \(T_n\).

3 Quantum Walk on Quotient Graphs via Shunt Decomposition↩︎

In this section, we develop a framework for the symmetrized quotient graph, denoted \(G/\pi\), using a vertex equitable partition. This approach allows us to relate the shift matrix of the parent graph and its quotient graph within the context of the shunt decomposition model.

Let \(G=(V,E)\) be a finite \(d\)-regular directed graph with adjacency matrix \(A\). Let \(\pi\) be an equitable partition of \(V\) into \(|\pi|\) cells, and let \(Q \in \mathbb{C}^{|V| \times |\pi|}\) be its normalized characteristic matrix satisfying \(Q^\top Q = I_{|\pi|}\). By definition of an equitable partition, we have the intertwining relation \(AQ = Q\widetilde{A}\), where \(\widetilde{A}\) is the adjacency matrix of the quotient graph \(G/\pi\).

Corollary 1. Let \(G\) be a \(d\)-regular directed graph with equitable partition \(\pi = \{C_1, \ldots, C_r\}\) and quotient matrix \(\widetilde{A}\). If \(|C_1| = |C_2| = \cdots = |C_r|\), then \(G/\pi\) is \(d\)-regular.

Proof. Let \(u \in C_i\). Since \(G\) is \(d\)-regular, \(u\) has exactly \(d\) out-neighbours distributed across the cells, with \(b_{ij}\) of them falling in \(C_j\), so \(\sum_{j=1}^{r} b_{ij} = d\) for all \(i\). Now fix \(C_j\). Let \(|C_1| = |C_2| = \cdots = |C_r|=\alpha\), each of the \(\alpha\) vertices in \(C_j\) has in-degree \(d\), so the total number of directed edges entering \(C_j\) is \(\alpha d\). Each cell \(C_i\) contributes exactly \(\alpha\,b_{ij}\) directed edges into \(C_j\), so \(\sum_{i=1}^{r} \alpha\,b_{ij} = \alpha d,\) we get \(\sum_{i=1}^{r} b_{ij} = d\) for all \(j\). Hence both row and column sums equal \(d\), and \(G/\pi\) is \(d\)-regular. ◻

Assume that \(G\) and \(G/\pi\) are both \(d\)-regular directed graphs, so that both \(A\) and \(\widetilde{A}\) admit a shunt decomposition of the form \[A = \sum_{j=1}^{d} P_j, \qquad \widetilde{A} = \sum_{j=1}^{d} \widetilde{P}_j,\] where \(P_j \in \{0,1\}^{|V|\times|V|}\) are permutation matrices on \(V\), and \(\widetilde{P}_j \in \mathbb{C}^{|\pi|\times|\pi|}\) are matrices acting on the quotient cells. Suppose these shunts are consistent with the partition such that for each \(j \in \{1, \dots, d\}\), the following holds: \[P_j Q = Q \widetilde{P}_j. \label{eq:intertwine}\tag{3}\] Using the definition of the shift operator 2 , together with 3 , we obtain a corresponding reduction of this operator to the quotient space.

Lemma 2. Let \(G\) be a \(d\)-regular directed graph with equitable partition \(\pi = \{C_1, \ldots, C_r\}\) of equal cell size, and normalized characteristic matrix \(Q\). Then \[(I_d \otimes Q^\top)\, S\, (I_d \otimes Q) = \widetilde{S}\] if and only if \(P_j Q = Q\widetilde{P}_j\) for each \(j = 1, \ldots, d\), where \(S = \sum_{j=1}^d E_{jj} \otimes P_j\) is the shift matrix of \(G\) and \(\widetilde{S} = \sum_{j=1}^d E_{jj} \otimes \widetilde{P}_j\) is the quotient shift matrix of \(G/\pi\).

Proof. \((\Rightarrow)\) By the equitability of \(\pi\), we have \(AQ=Q\tilde{A}\). Since by Corollary 1, the quotient graph \(G/\pi\) is \(d\)-regular. We have \(\left(\sum_{j=1}^d P_j\right) Q = Q \left(\sum_{j=1}^d \widetilde{P}_j\right)\). Assume \(P_j Q = Q\widetilde{P}_j\) for each \(j = 1,\ldots,d\). Then \[\label{permuatation} \sum_{j=1}^{d} E_{jj} \otimes P_j Q = \sum_{j=1}^{d} E_{jj} \otimes Q\widetilde{P}_j.\tag{4}\] Applying \((I_d \otimes Q^\top)\) on the left of  4 and using \(Q^\top Q = I_{|\pi|}\), we obtain \[\label{quotient95permutation} \sum_{j=1}^{d} E_{jj} \otimes Q^\top P_j Q = \sum_{j=1}^{d} E_{jj} \otimes \widetilde{P}_j.\tag{5}\] Hence by  5 the quotient shift matrix satisfies \[\widetilde{S} = \sum_{j=1}^d E_{jj} \otimes (Q^\top P_j Q) = \sum_{j=1}^d (E_{jj} \otimes Q^\top)\, S\, (E_{jj} \otimes Q) = (I_d \otimes Q^\top)\, S\, (I_d \otimes Q).\]

\((\Leftarrow)\) Assume \((I_d \otimes Q^\top)\,S\,(I_d \otimes Q) = \widetilde{S}\). Expanding via the mixed-product property and using the linear independence of \(\{E_{jj}\}\), we obtain \[Q^\top P_j Q = \widetilde{P}_j \qquad \text{for each } j.\] Left-multiplying by \(Q\) gives \(QQ^\top P_j Q = Q\widetilde{P}_j\). Since \(\pi\) is equitable, by Lemma 1 the projector \(QQ^\top\) commutes with each \(P_j\), that is, \(QQ^\top P_j = P_j QQ^\top\). Therefore \[P_j Q = Q\widetilde{P}_j, \qquad j = 1,\ldots,d. \qquad\] ◻

Corollary 2. Under the assumptions of Lemma 2, the quotient shift operator satisfies \(\widetilde{S}^2 = I\) if and only if \(\widetilde{P}_j^2 = I\) for all \(j = 1, \ldots, d\).

Proof. Recall that \(\widetilde{S} = \sum_{j=1}^d E_{jj} \otimes \widetilde{P}_j\). Using the orthogonality of the coin-basis projectors, \(E_{jj}E_{kk} = \delta_{jk}E_{jj}\), we compute \[\widetilde{S}^2 = \sum_{j=1}^d \sum_{k=1}^d (E_{jj}E_{kk}) \otimes (\widetilde{P}_j\widetilde{P}_k)= \sum_{j=1}^d E_{jj} \otimes \widetilde{P}_j^2.\] \((\Rightarrow)\) Suppose \(\widetilde{S}^2 = I_{d|\pi|}\), that is, \[\sum_{j=1}^d E_{jj} \otimes \widetilde{P}_j^2 = \sum_{j=1}^d E_{jj} \otimes I_{|\pi|}.\] Since the matrices \(\{E_{jj}\}_{j=1}^d\) are linearly independent, we may equate the \(j\)-th block on each side to conclude \(\widetilde{P}_j^2 = I_{|\pi|}\) for all \(j = 1, \ldots, d\).

\((\Leftarrow)\) Suppose \(\widetilde{P}_j^2 = I_{|\pi|}\) for all \(j = 1, \ldots, d\). Then \[\widetilde{S}^2 = \sum_{j=1}^d E_{jj} \otimes \widetilde{P}_j^2 = \sum_{j=1}^d E_{jj} \otimes I_{|\pi|} = I_d \otimes I_{|\pi|} = I_{d|\pi|}.\] This completes the proof. ◻

3.1 Transition to Arc Partitions↩︎

Definition 3. Let \(G = (V,E)\) be a directed graph, where each element of \(E\) is an ordered pair \((u,v)\), called an arc* (that is, a directed edge from \(u\) to \(v\)). The line digraph of \(G\), denoted by \(LD(G)\), is the directed graph whose vertex set is \(E(G)\), so that each vertex corresponds to an arc \((u,v)\) of \(G\). Two vertices \((u,v)\) and \((v,w)\) in \(LD(G)\) are adjacent if and only if \((u,v), (v,w) \in E(G)\).*

Thus, the direction in \(LD(G)\) encodes the natural progression of a walk along consecutive arcs of \(G\), where the terminal vertex of one arc coincides with the initial vertex of the next. To redefine the quantum walk model on arc partition, we utilize the structural relationship between a \(d\)-regular directed graph \(G\) and its line digraph \(LD(G)\). In this framework, the state space is \[\mathcal{H} = \mathbb{C}^{|E(G)|},\] where each basis state corresponds to an arc of \(G\). The evolution of the quantum walk is governed by the adjacency matrix of the line digraph, denoted by \(A_{LD(G)}\), which encodes transitions between arcs. Specifically, the walker evolves from an arc \((u,v)\) to a succeeding arc \((v,w)\), reflecting the adjacency condition in \(LD(G)\).

Let \[\pi=\{C_0,C_1,\dots,C_r\}\] be an equitable partition of \(V(G)\), and let \(Q\) be its normalized characteristic matrix of \(G\). For each pair \(0\le i,j\le r\), define \[C'_{ij}=\{(u,v)\in E(G):u\in C_i,\;v\in C_j\}.\] The nonempty sets \(C'_{ij}\) form a partition of \(E(G)\). Let \(Q'\) be the normalized characteristic matrix of this induced arc partition, defined by \[Q'_{(u,v),(i,j)}= \begin{cases} \dfrac{1}{\sqrt{|C'_{ij}|}}, & \text{if }(u,v)\in C'_{ij},\\[1ex] 0, & \text{otherwise.} \end{cases}\] Since the nonempty arc-cells are disjoint, the columns of \(Q'\) are orthonormal, and hence \[{Q'}^\top Q'=I.\]

We recall the following lemma, which holds for any graph \(G\).

Lemma 3[28]). Let \(\pi = \{C_0, C_1, \ldots, C_r\}\) be an equitable partition of \(G\). Define arc-cell \[C'_{ij} \;=\; \{(v_i, v_j)\in E(G) : v_i\in C_i,\;v_j\in C_j\}.\] Then \(\pi'=\{C'_{ij}\}_{0\le i,j\le r}\) is an equitable partition of \(LD(G)\).

Corollary 4. Let \(G\) be a \(d\)-regular digraph with equitable partition \(\pi = \{C_1, \ldots, C_r\}\) of equal cell size, and let \(Q\) be the normalized characteristic matrix of \(\pi\) . For each \(\ell = 1, \ldots, d\), let \(G_\ell = (V, E_\ell)\) be the directed graph induced by the \(\ell\)-th arc class. Define arc cells \[C'_{ij} = \{(v_i, v_j) \in E(G_\ell) : v_i \in C_i,\; v_j \in C_j\}.\] Then \(\pi'_\ell = \{C'_{ij}\}\) is an equitable arc partition of \(\mathrm{LD}(G_\ell)\). Moreover, for each \(\ell = 1, \ldots, d\), \(P_\ell\, Q = Q\, \widetilde{P}_\ell,\) where \(P_\ell\) is the shunt of \(G\) associated to the \(\ell\)-th arc class, and \(\widetilde{P}_\ell\) is the corresponding shunt of the quotient graph \(G/\pi\).

Proof. Fix \(\ell \in \{1, \ldots, d\}\). Since \(P_\ell\) is a permutation matrix, \(G_\ell\) is \(1\)-regular, each vertex \(v \in V\) has exactly one outgoing arc \((v, P_\ell(v))\), so \(A(\mathrm{LD}(G_\ell)) = P_\ell\). By Lemma 3, the arc cells \(C'_{ij}\) form an equitable partition of \(\mathrm{LD}(G_\ell)\). Any arc \((v_i, P_\ell(v_i)) \in C'_{ik}\) has its unique out-neighbor \((P_\ell(v_i), P_\ell^2(v_i))\) in \(C'_{ks}\), so the out-neighbor count into \(C'_{\ell s}\) equals \(1\) if \(\ell = k\) and \(0\) otherwise, independent of the arc chosen. Since \(\pi\) is equitable and \(P_\ell\) is consistent with the arc structure, \(P_\ell\) maps each cell \(C_k\) \((k \in \{1,\ldots,r\})\) entirely into a single cell \(C_{\sigma_\ell(k)}\), defining a well-defined permutation \(\sigma_\ell\) on \(\{1, \ldots, r\}\), and \(\widetilde{P}_\ell\) is the corresponding \(r \times r\) permutation matrix. For the \(k\)-th column \(Q_k\) of \(Q\), since \(P_\ell\) maps \(C_k\) bijectively onto \(C_{\sigma_\ell(k)}\) with \(|C_k| = |C_{\sigma_\ell(k)}| = m\), we have \(P_\ell\, Q_k = Q_{\sigma_\ell(k)} = Q\,\widetilde{P}_\ell\, e_k.\) Since this holds for every \(k \in \{1, \ldots, r\}\), we conclude \[\label{eq:shunt-intertwine} P_\ell Q = Q\widetilde{P}_\ell.\tag{6}\]  ◻

Remark 5. The intertwining relation 6 holds for any \(d\)-regular digraph admitting a shunt decomposition and an equitable partition. Equitability forces each shunt to map every cell entirely into a single cell, so Corollary 4 applies to each shunt individually. Summing over all \(d\) shunts then recovers the full quotient intertwining.

We now record a particularly useful special case, in which the arc partition of \(LD(G)\) is indexed in a structured way by the vertex partition of \(G\).

Let \(G=(V,E)\) be a finite \(d\)-regular directed graph with \(2n\) vertices and let \(\pi=\{C_1,\dots,C_n\}\) be an equitable partition of \(V\) with normalized characteristic matrix \(Q\in\mathbb{R}^{2n\times n}\). Suppose the arc set \(E\) is written as a disjoint union of \(r\) arc-classes \[E \;=\; \mathcal{A}^{(1)} \;\dot{\cup}\; \mathcal{A}^{(2)} \;\dot{\cup}\; \cdots \;\dot{\cup}\; \mathcal{A}^{(r)}.\] For each \(s=1,\dots,r\), define the induced arc-partition of \(\mathcal{A}^{(s)}\) coming from \(\pi\) by \[\pi'^{(s)} \;=\; \bigl\{\,C_{ij}^{\prime\,(s)} : 1\le i,j\le n\,\bigr\}, \qquad C_{ij}^{\prime\,(s)} \;=\; \{(u,v)\in\mathcal{A}^{(s)} : u\in C_i,\;v\in C_j\}.\] The nonempty sets \(C_{ij}^{\prime\,(s)}\) form a partition of \(\mathcal{A}^{(s)}\). Let \(m_s = |\mathcal{A}^{(s)}|\). The normalized characteristic matrix \(Q'^{(s)} \in \mathbb{R}^{m_s \times k_s}\) (where \(k_s\) is the number of nonempty cells in \(\pi'^{(s)}\)) is defined by \[Q'^{(s)}_{(u,v),(i,j)} = \begin{cases} \dfrac{1}{\sqrt{|C_{ij}^{\prime\,(s)}|}}, & \text{if } (u,v)\in C_{ij}^{\prime\,(s)},\\[1ex] 0, & \text{otherwise.} \end{cases}\] Thus each column is the normalized indicator vector of a cell, and the columns of \(Q'^{(s)}\) are orthonormal.

The combined arc partition of \(E\) into atomic cells is \[\tau_{\mathrm{atom}} \;=\; \bigcup_{s=1}^{r} \pi'^{(s)},\] that is, \(\tau_{\mathrm{atom}}\) consists of all nonempty cells \(C_{ij}^{\prime\,(s)}\) for \(1\le i,j\le n\) and \(1\le s\le r\).

A coarsening of \(\tau_{\mathrm{atom}}\) is any partition obtained by grouping together some of these atomic cells. In particular, for each vertex \(v_p \in V(G)\) with \(1\le p\le 2n\), we define \[T_p \;=\; \bigcup_{s=1}^{r} C_{i_s j_s}^{\prime\,(s)}, \qquad \text{where each } C_{i_s j_s}^{\prime\,(s)}\in \pi'^{(s)} \text{ is chosen so that all arcs in } T_p \text{ have terminal vertex } v_p.\] The resulting coarsening \[\tau \;=\; \{T_1,\, T_2,\, \dots,\, T_{2n}\}\] has exactly \(t = 2n = |V(G)|\) cells, one for each vertex of \(G\).

Figure 1: Left: K_{2,2} with arcs coloured by cell T_p (terminal vertexp). Right: quotient graph LD(G)/\tau; arrow T_p\!\to\!T_q exists whenthe head-vertex of arcs in T_p has an out-arc belonging to T_q.

Example 6. Let \(G = K_{2,2}\) with vertex set \(\{1,2,3,4\}\), bipartition \(C_1=\{1,2\}\) and \(C_2=\{3,4\}\), and arc classes consisting of all directed arcs between the two parts: \[\mathcal{A}^{(1)}=\{(3,1),(4,2),(2,3),(1,4)\},\qquad \mathcal{A}^{(2)}=\{(1,3),(2,4),(4,1),(3,2)\}.\] The atomic cells of \(\pi'^{(1)}\) and \(\pi'^{(2)}\) are: \[\begin{array}{ll} C_{21}^{\prime(1)} = \{(3,1),(4,2)\}, & C_{21}^{\prime(2)} = \{(4,1),(3,2)\}, \\[4pt] C_{12}^{\prime(1)} = \{(2,3),(1,4)\}, & C_{12}^{\prime(2)} = \{(1,3),(2,4)\}, \end{array}\] where the index \(ij\) records tail-cell \(C_i\) and head-cell \(C_j\) with \(i,j\in\{1,2\}\). The coarsening by terminal vertex gives \(\tau=\{T_1,T_2,T_3,T_4\}\) with \(t = 2n = 4\): \[T_1=\{(3,1),(4,1)\},\quad T_2=\{(4,2),(3,2)\},\quad T_3=\{(2,3),(1,3)\},\quad T_4=\{(1,4),(2,4)\}.\] Explicitly, each \(T_p\) is formed by taking from each atomic cell the unique arc whose head is vertex \(p\): \[T_1 = \{(3,1)\}\cup\{(4,1)\}, \quad T_2 = \{(4,2)\}\cup\{(3,2)\}, \quad T_3 = \{(2,3)\}\cup\{(1,3)\}, \quad T_4 = \{(1,4)\}\cup\{(2,4)\}.\] The arcs within each class are ordered so that the \(k\)-th arc of \(\mathcal{A}^{(1)}\) and the \(k\)-th arc of \(\mathcal{A}^{(2)}\) share the same tail vertex for every \(k\): \[\begin{array}{c|cc} k & \mathcal{A}^{(1)} & \mathcal{A}^{(2)} \\ \hline 1 & (3,1) & (4,1) \\ 2 & (4,2) & (3,2) \\ 3 & (2,3) & (1,3) \\ 4 & (1,4) & (2,4) \end{array}\] This alignment ensures the Kronecker factorization \(Q_\tau = I_2\otimes Q\). The adjacency matrix of \(G\) is \[A = P_{\mathcal{A}^{(1)}} + P_{\mathcal{A}^{(2)}} = \begin{pmatrix}0&0&1&1\\0&0&1&1\\1&1&0&0\\1&1&0&0\end{pmatrix}.\] Each cell \(T_p\) has size \(2\), so the normalized characteristic matrix, with rows ordered as \(\mathcal{A}^{(1)}\) then \(\mathcal{A}^{(2)}\), that is \((3,1),(4,2),(2,3),(1,4),(4,1),(3,2),(1,3),(2,4)\), is \[Q_\tau = \frac{1}{\sqrt{2}}\begin{pmatrix} 1&0&0&0\\ 0&1&0&0\\ 0&0&1&0\\ 0&0&0&1\\ 1&0&0&0\\ 0&1&0&0\\ 0&0&1&0\\ 0&0&0&1\; \end{pmatrix} = I_2\otimes Q,\] where columns correspond to \(T_1, T_2, T_3, T_4\) respectively. The adjacency matrix of \(LD(G)\), with arcs ordered as \((3,1),(4,2),(2,3),(1,4),(4,1),(3,2),(1,3),(2,4)\), is \[A_{LD}=\begin{pmatrix} 0&0&0&1&0&0&1&0\\ 0&0&1&0&0&0&0&1\\ 1&0&0&0&0&1&0&0\\ 0&1&0&0&1&0&0&0\\ 0&0&0&1&0&0&1&0\\ 0&0&1&0&0&0&0&1\\ 1&0&0&0&0&1&0&0\\ 0&1&0&0&1&0&0&0 \end{pmatrix}.\] Computing \(Q_\tau^\top A_{LD(G)}\,Q_\tau\) gives \[B = Q_\tau^\top A_{LD(G)}\,Q_\tau =\begin{pmatrix}0&0&1&1\\0&0&1&1\\1&1&0&0\\1&1&0&0\end{pmatrix} = A (\text{see Figure}~\ref{fig:K22-partition}),\] confirming \[Q_\tau^\top A_{LD(G)}\,Q_\tau = A \qquad \text{and hence} \qquad A_{LD(G)}\,Q_\tau = Q_\tau\,A.\]

Lemma 4. Let \(\pi = \{C_1, \dots, C_n\}\) be an equitable partition of \(V(G)\), where \(|V(G)| = 2n\) and \(G\) is a \(d\)-regular directed graph. For each vertex \(v_p \in V(G)\) with \(1 \le p \le 2n\), define \[T_p \;=\; \bigcup_{s=1}^{r} C_{i_s j_s}^{\prime\,(s)}, \qquad 1 \le i_s,\, j_s \le n,\] where for each \(s\), the cell \(C_{i_s j_s}^{\prime\,(s)} \in \pi'^{(s)}\) is chosen so that every arc in \(T_p\) has terminal vertex \(v_p\). Then the collection \[\tau = \{T_1,\, T_2,\, \dots,\, T_{2n}\}\] is an equitable arc partition of the line digraph \(LD(G)\). Moreover, if \(Q_\tau\) denotes the normalized characteristic matrix of \(\tau\), then \[A_{LD(G)}\, Q_\tau = Q_\tau\, A,\] where \(A_{LD(G)}\) is the adjacency matrix of \(LD(G)\) and \(A\) is the adjacency matrix of \(G\).

Proof. Let \((v_i, v_p)\) be any arc of \(G\) lying in cell \(T_p\), and let \(T_q\) be any cell of \(\tau\), where \(1\le p,q\le 2n\). We count the neighbors of \((v_i, v_p)\) in \(T_q\) inside \(LD(G)\). By definition of the line digraph, an arc \((v_\ell, v_m)\) is adjacent to \((v_i, v_p)\) in \(LD(G)\) if and only if \(v_\ell = v_p\). Therefore the neighbors of \((v_i,v_p)\) lying in \(T_q\) are exactly \(S \;=\; \{(v_\ell, v_m) \in T_q : v_\ell = v_p\}.\) By construction, every arc in \(T_q\) has terminal vertex \(v_q\), so every arc in \(T_q\) has the form \((v_\ell, v_q)\) for some \(v_\ell\). Imposing \(v_\ell = v_p\) reduces \(S\) to \(S \;=\; \{(v_p, v_q) \in T_q\} \;=\; \{(v_p, v_q) \in E(G)\}.\) Hence \[\label{eq9520} |S| \;=\; A_{pq},\tag{7}\] where \(A_{pq}\) is the \((p,q)\)-entry of the adjacency matrix \(A\) of \(G\). Since \(|S| = A_{pq}\) depends only on \(p\) and \(q\), and not on the particular arc \((v_i, v_p)\) chosen within \(T_p\), every arc in \(T_p\) has exactly \(A_{pq}\) neighbors in \(T_q\). This holds for all \(1\le p,q\le 2n\), so \(\tau\) is an equitable partition of \(LD(G)\).

Now let \(Q_\tau\) be the normalized characteristic matrix of \(\tau\). For any equitable partition the standard identity gives \[\label{eq9521} A_{LD(G)}\,Q_\tau \;=\; Q_\tau\,B,\tag{8}\] where \(B\) is the quotient matrix with \((p,q)\)-entry equal to the number of neighbors in \(T_q\) of any arc in \(T_p\). Thus from 7 , we have \[B_{pq} \;=\; |S| \;=\; A_{pq} \qquad \text{for all } 1\le p,q\le 2n,\] so \(B = A\). Substituting in 8 gives \[A_{LD(G)}\,Q_\tau \;=\; Q_\tau\,A.\] ◻

Now we extend our analysis by performing an arc partition on the quotient graph \(G/\pi\). This allows us to further reduce the dimensionality of the quantum walk by exploiting symmetries remaining in the quotient structure.

Lemma 5. Let \(\pi = \{C_1, \dots, C_n\}\) be an equitable partition of \(V(G)\), where \(|V(G)| = 2n\) and \(G\) is \(d\)-regular directed graph, and let \(G/\pi\) be the quotient digraph with adjacency matrix \(\widetilde{A}\). Define \[\sigma_j \;=\; \{\,(C_i, C_j)\in E({G/\pi}) : 1 \le i \le n\,\}, \qquad j = 1,\dots,n,\] that is, \(\sigma_j\) consists of all arcs of \({G/\pi}\) with terminal vertex \(C_j\). Then \[\sigma = \{\sigma_1,\dots,\sigma_n\}\] is an equitable arc partition of the line digraph \(LD({G/\pi})\). Moreover, if \(\widetilde{Q}\) is the normalized characteristic matrix of \(\sigma\), then \[A_{LD(G/\pi)}\,\widetilde{Q} \;=\; \widetilde{Q}\,\widetilde{A}.\]

Proof. The proof follows the same argument as the proof of Lemma 4. ◻

Example 7. Let \(G = C_4\) and consider the vertex partition \(\pi = \{\{1,3\},\{2,4\}\} = \{C_1, C_2\}, \quad d = 2.\) The normalized characteristic matrix of this partition is \[Q = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 & 0\\ 0 & 1\\ 1 & 0\\ 0 & 1 \end{pmatrix},\] so the quotient adjacency matrix is \[A(G/\pi) = Q^\top A\, Q = \begin{pmatrix}0 & 2\\ 2 & 0\end{pmatrix}.\] The quotient graph \(G/\pi\) has two vertices \(C_1, C_2\) with two arcs in each direction. Label the four arcs sequentially as \[b_1 = (C_1, C_2)^{(1)}, \quad b_2 = (C_2, C_1)^{(1)}, \quad b_3 = (C_1, C_2)^{(2)}, \quad b_4 = (C_2, C_1)^{(2)},\] ordered as \(b_1, b_2, b_3, b_4\) ( see Figure 2). The arcs alternate terminal vertex in this ordering: \[\begin{array}{c|cc} \text{arc} & \text{direction} & \text{terminal vertex}\\ \hline b_1 & C_1 \to C_2 & C_2\\ b_2 & C_2 \to C_1 & C_1\\ b_3 & C_1 \to C_2 & C_2\\ b_4 & C_2 \to C_1 & C_1 \end{array}\] Coarsen these four arcs into two cells by terminal vertex: \[\sigma_1 = \{b_1, b_3\} \quad\text{(terminal vertex }C_2\text{)},\qquad \sigma_2 = \{b_2, b_4\} \quad\text{(terminal vertex }C_1\text{)}.\] Each cell has size \(2\), so the normalized characteristic matrix of \(\sigma = \{\sigma_1, \sigma_2\}\), with rows ordered as \(b_1, b_2, b_3, b_4\) and columns as \(\sigma_1, \sigma_2\), is \[\widetilde{Q} = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 & 0\\ 0 & 1\\ 1 & 0\\ 0 & 1 \end{pmatrix}.\] In \(LD(G/\pi)\), an arc with head \(C_j\) points to all arcs with tail \(C_j\), so every vertex has out-degree \(2\). Under the ordering \(b_1, b_2, b_3, b_4\), the adjacency matrix of \(LD(G/\pi)\) is therefore \[A_{LD(G/\pi)} = \begin{pmatrix} 0 & 1 & 0 & 1\\ 1 & 0 & 1 & 0\\ 0 & 1 & 0 & 1\\ 1 & 0 & 1 & 0 \end{pmatrix}.\] We verify the intertwining relation directly: \[A_{LD(G/\pi)}\,\widetilde{Q} = \frac{1}{\sqrt{2}} \begin{pmatrix} 0&1&0&1\\ 1&0&1&0\\ 0&1&0&1\\ 1&0&1&0 \end{pmatrix} \begin{pmatrix} 1&0\\ 0&1\\ 1&0\\ 0&1 \end{pmatrix} = \frac{1}{\sqrt{2}} \begin{pmatrix} 0&2\\ 2&0\\ 0&2\\ 2&0 \end{pmatrix}.\] On the other hand, \[\widetilde{Q}\,A(G/\pi) = \frac{1}{\sqrt{2}} \begin{pmatrix} 1&0\\ 0&1\\ 1&0\\ 0&1 \end{pmatrix} \begin{pmatrix}0&2\\ 2&0\end{pmatrix} = \frac{1}{\sqrt{2}} \begin{pmatrix} 0&2\\ 2&0\\ 0&2\\ 2&0 \end{pmatrix}.\] Since both sides agree, we confirm \[A_{LD(G/\pi)}\,\widetilde{Q} = \widetilde{Q}\,A(G/\pi).\] We also recover the quotient adjacency matrix: \[\widetilde{Q}^\top A_{LD(G/\pi)}\,\widetilde{Q} = \frac{1}{2} \begin{pmatrix}1&0&1&0\\ 0&1&0&1\end{pmatrix} \begin{pmatrix} 0&2\\ 2&0\\ 0&2\\ 2&0 \end{pmatrix} = \begin{pmatrix}0&2\\ 2&0\end{pmatrix} = A(G/\pi),\] confirming that the nested quotient recovers the two-vertex multigraph.

Figure 2: Left: quotient graph G/\pi with arcs coloured by cell;\sigma_1 (violet) groups arcs b_1, b_3 with terminal vertexC_2, and \sigma_2 (teal) groups arcs b_2, b_4 with terminalvertex C_1.Right: line digraph LD(G/\pi); every arc in \sigma_j has thesame out-neighbours.

Theorem 8. Let \(G = (V, E)\) be a \(d\)-regular directed graph with \(|V(G)| = 2n\), and let \[\pi = \{C_1, \dots, C_n\}\] be an equitable partition of \(V(G)\) with quotient digraph \(G/\pi\). Then there exist equitable arc partitions \(\tau\) of \(LD(G)\) and \(\sigma\) of \(LD(G/\pi)\), obtained by grouping arcs according to their terminal vertices, such that \[LD(G)/\tau \;\cong\; G \qquad \text{and} \qquad LD(G/\pi)/\sigma \;\cong\; G/\pi.\]

Proof. The result follows directly from the preceding Lemma 4 and Lemma 5. The first isomorphism \[LD(G)/\tau \cong G\] is established by the construction of the arc partition \(\tau\), where arcs are grouped according to their terminal vertices. Similarly, the second isomorphism \[LD(G/\pi)/\sigma \cong G/\pi\] follows from the corresponding induced arc partition \(\sigma\) on the quotient graph. This construction shows that forming the line digraph and then taking the corresponding arc partition yields a graph isomorphic to the original graph (or its quotient), completing the proof. ◻

4 Case I: Unitary Evolution on \(G\) and \(G/\pi\) under the Assumption \(Q = \widetilde{Q}\) and \(Q_\tau = I_d \otimes \widetilde{Q}\)↩︎

Figure 3: Commutative diagram illustrating the structural relationships betweenG, LD(G), and their equitable quotients, as established inTheorem 8.

In this section, we formalize the transition operator arising from the arc-partitioned structure induced by a shunt decomposition. Using the partitions introduced above, we describe the unitary evolution on the line digraph \(LD(G)\) and its reduced form on the quotient space. By Theorem 8, the arc partitions \(\tau\) and \(\sigma\) yield the identifications \[LD(G)/\tau \;\cong\; G, \qquad LD(G/\pi)/\sigma \;\cong\; G/\pi,\] showing that the arc-based dynamics on \(LD(G)\) reduce naturally to vertex dynamics on \(G\), and similarly for the quotient graph \(G/\pi\). The interplay between the line digraph construction, the equitable partitions, and the resulting isomorphisms is captured in the commutative diagram of Figure 3. Thus, the arc-based dynamics on \(LD(G)\) reduce to vertex dynamics on \(G\), and similarly for the quotient graph.

Let \(\widetilde{A} \in \mathbb{C}^{n \times n}\), where \(n = |\pi|\) denotes the number of cells in the partition \(\pi = \{C_1, \ldots, C_r\}\), each cell of equal size. Its entries are given by \[\widetilde{A}_{ij} = \begin{cases} 1, & \text{if there exists an arc from } C_i \text{ to } C_j \text{ in } G/\pi,\\ 0, & \text{otherwise} \end{cases}\] This reduced matrix governs the effective evolution on the quotient space and provides a lower-dimensional representation of the dynamics.. Since \(G\) is \(d\)-regular directed graph with \(|\pi|\) cells of equal size, each vertex \(C_i\) of \(G/\pi\) has out-degree \(d\), and hence \[|\mathcal{A}(G/\pi)| \;=\; d \cdot |\pi|,\] where \(\mathcal{A}(G/\pi)\) denotes the arc set of \(G/\pi\). This reflects Corollary 1 that the quotient graph inherits the \(d\)-regularity of \(G\), with each cell \(C_i\) sending exactly \(d\) arcs to other cells, one per shunt class.

The unitary evolution operator or the transition operator for the quotient graph \(G/\pi\) is defined as \[\widetilde{U} \;=\; \mathcal{U}(G/\pi) \;=\; \widetilde{S}\,(2\widetilde{Q}\widetilde{Q}^\top - I) \;\in\; \mathbb{C}^{|\mathcal{A}(G/\pi)| \times |\mathcal{A}(G/\pi)|},\] where \(\widetilde{S}\) is the shift operator on the arcs of \(G/\pi\) and \(\widetilde{Q}\) is the normalized characteristic matrix of the arc partition \(\sigma\) of \(LD(G/\pi)\). Since \(|\mathcal{A}(G/\pi)| = d\,|\pi|\), this is a square matrix of size \(d|\pi| \times d|\pi|\) acting on the quotient arc space \(\mathbb{C}^{\mathcal{A}(G/\pi)}\), with one coordinate per arc of \(G/\pi\). We refer to the discrete quantum walks governed by \(\widetilde{U}\) as shunt decomposition walks. To verify the unitarity of \(\widetilde{U}\), we examine its components. Since each shunt \(P_j\) is a permutation matrix, it is unitary and satisfies the intertwining relation \(P_j Q = Q \widetilde{P}_j\), where \(Q\) is the normalized vertex characteristic matrix. Given \({Q}^\top {Q} = I_n\), it follows that for every \(j\): \[(Q^\top P_j Q)(Q^\top P_j Q)^\top = (Q^\top Q \widetilde{P}_j)(Q^\top Q \widetilde{P}_j)^\top = \widetilde{P}_j \widetilde{P}_j^\top = I_n.\] Thus, each block \(Q^\top P_j Q\) is unitary. Using the properties of the Kronecker product and the identity \(E_{jj}E_{ii} = \delta_{ji}E_{jj}\), the reduced shift operator \(\widetilde{S}\) satisfies: \[\label{shift32matrix32unitary32opertaor} \widetilde{S}\widetilde{S}^\top = \sum_{j,i}E_{jj}E_{ii} \otimes (Q^\top P_j Q)(Q^\top P_i Q)^\top = \sum_{j}E_{jj} \otimes I_n = I_{|\pi|} \otimes I_n .\tag{9}\] Hence, \(\widetilde{S}\) is unitary. Similarly, the reduced reflection operator \[\label{quotient32reflection} \widetilde{R} = 2\widetilde{Q}\widetilde{Q}^\top - I\tag{10}\] is Hermitian. Since \(\widetilde{Q}\widetilde{Q}^\top\) is an orthogonal projector, we have: \[\widetilde{R}^2 = (2\widetilde{Q}\widetilde{Q}^\top - I)^2 = 4(\widetilde{Q}\widetilde{Q}^\top)^2 - 4\widetilde{Q}\widetilde{Q}^\top + I = I,\] implying that \(\widetilde{R}\) is an involution and thus unitary. Consequently, \(\widetilde{U} = \widetilde{S}\widetilde{R}\) is the product of two unitary matrices, and hence \(\widetilde{U}\) is unitary. The reflection operator on the full arc space \(\mathcal{A}(G)\) is defined as \[\label{reflection32operator322} R = 2\,Q_\tau(\widetilde{Q}\widetilde{Q}^\top)Q_\tau^\top - I,\tag{11}\] where \(Q_\tau\) is the normalized characteristic matrix of the arc partition \(\tau\) induced by the shunt decomposition, and \(\widetilde{Q}\) is the normalized characteristic matrix of the arc partition \(\sigma\) of \(LD(G/\pi)\). The matrix \(P = Q_\tau(\widetilde{Q}\widetilde{Q}^\top)Q_\tau^\top\) is an orthogonal projection onto the subspace spanned by the columns of \(Q_\tau\widetilde{Q}\), satisfying \(P^2 = P\) and \(P^\top = P\). The operator \(R = 2P - I\) is then the reflection through this projection subspace, which maps any vector \(v\) to \(2Pv - v\), reversing the component of \(v\) orthogonal to the subspace while preserving the component within it. In particular, \(R\) satisfies \(R^2 = I\) and \(R^\top = R\), confirming that \(R\) is both unitary and self-adjoint. The operator \(R\) acts as a reflection about the subspace spanned by the columns of \(Q_\tau\), and is unitary by construction.

Using this, we define the transition matrix \(U\) for the parent graph \(G\) on the full arc space \(\mathcal{A}(G)\) as \[U = SR = S\bigl(2\,Q_\tau(\widetilde{Q}\widetilde{Q}^\top)Q_\tau^\top - I\bigr) \;\in\; \mathbb{C}^{|\mathcal{A}(G)|\times|\mathcal{A}(G)|},\] where \(S = \displaystyle\sum_{j=1}^{d} P_j \otimes E_{jj}\) is the shift operator on \(\mathcal{A}(G)\), with \(P_j\) the permutation matrix of the \(j\)-th arc class and \(E_{jj}\) the \(j\)-th standard basis matrix, and \(|\mathcal{A}(G)|\) denotes the total number of arcs in \(G\). Thus \(U\) is a square unitary matrix acting on the arc space \(\mathbb{C}^{|\mathcal{A}(G)|}\), with one coordinate per arc of \(G\). This framework allows the analysis of high-dimensional walks to be conducted efficiently through the reduced operator \(\widetilde{U}\). In what follows, we illustrate this construction with examples and establish the precise relationship between \(\widetilde{U}\) and \(U\).

4.1 Relation between \(U\) and \(\widetilde{U}\)↩︎

Ordering the arcs of \(\mathcal{A}(G)\) such that all elements of the arc-subsets \(\mathcal{A}^{(1)}, \mathcal{A}^{(2)}, \dots, \mathcal{A}^{(d)}\) are grouped sequentially, the normalized characteristic matrix \(Q_{\tau}\) of the induced arc-partition \(\tau\) factorizes as: \[Q_{\tau} = I_d \otimes \widetilde{Q} ,\] where \(\widetilde{Q}\) is the normalized characteristic matrix of the quotient arc-partition of \(LD(G/\pi)\), and \(I_d\) is the identity matrix on the arc-class index. Similarly, by ordering the arcs of the nested quotient \(LD(G/\pi)/\sigma\), such that the normalized characteristic matrix of the induced arc-partition \(\sigma\) satisfies \(\widetilde{Q} = Q\), where \(Q\) is the characteristic matrix of the original vertex partition \(\pi\). From Equation 1 and Lemma 5, using \(\widetilde{Q} = Q\), we have: \[\label{eq:spectral-equiv} \widetilde{Q}^\top \!\left(A - A_{LD(G/\pi)}\right)\widetilde{Q} = O.\tag{12}\] where \(O\) denotes the zero matrix. This identity states that the matrix \(M = A - A_{LD(G/\pi)}\) satisfies \(\widetilde{Q}^\top M\,\widetilde{Q} = O\), meaning that for every pair of cells \(C_i, C_j \in \pi\), the total number of arcs from \(C_i\) to \(C_j\) counted in \(A\) equals the total number counted in \(A_{LD(G/\pi)}\): \[\sum_{u \in C_i}\sum_{v \in C_j} A_{uv} \;=\; \sum_{u \in C_i}\sum_{v \in C_j} (A_{LD(G/\pi)})_{uv}.\] In other words, even if \(A\) and \(A_{LD(G/\pi)}\) differ entry by entry, their cell-to-cell arc counts are identical under \(\pi\). From Equation 12 we identify two structural cases:

  1. \(A = A_{LD(G/\pi)}\), that is, the adjacency matrix of the parent graph \(G\) and the adjacency matrix of the line digraph quotient \(LD(G/\pi)\) coincide entry by entry. The example of \(C_4\) with partition \(\pi = \{\{1,3\},\{2,4\}\}\) illustrates this case in Example 7: we computed \[A_{LD(C_4/\pi)} = \begin{pmatrix}0&1&0&1\\1&0&1&0\\0&1&0&1\\1&0&1&0\end{pmatrix} = A(C_4),\] so \(M = O\) identically, and Equation 12 holds trivially.

  2. \(A \neq A_{LD(G/\pi)}\) but \(\mathrm{Range}(\widetilde{Q}) \subseteq \mathrm{Null}(M)\), where \(M = A - A_{LD(G/\pi)}\). In this case the two matrices differ in individual entries, but for every pair of cells \(C_i, C_j\) the number of arcs from \(C_i\) to \(C_j\) is the same in both \(A\) and \(A_{LD(G/\pi)}\). The difference \(M\) annihilates every column of \(\widetilde{Q}\), so \(M\widetilde{Q} = O\) and hence \(\widetilde{Q}^\top M \widetilde{Q} = O\).

Proposition 9. Let \(G\) be a \(d\)-regular digraph on \(2n\) vertices. Let \(\pi\) an equitable partition of \(V(G)\) into \(n\) cells, and \(\sigma\) an equitable partition of the arcs of \(LD(G/\pi)\) into \(n\) cells. If \(LD(G/\pi) \cong G\), then \(Q = \widetilde{Q}\); however, the converse does not hold in general.

Proof. Since \(\pi\) is an equitable vertex partition of \(G\), there exists a normalized characteristic matrix \(Q\) such that \[\label{eq:vertex} AQ = Q\widetilde{A},\tag{13}\] where \(A\) is the adjacency matrix of \(G\) and \(\widetilde{A}\) is the quotient matrix of \(G/\pi\). Since \(\sigma\) is an equitable arc partition of \(L(G/\pi)\), there exists a normalized characteristic matrix \(\widetilde{Q}\) such that \[\label{eq:arc} A_{LD(G/\pi)}\,\widetilde{Q} = \widetilde{Q}\,\widetilde{A},\tag{14}\] where \(\widetilde{A}\) is the quotient matrix of \(G/\pi\) by Theorem 8. Now suppose \(LD(G/\pi)\cong G\), so that \(A_{LD(G/\pi)}=A\). Substituting into Equation 14 gives \(A\widetilde{Q} = \widetilde{Q}\,\widetilde{A}.\) Comparing with Equation 13 , both \(Q\) and \(\widetilde{Q}\) satisfy the same Equation, and since the normalized characteristic matrix of an equitable partition is unique, we conclude that \[Q = \widetilde{Q}.\] For the converse, \(Q = \widetilde{Q}\) does not imply \(LD(G/\pi) \cong G\) in general. As a counterexample, see Example 21. ◻

Proposition 10. Let \(G\) be a \(d\)-regular directed graph on \(2n\) vertices, and let \(\pi\) be an equitable partition of \(V(G)\) into cells of equal size. Let \(\tau\) and \(\sigma\) be the arc partitions of \(LD(G)\) and \(LD(G/\pi)\) into cells of equal size, respectively, with normalized characteristic matrices \(Q_\tau\) and \(\widetilde{Q}\) satisfying \[Q_\tau=I_d\otimes \widetilde{Q}, \qquad \widetilde{Q}={Q} .\] Let \(U = SR\) and \(\widetilde{U} = \widetilde{S}\,\widetilde{R}\) be the unitary evolution operators on \(G\) and \(G/\pi\), respectively. Then the following hold:

  1. \(R\, Q_\tau = Q_\tau\, \widetilde{R}\).

  2. For all integers \(k \geq 0\), \(\widetilde{U}^k = Q_\tau^\top\, U^k\, Q_\tau.\)

Proof. (a) Since \(Q_{\tau}^{\top}Q_{\tau} = I\), by Equations 9 and 10 , we have \[R Q_{\tau} = (2Q_{\tau}(\widetilde{Q} \widetilde{Q}^\top)Q_{\tau}^{\top} - I)Q_{\tau} = Q_{\tau}(2\widetilde{Q} \widetilde{Q}^\top - I) = Q_{\tau}\widetilde{R}.\] (b) By Lemma 2 and Corollary 4, and using \(Q_{\tau} = I_d \otimes \widetilde{Q},\quad Q=\widetilde{Q}\), we have

\[\widetilde{U} = \widetilde{S} \widetilde{R} = (I_d \otimes \widetilde{Q}^\top)\, S\, (I_d \otimes \widetilde{Q})\, \widetilde{R}=Q_\tau SQ_\tau \widetilde{R}.\] Using part (a), we have \[\widetilde{U} = Q_\tau^{\top} U Q_\tau.\] By Lemma 1, \(Q_\tau Q_\tau^{\top}\) commutes with \(U\), and hence \(\operatorname{Im}(Q_\tau)\) is invariant under \(U\). This gives \(U Q_\tau = Q_\tau \widetilde{U}\). Applying this relation inductively yields \[\label{eq:Uk-intertwine} U^k Q_\tau = Q_\tau \widetilde{U}^k \quad \text{for all } k \geq 0.\tag{15}\] Multiplying both sides of 15 on the left by \(Q_\tau^{\top}\) and using the isometry property \(Q_\tau^{\top}Q_\tau = I\), we obtain \[Q_\tau^{\top}\, U^k\, Q_\tau = \widetilde{U}^k \quad \text{for all } k \geq 0.\] ◻

The assumptions and propositions established above lead to the following equivalence between PST in the parent graph \(G\) and its quotient graph \(G/\pi\), as made precise in Theorem 11 below.

Theorem 11. Let \(G\) be a \(d\)-regular directed graph on \(2n\) vertices, and let \(\pi\) be an equitable partition of \(V(G)\) into cells of equal size. Let \(\tau\) and \(\sigma\) be the arc partitions of \(LD(G)\) and \(LD(G/\pi)\) into cells of equal size, respectively, with normalized characteristic matrices \(Q_\tau\) and \(\widetilde{Q}\) satisfying \[Q_\tau=I_d\otimes \widetilde{Q}, \qquad \widetilde{Q}={Q} .\] Then \(U\) exhibits PST from \(Q_\tau x\) to \(Q_\tau y\) at time \(k\) if and only if \(\widetilde{U}\) exhibits PST from \(x\) to \(y\) at time \(k\), for all \(x,y \in \operatorname{Im}(\widetilde{Q})\).

Proof. Since \(\operatorname{Im}(Q_\tau)\) is \(U\)–invariant and \(Q_\tau\) has orthonormal columns, we have the basic relation from Proposition 10 for all \(k\ge0\), \[\label{eq4644620} \widetilde{U}^k = Q_\tau^\top U^k Q_\tau,\qquad U^k Q_\tau = Q_\tau\widetilde{U}^k.\tag{16}\] (\(\Rightarrow\)) Assume that \(\widetilde{U}\) exhibits PST at time \(k\), that is, \[\widetilde{U}^k x = y, \quad \text{for some } x,y \in \operatorname{Im}(\widetilde{Q}).\] From Equation 16 , we obtain \[U^k Q_\tau x = Q_\tau \widetilde{U}^k x = Q_\tau y.\] Hence, \(U\) exhibits PST from \(Q_\tau x\) to \(Q_\tau y\) at time \(k\).

(\(\Leftarrow\)) Conversely, suppose that \(U\) exhibits PST at time \(k\), that is, \[U^k Q_\tau x = Q_\tau y, \quad \text{for some } x,y \in \operatorname{Im}(\widetilde{Q}).\] Multiplying on the left by \(Q_\tau^{\top}\) and using \(Q_\tau^{\top} Q_\tau = I\), together with 16 , we obtain \[\widetilde{U}^k x = Q_\tau^{\top} U^k Q_\tau x = Q_\tau^{\top} Q_\tau y = y.\] Thus \(\widetilde{U}\) exhibits PST from \(x\) to \(y\) at time \(k\). Therefore, PST in the quotient system is equivalent to PST in the original system restricted to the invariant subspace \(\operatorname{Im}(Q_\tau)\). ◻

Corollary 12. Under the assumptions of Theorem 11, the quotient graph \(LD(G/\pi)/\sigma\) exhibits PST if and only if \(LD(G)\tau\) exhibits PST.

Proof. By Theorem 8, we have the isomorphisms \(LD(G)/\tau \;\cong\; G \quad \text{and} \quad LD(G/\pi)/\sigma \;\cong\; G/\pi,\) from which the result follows. ◻

Lemma 6. Let \(G\) be a \(d\)-regular directed graph on \(2n\) vertices. Let \[\tau = \{T_1, \dots, T_{2n}\}, \qquad \pi = \{C_1, \dots, C_{n}\}, \qquad \sigma = \{\sigma_1, \dots, \sigma_{n}\}\] be, respectively, an equitable arc partition of \(LD(G)\), an equitable vertex partition of \(G\), and an equitable arc partition of \(LD(G/\pi)\), with normalized characteristic matrices \(Q_\tau\), \(Q\), and \(\widetilde{Q}\). If \(A(G) = A(LD(G/\pi))\) and \(Q_\tau = \widetilde{Q} \otimes I_d,\) then \(G\) is \(2\)-regular. The converse does not hold in general.

Proof. Since \(A(G) = A(LD(G/\pi))\), the graphs \(G\) and \(L(G/\pi)\) are identical, and in particular have the same vertex set. Therefore \[|V(G)| = |V(L(G/\pi))| = |\mathcal{A}(G/\pi)|,\] which gives \(|\mathcal{A}(G/\pi)| = nd\). Now consider the dimensions of each side of \(Q_\tau = \widetilde{Q}\otimes I_d\). Since \(|\mathcal{A}(G)|=2nd\) and \(\tau\) partitions \(\mathcal{A}(G)\) into \(n\) cells, \(Q_\tau \in \mathbb{R}^{2nd \times 2n}.\) Since \(|\mathcal{A}(G/\pi)|=nd\) and \(\sigma\) partitions \(\mathcal{A}(G/\pi)\) into \(n\) cells, \(\widetilde{Q} \in \mathbb{R}^{nd \times n}, \quad Q_\tau= I_d\otimes \widetilde{Q} \in \mathbb{R}^{nd^2 \times nd}.\) For the two sides to be equal, their column dimensions must agree, thus \(2n = nd \implies d = 2.\) Therefore \(G\) is \(2\)-regular. For the converse, \(G\) being \(2\)-regular and satisfying \(Q_\tau = I_2 \otimes \widetilde{Q}\) does not imply \(A(G)=A(LD(G/\pi))\) in general; a counterexample is provided in Example 13. ◻

Example 13. Let \(G\) be a directed graph with vertex set \(V(G)=\{1,2,3,4,5,6\}\) and arc set \(\mathcal{A}(G)=\{1\to2,1\to5,\;2\to3,2\to6,\;3\to1,3\to4,\;4\to5,4\to2,\;5\to6,5\to3,\;6\to4,6\to1\}.\) Then \(G\) is \(2\)-regular, since every vertex has in-degree and out-degree equal to \(2\). The adjacency matrix of \(G\) is \[A(G)= \begin{pmatrix} 0&1&0&0&1&0\\ 0&0&1&0&0&1\\ 1&0&0&1&0&0\\ 0&1&0&0&1&0\\ 0&0&1&0&0&1\\ 1&0&0&1&0&0 \end{pmatrix}.\] Consider the partition \(\pi=\{\{1,4\},\{2,5\},\{3,6\}\}.\) Each vertex in a cell has the same number of out-neighbors in every other cell. Hence \(\pi\) is equitable. Its normalized characteristic matrix is \[Q= \frac{1}{\sqrt{2}} \begin{pmatrix} I_3\\ I_3 \end{pmatrix}.\] The quotient graph \(G/\pi\) has three nodes \(C_1,C_2,C_3\) with two parallel arcs between consecutive nodes: \(C_1 \to C_2,\quad C_2 \to C_3,\quad C_3 \to C_1.\) Label the arcs as \(b_1,b_2: C_1 \to C_2,\quad b_3,b_4: C_2 \to C_3,\quad b_5,b_6: C_3 \to C_1.\) The line digraph \(LD(G/\pi)\) has adjacency matrix (in the order \(b_1,\dots,b_6\)) \[A_{LD(G/\pi)}= \begin{pmatrix} 0&0&1&1&0&0\\ 0&0&1&1&0&0\\ 0&0&0&0&1&1\\ 0&0&0&0&1&1\\ 1&1&0&0&0&0\\ 1&1&0&0&0&0 \end{pmatrix}.\] Define the arc partition \(\sigma=\{\{b_1,b_2\},\{b_3,b_4\},\{b_5,b_6\}\}.\) Its normalized characteristic matrix is \[\widetilde{Q}= \frac{1}{\sqrt{2}} \begin{pmatrix} 1&0&0\\ 1&0&0\\ 0&1&0\\ 0&1&0\\ 0&0&1\\ 0&0&1 \end{pmatrix}.\]

Then \[\widetilde{Q}_\sigma^\top A_{LD(G/\pi)} \widetilde{Q}_\sigma = \begin{pmatrix} 0&2&0\\ 0&0&2\\ 2&0&0 \end{pmatrix} = \widetilde{A}.\]

Although \(A(G)\) and \(A_{LD(G/\pi)}\) are both \(6\times6\), they are not equal. Let \[M = A(G) - A_{LD(G/\pi)} \neq 0.\] However, \[\widetilde{Q}^{\top}A(G)\widetilde{Q} = \widetilde{Q}^{\top}A_{LD(G/\pi)}\widetilde{Q} = \begin{pmatrix}0&2&0\\0&0&2\\2&0&0\end{pmatrix}.\] Hence, \[\widetilde{Q}^{\top} M \widetilde{Q} = 0 \quad \text{while} \quad M \neq 0,\] showing that the two matrices agree at the quotient level but differ entry-wise.

5 Case II: Unitary Evolution on \(LD(G)\) and \(LD(G/\pi)/\sigma\) under the Assumption \(Q \neq \widetilde{Q}\) and \(Q_\tau \neq I_d \otimes \widetilde{Q}\)↩︎

Figure 4: Commutative diagram relating G, its quotient G/\pi, their associated LD-structures, and the induced quotients LD(G)/\tau and LD(G/\pi)

In this section, we establish PST equivalence between \(LD(G)\) and \(LD(G/\pi)/\sigma\) under the condition \(LD(G)/\tau \cong LD(G/\pi)\), as shown in Figure 4. In Sections 9 and 10, we verify this isomorphism explicitly for specific graphs. In the special case of Theorem 8, the arc partition \(\tau = \{T_1, \dots, T_{2n}\}\) is indexed by the arcs of \(G\), and the quotient matrix coincides with the adjacency matrix of \(G\), so \(LD(G)/\tau \cong G\). We consider a \(d\)-regular directed graph \(G\) with \(d \geq 3\) and \(m = 2n\) vertices. In general, let \[\tau = \{T_1, T_2, \dots, T_{2m}\}\] be an equitable arc partition of \(LD(G)\) into \(2m\) cells, where \(2m\) need not equal \(|V(G)|\). Since \(|\mathcal{A}(G)| = 2nd\) and \(LD(G)\) is \(d\)-regular (as \(G\) is \(d\)-regular), we have \[|\mathcal{A}(LD(G))| = 2nd \cdot d = 2nd^2.\] Assuming further that \(LD(G)/\tau\) is \(d\)-regular, it follows that \[|\mathcal{A}(LD(G)/\tau)| = 2md = 4nd.\] The equitable partition condition yields \[A_{LD(G)}\, Q_\tau = Q_\tau\, A', \qquad A' = Q_\tau^\top A_{LD(G)}\, \quad Q_\tau \in \mathbb{R}^{2nd \times 4n},\] where \(A'\) is the adjacency matrix of the quotient graph \(LD(G)/\tau\). In general, \(A'\) does not coincide with \(A_G\). Now let \(\pi = \{C_1, C_2, \dots, C_n\}\) be an equitable vertex partition of \(V(G)\) into \(n\) cells, so that the quotient graph \(G/\pi\) satisfies \[|\mathcal{A}(G/\pi)| = nd.\] Let \(\sigma = \{\sigma_1, \dots, \sigma_n\}\) be an equitable arc partition of \(G/\pi\) into \(n\) cells, with normalized characteristic matrix \(\widetilde{Q}\). Since \(\sigma\) has \(n\) parts and \(|\mathcal{A}(G/\pi)| = nd\), the matrix \(\widetilde{Q}\) has dimensions \[\widetilde{Q} \in \mathbb{R}^{nd \times n}.\] By Lemma 5, \[A_{LD(G/\pi)}\, \widetilde{Q} = \widetilde{Q}\, \widetilde{A}, \qquad \widetilde{A} = \widetilde{Q}^\top A_{LD(G/\pi)}\, \widetilde{Q} \in \mathbb{R}^{n \times n}.\] Since \(Q_\tau \neq \widetilde{Q} \otimes I_d\) in general, the hypotheses of Theorem 11 are not satisfied, and one cannot directly conclude that PST occurs in \(G\) if and only if it occurs in \(G/\pi\). Instead, we relate PST between \(LD(G)\) and \(LD(G/\pi)/\sigma\) by imposing additional structural assumptions ( see Figure 4) on the partition \(\tau\) together with compatibility conditions on the associated reflection operators.

5.1 Relations Between the Transition Operators of \(LD(G)\), \(LD(G/\pi)\), \(LD(G)/\tau\), and \(LD(G/\pi)/\sigma\)↩︎

Since \(Q \neq \widetilde{Q}\) and \(Q_\tau \neq I_d \otimes \widetilde{Q}\), we define reflection operators for the graphs \(LD(G/\pi)\), \(LD(G)\), and \(LD(G)/\tau\) analogously to \(R\) and \(\widetilde{R}\) for \(G\) and \(G/\pi\), as given in Equations 10 and 11 . Each reflection is of the form \(2PP^{\top} - I\) for an appropriate isometry \(P\), hence unitary, Hermitian, and involutive (i.e.\(R^2 = I\)). Let the transition operators for the three coined quantum walks acting on \(LD(G/\pi)\), \(LD(G)\), and \(LD(G)/\tau\) respectively, all of degree \(d\), be defined as \[U_{\sigma} = S_{\sigma}R_{\sigma}, \qquad U_{\tau} = S_{\tau}R_{\tau}, \qquad \widetilde{U}_{\tau} = \widetilde{S}_{\tau}\widetilde{R}_{\tau}.\] In each case, the shift matrix is defined according to the shunt decomposition model as given in Equation 2 , and the reflection operator \(R = 2PP^{\top} - I\) serves as the coin operator for the respective graph. The three reflection operators, with explicit dimensions, are defined as follows. Reflection operator on \(LD(G/\pi)\) (of size \(|\mathcal{A}(G/\pi)|\cdot d \times |\mathcal{A}(G/\pi)|\cdot d = nd^{2}\times nd^{2}\)): \[R_{\sigma} \;=\; 2\, \underbrace{ (I_d \otimes \widetilde{Q}) }_{\displaystyle nd^{2}\,\times\, nd} \; \underbrace{ (\widetilde{Q}\,\widetilde{Q}^{\top}) }_{\displaystyle nd\,\times\, nd} \; \underbrace{ (I_d \otimes \widetilde{Q})^{\top} }_{\displaystyle nd\,\times\, nd^{2}} \;-\; I \;\in\; \mathbb{C}^{\,nd^{2}\times nd^{2}}.\] Here the ambient space decomposes as \(\mathbb{C}^{nd^2} \cong \mathbb{C}^d \otimes \mathbb{C}^{nd}\), where \(\mathbb{C}^d\) is the coin space (the \(d\) outgoing arcs per vertex) and \(\mathbb{C}^{nd}\) is the arc space of \(G/\pi\) with \(|A(G/\pi)| = nd\). The isometry \(P_{\sigma} = I_d \otimes \widetilde{Q}\) (of size \(nd^2 \times nd\)) embeds the coin tensored with the arc-space projector \(\widetilde{Q}\widetilde{Q}^{\top}\), so that \(R_{\sigma} = 2P_{\sigma}(\widetilde{Q}\widetilde{Q}^{\top})P_{\sigma}^{\top} - I\) is unitary and Hermitian.

Reflection operator on \(LD(G)\) (of size \(|\mathcal{A}(G)|\cdot d \times |\mathcal{A}(G)|\cdot d = 2nd^{2}\times 2nd^{2}\)): \[R_{\tau} \;=\; 2\, \underbrace{ (I_d \otimes Q_{\tau}) }_{\displaystyle 2nd^{2}\,\times\, 4nd} \; \underbrace{ (I_2 \otimes Q_{\tau}Q_{\tau}^{\top}) }_{\displaystyle 4nd\,\times\, 4nd} \; \underbrace{ (I_d \otimes Q_{\tau})^{\top} }_{\displaystyle 4nd\,\times\, 2nd^{2}} \;-\; I \;\in\; \mathbb{C}^{2nd^{2}\times 2nd^{2}}.\] The ambient space decomposes as \(\mathbb{C}^{2nd^2} \cong \mathbb{C}^d \otimes \mathbb{C}^{2nd} \cong \mathbb{C}^d \otimes \mathbb{C}^2 \otimes \mathbb{C}^{nd}\), where the \(\mathbb{C}^2\) factor encodes the two-block structure induced by the equitable arc partition \(\tau\). The isometry \(P_{\tau} = I_d \otimes Q_{\tau}\) (of size \(2nd^2 \times 4nd\)) embeds into \(\mathbb{C}^{4nd} \cong \mathbb{C}^2 \otimes \mathbb{C}^{2nd}\). The block projector \(I_2 \otimes Q_{\tau}Q_{\tau}^{\top}\) acts identically on the two copies of \(\mathbb{C}^{2nd}\), so that \(R_{\tau} = 2P_{\tau}(I_2 \otimes Q_{\tau}Q_{\tau}^{\top})P_{\tau}^{\top} - I\) is unitary and Hermitian.

Reflection operator on \(LD(G)/\tau\) (of size \(|\mathcal{A}(LD(G)/\tau)| \times |\mathcal{A}(LD(G)/\tau)| = 4nd\times 4nd\)): \[\widetilde{R}_{\tau} \;=\; 2\,(I_2 \otimes Q_{\tau}Q_{\tau}^{\top}) \;-\; I \;\in\; \mathbb{C}^{4nd\times 4nd}.\] This operator acts directly on the reduced arc space \(\mathbb{C}^{4nd} \cong \mathbb{C}^2 \otimes \mathbb{C}^{2nd}\), where the \(\mathbb{C}^2\) factor again denotes the \(\tau\)-block structure. Since \(Q_{\tau}Q_{\tau}^{\top}\) is an orthogonal projector, \(\widetilde{R}_{\tau}\) is unitary, Hermitian, and involutive.

Since each reflection operator is of the form \(R = 2PP^{\top} - I\) for an appropriate isometry \(P\), it satisfies \(R^2 = I\) and \(R = R^{\dagger}\). That is, each reflection is both involutive and Hermitian unitary. Furthermore, each is constructed from an isometric embedding and the appropriate orthogonal projector. Therefore, \(R_{\sigma}\), \(R_{\tau}\), and \(\widetilde{R}_{\tau}\) are valid coined quantum-walk reflection operators on the arc spaces of \(LD(G/\pi)\), \(LD(G)\), and \(LD(G)/\tau\), respectively.

Using the reflection operators defined above, we establish a relation between the transition operators of \(LD(G)\), \(LD(G/\pi)\), and \(LD(G)/\tau\) in Proposition 14, and subsequently show the equivalence of perfect state transfer in their respective line digraphs in Theorem 15.

Proposition 14. Let \(G\) be a \(d\)-regular directed graph on \(2n\) vertices. Let \(\tau\), \(\sigma\), and \(\pi\) be the equitable arc partitions of \(LD(G)\), \(LD(G/\pi)\), and the equitable vertex partition of \(G\) into cells of equal size, respectively. Let \(Q_{\tau}\) and \(\widetilde{Q}\) be their normalized characteristic matrices, satisfying \[Q_{\tau}^{\top} Q_{\tau} = I, \qquad \widetilde{Q}^{\top}\widetilde{Q} = I.\] Let \[U_{\tau} = S_{\tau} R_{\tau}, \qquad U_{\sigma} = S_{\sigma} R_{\sigma}, \qquad \widetilde{U}_{\tau} = \widetilde{S}_{\tau}\widetilde{R}_{\tau}, \qquad \widetilde{U} = \widetilde{S}\,\widetilde{R}\] be the unitary evolution operators on \(LD(G)\), \(LD(G/\pi)\), \(LD(G)/\tau\), and \(L(G/\pi)/\sigma,\) respectively, each of degree \(d\). Then the following hold.

  1. \(R_{\tau}\,(I_d \otimes Q_{\tau}) = (I_d \otimes Q_{\tau})\,\widetilde{R}_{\tau}\) and \(R_{\sigma}\,(I_d \otimes \widetilde{Q}) = (I_d \otimes \widetilde{Q})\,\widetilde{R}.\)

  2. For all integers \(k \geq 0\), \(\widetilde{U}_{\tau}^{\,k} = (I_d \otimes Q_{\tau})^{\top}\,U_{\tau}^{k}\, (I_d \otimes Q_{\tau}), \quad \widetilde{U}^{\,k} = (I_d \otimes \widetilde{Q})^{\top}\,U_{\sigma}^{k}\, (I_d \otimes \widetilde{Q}).\)

Proof. (a). Set \(P = I_d \otimes Q_{\tau}\). Since \(P^{\top}P = I\), we compute \[\begin{align} R_{\tau}\,P &= \Bigl(2\,P\,(I_2 \otimes Q_{\tau}Q_{\tau}^{\top})\,P^{\top} - I\Bigr)P = P\,\Bigl(2\,(I_2 \otimes Q_{\tau}Q_{\tau}^{\top}) - I\Bigr) = P\,\widetilde{R}_{\tau}. \end{align}\] Hence \[R_{\tau}\,(I_d \otimes Q_{\tau}) = (I_d \otimes Q_{\tau})\,\widetilde{R}_{\tau}.\] The second identity follows by the identical argument with \(Q_{\tau}\) replaced by \(\widetilde{Q}\) and \(R_{\tau}\) replaced by \(R_{\sigma}\).

(b). Since \(\tau\) is an equitable arc partition of \(LD(G)\), we have \(A_{LD(G)/\tau} = Q_{\tau}^{\top}\,A_{LD(G)}\,Q_{\tau}.\) Since \(LD(G)/\tau\) and \(LD(G)\) are both \(d\)-regular, by same argument as Lemma 2 and Remark 5, we have \(\widetilde{S}_{\tau} = (I_d \otimes Q_{\tau})^{\top}\,S_{\tau}\,(I_d \otimes Q_{\tau}).\) Therefore, \[\begin{align} \widetilde{U}_{\tau} = \widetilde{S}_{\tau}\,\widetilde{R}_{\tau} &= (I_d \otimes Q_{\tau})^{\top}\,S_{\tau}\,(I_d \otimes Q_{\tau})\, \widetilde{R}_{\tau} \\ &= (I_d \otimes Q_{\tau})^{\top}\,S_{\tau}\,R_{\tau}\, (I_d \otimes Q_{\tau}) \qquad\text{(by part~(a))} \\ &= (I_d \otimes Q_{\tau})^{\top}\,U_{\tau}\,(I_d \otimes Q_{\tau}). \end{align}\] For the second identity, since \(\sigma\) is an equitable arc partition of \(LD(G/\pi)\) and \(LD(G/\pi)/\sigma \cong G/\pi\) by Theorem 8, both \(LD(G/\pi)/\sigma\) and \(LD(G/\pi)\) are \(d\)-regular, by same argument as Lemma 2 and Remark 5, we have \(\widetilde{S} = (I_d \otimes \widetilde{Q})^{\top}\,S_{\sigma}\, (I_d \otimes \widetilde{Q}).\) Therefore, \[\begin{align} \widetilde{U} = \widetilde{S}\,\widetilde{R} &= (I_d \otimes \widetilde{Q})^{\top}\,S_{\sigma}\, (I_d \otimes \widetilde{Q})\,\widetilde{R} \\ &= (I_d \otimes \widetilde{Q})^{\top}\,S_{\sigma}\,R_{\sigma}\, (I_d \otimes \widetilde{Q}) \qquad\text{(by part~(a))} \\ &= (I_d \otimes \widetilde{Q})^{\top}\,U_{\sigma}\, (I_d \otimes \widetilde{Q}). \end{align}\] By Lemma 1, \((I_d \otimes Q_{\tau})(I_d \otimes Q_{\tau})^\top\) commutes with \(U\), and hence \(\operatorname{Im}(I_d \otimes Q_{\tau})\) is invariant under \(U_{\tau}\).This gives \(U_{\tau}\,(I_d \otimes Q_{\tau}) = (I_d \otimes Q_{\tau})\,\widetilde{U}_{\tau}\). Applying this relation inductively yields \[\label{induction} U_{\tau}^{k}(I_d \otimes Q_{\tau}) = (I_d \otimes Q_{\tau})\,\widetilde{U}_{\tau}^{\,k} \quad \forall k \geq 0\tag{17}\]

Multiplying both sides of (17 ) on the left by \((I_d \otimes Q_{\tau})^{\top}\) and using \((I_d \otimes Q_{\tau})^{\top}(I_d \otimes Q_{\tau}) = I\), we obtain \[\widetilde{U}_{\tau}^{\,k} = (I_d \otimes Q_{\tau})^{\top}\,U_{\tau}^{k}\, (I_d \otimes Q_{\tau}) \quad\text{for all } k \geq 0.\] The identity for \(\widetilde{U}^{\,k}\) follows by the identical argument with \(Q_{\tau}\) replaced by \(\widetilde{Q}\) and \(U_{\tau}\) replaced by \(U_{\sigma}\). ◻

Theorem 15. Let \(G\) be a \(d\)-regular directed graph on \(2n\) vertices. Let \(\tau = \{T_1, \ldots, T_{2m}, m=2n\}\), \(\sigma = \{\sigma_1, \ldots, \sigma_{n}\}\), and \(\pi = \{C_1, \ldots, C_{n}\}\) be equitable arc partitions of \(LD(G)\), \(LD(G/\pi)\), and vertex partition of \(G\) into cells of equal size, with normalized characteristic matrices \(Q_{\tau}\), \(\widetilde{Q}\), and \(Q\), respectively.let \(\tau = \{T_1, \ldots, T_{2m}, m=2n\}\) be an equitable arc partition of \(LD(G)\) with normalized characteristic matrix \(Q_{\tau}\), and let \(\pi = (C_1, \ldots, C_{n})\) be an equitable vertex partition of \(G\). Assume that \[LD(G)/\tau \;\cong\; LD(G/\pi).\] Then the transition operator \(U_{\tau}\) of \(LD(G)\) exhibits PST from \[(I_d \otimes Q_{\tau})(I_d \otimes \widetilde{Q})\,x \quad\text{to}\quad (I_d \otimes Q_{\tau})(I_d \otimes \widetilde{Q})\,y\] at time \(k\) if and only if the transition operator \(\widetilde{U}\) of \(LD(G/\pi)/\sigma\) exhibits PST from \(x\) to \(y\) at time \(k\), for all \(x, y \in \operatorname{Im}(I_d \otimes \widetilde{Q})\).

Proof. Let \(U_{\tau}\), \(\widetilde{U}_{\tau}\), \(U_{\sigma}\), and \(\widetilde{U}\) denote the unitary evolution operators on \(LD(G)\), \(LD(G)/\tau\), \(LD(G/\pi)\), and \(LD(G/\pi)/\sigma\), respectively. Since \(\tau\) is an equitable arc partition of \(LD(G)\) and \(\sigma\) is an equitable arc partition of \(LD(G/\pi)\), Proposition 14 gives, for every integer \(k \geq 0\), \[\begin{align} U_{\tau}^{k}\,(I_d \otimes Q_{\tau}) &= (I_d \otimes Q_{\tau})\,\widetilde{U}_{\tau}^{\,k}, \tag{18}\\ U_{\sigma}^{k}\,(I_d \otimes \widetilde{Q}) &= (I_d \otimes \widetilde{Q})\,\widetilde{U}^{\,k}. \tag{19} \end{align}\]

(\(\Rightarrow\)). Suppose \(\widetilde{U}\) exhibits PST at time \(k\), so that \[\widetilde{U}^{\,k}\,x = y \qquad \text{for some } x, y \in \operatorname{Im}(I_d \otimes \widetilde{Q}).\] Applying 19 yields \[U_{\sigma}^{k}\,(I_d \otimes \widetilde{Q})\,x = (I_d \otimes \widetilde{Q})\,y.\] Since \(LD(G)/\tau \cong LD(G/\pi)\), we have \(U_{\sigma} = \widetilde{U}_{\tau}\), and 18 then gives \[U_{\tau}^{k}\,(I_d \otimes Q_{\tau})(I_d \otimes \widetilde{Q})\,x = (I_d \otimes Q_{\tau})(I_d \otimes \widetilde{Q})\,y.\] Hence \(U_{\tau}\) exhibits PST between the corresponding lifted states in \(LD(G)\).

(\(\Leftarrow\)). Conversely, suppose \(U_{\tau}\) exhibits PST at time \(k\), so that \[U_{\tau}^{k}\,(I_d \otimes Q_{\tau})(I_d \otimes \widetilde{Q})\,x = (I_d \otimes Q_{\tau})(I_d \otimes \widetilde{Q})\,y.\] Multiplying on the left by \((I_d \otimes Q_{\tau})^{\top}\) and using 18 together with \((I_d \otimes Q_{\tau})^{\top}(I_d \otimes Q_{\tau}) = I\), we obtain \[U_{\sigma}^{k}\,(I_d \otimes \widetilde{Q})\,x = (I_d \otimes \widetilde{Q})\,y.\] Multiplying on the left by \((I_d \otimes \widetilde{Q})^{\top}\) and using 19 together with \((I_d \otimes \widetilde{Q})^{\top}(I_d \otimes \widetilde{Q}) = I\), we obtain \[\widetilde{U}^{\,k}\,x = y.\] Hence \(\widetilde{U}\) exhibits PST from \(x\) to \(y\). Therefore, PST occurs in \(LD(G/\pi)/\sigma\) between states \(x\) and \(y\) if and only if it occurs in \(LD(G)\) between the lifted states \((I_d \otimes Q_{\tau})(I_d \otimes \widetilde{Q})\,x\) and \((I_d \otimes Q_{\tau})(I_d \otimes \widetilde{Q})\,y\). ◻

6 Chebyshev Representation of the Unitary Evolution on Quotient Graphs↩︎

The powers of the evolution operator \(\widetilde{U}\) can be expressed in terms of Chebyshev polynomials of the first kind, yielding a representation analogous to that of the Grover walk [16]. This formulation provides explicit criteria for PST on quotient graphs, which can subsequently be lifted to the original graph \(G\). We will apply this framework in Section 7 to establish PST in the cycle graph \(C_{2n}\).

The reduced shift operator \(\widetilde{S}\) of quotient graph \(G/\pi\) is involutory, that is, \[\label{shift32matrix95Involutary32matrix} \widetilde{S}^{2}=I,\tag{20}\] whenever the induced permutation matrix satisfies \(\widetilde{P_j}^{2}=I_d\) by Corollary 2. We define the discriminant matrix of the quotient graph by \[\widetilde{D} = \widetilde{D}(G/\pi) = \widetilde{Q}^{\top}\widetilde{S}\widetilde{Q} \in \mathbb{C}^{d\times d}.\] Taking transpose gives \[\widetilde{D}^{\top} = (\widetilde{Q}^{\top}\widetilde{S}\widetilde{Q})^{\top} = \widetilde{Q}^{\top}\widetilde{S}^{\top}\widetilde{Q}.\] Since \(\widetilde{S}\) is unitary and involutory, by Equations 9 and 20 , \[\widetilde{S}\widetilde{S}^{\top}=I \quad \Rightarrow \quad \widetilde{S}^{\top}=\widetilde{S}^{-1}=\widetilde{S}.\] Hence, \[\label{symmetric} \widetilde{D}^{\top} = \widetilde{Q}^{\top}\widetilde{S}\widetilde{Q} = \widetilde{D}.\tag{21}\] Therefore, \(\widetilde{D}\) is symmetric. The matrix \(\widetilde{D}\) encodes the effective transition structure of the quotient system. In particular, the dynamics of the walk can be reduced to the action of \(\widetilde{D}\), and the \(n\)-th power of the evolution operator can be expressed through Chebyshev polynomials \(T_n(\widetilde{D})\). This establishes a direct connection between the adjacency structure \(\widetilde{A}\) and the unitary dynamics of the shunt decomposition walk. We first show how the discriminant \(\widetilde{D}\) relates to the adjacency matrix \(\widetilde{A}\) of the quotient graph \(G/\pi\) under a specific characteristic matrix, as given in Lemma 7 below.

Lemma 7. Let \(G\) be a \(d\)-regular directed graph on \(2n\) vertices with no internal edges within any cell, and let \(\pi=\{C_1,\dots,C_n\}\) be an equitable partition of \(V\). Let \(G/\pi\) be the quotient graph with adjacency matrix \(\widetilde{A}\), arc set \(\mathcal{A}(G/\pi)\), and permutation decomposition \(\widetilde{A}=\widetilde{P}_1+\cdots+\widetilde{P}_d\). Let \(\widetilde{S}=\mathrm{diag}(\widetilde{P}_1,\dots,\widetilde{P}_d)\) for the reduced shift operator on \(\mathcal{A}(G/\pi)\). Suppose the normalized characteristic matrix \(\widetilde{Q}\in\mathbb{R}^{dn\times n}\) of the arc partition of \(\mathrm{LD}(G/\pi)\) takes one of the following forms:

  1. \[\widetilde{Q} \;=\; \frac{1}{\sqrt{d}} \begin{pmatrix}I_n\\I_n\\\vdots\\I_n\end{pmatrix} \;\in\mathbb{R}^{dn\times n},\] corresponding to all \(d\) arc-groups from each cell being ordered identically; or

  2. \[\widetilde{Q} \;=\; \frac{1}{\sqrt{d}} \begin{pmatrix}\widetilde{P}_1\\\widetilde{P}_2\\\vdots\\\widetilde{P}_d\end{pmatrix} \;\in\mathbb{R}^{dn\times n},\] where \(\widetilde{P}_1,\dots,\widetilde{P}_d\) are the same permutation matrices appearing in the decomposition \(\widetilde{A}=\widetilde{P}_1+\cdots+\widetilde{P}_d\).

Then the discriminant matrix \[\widetilde{D} \;=\; \widetilde{Q}^{\!\top}\,\widetilde{S}\,\widetilde{Q}.\] satisfies \[\widetilde{D} \;=\; \frac{1}{d}\,\widetilde{A},\] in both cases, where \(\widetilde{A}\) has zero diagonal (since there are no internal edges within cells). Moreover, \(\widetilde{D}\) is row-stochastic and every eigenvalue satisfies \(|\lambda(\widetilde{D})|\le 1\).

Proof. Case (i): With \(\widetilde{Q}=\frac{1}{\sqrt{d}}(I_n^{\top}\cdots I_n^{\top})^{\top}\) and \(\widetilde{S}=\mathrm{diag}(\widetilde{P}_1,\dots,\widetilde{P}_d)\), block multiplication gives \[\widetilde{S}\,\widetilde{Q} \;=\; \begin{pmatrix}\widetilde{P}_1&&\\&\ddots&\\&&\widetilde{P}_d\end{pmatrix} \frac{1}{\sqrt{d}} \begin{pmatrix}I_n\\\vdots\\I_n\end{pmatrix} \;=\; \frac{1}{\sqrt{d}} \begin{pmatrix}\widetilde{P}_1\\\vdots\\\widetilde{P}_d\end{pmatrix},\] and therefore \[\widetilde{D} \;=\; \widetilde{Q}^{\!\top}\widetilde{S}\,\widetilde{Q} \;=\; \frac{1}{d} \begin{pmatrix}I_n&\cdots&I_n\end{pmatrix} \begin{pmatrix}\widetilde{P}_1\\\vdots\\\widetilde{P}_d\end{pmatrix} \;=\; \frac{1}{d}(\widetilde{P}_1+\cdots+\widetilde{P}_d) \;=\; \frac{1}{d}\,\widetilde{A}.\]

Case (ii): With \(\widetilde{Q}=\frac{1}{\sqrt{d}}(\widetilde{P}_1^{\top}\cdots \widetilde{P}_d^{\top})^{\top}\) and the same \(\widetilde{S}\), block multiplication gives \[\widetilde{S}\,\widetilde{Q} \;=\; \frac{1}{\sqrt{d}} \begin{pmatrix} \widetilde{P}_1^2\\\vdots\\\widetilde{P}_d^2\end{pmatrix},\]therefore \[\begin{align} \widetilde{D} &\;=\; \widetilde{Q}^{\!\top}\widetilde{S}\,\widetilde{Q} \;=\; \frac{1}{d} \begin{pmatrix}\widetilde{P}_1^{\top}&\cdots&P_d^{\top}\end{pmatrix} \begin{pmatrix} \widetilde{P}_1^2\\\vdots\\\widetilde{P}_d^2 \end{pmatrix} \;=\; \frac{1}{d}\sum_{k=1}^d\widetilde{P}_k^{\top}\widetilde{P}_k^2. \end{align}\] Since each \(\widetilde{P}_k\) is a permutation matrix we have \(\widetilde{P}_k^{\top}\widetilde{P}_k=I_n\), hence \(\widetilde{P}_k^{\top}\widetilde{P}_k^2=P_k\), and so \[\widetilde{D} \;=\; \frac{1}{d}\sum_{k=1}^d \widetilde{P}_k \;=\; \frac{1}{d}\,\widetilde{A}.\]

Since each \(\widetilde{P}\) is a permutation matrix, every row of \(\widetilde{P}_k\) sums to \(1\). Hence every row of \(\widetilde{A}=\sum_{k=1}^d \widetilde{P}_k\) sums to \(d\), and therefore every row of \(\widetilde{D}=\frac{1}{d}\widetilde{A}\) sums to \(1\), confirming that \(\widetilde{D}\) is row-stochastic with non-negative entries. By the Perron–Frobenius theorem [30], the spectral radius of a row-stochastic matrix equals \(1\), so every eigenvalue of \(\widetilde{D}\) satisfies \(|\lambda(\widetilde{D})|\le 1\). ◻

Definition 16. Let \(G/\pi\) be the quotient graph of a \(d\)-regular directed graph \(G\) under an equitable partition \(\pi=\{C_1,\dots,C_r\}\). Let \(\widetilde{Q}\in\mathbb{R}^{|\mathcal{A}(G/\pi)|\times r}\) be the normalized characteristic matrix of the arc partition of \(LD(G/\pi)\), whose \((a,i)\)-entry is \((d|C_i|)^{-1/2}\) if the arc \(a\in\mathcal{A}(G/\pi)\) has terminal vertex in \(C_i\), and \(0\) otherwise. For each cell \(C_i\in\pi\), let \(e_{C_i}\in\mathbb{C}^r\) denote the standard basis vector with \(1\) in the \(i\)-th position. The quotient vertex-type state* associated with \(C_i\) is \[x_{C_i} = \widetilde{Q}e_{C_i} = \frac{1}{\sqrt{d|C_i|}} \sum_{\substack{a\in\mathcal{A}(G/\pi)\\ t(a)\in C_i}} e_a,\] where \(e_a\) is the standard basis vector indexed by arc \(a\). Thus, \(x_{C_i}\) is the normalized uniform superposition over all arcs of \(G/\pi\) whose terminal vertex lies in \(C_i\). The set of quotient vertex-type states is \[\widetilde{\chi} = \{\,\widetilde{Q}e_{C_i}: C_i\in\pi\,\}.\]*

Definition 17. Let \(G\) be a \(d\)-regular directed graph with evolution operator \(U\), and let \(G/\pi\) be its quotient with reduced operator \(\widetilde{U}\). Given the lift operator \(Q_\tau = I_d\otimes \widetilde{Q}\), we say that PST occurs from cell \(C_i\) to cell \(C_j\) at time \(k\) if \[\bigl|\langle x_{C_j},\,\widetilde{U}^k x_{C_i}\rangle\bigr| \;=\; 1,\] where \(x_{C_i} = \widetilde{Q}\,e_{C_i}\) is the quotient vertex-type state of Definition 16.

Under the assumption that \(\operatorname{Im}(Q_{\tau})\) is \(U\)-invariant, Theorem 11 gives the equivalent evolution in the parent graph: \[U^{k}(Q_{\tau}\,x_{C_i}) \;=\; Q_{\tau}\,(\widetilde{U}^{k}\,x_{C_i}) \;=\; Q_{\tau}\,x_{C_j}.\]Thus PST between the quotient states \(x_{C_i}\) and \(x_{C_j}\) implies PST between the lifted vertex-type states \(Q_{\tau}\,x_{C_i}\) and \(Q_{\tau}\,x_{C_j}\) in \(G\), and such transfer is fundamentally governed by the spectral decomposition of the discriminant matrix \(\widetilde{D} = \widetilde{Q}^{\top}\widetilde{S}\,\widetilde{Q}.\) As is standard in the analysis of Grover-type quantum walks, the discrete-time evolution naturally gives rise to Chebyshev polynomials of the first kind [16].

Definition 18. For a cell \(C_i \in \pi\), the eigenvalue support of \(C_i\) with respect to the discriminant matrix \(\widetilde{D}\) is \[\Sigma_{C_i} \;=\; \bigl\{\,\mu_r \in \mathrm{Spec}(\widetilde{D}) : \widetilde{E}_r\,e_{C_i} \neq 0\,\bigr\},\] where \(\widetilde{E}_r\) is the orthogonal projection onto the eigenspace of \(\widetilde{D}\) corresponding to eigenvalue \(\mu_r\). That is, \(\Sigma_{C_i}\) consists of those eigenvalues of \(\widetilde{D}\) whose eigenspace has a non-trivial component in the direction of \(e_{C_i}\).

A key property used in our analysis is that \(|T_n(p)| \leq 1 \quad \text{whenever } |p| \leq 1,\) where \(T_n(p)\) denotes the Chebyshev polynomial of the first kind, as discussed in Section 2.3, this bound plays an important role in evaluating the powers of the discriminant matrix, since the eigenvalues of \(\widetilde{D}\) lie in the interval \([-1,1]\).

Lemma 8. Let \(G/\pi\) be a quotient graph with time-evolution matrix \(\widetilde{U}\) and discriminant \(\widetilde{D} = \widetilde{Q}^{\top}\widetilde{S}\widetilde{Q}.\) Define the time-dependent discriminant for \(k \in \mathbb{N} \cup \{0\}\) as \(\widetilde{D}_k = \widetilde{Q}^{\top}\widetilde{U}^{k}\widetilde{Q}.\) Then \(\widetilde{D}_k = T_k(\widetilde{D})\), where \(T_k\) is the Chebyshev polynomial of the first kind.

Proof. We first observe that for every \(k \geq 1\): \[\label{eq:discriminant} \widetilde{D}_k = \widetilde{Q}^{\top} \widetilde{U}^k \widetilde{Q} = \widetilde{Q}^{\top} \widetilde{U}^{k-1} \widetilde{S} \widetilde{Q}.\tag{22}\] Indeed, using the shunt-decomposition \(\widetilde{U} = \widetilde{S}(2\widetilde{Q}\widetilde{Q}^{\top} - I)\): \[\begin{align} \widetilde{Q}^{\top} \widetilde{U}^k \widetilde{Q} &= \widetilde{Q}^{\top} \widetilde{U}^{k-1} \bigl[\widetilde{S}(2\widetilde{Q}\widetilde{Q}^{\top} - I)\bigr] \widetilde{Q} \\ &= 2\widetilde{Q}^{\top} \widetilde{U}^{k-1} \widetilde{S} (\widetilde{Q}\widetilde{Q}^{\top}\widetilde{Q}) - \widetilde{Q}^{\top} \widetilde{U}^{k-1} \widetilde{S} \widetilde{Q} \\ &= 2\widetilde{Q}^{\top} \widetilde{U}^{k-1} \widetilde{S} \widetilde{Q} - \widetilde{Q}^{\top} \widetilde{U}^{k-1} \widetilde{S} \widetilde{Q} \qquad (\text{since } \widetilde{Q}^{\top}\widetilde{Q} = I) \\ &= \widetilde{Q}^{\top} \widetilde{U}^{k-1} \widetilde{S} \widetilde{Q}. \end{align}\] We now proceed by induction on \(k\). For the base cases:

  • \(k = 0\): \(\widetilde{D}_0 = \widetilde{Q}^{\top} I \widetilde{Q} = I = T_0(\widetilde{D})\).

  • \(k = 1\): \(\widetilde{D}_1 = \widetilde{Q}^{\top} \widetilde{S} \widetilde{Q} = \widetilde{D} = T_1(\widetilde{D})\).

Assume the identity holds for \(k-1\) and \(k-2\). Using Eq. 22 and the shunt-decomposition, we have \[\begin{align} \widetilde{D}_k &= \widetilde{Q}^{\top} \widetilde{U}^{k-1} \widetilde{S} \widetilde{Q} }\\ &= \widetilde{Q}^{\top} \bigl[\widetilde{U}^{k-2}\widetilde{S} (2\widetilde{Q}\widetilde{Q}^{\top} - I)\bigr] \widetilde{S}\widetilde{Q} \\ &= 2(\widetilde{Q}^{\top}\widetilde{U}^{k-2}\widetilde{S}\widetilde{Q}) (\widetilde{Q}^{\top}\widetilde{S}\widetilde{Q}) - \widetilde{Q}^{\top}\widetilde{U}^{k-2}\widetilde{Q} \\ &= 2\widetilde{D}_{k-1}\,\widetilde{D} - \widetilde{D}_{k-2}and induction hypothesis}\\ &= T_k(\widetilde{D}). \end{align}\] Since \(T_k(p) = 2p\,T_{k-1}(p) - T_{k-2}(p)\) and the identity holds for all base cases, by induction we conclude \(\widetilde{D}_k = T_k(\widetilde{D})\) for all \(k \in \mathbb{N} \cup \{0\}\). ◻

Using the spectral decomposition of the discriminant \(\widetilde{D}\), let \[\widetilde{D} = \sum_{r=1}^{m} \mu_r \widetilde{E}_r,\] where \(\mu_r\) are the eigenvalues of \(\widetilde{D}\) and \(\widetilde{E}_r\) are the corresponding eigenprojectors. For any polynomial \(f\), we have \[f(\widetilde{D}) = \sum_{r=1}^{m} f(\mu_r) \widetilde{E}_r.\]

Lemma 9. Let \(G/\pi\) be a quotient graph with shift matrix \(\widetilde{S}\) is symmetric, and let \(\widetilde{D} = \widetilde{Q}^{\top}\widetilde{S}\widetilde{Q}\) be the corresponding discriminant. For a cell \(C_i \in \pi\) and \(k \in \mathbb{N} \cup \{0\}\), we have \[\|T_k(\widetilde{D})\,e_{C_i}\| \le 1.\] The equality holds if and only if \(T_k(\mu) = \pm 1\) for every \(\mu \in \Sigma_{C_i}\).

Proof. The proof is analogous to the vertex-state case in standard Grover walks (see [16]).

Since \(\widetilde{D} = \widetilde{Q}^{\top}\widetilde{S}\widetilde{Q}\) and \(\widetilde{S}\) is a symmetric matrix, \(\widetilde{D}\) is symmetric, and hence all its eigenvalues are real and satisfy \(\mu \in \Sigma_{C_i} \subset [-1,1]\). This guarantees that the spectral decomposition \(\widetilde{D} = \sum_{\mu \in \Sigma_{C_i}.} \mu\, \widetilde{E}_\mu\) holds with orthogonal projectors \(\widetilde{E}_\mu\), and that \(|T_k(\mu)| \leq 1\) for all \(\mu \in \Sigma_{C_i}\). By expressing \(\|T_k(\widetilde{D})\,e_{C_i}\|^2\) through this spectral decomposition, we obtain: \[\|T_k(\widetilde{D})\,e_{C_i}\|^2 = \sum_{\mu \in \Sigma_{C_i}} |T_k(\mu)|^2\,\langle \widetilde{E}_\mu\,e_{C_i},\, e_{C_i}\rangle.\] Since \(|T_k(\mu)| \le 1\) for all \(\mu \in [-1,1]\) and \(\sum_{\mu}\langle \widetilde{E}_\mu\,e_{C_i}, e_{C_i}\rangle = \|e_{C_i}\|^2 = 1\), the norm is bounded by \(1\). Equality is achieved if and only if \(|T_k(\mu)| = 1\), i.e.\(T_k(\mu) = \pm 1\), for all \(\mu\) in the support \(\Sigma_{C_i}\). ◻

Lemma 8 and Lemma 9 together yield a necessary condition for PST to occur in the quotient graph \(G/\pi\), as stated in Theorem 19 below.

Theorem 19. Let \(G/\pi\) be a quotient graph with shift matrix \(\widetilde{S}\) is symmetric, and let \(\widetilde{D} = \widetilde{Q}^{\top}\widetilde{S}\widetilde{Q}\) be the corresponding discriminant. If PST occurs from the quotient vertex–type state \(x_{C_i}\) to \(x_{C_j}\) at time \(k\), then \(T_k (\mu) = \pm 1 \quad \text{for every } \mu \in \Sigma_{C_i}.\)

Proof. Suppose PST occurs at time \(k\). Following the characterization of PST in  [16], the condition \(|\langle x_{C_j}, \widetilde{U}^\tau x_{C_i} \rangle| = 1\) is equivalent to \(|\langle e_{C_j}, T_k(\widetilde{D}) e_{C_i} \rangle| = 1\) by Lemma 8. Applying the Cauchy–Schwarz inequality: \[1 = |\langle e_{C_j}, T_k(\widetilde{D}) e_{C_i} \rangle| \le \|e_{C_j}\| \cdot \|T_k(\widetilde{D}) e_{C_i}\| \le 1.\] This implies \(\|T_k(\widetilde{D}) e_{C_i}\| = 1\), and the result follows directly from Lemma 9. ◻

7 Perfect State Transfer on the Quotient Graph of an Even Cycle \(C_{2n}\), where \(n\) is Even↩︎

Figure 5: (a) Original cycle C_6. (b) Grouped layoutwith cells C_1, C_2, C_3 in triangle form;inter-cell edges give the quotient K_3.(c) Line digraph \mathrm{LD}(K_3) with arc-partitioncells \sigma_1, \sigma_2, \sigma_3; directed edges follow the adjacency in\mathrm{LD}(K_3).

We consider the cycle graph \(C_{2n}\) and construct a quotient graph using an equitable partition \(\pi\). We partition the vertex set of \(C_{2n}\) into cells of size \(2\), so that the number of cells is \(n\). Hence \(C_{2n}/\pi\) is 2-regular quotient graph by Corollary 1. Under this partition, the quotient graph \(C_{2n}/\pi\) is isomorphic to \(C_n\) (see Figure 5). Let \(\sigma\) be the arc partition of the quotient graph \(LD(C_{2n}/\pi)\), obtained by grouping arcs according to their terminal vertices. Using this structure, we establish PST on \(C_{2n}\) in the following theorem.

Lemma 10. Let \(C_{2n}\) be the cycle graph on \(2n\) vertices with \(n \geq 3\). Partition the vertex set into \(n\) cells of size \(2\) defined by \[C_i = \{i,\; i+n\}, \qquad i = 1, 2, \ldots, n.\] Then \(\pi = \{C_1, C_2, \ldots, C_n\}\) is an equitable partition of \(C_{2n}\), and the quotient graph \(C_{2n}/\pi\) is isomorphic to the cycle graph \(C_n\).

Proof. Since the cells \(C_i = \{i, i+n\}\) for \(i = 1, \ldots, n\) are pairwise disjoint and cover \(\{1, \ldots, 2n\}\), the collection \(\pi\) is indeed a partition. For \(n \geq 3\), no two vertices within the same cell are adjacent in \(C_{2n}\), since their difference is \(n \geq 3\), whereas adjacency requires a difference of \(1\) or \(2n-1\). Hence \(G/\pi\) has no self-loops. Now fix \(i \in \{1, \ldots, n\}\) and consider the two vertices \(v = i\) and \(w = i + n\) of \(C_i\). Their neighbours in \(C_{2n}\) are \[N(v) = \{i-1,\; i+1\}, \qquad N(w) = \{i+n-1,\; i+n+1\}.\] Since \(i - 1, \, i+n-1 \in C_{i-1}\) and \(i+1,\, i+n+1 \in C_{i+1}\) (indices modulo \(n\)), each vertex of \(C_i\) has exactly one neighbour in \(C_{i-1 \bmod n}\) and exactly one neighbour in \(C_{i+1 \bmod n}\), and no neighbours in any other cell. As this count is independent of the choice of vertex in \(C_i\), the partition \(\pi\) is equitable. Consequently, in the quotient graph \(C_{2n}/\pi\), each cell \(C_i\) is adjacent only to \(C_{i-1 \bmod n}\) and \(C_{i+1 \bmod n}\), which is precisely the adjacency structure of \(C_n\). Hence \[C_{2n}/\pi \;\cong\; C_n.\] ◻

Corollary 20. Under the hypotheses of Lemma 10, let \(\sigma = \{\sigma_1, \ldots, \sigma_n\}\) be an equitable arc partition of \(\mathrm{LD}(G/\pi)\). By ordering the \(2n\) arcs of \(\mathrm{LD}(G/\pi)\) so that the first arc of each class \(\sigma_1, \ldots, \sigma_n\) precedes the second arc of each class, the normalized characteristic matrix \(\widetilde{Q}\) coincides with \(Q\), and both take the simple form \[Q \;=\; \widetilde{Q} \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_n \\ I_n \end{pmatrix}.\]

Proof. By Lemma 10, \(G/\pi \cong C_n\) has \(n\) undirected edges, so \(\mathrm{LD}(G/\pi)\) has exactly \(2n\) directed arcs. Hence the number of arcs of \(\mathrm{LD}(G/\pi)\) equals the number of vertices of \(G = C_{2n}\). The equitable vertex partition \(\pi\) partitions the \(2n\) vertices of \(G\) into \(n\) cells each of size \(2\), giving \[Q \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_n \\ I_n \end{pmatrix} \;\in\; \mathbb{R}^{2n \times n},\] where the upper \(I_n\) corresponds to the elements \(\{1, 2, \ldots, n\}\) and the lower \(I_n\) corresponds to the elements \(\{n+1, n+2, \ldots, 2n\}\) of each cell. The arc partition \(\sigma\) partitions the \(2n\) arcs of \(\mathrm{LD}(G/\pi)\) into \(n\) classes each of size \(2\), namely the two arcs directed into each vertex of \(C_n\). Ordering the arcs as \[\underbrace{(u_1,v_1),\,(u_2,v_2),\,\ldots,\,(u_n,v_n)}_{ \text{first arc of each class}}, \qquad \underbrace{(w_1,v_1),\,(w_2,v_2),\,\ldots,\,(w_n,v_n)}_{ \text{second arc of each class}},\] where \((u_i, v_i)\) and \((w_i, v_i)\) are the two arcs in class \(\sigma_i\), the normalized characteristic matrix takes the form \[\widetilde{Q} \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_n \\ I_n \end{pmatrix} \;\in\; \mathbb{R}^{2n \times n}.\] Hence \(Q = \widetilde{Q}\), and \(\widetilde{Q}\) satisfies the equitable partition condition \[A_{\mathrm{LD}(G/\pi)}\,\widetilde{Q} \;=\; \widetilde{Q}\,\widetilde{A}, \qquad \widetilde{A} = A(C_n),\] confirming that \[\mathrm{LD}(G/\pi)/\sigma \;\cong\; C_n \;\cong\; G/\pi.\] ◻

Example 21. Take \(n = 3\), so \(G = C_{2n} = C_6\) with vertices \(1, 2, 3, 4, 5, 6\). The equitable vertex partition \(\pi\) is \[C_1 = \{1,4\}, \quad C_2 = \{2,5\}, \quad C_3 = \{3,6\},\] ordering the vertices as \(1,2,3,4,5,6\), the normalized characteristic matrix is \[Q \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_3 \\ I_3 \end{pmatrix} \;\in\; \mathbb{R}^{6 \times 3},\] where the upper \(I_3\) corresponds to vertices \(\{1,2,3\}\) and the lower \(I_3\) corresponds to vertices \(\{4,5,6\}\), satisfying \(A(C_6)\,Q = Q\,A(C_3)\). The neighbour table confirms equitability:

Vertex Cell Neighbours in \(C_6\) Target cells
\(1\) \(C_1\) \(2,\;6\) \(C_2,\;C_3\)
\(4\) \(C_1\) \(3,\;5\) \(C_3,\;C_2\)
\(2\) \(C_2\) \(1,\;3\) \(C_1,\;C_3\)
\(5\) \(C_2\) \(4,\;6\) \(C_1,\;C_3\)
\(3\) \(C_3\) \(2,\;4\) \(C_2,\;C_1\)
\(6\) \(C_3\) \(5,\;1\) \(C_2,\;C_1\)

The quotient adjacency matrix is \[\widetilde{A}(C_6/\pi) \;=\; \begin{pmatrix} 0 & 1 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 0 \end{pmatrix} \;=\; A(C_3).\] Now \(C_6/\pi \cong C_3\) has \(3\) undirected edges, so \(\mathrm{LD}(C_3)\) has \(6\) directed arcs. The equitable arc partition \(\sigma\) groups the two arcs directed into each vertex of \(C_3\) into one class: \[\sigma_1 = \{(2,1),(3,1)\}, \quad \sigma_2 = \{(1,2),(3,2)\}, \quad \sigma_3 = \{(1,3),(2,3)\}.\] By Corollary 20, ordering the arcs as \[\underbrace{(2,1),\,(1,2),\,(1,3)}_{\text{first arc of each class} \;\sigma_1,\sigma_2,\sigma_3},\; \underbrace{(3,1),\,(3,2),\,(2,3)}_{\text{second arc of each class} \;\sigma_1,\sigma_2,\sigma_3},\] the normalized characteristic matrix is \[\widetilde{Q} \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_3 \\ I_3 \end{pmatrix} \;\in\; \mathbb{R}^{6 \times 3},\] where the upper \(I_3\) corresponds to arcs \((2,1),\,(1,2),\,(1,3)\) and the lower \(I_3\) corresponds to arcs \((3,1),\,(3,2),\,(2,3)\). Hence \(\widetilde{Q} = Q\), satisfying \[A_{\mathrm{LD}(C_3)}\,\widetilde{Q} \;=\; \widetilde{Q}\,A(C_3),\] and therefore \(\mathrm{LD}(C_3)/\sigma \cong C_3 \cong C_6/\pi\).

Corollary 22. The shift matrix \(\widetilde{S} = \mathrm{diag}(\widetilde{P}_1, \widetilde{P}_2)\) of the cycle graph \(C_n\) is always symmetric.

Proof. Since \(C_n\) has degree \(2\), its adjacency matrix satisfies \(A(C_n) = \widetilde{P}_1 + \widetilde{P}_2\), where \(\widetilde{P}_1\) and \(\widetilde{P}_2\) are the two permutation matrices corresponding to the two arc directions. Since each \(\widetilde{P}_j\) is an involution, i.e.\(\widetilde{P}_j^2 = I\), it follows by Corollary 2 that \(\widetilde{S}^2 = I\). Since \(\widetilde{S}\) is unitary and satisfies \(\widetilde{S}^2 = I\), we have \(\widetilde{S}^{-1} = \widetilde{S}\). Combined with the unitarity condition \(\widetilde{S}^{-1} = \widetilde{S}^{\top}\), this gives \(\widetilde{S} = \widetilde{S}^{\top}\), and hence \(\widetilde{S}\) is symmetric. ◻

Since \(\widetilde{S}\) is symmetric by Equation 21 , the discriminant \(\widetilde{D} = \widetilde{Q}^{\top}\widetilde{S}\widetilde{Q}\) is also symmetric. We now apply Theorem 19 to establish perfect state transfer in the quotient graph \(C_{2n}\), as demonstrated in Lemma 11 below with an explicit example. Subsequently, we lift this result to the parent graph \(C_{2n}\) in Theorem 24 via Theorem 11.

Lemma 11. Let \(C_{2n}\) be the cycle graph on \(2n\) vertices, where \(n \geq 2\) is even, and let \(\pi = \{C_i\}_{i=1}^n\) with \(C_i = \{i,\,i+n\}\) be the equitable vertex partition of \(C_{2n}\). Let \(\widetilde{D}\) denotes the discriminant of the quotient graph \(C_{2n}/\pi\). Then PST occurs on the quotient graph from \(\widetilde{Q}e_{C_i}\) to \(\widetilde{Q}e_{C_j}\) at time \(k = \frac{n}{2}.\)

Proof. By Lemma 7 and Corollary 20, the quotient graph is \(C_{2n}/\pi \cong C_n\) and the discriminant satisfies \(\widetilde{D} = \tfrac{1}{2}A(C_n)\). The eigenvalues of \(A(C_n)\) are \(2\cos\!\bigl(\tfrac{2\pi t}{n}\bigr)\) for \(t = 0,1,\ldots,n-1\), so the eigenvalues of \(\widetilde{D}\) are \[\label{eq:disc-evals} \mu_t = \cos\!\left(\frac{2\pi t}{n}\right), \qquad t = 0, 1, \ldots, n-1.\tag{23}\]

By Theorem 19, PST from \(\widetilde{Q}e_{C_i}\) to \(\widetilde{Q}e_{C_j}\) at time \(k\) requires \[T_k(\mu_t) = \pm 1 \qquad \text{for all } t = 0, 1, \ldots, n-1 \text{ and } \mu_t \in \Sigma_{C_i}.\] where \(T_k\) is the Chebyshev polynomial of degree \(k\). Using \(T_k(\cos\theta) = \cos(k\theta)\), this condition becomes \[\cos\!\left(k \cdot \frac{2\pi t}{n}\right) = \pm 1 \quad\iff\quad k \cdot \frac{2t}{n} \in \mathbb{Z} \quad \text{for all } t = 0,1,\ldots,n-1.\] To satisfy this for all \(t\), it suffices to consider \(t=1\), which yields \[\frac{2k}{n} \in \mathbb{Z} \quad\Longrightarrow\quad k = m\,\frac{n}{2}, \quad m \in \mathbb{Z}_{>0}.\] The smallest positive value is \(k = \dfrac{n}{2}\), which is a positive integer since \(n\) is even. Let \(E_t\) denote the spectral projector of \(\widetilde{D}\) onto the eigenspace of \(\mu_t\). At \(k = n/2\), the sign pattern is \[T_{n/2}(\mu_t) = \cos\!\left(\frac{n}{2}\cdot\frac{2\pi t}{n}\right) = \cos(\pi t ) = (-1)^t,\] so the transfer operator is \[T_{n/2}(\widetilde{D}) = \sum_{t=0}^{n-1}(-1)^t E_t.\] Since \(n\) is even and \(C_n\) is vertex-transitive, the antipodal symmetry of \(C_n\) (sending cell \(C_i\) to cell \(C_{i+n/2 \bmod n}\)) implies \[T_{n/2}(\widetilde{D})\,e_{C_i} = e_{C_{i+n/2 \bmod n}},\] that is, the transfer operator maps each basis vector to the diametrically opposite basis vector of \(C_n\). Hence \[\bigl\langle \widetilde{U}^{n/2}\,\widetilde{Q}e_{C_i},\; \widetilde{Q}e_{C_j} \bigr\rangle = 1, \qquad j = i + \tfrac{n}{2} \bmod n,\] establishing PST at time \(k = n/2\). ◻

Example 23.

Take \(2n = 8\), so \(n = 4\) (even, satisfying the lemma). The vertex partition \(C_i = \{i,\,i+4\}\) gives \[C_1=\{1,5\},\quad C_2=\{2,6\},\quad C_3=\{3,7\},\quad C_4=\{4,8\},\] with quotient \(C_8/\pi \cong C_4\). The discriminant is \(\widetilde{D} = \tfrac{1}{2}A(C_4)\), with eigenvalues \[\mu_t = \cos\!\left(\frac{2\pi t}{4}\right) = \cos\!\left(\frac{\pi t}{2}\right), \qquad t = 0,1,2,3,\] namely \[\mu_0 = 1,\quad \mu_1 = 0,\quad \mu_2 = -1,\quad \mu_3 = 0.\] By the lemma, \(k = n/2 = 2\). The Chebyshev polynomial of degree \(2\) is \[T_2(x) = 2x^2 - 1.\] Evaluating on the spectrum: \(T_2(1) = 1,\quad T_2(0) = -1,\quad T_2(-1) = 1,\quad T_2(0) = -1.\) Thus \(T_2(\mu_t) = (-1)^t \in \{+1,-1\}\) for all \(t\), confirming the PST condition. The distinct eigenvalues of \(\widetilde{D}\) are \(\mu = +1, 0, -1\). Their spectral projectors are: \[E_0 = \frac{1}{4} \begin{pmatrix}1&1&1&1\\1&1&1&1\\1&1&1&1\\1&1&1&1\end{pmatrix}, \qquad E_2 = \frac{1}{4} \begin{pmatrix}1&{-1}&1&{-1}\\{-1}&1&{-1}&1\\ 1&{-1}&1&{-1}\\{-1}&1&{-1}&1\end{pmatrix},\] \[E_{1,3} = \frac{1}{2} \begin{pmatrix}1&0&{-1}&0\\0&1&0&{-1}\\ {-1}&0&1&0\\0&{-1}&0&1\end{pmatrix}.\] These satisfy \(E_0 + E_{1,3} + E_2 = I_4\).

\[T_2(\widetilde{D}) = (+1)E_0 + (-1)E_{1,3} + (+1)E_2 = 2\widetilde{D}^2 - I_4 = \begin{pmatrix} 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \end{pmatrix}.\] This is the antipodal permutation matrix of \(C_4\), and its action is \[T_2(\widetilde{D})\,e_{C_1} = e_{C_3},\quad T_2(\widetilde{D})\,e_{C_2} = e_{C_4},\quad T_2(\widetilde{D})\,e_{C_3} = e_{C_1},\quad T_2(\widetilde{D})\,e_{C_4} = e_{C_2}.\] Hence PST occurs at \(k = 2\) between the antipodal pairs: \[\widetilde{Q}e_{C_1} \;\longleftrightarrow\; \widetilde{Q}e_{C_3}, \qquad \widetilde{Q}e_{C_2} \;\longleftrightarrow\; \widetilde{Q}e_{C_4}.\]

Theorem 24. Let \(G = C_{2n}\) be the even cycle on \(2n\) vertices, where \(n \geq 2\) is even, and let \(\pi = \{C_i\}_{i=1}^{n}\) with \(C_i = \{i,\, i+n\}\) be the equitable vertex partition of \(G\). Then \(G\) exhibits PST at time \(k = \frac{n}{2}\) from the state \(Q_\tau\, x_{C_i}\) to the state \(Q_\tau\, x_{C_j}\), where \(j \equiv i + \tfrac{n}{2} \pmod{n}\).

Proof. By Lemma 10, the partition \(\pi\) is equitable with \(n\) cells each of size \(2\), and the quotient satisfies \(C_{2n}/\pi \cong C_n\). By Corollary 20, the vertex and arc characteristic matrices coincide: \[Q \;=\; \widetilde{Q} \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_n \\ I_n \end{pmatrix} \;\in\; M_{2n \times n}(\mathbb{R}), \qquad \widetilde{Q}^\top \widetilde{Q} = I_n.\] The arc characteristic matrix of \(\mathrm{LD}(C_{2n})\) takes the form \[Q_\tau \;=\; I_2\otimes \widetilde{Q} \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_{2n} \\ I_{2n} \end{pmatrix} \;\in\; M_{4n \times 2n}(\mathbb{R}), \qquad Q_\tau^\top Q_\tau = I_{2n}.\] By construction, \(Q_\tau\) satisfies the intertwining identity \[A_{\mathrm{LD}(C_{2n})}\, Q_\tau \;=\; Q_\tau\, A_{C_{2n}},\] where \(A_{\mathrm{LD}(C_{2n})} \in M_{4n \times 4n}(\mathbb{R})\) and \(A_{C_{2n}} \in M_{2n \times 2n}(\mathbb{R})\). By Lemma 11, the quotient \(C_n\) exhibits PST at time \(k = \tfrac{n}{2}\) (a positive integer since \(n\) is even) between the antipodal states \(\widetilde{Q}\,e_{C_i}\) and \(\widetilde{Q}\,e_{C_j}\), that is, \[\left| e_{C_j}^\top\, \widetilde{Q}^\top\, \widetilde{U}^{\,k}\, \widetilde{Q}\, e_{C_i} \right| = 1.\] Applying Theorem 11 with \(Q_\tau = I_2 \otimes \widetilde{Q}\), PST on the quotient lifts to the original graph, giving \[\left| x_{C_j}^\top\, Q_\tau^\top\, U^{k}\, Q_\tau\, x_{C_i} \right| \;=\; \left| e_{C_j}^\top\, \widetilde{Q}^\top\, \widetilde{U}^{\,k}\, \widetilde{Q}\, e_{C_i} \right| \;=\; 1,\] where \(U\) and \(\widetilde{U}\) are the transition operators on \(C_{2n}\) and \(C_n\), respectively. Hence \(C_{2n}\) exhibits PST at time \(k = \tfrac{n}{2}\) from the state \(Q_\tau\, x_{C_i}\) to the state \(Q_\tau\, x_{C_j}\), with \(j \equiv i + \tfrac{n}{2} \pmod{n}\). ◻

8 Perfect State Transfer on the Quotient Graph \(K_{n}^{\circlearrowleft}\) for \(n=2^s\) for some integer \(s\ge 1\)↩︎

Complete graphs with self-loops are among the most symmetric graph structures and have received considerable attention in the study of quantum walks. Szegedy quantum walks on complete graphs with self-loops have been investigated, where the success probability approaches unity as the number of vertices \(N\) becomes large [31]. Moreover, for a complete graph with self-loops on \(N = 30\) vertices, the first maximum of the fidelity is attained after \(12\) steps under the Szegedy quantum walk model.

Motivated by these results, we investigate perfect state transfer (PST) on the complete graph with self-loops \(K_n^{\circlearrowleft}\) on \(n\) vertices, where \(n\) is a power of \(2\). Specifically, we consider a \(d\)-regular directed graph \(G\) on \(2n\) vertices whose quotient graph is \(K_n^{\circlearrowleft}\) of degree \(d\), and we establish conditions under which PST occurs in the corresponding quotient quantum walk. The results of this section serve as a tool for proving PST on broader families of quotient graphs, as developed in Sections 9 and 10. Let the shift matrix of \(K_n^{\circlearrowleft}\) be \[\widetilde{S} = \sum_{j=1}^{d} E_{jj}\otimes \widetilde{P}_j,\] where \(\widetilde{P}_1,\widetilde{P}_2,\ldots,\widetilde{P}_d\) are the shunts of the adjacency matrix \(A(K_{n}^{\circlearrowleft})\) satisfying \[A(K_{n}^{\circlearrowleft}) = \widetilde{P}_1+ \widetilde{P}_2+\cdots+ \widetilde{P}_d=I_n+\widetilde{P}+\widetilde{P}^2 \cdots \widetilde{P}^{d-1}.\]

For the specific choice \[\widetilde{Q} = \frac{1}{\sqrt d} \begin{bmatrix} I_n\\ \widetilde{P}\\ \widetilde{P}^2\\ \vdots\\ \widetilde{P}^{d-1} \end{bmatrix}\] where \(\widetilde{P}\) is the cyclic permutation matrix, and with reflction operator \(\widetilde{R}\) as defined in Equation 10 , we obtain \[\widetilde{S} = \bigoplus_{k=0}^{n-1} \widetilde{P}^k, \qquad \widetilde{U} = \widetilde{S}\widetilde{R}.\]

The following lemma determines the eigenvalues of \(\widetilde{U}\), and the subsequent theorem establishes PST on the quotient graph \(K_{n}^{\circlearrowleft}\).

Lemma 12. Let \(n \geq 1\) and set \(d = n\). Given \[\widetilde{Q} = \frac{1}{\sqrt{n}} \begin{bmatrix} I_n \\ \widetilde{P} \\ \widetilde{P}^2 \\ \vdots \\ \widetilde{P}^{n-1} \end{bmatrix}, \qquad R = 2\widetilde{Q}\widetilde{Q}^\top - I_{n^2}, \qquad S = \bigoplus_{k=0}^{n-1} \widetilde{P}^k, \qquad \widetilde{U} = \widetilde{S} \widetilde{R},\] where \(\widetilde{P}\) is the cyclic shift on \(\mathbb{C}^n\), the eigenvalues of \(\widetilde{U} \in \mathbb{C}^{n^2 \times n^2}\) are the roots of the \(n\)th-degree characteristic polynomial \[p_l(\lambda) = \prod_{m=0}^{n-1}(\lambda + \omega^{lm}) - \frac{2}{n}\sum_{m=0}^{n-1} \omega^{-ml} \prod_{\substack{j=0\\j\neq m}}^{n-1}(\lambda + \omega^{lj}), \qquad l \in \mathbb{Z}_n,\] where \(\omega = e^{2\pi i/n}\).

Proof. Since \(d = n\), the same root of unity \(\omega = e^{2\pi i/n}\) governs both the cyclic shift \(\widetilde{P}\) on \(\mathbb{C}^n\) and the DFT structure on \(\mathbb{C}^n\). The DFT basis vectors \[f_l = \frac{1}{\sqrt{n}}\bigl[1,\,\omega^{l},\,\omega^{2l},\,\ldots,\, \omega^{(n-1)l}\bigr]^\top, \qquad l \in \mathbb{Z}_n,\] satisfy \(\widetilde{P} f_l = \omega^l f_l\). The subspaces \(V_l = \operatorname{span}\{f_m \otimes f_l : m \in \mathbb{Z}_n\}, \qquad l \in \mathbb{Z}_n,\) are \(\widetilde{U}\)-invariant and \(\mathbb{C}^{n^2} = \bigoplus_{l=0}^{n-1} V_l\). Indeed, since \(d = n\), the action of \(S\) gives \(S(f_m \otimes f_l) = f_{m+l \bmod n} \otimes f_l \in V_l\), and the action of \(R\) gives \(R(f_m \otimes f_l) = d_m^{(l)}(f_m \otimes f_l) \in V_l\), both of which keep \(V_l\) invariant. It therefore suffices to find the eigenvalues of \(\widetilde{U}_l = \widetilde{U}|_{V_l}\) for each \(l \in \mathbb{Z}_n\). In the basis \(\{f_m \otimes f_l\}_{m \in \mathbb{Z}_n}\) one has \[\widetilde{U}_l = \Sigma_l D_l,\] where \(\Sigma_l\) is the cyclic shift by \(l\) on \(\mathbb{C}^n\) (that is\((\Sigma_l)_{m,m'} = \delta_{m,\,m'+l \bmod n}\)), arising from \(S|_{V_l}\), and \(D_l = \operatorname{diag}(d_0^{(l)},\ldots,d_{n-1}^{(l)})\) with \[d_m^{(l)} = \begin{cases} +1 & m = l,\\ -1 & m \neq l,\end{cases}\] arising from \(R|_{V_l}\). Write \(D_l\) as a rank-one update of \(-I_n\), \(D_l = -I_n + 2\,e_l e_l^\top,\) since this matrix has \(+1\) in position \((l,l)\) and \(-1\) elsewhere on the diagonal. Hence \[\widetilde{U}_l = \Sigma_l D_l = \Sigma_l(-I_n + 2\,e_l e_l^\top) = -\Sigma_l + 2\,(\Sigma_l e_l)\,e_l^\top.\] This expresses \(\lambda I - \widetilde{U}_l\) as a rank-one perturbation of \(\lambda I + \Sigma_l\) \[\lambda I - \widetilde{U}_l = \underbrace{(\lambda I + \Sigma_l)}_{=\,A} + \underbrace{(-2\,\Sigma_l e_l)}_{=\,u} \,\underbrace{e_l^\top}_{=\,v^\top}. \label{eq:rankone}\tag{24}\] For an invertible matrix \(A\) and vectors \(u,v\), \[\det(A + uv^\top) = \det(A)\,(1 + v^\top A^{-1} u).\] Applying this to 24 with \(A = \lambda I + \Sigma_l\), \(u = -2\Sigma_l e_l\), \(v = e_l\) \[\begin{align} \det(\lambda I - \widetilde{U}_l) &= \det(\lambda I + \Sigma_l) \Bigl(1 - 2\,e_l^\top(\lambda I + \Sigma_l)^{-1}\Sigma_l e_l\Bigr). \label{eq:MDL} \end{align}\tag{25}\]

The matrix \(\Sigma_l\) is the cyclic permutation \(m \mapsto m + l \bmod n\) on \(\mathbb{C}^n\), whose eigenvalues are \(\{\omega^{lm} : m \in \mathbb{Z}_n\}\) with \(\omega = e^{2\pi i/n}\). Therefore \(\det(\lambda I + \Sigma_l) = \prod_{m=0}^{n-1}(\lambda + \omega^{lm}).\) Now we compute \(e_l^\top(\lambda I + \Sigma_l)^{-1}\Sigma_l e_l\). The shift \(\Sigma_l\) maps the \(k\)-th standard basis vector to \(e_{k+l \bmod n}\), so in particular \(\Sigma_l e_l = e_{2l \bmod n}.\) Hence the resolvent entry becomes \[\label{eq:res} e_l^\top(\lambda I + \Sigma_l)^{-1}\Sigma_l e_l = e_l^\top(\lambda I + \Sigma_l)^{-1} e_{2l \bmod n} = \bigl[(\lambda I + \Sigma_l)^{-1}\bigr]_{l,\,2l \bmod n}.\tag{26}\] Since \(\Sigma_l\) is a circulant matrix on \(\mathbb{C}^n\), so is \((\lambda I + \Sigma_l)^{-1}\). Its \((j,k)\) entry is \[\bigl[(\lambda I + \Sigma_l)^{-1}\bigr]_{j,k} = \frac{1}{n}\sum_{m=0}^{n-1}\frac{\omega^{m(j-k)}}{\lambda + \omega^{lm}}.\] Setting \(j = l\) and \(k = 2l \bmod n\) gives \(j - k \equiv -l \pmod{n}\), so \[\label{eq:entry} \bigl[(\lambda I + \Sigma_l)^{-1}\bigr]_{l,\,2l \bmod n} = \frac{1}{n}\sum_{m=0}^{n-1}\frac{\omega^{-ml}}{\lambda + \omega^{lm}}.\tag{27}\] Substituting 26 and 27 into 25 : \[\det(\lambda I - \widetilde{U}_l) = \prod_{m=0}^{n-1}(\lambda + \omega^{lm}) \left(1 - \frac{2}{n}\sum_{m=0}^{n-1} \frac{\omega^{-ml}}{\lambda + \omega^{lm}}\right).\] Clearing denominators by multiplying through gives \[\label{det} \det(\lambda I - \widetilde{U}_l) = \prod_{m=0}^{n-1}(\lambda + \omega^{lm}) - \frac{2}{n}\sum_{m=0}^{n-1} \omega^{-ml}\prod_{\substack{j=0\\j\neq m}}^{n-1}(\lambda + \omega^{lj}) = p_l(\lambda).\tag{28}\] This is a degree-\(n\) polynomial in \(\lambda\), valid for each \(l \in \mathbb{Z}_n\). Thus the eigenvalues of \(\widetilde{U}\) are \(\bigcup_{l=0}^{n-1}\{\lambda : p_l(\lambda) = 0\}\). ◻

Lemma 13. Let \(n = 2^s\) for some integer \(s \geq 1\), and let \(\widetilde{U}_l = \Sigma_l D_l\) be the restriction of \(\widetilde{U} = \widetilde{S}\widetilde{R}\) to the invariant subspace \(V_l\), for \(l \in \mathbb{Z}_n\). Then the following hold.

(i) For every \(l \in \mathbb{Z}_n\), \[\widetilde{U}_l^n = (-1)^{l \bmod n}\,I_n, \qquad \widetilde{U}_l^{2n} = I_n.\] That is, the order of \(\widetilde{U}_l\) is exactly \(2n\) for every \(l \in \mathbb{Z}_n\) with \(l \bmod n\) odd, and divides \(2n\) for every \(l \in \mathbb{Z}_n\) with \(l \bmod n\) even.

(ii) Since \(d = n\), the identity \(\widetilde{U}^{\,n} = I_n \otimes \widetilde{P}^{n/2}\) holds.

Proof. Proof of part (i). Recall from Lemma 12 that \(\widetilde{U}_l = \Sigma_l D_l\), where \(\Sigma_l\) is the cyclic shift by \(l\) on \(\mathbb{C}^n\) and \(D_l = \operatorname{diag}(d_0^{(l)}, \ldots, d_{n-1}^{(l)})\) with \(d_m^{(l)} = +1\) if \(m = l \bmod n\) and \(d_m^{(l)} = -1\) otherwise. We first establish that for all \(k \geq 1\), \[\label{eq:ind} \widetilde{U}_l^k = \Sigma_{kl \bmod n}\,E_k,\tag{29}\] where \(\Sigma_{kl}\) denotes the cyclic shift by \(kl \bmod n\) on \(\mathbb{C}^n\) and \(E_k\) is the \(n \times n\) diagonal matrix with entries \[\label{eq:Ek} (E_k)_{mm} = \prod_{r=0}^{k-1} d_{m-rl \bmod n}^{(l)}, \qquad m \in \mathbb{Z}_n,\tag{30}\]

Base case \(k = 1\). We have \(\widetilde{U}_l^1 = \Sigma_l D_l = \Sigma_l E_1\) since \((E_1)_{mm} = d_m^{(l)}\).

Inductive step. Assume \(\widetilde{U}_l^k = \Sigma_{kl} E_k\). Then \(\widetilde{U}_l^{k+1} = \Sigma_{kl} E_k \cdot \Sigma_l D_l.\) Since \(E_k\) is diagonal and \(\Sigma_l\) is the shift by \(l\) on \(\mathbb{C}^n\), commuting \(E_k\) past \(\Sigma_l\) relabels the diagonal indices: \[E_k \Sigma_l = \Sigma_l \widehat{E}_k, \qquad (\widehat{E}_k)_{mm} = (E_k)_{m-l \bmod n,\; m-l \bmod n}.\] Hence \[\widetilde{U}_l^{k+1} = \Sigma_{(k+1)l}\,\widehat{E}_k D_l = \Sigma_{(k+1)l}\,E_{k+1},\] where \[(E_{k+1})_{mm} = (\widehat{E}_k)_{mm}\cdot d_m^{(l)} = \prod_{r=0}^{k-1} d_{m-(r+1)l}^{(l)} \cdot d_m^{(l)} = \prod_{r=0}^{k} d_{m-rl}^{(l)}.\] This completes the induction. At \(k = n\) the shift satisfies \(\Sigma_{nl} = \Sigma_0 = I_n\) since \(nl \equiv 0 \pmod{n}\) for every \(l\), so \[\widetilde{U}_l^n = E_n,\] and it remains to determine the diagonal entries of \(E_n\). Fix \(m \in \mathbb{Z}_n\) and consider the sequence of indices \[m,\; m-l,\; m-2l,\; \ldots,\; m-(n-1)l \pmod{n}.\] Let \(g = \gcd(l \bmod n,\,n)\). The map \(r \mapsto m - rl \bmod n\) has period \(n/g\), so as \(r\) runs over \(\{0,1,\ldots,n-1\}\) each element of the orbit \[\mathcal{O}(m,l) = \{m - rl \bmod n : r \in \mathbb{Z}_n\}\] is visited exactly \(g\) times. The factor \(d_{m-rl}^{(l)}\) equals \(+1\) only when \(m - rl \equiv l \pmod{n}\). The number of such \(r \in \{0,\ldots,n-1\}\) is \[N_+(m,l) = \#\{r \in \mathbb{Z}_n : rl \equiv m-l \pmod{n}\} = \begin{cases} g & \text{if } g \mid (m-l),\\ 0 & \text{if } g \nmid (m-l). \end{cases}\] The remaining \(n - N_+(m,l)\) factors each equal \(-1\), so \[\label{eq:Enentry} (E_n)_{mm} = (+1)^{N_+}\cdot(-1)^{n-N_+} = (-1)^{n-N_+}.\tag{31}\]

8.0.0.1 Case 1: \(g \nmid (m-l)\).

Then \(N_+ = 0\), so \((E_n)_{mm} = (-1)^n = +1\) since \(n = 2^s\) is even.

8.0.0.2 Case 2: \(g \mid (m-l)\).

Then \(N_+ = g\), so \((E_n)_{mm} = (-1)^{n-g}\). Write \(g = \gcd(l \bmod n,\,n) = 2^a\) with \(0 \leq a \leq s\), so that \(n - g = 2^s - 2^a = 2^a(2^{s-a}-1)\).

  • If \(a \geq 1\) (that is\(l \bmod n\) is even): \(n - g\) is even, so \((-1)^{n-g} = +1\).

  • If \(a = 0\) (that is\(l \bmod n\) is odd, \(g = 1\)): \(n - g = 2^s - 1\) is odd for \(s \geq 1\), so \((-1)^{n-g} = -1\).

Combining both cases, for every \(m \in \mathbb{Z}_n\), \[(E_n)_{mm} = \begin{cases} +1 = (-1)^{l \bmod n} & \text{if } l \bmod n \text{ is even},\\ -1 = (-1)^{l \bmod n} & \text{if } l \bmod n \text{ is odd}. \end{cases}\] Hence \(E_n = (-1)^{l \bmod n}\,I_n\) independently of \(m\), and therefore \[\widetilde{U}_l^n = (-1)^{l \bmod n}\,I_n.\] Squaring gives \(\widetilde{U}_l^{2n} = I_n\). To see that the order is exactly \(2n\) when \(l \bmod n\) is odd, note that \(\widetilde{U}_l^n = -I_n \neq I_n\), so no divisor of \(n\) is the order. For \(n < T < 2n\), write \(T = n + q\) with \(1 \leq q < n\); then \[\widetilde{U}_l^T = \widetilde{U}_l^n \cdot \widetilde{U}_l^q = -\widetilde{U}_l^q.\] For \(\widetilde{U}_l^T = I_n\) we would need \(\widetilde{U}_l^q = -I_n\), hence \(\Sigma_{ql \bmod n} = I_n\), that is\(ql \equiv 0 \pmod{n}\). Since \(\gcd(l \bmod n,\,n) = 1\) this forces \(n \mid q\), contradicting \(1 \leq q < n\). Hence the order of \(\widetilde{U}_l\) is exactly \(2n\) for every \(l\) with \(l \bmod n\) odd. This proves part (i).

Proof of part (ii). Since \(d = n\), we verify directly that \(\widetilde{U}^{\,n}\) and \(I_n \otimes \widetilde{P}^{n/2}\) agree on every basis vector \(f_m \otimes f_l\) of \(\mathbb{C}^{n^2}\). From part (i), \[\widetilde{U}^{\,n}(f_m \otimes f_l) = \widetilde{U}_l^n\,(f_m \otimes f_l) = (-1)^{l \bmod n}\,(f_m \otimes f_l) = (-1)^l\,(f_m \otimes f_l),\] where the last equality uses \(l \in \mathbb{Z}_n\) so that \(l \bmod n = l\). Using the mixed-product property and the eigenrelation \(\widetilde{P}\,f_l = \omega^l f_l\) with \(\omega = e^{2\pi i/n}\), we have \[(I_n \otimes \widetilde{P}^{n/2})(f_m \otimes f_l) = f_m \otimes \widetilde{P}^{n/2} f_l = f_m \otimes \omega^{ln/2}\,f_l = e^{i\pi l}\,(f_m \otimes f_l) = (-1)^l\,(f_m \otimes f_l).\] Both sides produce the same scalar \((-1)^l\) on every basis vector \(f_m \otimes f_l\) of \(\mathbb{C}^{n^2}\), so \[\widetilde{U}^{\,n} = I_n \otimes \widetilde{P}^{n/2},\] which is part (ii). ◻

These two Lemmas together yield the PST and periodicity values of \(K_n^{\circlearrowleft}\), as established below with example.

Theorem 25. Let \(\pi\) be an equitable partition of a \(d\)-regular directed graph \(G\) on \(2n\) vertices, and suppose that the corresponding quotient graph is \(K_n^{\circlearrowleft}\), where \(n=2^s\) for some integer \(s\ge 1\). Then the following hold. (i) At time \(k=n\), PST occurs between each basis state \[e_{v_i}\otimes e_{v_j} \in \operatorname{Im}( I_d \otimes \widetilde{Q}), \qquad (v_i,v_j)\in\mathcal{A}(K_n^{\circlearrowleft}),\] representing the walker on the arc \((v_i,v_j)\), and the basis state corresponding to its antipodal arc \(\bigl(v_i,\;v_{j+n/2 \bmod n}\bigr).\) That is, for every \((v_i,v_j)\in\mathcal{A}(K_n^{\circlearrowleft})\), \[\Bigl| \bigl(\widetilde{U}^{\,n}\bigr)_{ (v_i,\;v_{j+n/2 \bmod n}), (v_i,\;v_j)} \Bigr|^2 =1,\] and hence the transfer fidelity is \(\mathcal{F}=1\).

(ii) \(\widetilde{U}^{\,2n} = I_{n^2},\) and the period of \(\widetilde{U}\) is exactly \(k = 2n\).

Proof. Let the vertices of \(K_n^{\circlearrowleft}\) be labeled by \(V(K_n^{\circlearrowleft}) = \{v_0,v_1,\ldots,v_{n-1}\}.\) Let \(\widetilde{U}\) be transition matrix of \(K_n^{\circlearrowleft}\) defined by \(\widetilde{U} = \widetilde{S} \widetilde{R}\), where \(S = \bigoplus_{k=0}^{n-1} \widetilde{P}^k\) and \(R = 2\widetilde{Q}\widetilde{Q}^\top - I_{n^2}\), \(\widetilde{Q} = \frac{1}{\sqrt{d}} \begin{bmatrix} I_n \\ \widetilde{P} \\ \widetilde{P}^2 \\ \vdots \\ \widetilde{P}^{d-1} \end{bmatrix}.\) Thus the arc set of \(K_n^{\circlearrowleft}\) is \(\mathcal{A}(K_n^{\circlearrowleft}) = \bigl\{(v_i, v_j) : i, j \in \mathbb{Z}_n\bigr\},\) so the state space of the walk is \(\mathbb{C}^{n^2}\) with orthonormal basis \(\{e_{v_i} \otimes e_{v_j}\}_{(v_i,v_j) \in \mathcal{A}(K_n^{\circlearrowleft})}\in \operatorname{Im}(I_d\otimes \widetilde{Q})\). Since \(d=n\) for \(K_n^{\circlearrowleft}\), we have by Lemma 13, \[\label{eq:Un-thm} \widetilde{U}^{\,n} = I_n\otimes \widetilde{P}^{n/2},\tag{32}\] where \(\widetilde{P}\) is the cyclic shift matrix satisfying \(\widetilde{P} e_{v_j}=e_{v_{j+1\bmod n}}\). The basis vector \(e_{v_i}\otimes e_{v_j}\) represents the walker on the arc \((v_i,v_j)\). Using the mixed-product property, \[(I_n\otimes \widetilde{P}^{n/2})(e_{v_i}\otimes e_{v_j}) = (I_n e_{v_i})\otimes(\widetilde{P}^{n/2}e_{v_j}) = e_{v_i}\otimes e_{v_{j+n/2\bmod n}}.\] Hence, by 32 , \[\widetilde{U}^{\,n}(e_{v_i}\otimes e_{v_j}) = e_{v_i}\otimes e_{v_{j+n/2\bmod n}}.\] Therefore every arc \((v_i,v_j)\) is mapped to its antipodal arc \((v_i,v_j) \longmapsto (v_i,v_{j+n/2\bmod n})\) with amplitude \(\bigl(\widetilde{U}^{\,n}\bigr)_{ (v_i,v_{j+n/2\bmod n}), (v_i,v_j)} = 1.\) Since \(\widetilde{U}^{\,n}\) is unitary, all other entries in the same column are zero, and thus the transfer fidelity is \[\mathcal{F} = \Bigl| \bigl(\widetilde{U}^{\,n}\bigr)_{ (v_i,v_{j+n/2\bmod n}), (v_i,v_j)} \Bigr|^2 = 1.\] This proves (i).

Applying 32 twice gives \[\widetilde{U}^{\,2n} = (\widetilde{U}^{\,n})^2 = (I_n\otimes C^{n/2})^2 = I_n\otimes C^n = I_{n^2}.\] Thus the period divides \(2n\). Since \(n\ge2\), \(\widetilde{P}^{n/2}e_{v_j} = e_{v_{j+n/2}} \neq e_{v_j},\) so \(\widetilde{P}^{n/2}\neq I_n\), and hence \[\widetilde{U}^{\,n} = I_n\otimes \widetilde{P}^{n/2} \neq I_{n^2}.\] Therefore the period does not divide \(n\). Since it divides \(2n\) but not \(n\), the period is exactly \(2n\). This proves (ii). ◻

Example 26. \(K_4^{\circlearrowleft}\) with Loops, \(n = 4 = 2^2=d\). The cyclic shift matrix \(\widetilde{P} \in M_{4\times4}(\mathbb{R})\) is defined by \((\widetilde{P})_{ij} = \delta_{i,\,j+1 \bmod 4}\) \[\widetilde{P}= \begin{bmatrix} 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 \end{bmatrix}.\] Its powers are \[\widetilde{P}^0 = I_4, \qquad \widetilde{P}^1 = \widetilde{P}, \qquad \widetilde{P}^2 = \begin{bmatrix} 0&0&1&0\\ 0&0&0&1\\ 1&0&0&0\\ 0&1&0&0 \end{bmatrix}, \qquad \widetilde{P}^3 = \begin{bmatrix} 0&0&0&1\\ 1&0&0&0\\ 0&1&0&0\\ 0&0&1&0 \end{bmatrix}.\] \[\widetilde{Q} = \frac{1}{\sqrt{4}} \begin{bmatrix} I_4 \\ \widetilde{P} \\ \widetilde{P}^2 \\ \widetilde{P}^3 \end{bmatrix} = \frac{1}{2} \scalebox{0.5}{\begin{bmatrix} 1&0&0&0\\ 0&1&0&0\\ 0&0&1&0\\ 0&0&0&1\\ 0&1&0&0\\ 0&0&1&0\\ 0&0&0&1\\ 1&0&0&0\\ 0&0&1&0\\ 0&0&0&1\\ 1&0&0&0\\ 0&1&0&0\\ 0&0&0&1\\ 1&0&0&0\\ 0&1&0&0\\ 0&0&1&0 \end{bmatrix}} \in M_{16\times4}(\mathbb{R}).\]

Each column of \(\widetilde{Q}\) contains exactly four entries equal to \(\tfrac{1}{2}\) and is otherwise zero, so every column has unit norm. Distinct columns have disjoint support, hence are orthogonal. Therefore \(\widetilde{Q}^{\top}\widetilde{Q} = I_4\). Set \(P = \widetilde{Q}\widetilde{Q}^{\top} \in M_{16\times16}(\mathbb{R})\), the orthogonal projection onto the column space of \(\widetilde{Q}\), and \[\widetilde{R} = 2P - I_{16}.\] Hence \(\widetilde{R}\) is a symmetric orthogonal matrix (a Householder-type reflection).

\[\widetilde{S} = \bigoplus_{k=0}^{3} \widetilde{P}^k = \begin{bmatrix} I_4 & 0 & 0 & 0 \\ 0 & \widetilde{P} & 0 & 0 \\ 0 & 0 & \widetilde{P}^2 & 0 \\ 0 & 0 & 0 & \widetilde{P}^3 \end{bmatrix} \in M_{16\times16}(\mathbb{R}).\] Since each \(\widetilde{P}^k\) is a permutation matrix, \(\widetilde{S}\) is also a permutation matrix and hence orthogonal \(\widetilde{S}^{\top} \widetilde{S} = I_{16}\). We have \(\widetilde{U} = \widetilde{S} \widetilde{R} \in M_{16\times16}(\mathbb{R}).\) Since \(\widetilde{S}\) and \(\widetilde{R}\) are both orthogonal, \(\widetilde{U}^{\top}\widetilde{U} = \widetilde{R}^{\top}\widetilde{S}^{\top} \widetilde{S} \widetilde{R} = \widetilde{R}^{\top} \widetilde{R} = I_{16}\), so \(\widetilde{U}\) is orthogonal and all its eigenvalues lie on the unit circle. Let \(\omega = e^{2\pi i/4} = i\) and \(f_l = \tfrac{1}{2}[1, \omega^l, \omega^{2l}, \omega^{3l}]^{\top}\) for \(l \in \mathbb{Z}_4\). By Lemma 12, \(\widetilde{U}\) preserves each subspace \(V_l = \operatorname{span}\{f_m \otimes f_l : m \in \mathbb{Z}_4\}, \qquad l \in \mathbb{Z}_4,\) and its restriction to \(V_l\) (in the basis \(\{f_m \otimes f_l\}\)) is \[\widetilde{U}_l = \Sigma_l D_l,\] where \(\Sigma_l\) is the cyclic shift by \(l\) and \(D_l = \operatorname{diag}(d_0^{(l)}, \ldots, d_3^{(l)})\) with \[d_m^{(l)} = \begin{cases} +1 & m = l, \\ -1 & m \neq l. \end{cases}\]

Explicitly \[\Sigma_0 = I_4, \qquad \Sigma_1 = \begin{bmatrix}0&0&0&1\\1&0&0&0\\0&1&0&0\\0&0&1&0\end{bmatrix}, \qquad \Sigma_2 = \begin{bmatrix}0&0&1&0\\0&0&0&1\\1&0&0&0\\0&1&0&0\end{bmatrix}, \qquad \Sigma_3 = \begin{bmatrix}0&1&0&0\\0&0&1&0\\0&0&0&1\\1&0&0&0\end{bmatrix},\] \[D_0 = \operatorname{diag}(+1,-1,-1,-1), \quad D_1 = \operatorname{diag}(-1,+1,-1,-1), \quad D_2 = \operatorname{diag}(-1,-1,+1,-1),\] \[D_3 = \operatorname{diag}(-1,-1,-1,+1).\]

From Lemma 12, Equation 28 , we have for each \(l \in \mathbb{Z}_4\) \[\label{eq:charpoly} \det(\lambda I - \widetilde{U}_l) = \prod_{m=0}^{3}(\lambda + \omega^{lm}) - \frac{1}{2}\sum_{m=0}^{3} \omega^{-ml} \prod_{\substack{j=0\\j\neq m}}^{3}(\lambda + \omega^{lj}).\qquad{(1)}\]

**Case \(l = 0\).* All \(\omega^{0\cdot m} = 1\), so \(\omega^{-m\cdot 0} = 1\) and \[\prod_{m=0}^{3}(\lambda+1) = (\lambda+1)^4, \qquad \frac{1}{2}\sum_{m=0}^{3}(\lambda+1)^3 = \frac{1}{2}\cdot 4(\lambda+1)^3 = 2(\lambda+1)^3.\] Hence \[\det(\lambda I - \widetilde{U}_0) = (\lambda+1)^4 - 2(\lambda+1)^3 = (\lambda+1)^3\bigl[(\lambda+1)-2\bigr] = (\lambda+1)^3(\lambda-1).\] Eigenvalues of \(\widetilde{U}_0\): \(\{-1,-1,-1,+1\}\). Cases \(l = 1\) and \(l = 3\) (odd \(l\)). Since \(l\) is odd and \(n = 2^2\), Lemma 13 gives \(\widetilde{U}_l^4 = -I_4\). If \(\lambda\) is an eigenvalue with eigenvector \(v\), then \(-v = \widetilde{U}_l^4 v = \lambda^4 v,\) so \(\lambda^4 = -1\). The four solutions are the primitive \(8\)th roots of unity, all distinct. The \(4\times 4\) matrix \(\widetilde{U}_l\) therefore has characteristic polynomial \[\det(\lambda I - \widetilde{U}_l) = \lambda^4 + 1.\] Eigenvalues of \(\widetilde{U}_1\) and \(\widetilde{U}_3\): \(e^{\pm i\pi/4},\, e^{\pm 3i\pi/4}\), that is\(\dfrac{\pm 1 \pm i}{\sqrt{2}}\).*

**Case \(l = 2\).* Here \(\omega^2 = -1\), so \(\omega^{2m}\) cycles as \(\{1,-1,1,-1\}\). We apply ?? directly.*

**First term. \[\prod_{m=0}^{3}(\lambda+\omega^{2m}) = (\lambda+1)^2(\lambda-1)^2 = (\lambda^2-1)^2.\]

**Second term.* The weights \(\omega^{-2m} = (-1)^{-m}\) cycle as \(\{1,-1,1,-1\}\). The four omitted products are: \[\begin{array}{rcl} m=0: & \omega^{0} = 1, & \displaystyle\prod_{j\neq0}(\lambda+\omega^{2j}) = (\lambda-1)(\lambda+1)(\lambda-1) = (\lambda^2-1)(\lambda-1),\\ m=1: & \omega^{-2} = -1, & \displaystyle\prod_{j\neq1}(\lambda+\omega^{2j}) = (\lambda+1)(\lambda+1)(\lambda-1) = (\lambda+1)^2(\lambda-1),\\[6pt] m=2: & \omega^{-4} = 1, & \displaystyle\prod_{j\neq2}(\lambda+\omega^{2j}) = (\lambda+1)(\lambda-1)(\lambda-1) = (\lambda^2-1)(\lambda-1),\\[6pt] m=3: & \omega^{-6} = -1, & \displaystyle\prod_{j\neq3}(\lambda+\omega^{2j}) = (\lambda+1)(\lambda+1)(\lambda-1) = (\lambda+1)^2(\lambda-1). \end{array}\] Collecting with their weights and the factor \(\tfrac{1}{2}\) \[\begin{align} &\frac{1}{2}\Bigl[ 1\cdot(\lambda^2-1)(\lambda-1) + (-1)\cdot(\lambda+1)^2(\lambda-1) + 1\cdot(\lambda^2-1)(\lambda-1) + (-1)\cdot(\lambda+1)^2(\lambda-1) \Bigr]\\[4pt] &= (\lambda-1)\Bigl[(\lambda^2-1) - (\lambda+1)^2\Bigr] = -2(\lambda^2-1). \end{align}\] \[\begin{align} \det(\lambda I - \widetilde{U}_2) &= (\lambda^2-1)^2 + 2(\lambda^2-1) = (\lambda^2-1)(\lambda^2+1) = \lambda^4 - 1. \end{align}\] Eigenvalues of \(\widetilde{U}_2\): \(\{+1,-1,+i,-i\}\).*

Collecting eigenvalues from all four blocks:

\(l\) Characteristic polynomial Eigenvalues (with multiplicity)
\(0\) \((\lambda+1)^3(\lambda-1)\) \(-1\) (mult.), \(+1\) (mult.)
\(1\) \(\lambda^4+1\) \(e^{\pm i\pi/4},\; e^{\pm 3i\pi/4}\) (each mult.)
\(2\) \(\lambda^4-1 = (\lambda^2-1)(\lambda^2+1)\) \(+1,\;-1,\;+i,\;-i\) (each mult.)
\(3\) \(\lambda^4+1\) \(e^{\pm i\pi/4},\; e^{\pm 3i\pi/4}\) (each mult.)

Summing multiplicities across all blocks gives \[\operatorname{spec}(\widetilde{U}) = \left\{ +1^{(2)},\; -1^{(4)},\; (+i)^{(1)},\; (-i)^{(1)},\; \Bigl(\tfrac{1+i}{\sqrt{2}}\Bigr)^{(2)},\; \Bigl(\tfrac{1-i}{\sqrt{2}}\Bigr)^{(2)},\; \Bigl(\tfrac{-1+i}{\sqrt{2}}\Bigr)^{(2)},\; \Bigl(\tfrac{-1-i}{\sqrt{2}}\Bigr)^{(2)} \right\},\] accounting for all \(16\) eigenvalues, all on the unit circle.

  • \(l = 1, 3\) (odd): \(\widetilde{U}_l^4 = -I_4\), so \(\widetilde{U}_l^8 = I_4\).

  • \(l = 0\): eigenvalues \(\pm 1\) give \(\widetilde{U}_0^2 = I_4\), so \(\widetilde{U}_0^8 = I_4\).

  • \(l = 2\): eigenvalues \(+1,-1,+i,-i\) give \(\widetilde{U}_2^4 = I_4\), so \(\widetilde{U}_2^8 = I_4\).

Hence \(\widetilde{U}^8 = \bigoplus_{l=0}^{3} \widetilde{U}_l^8 = I_{16}\). The blocks \(l = 1,3\) have primitive \(8\)th roots of unity as eigenvalues, forcing \(8 \mid T\). Therefore, \({T = 2n = 8.}\) By Theorem 25(i), PST occurs at time \(t = 4\) via the operator identity \[\widetilde{U}^{\,4} = I_4 \otimes \widetilde{P}^2.\] We verify this directly from the \(16\times16\) matrix \(\widetilde{U}^4\), whose rows and columns are indexed by arcs \(i\to j\) with \(i,j\in\mathbb{Z}_4\). The matrix has a single \(+1\) in each row and column and is zero elsewhere:

Each row \(i\to j\) has its unique \(+1\) in column \(i\to j+2\bmod 4\), confirming \(\widetilde{U}^4 = I_4\otimes\widetilde{P}^2\) entry by entry. The image of \(I_4\otimes\widetilde{Q}\) consists of all vectors of the form \[\operatorname{Im}(I_4\otimes\widetilde{Q}) = \left\{ \frac{1}{2} \begin{bmatrix} \widetilde{Q}z_0 \\ \widetilde{Q}z_1 \\ \widetilde{Q}z_2 \\ \widetilde{Q}z_3 \end{bmatrix} : z_0,z_1,z_2,z_3\in\mathbb{C}^4 \right\}.\] Taking \(z_i = e_{v_j}\) for each pair \((i,j)\in\mathbb{Z}_4\times\mathbb{Z}_4\) and \(z_k=0\) for \(k\neq i\), the 16 distinguished basis states in \(\operatorname{Im}(I_4\otimes\widetilde{Q})\) are \[x_{ij} = (I_4\otimes\widetilde{Q})(e_{v_i}\otimes e_{v_j}) = e_{v_i}\otimes\widetilde{Q}e_{v_j} = \frac{1}{2}\,e_{v_i}\otimes \begin{bmatrix} e_{v_j}\\e_{v_{j+1\bmod4}}\\e_{v_{j+2\bmod4}}\\e_{v_{j+3\bmod4}} \end{bmatrix}, \qquad i,j\in\mathbb{Z}_4.\] Explicitly, for tail block \(i=0\): \[x_{0,0} = \frac{1}{2} \begin{bmatrix}e_{v_0}\\e_{v_1}\\e_{v_2}\\e_{v_3}\\0\\\vdots\\0\end{bmatrix},\quad x_{0,1} = \frac{1}{2} \begin{bmatrix}e_{v_1}\\e_{v_2}\\e_{v_3}\\e_{v_0}\\0\\\vdots\\0\end{bmatrix},\quad x_{0,2} = \frac{1}{2} \begin{bmatrix}e_{v_2}\\e_{v_3}\\e_{v_0}\\e_{v_1}\\0\\\vdots\\0\end{bmatrix},\quad x_{0,3} = \frac{1}{2} \begin{bmatrix}e_{v_3}\\e_{v_0}\\e_{v_1}\\e_{v_2}\\0\\\vdots\\0\end{bmatrix},\] and analogously for tail blocks \(i=1,2,3\), with the nonzero entries shifted to the corresponding block. Applying \(\widetilde{U}^{4} = I_4\otimes\widetilde{P}^{2}\). Since \(I_4\otimes\widetilde{P}^2\) acts on each tail-block \(i\) independently by \(\widetilde{P}^2\), and \(x_{ij}\) is supported only in tail-block \(i\): \[\widetilde{U}^{\,4}\,x_{ij} = (I_4\otimes\widetilde{P}^2)(e_{v_i}\otimes\widetilde{Q}e_{v_j}) = e_{v_i}\otimes\widetilde{P}^2\widetilde{Q}e_{v_j} = \frac{1}{2}\,e_{v_i}\otimes \begin{bmatrix} e_{v_{j+2\bmod4}}\\e_{v_{j+3\bmod4}}\\e_{v_{j+0\bmod4}}\\e_{v_{j+1\bmod4}} \end{bmatrix} = e_{v_i}\otimes\widetilde{Q}e_{v_{j+2\bmod4}} = x_{i,\,j+2\bmod4}.\] Hence \(\widetilde{U}^{\,4}\,x_{ij} = x_{i,\,j+2\bmod 4}\), with fidelity \[\mathcal{F} = \bigl|\langle x_{i,\,j+2\bmod4},\,\widetilde{U}^{\,4}\,x_{ij}\rangle\bigr|^2 = 1.\] The 16 PST pairs, grouped by tail block, are:

Tail block Initial state \(x\) Target state \(y\)
\(i=0\) \(x_{0,0}\) \(x_{0,2}\)
\(i=0\) \(x_{0,1}\) \(x_{0,3}\)
\(i=0\) \(x_{0,2}\) \(x_{0,0}\)
\(i=0\) \(x_{0,3}\) \(x_{0,1}\)
\(i=1\) \(x_{1,0}\) \(x_{1,2}\)
\(i=1\) \(x_{1,1}\) \(x_{1,3}\)
\(i=1\) \(x_{1,2}\) \(x_{1,0}\)
\(i=1\) \(x_{1,3}\) \(x_{1,1}\)
\(i=2\) \(x_{2,0}\) \(x_{2,2}\)
\(i=2\) \(x_{2,1}\) \(x_{2,3}\)
\(i=2\) \(x_{2,2}\) \(x_{2,0}\)
\(i=2\) \(x_{2,3}\) \(x_{2,1}\)
\(i=3\) \(x_{3,0}\) \(x_{3,2}\)
\(i=3\) \(x_{3,1}\) \(x_{3,3}\)
\(i=3\) \(x_{3,2}\) \(x_{3,0}\)
\(i=3\) \(x_{3,3}\) \(x_{3,1}\)

Applying the transfer twice confirms the period \[\widetilde{U}^{\,8}\,x_{ij} = \widetilde{U}^{\,4}\,x_{i,\,j+2\bmod4} = x_{i,\,j+4\bmod4} = x_{ij}, \qquad \widetilde{U}^{\,8} = I_{16}.\] Since \(\widetilde{P}^2\neq I_4\) (as \(e_{v_0}\mapsto e_{v_2}\neq e_{v_0}\)), we have \(\widetilde{U}^{\,4} = I_4\otimes\widetilde{P}^2\neq I_{16}\), so the period does not divide \(4\). Therefore the period of \(\widetilde{U}\) is exactly \(2n = 8\).

Thus the derived model exhibits exact PST on \(K_{n}^{\circlearrowleft}\) whenever \(n=d\) is a power of \(2\). Specifically, PST occurs after \(n\) steps and the evolution is periodic with period \(2n\). Thus, for every complete graph with loops on \(n=2^s\) vertices, the corresponding quotient quantum walk exhibits PST together with a well-defined periodic structure.

9 Construction of \(LD(K_{n,n}^{\rightleftharpoons})\) with PST for \(n = 2^s\), \(s \geq 0\)↩︎

Figure 6: (a) The vertex-equitable partition \pi = \{C_1, C_2, C_3, C_4\}of K^{\rightleftharpoons}_{4,4} with colored inter-cell arcs.(b) The corresponding quotient digraphK^{\rightleftharpoons}_{4,4}/\pi \cong K_4^{\circlearrowleft},the complete digraph on four vertices with a loop at each cell.

In this section, we consider the line digraph of the complete bipartite digraph \(LD(K^{\rightleftharpoons}_{n,n})\), where \(n = d\) holds for this graph. We perform a vertex-equitable partition \(\pi\) of \(K^{\rightleftharpoons}_{n,n}\), and show that \[K^{\rightleftharpoons}_{n,n}/\pi \cong K^{\circlearrowleft}_{n},\] that is, the complete bipartite digraph with loops at all vertices. The relation between \(LD(K^{\rightleftharpoons}_{2n,2n})/\tau\) and \(LD(K^{\rightleftharpoons}_{n,n}/\pi)\) will be further established in subsequent theorems with illustrative examples, where \(\tau\) is an equitable arc partition of \(K^{\rightleftharpoons}_{n,n}\). Moreover, the PST in \(LD(K^{\rightleftharpoons}_{n,n})\) also showed in the subsequent results.

Lemma 14. Let \(K^{\rightleftharpoons}_{n,n}\) be the complete bipartite digraph with bipartition \(A=\{a_1,\dots,a_n\}\) and \(B=\{b_1,\dots,b_n\}\) and arc set \[E=\{(a_i,b_j)\}\cup\{(b_i,a_j)\},\quad 1\le i,j\le n,\] so that \(|E|=2n^2\). For each pair \((i,j)\in[n]^2\) define the cell \[C_{ij}=\{(a_i,b_j),(b_i,a_j)\}\subset E.\] Then \(\tau=\{C_{ij}:1\le i,j\le n\}\) is an equitable partition of the arc set of \(LD(K^{\rightleftharpoons}_{n,n})\) into \(n^2\) cells of size \(2\), with quotient matrix \(B\in\{0,1\}^{n^2\times n^2}\) whose \(\big((i,j),(k,l)\big)\)-entry is \[B_{(i,j),(k,l)}=\begin{cases}1 & \text{if }j=k,\\0 & \text{if }j\neq k.\end{cases}\] Furthermore, \[LD(K^{\rightleftharpoons}_{n,n})/\tau\;\cong\; LD(K^{\circlearrowleft}_n).\]

Proof. Every arc of \(E\) is uniquely of the form \((a_i,b_j)\) or \((b_i,a_j)\) for some \((i,j)\in[n]^2\), so each arc belongs to exactly one cell \(C_{ij}\). The cells are pairwise disjoint and cover \(E\), so \(\tau\) partitions \(E\) into \(n^2\) cells each of size \(2\). For each cell \(C_{ij}\) \[\label{tail32head} \mathrm{tail}(C_{ij})=\{a_i,b_i\},\quad \mathrm{head}(C_{ij})=\{a_j,b_j\}.\tag{33}\]

By definition of the line digraph, \(C_{ij}\to C_{kl}\) in \(LD(K^{\rightleftharpoons}_{n,n})\) if and only if \[\mathrm{head}(C_{ij})\cap\mathrm{tail}(C_{kl})\neq\emptyset,\] that is, \(\{a_j,b_j\}\cap\{a_k,b_k\}\neq\emptyset\), which holds if and only if \(j=k\). Hence out neighbours of \[\label{head32tail} (C_{ij})=\{C_{jl}:1\le l\le n\},\tag{34}\] and every cell has out-degree exactly \(n\). We must show that for every pair of cells \(C_{ij}\) and \(C_{kl}\), every arc \(e\in C_{ij}\) points to the same number of arcs in \(C_{kl}\), and that this number equals \(B_{(i,j),(k,l)}\).

Case 1: \(j\neq k\). By Equation 34 , no arc of \(C_{ij}\) points to any arc of \(C_{kl}\), so the count is \(0\).

Case 2: \(j=k\). Take any arc \(e\in C_{ij}\). From Equation  33 , \(e\) has a unique head vertex \(v\in\mathrm{head}(C_{ij})=\{a_j,b_j\}\), namely: \[v=\begin{cases}b_j & \text{if }e=(a_i,b_j),\\ a_j & \text{if }e=(b_i,a_j).\end{cases}\] Now consider cell \(C_{jl}\) (since \(k=j\)). Its two arcs are \((a_j,b_l)\) and \((b_j,a_l)\), with tails \(a_j\) and \(b_j\) respectively. Exactly one of these tails equals \(v\): \[\begin{cases} (a_j,b_l)\text{ has tail }a_j=v & \text{if }e=(b_i,a_j),\\ (b_j,a_l)\text{ has tail }b_j=v & \text{if }e=(a_i,b_j). \end{cases}\] Hence exactly \(1\) arc in \(C_{jl}=C_{kl}\) follows \(e\), and this count is independent of which arc \(e\in C_{ij}\) we chose and independent of \(i\) and \(l\). Combining both cases, the number of arcs in \(C_{kl}\) that any arc \(e\in C_{ij}\) points to is \[B_{(i,j),(k,l)}=\begin{cases}1 & \text{if }j=k,\\0 & \text{if }j\neq k,\end{cases}\] which depends only on \(j\) and \(k\), not on \(i\), \(l\), or the choice of \(e\in C_{ij}\). Therefore \(\tau\) is an equitable partition with quotient matrix \(B\) as stated. If \(Q_\tau\) is the normalized characteristic matrix of \(\tau\), then \[A_{LD(K^{\rightleftharpoons}_{n,n})}\,Q_\tau=Q_\tau\,B,\] where \(A_{LD(K^{\rightleftharpoons}_{n,n})}\) is the adjacency matrix of \(LD(K^{\rightleftharpoons}_{n,n})\). Under the identification \(C_{ij}\mapsto(i\to j)\), the adjacency rule \[C_{ij}\to C_{kl}\iff j=k\] coincides exactly with the arc-composition rule \((i\to j)\to(j\to l)\) in \(LD(K^{\circlearrowleft}_n)\). Hence \[LD(K^{\rightleftharpoons}_{n,n})/\tau\cong LD(K^{\circlearrowleft}_n).\] ◻

Next, we consider the vertex equitable partition of \(K_{n,n}^{\rightleftharpoons}\) and show that its quotient graph is isomorphic to the complete digraph with loops \(K_n^{\circlearrowleft}\).

Lemma 15. Let \(K_{n,n}^{\rightleftharpoons}\) be the complete bipartite digraph with bipartition \(A = \{a_1, \dots, a_n\}\) and \(B = \{b_1, \dots, b_n\}\). Define the partition \(\pi \;=\; \{C_1, \dots, C_n\}, \qquad C_i \;=\; \{a_i,\, b_i\}, \quad i = 1, \dots, n.\) Then \(\pi\) is an equitable partition of \(K_{n,n}^{\rightleftharpoons}\), and the corresponding quotient digraph satisfies \[K_{n,n}^{\rightleftharpoons}/\pi \;\cong\; K_n^{\circlearrowleft},\] where \(K_n^{\circlearrowleft}\) denotes the complete digraph on \(n\) vertices with a loop at every vertex. Moreover, the normalized characteristic matrix of \(\pi\) is given by \[Q \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_n \\ I_n \end{pmatrix},\] where \(I_n\) is the identity matrix of order \(n\).

Proof. Fix any two cells \(C_i, C_j \in \pi\). Since \(a_i\) has out-neighbours \(\{b_1,\dots,b_n\}\) and \(b_j\) is the unique member of \(B\cap C_j\), vertex \(a_i\) has exactly one out-neighbour in \(C_j\). Likewise \(b_i\) has out-neighbours \(\{a_1,\dots,a_n\}\) and \(a_j\) is the unique member of \(A\cap C_j\), so \(b_i\) also has exactly one out-neighbour in \(C_j\). This count is \(1\) for every pair \((i,j)\), including \(i=j\), so \(\pi\) is equitable with quotient matrix \[B_{ij} \;=\; 1 \quad\text{for all } i,j, \qquad\text{that is, } B = J_n.\] Each cell \(C_i = \{a_i, b_i\}\) has size \(d = 2\), so the normalized characteristic matrix is \[Q \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_n \\ I_n \end{pmatrix} \;\in\; \mathbb{R}^{2n\times n},\] where the \(i\)-th column has entry \(\tfrac{1}{\sqrt{2}}\) at rows \(a_i\) and \(b_i\), and zero elsewhere. Fix any \(i \in [n]\). The \(i\)-th column of \(A_G Q\) is \[A_{K_{n,n}^{\rightleftharpoons}} Q\, e_i \;=\; \frac{1}{\sqrt{2}}\,A_{K_{n,n}^{\rightleftharpoons}}\,\mathbf{1}_{C_i},\] where \(\mathbf{1}_{C_i} \in \mathbb{R}^{2n}\) denotes the indicator vector of the cell \(C_i\), with entry \(1\) at vertices \(a_i, b_i\) and \(0\) elsewhere. Since \(a_i\) sends an arc to every \(b_j\) and \(b_i\) sends an arc to every \(a_j\), every vertex of \(K_{n,n}^{\rightleftharpoons}\) receives exactly one arc from \(C_i\), so \(A_{K_{n,n}^{\rightleftharpoons}}\,\mathbf{1}_{C_i} \;=\; \mathbf{1}_{V(K_{n,n}^{\rightleftharpoons})}.\) The \(i\)-th column of \(Q J_n\) is \[Q J_n\, e_i \;=\; \frac{1}{\sqrt{2}} \begin{pmatrix} I_n \\ I_n \end{pmatrix} \mathbf{1}_n \;=\; \frac{1}{\sqrt{2}}\,\mathbf{1}_{V(K_{n,n}^{\rightleftharpoons})},\] since \(J_n e_i = \mathbf{1}_n\) and each vertex of \(G\) belongs to exactly one cell, so \(\sum_{j=1}^n \mathbf{1}_{C_j} = \mathbf{1}_{V(K_{n,n}^{\rightleftharpoons})}\). Both columns equal \(\tfrac{1}{\sqrt{2}}\,\mathbf{1}_{V(K_{n,n}^{\rightleftharpoons})}\) for every \(i \in [n]\), hence \(A_{K_{n,n}^{\rightleftharpoons}}\,Q = Q\,J_n\). Thus, the quotient graph \(K_{n,n}^{\rightleftharpoons}/\pi\) has adjacency matrix \(B = J_n\), which has a \(1\) in every position including the diagonal. Hence \(K_{n,n}^{\rightleftharpoons}/\pi\) has an arc from \(C_i\) to \(C_j\) for every \((i,j)\in[n]^2\), including \(i=j\), giving \[K_{n,n}^{\rightleftharpoons}/\pi \cong K_n^{\circlearrowleft}.\] ◻

Example 27. Consider the complete bipartite digraph \(G = {K}^\rightleftharpoons_{4,4}\) with vertex set \(A\cup B\), where \(A=\{a_1,a_2,a_3,a_4\}\) and \(B=\{b_1,b_2,b_3,b_4\}\), and arc set \[\mathcal{A}(G) = \{(a_i,b_j)\mid 1\le i,j\le 4\} \cup \{(b_i,a_j)\mid 1\le i,j\le 4\}, \qquad |\mathcal{A}(G)|=32.\]

Define the arc partition \[\tau=\{C_{ij} : 1\le i,j\le 4\},\quad C_{ij}=\{(a_i,b_j),(b_i,a_j)\},\] so \(|\tau|=16\) cells each of size \(2\). The cells are displayed in the following table.

\[\renewcommand{\arraystretch}{1.3} \begin{array}{c|c|c|c|c} & j=1 & j=2 & j=3 & j=4 \\ \hline i=1 & T_1:\,(a_1,b_1),(b_1,a_1) & T_2:\,(a_1,b_2),(b_1,a_2) & T_3:\,(a_1,b_3),(b_1,a_3) & T_4:\,(a_1,b_4),(b_1,a_4)\\ \hline i=2 & T_5:\,(a_2,b_2),(b_2,a_2) & T_6:\,(a_2,b_3),(b_2,a_3) & T_7:\,(a_2,b_4),(b_2,a_4)& T_8:\,(a_2,b_1),(b_2,a_1) \\ \hline i=3 & T_{9}:\,(a_3,b_3),(b_3,a_3) & T_{10}:\,(a_3,b_4),(b_3,a_4)& T_{11}:\,(a_3,b_1),(b_3,a_1) & T_{12}:\,(a_3,b_2),(b_3,a_2) \\ \hline i=4 & T_{13}:\,(a_4,b_4),(b_4,a_4)& T_{14}:\,(a_4,b_1),(b_4,a_1) & T_{15}:\,(a_4,b_2),(b_4,a_2) & T_{16}:\,(a_4,b_3),(b_4,a_3) \end{array}\]

Since \(|\mathcal{A}(G)|=32\) and each cell has size \(2\), the normalized characteristic matrix is \[Q_\tau\in\; \mathbb{R}^{32\times 16},\] One verifies \(Q_\tau^\top Q_\tau = I_{16}\). By Lemma 4, \(\tau\) is an equitable partition of \(LD(G)\) and the quotient adjacency matrix \[A' = Q_\tau^\top\, A_{LD(G)}\, Q_\tau \;\in\;\mathbb{R}^{16\times 16}\] satisfies \(A_{LD(G)}\,Q_\tau = Q_\tau\,A'\). Ordering the cells as \(T_1,\dots,T_{16}\) (row-major in \(i\), then \(j\)), a direct computation gives \[A'= \renewcommand{\arraystretch}{0.8} \left[ \begin{array}{@{}cccc|cccc|cccc|cccc@{}} 1&1&1&1&0&0&0&0&0&0&0&0&0&0&0&0\\ 0&0&0&0&1&1&1&1&0&0&0&0&0&0&0&0\\ 0&0&0&0&0&0&0&0&1&1&1&1&0&0&0&0\\ 0&0&0&0&0&0&0&0&0&0&0&0&1&1&1&1\\ \hline 0&0&0&0&1&1&1&1&0&0&0&0&0&0&0&0\\ 0&0&0&0&0&0&0&0&1&1&1&1&0&0&0&0\\ 0&0&0&0&0&0&0&0&0&0&0&0&1&1&1&1\\ 1&1&1&1&0&0&0&0&0&0&0&0&0&0&0&0\\ \hline 0&0&0&0&0&0&0&0&1&1&1&1&0&0&0&0\\ 0&0&0&0&0&0&0&0&0&0&0&0&1&1&1&1\\ 1&1&1&1&0&0&0&0&0&0&0&0&0&0&0&0\\ 0&0&0&0&1&1&1&1&0&0&0&0&0&0&0&0\\ \hline 0&0&0&0&0&0&0&0&0&0&0&0&1&1&1&1\\ 1&1&1&1&0&0&0&0&0&0&0&0&0&0&0&0\\ 0&0&0&0&1&1&1&1&0&0&0&0&0&0&0&0\\ 0&0&0&0&0&0&0&0&1&1&1&1&0&0&0&0 \end{array} \right].\]

Let \(G'\) denote the quotient graph with adjacency matrix \(A'\). Note that \(LD(G)/\tau\ncong G\) in general; indeed \(G'=LD(G)/\tau\cong LD({K}_4^\circlearrowleft)\). Define the equitable vertex partition \[\pi=\{C_1,C_2,C_3,C_4\},\qquad C_k=\{a_k,b_k\},\] with normalized characteristic matrix \(Q\in\mathbb{R}^{8\times 4}\). Because every vertex in \(C_k\) has out-arcs to all vertices in every \(C_l\) (including \(l=k\)), the quotient is \[G/\pi \;\cong\; {K}_4^\circlearrowleft\] with adjacency matrix \(A(G/\pi)=J_4\) (the \(4\times 4\) all-ones matrix)(see Figure [fig:K4-quotient]). The complete digraph \({K}_4^\circlearrowleft\) has \(4\times 4=16\) arcs (including self-loops), with arc set \(\mathcal{A}(G/\pi)=\{(i,j):1\le i,j\le 4\}\). The line digraph \(LD(G/\pi)\) has these 16 arcs as vertices, with adjacency matrix (arcs ordered \((1,1),(1,2),(1,3),(1,4),(2,2),(2,3),(2,4),(2,1),(3,3),(3,4),(3,1),(3,2),(4,4),(4,1),(4,2),(4,3)\)), shown in Figure 6, we have \[A_{LD(G/\pi)} = A'\]

Now define the arc partition \(\sigma=\{\sigma_1,\sigma_2,\sigma_3,\sigma_4\}\) of \(LD(G/\pi)\) by grouping arcs by their terminal vertex \[\sigma_j = \{(i,j) : 1\le i\le 4\},\quad j=1,2,3,4.\] Each \(\sigma_j\) has size \(4\), so the normalized characteristic matrix is \[\widetilde{Q} \;\in\;\mathbb{R}^{16\times 4},\] Explicitly, \[\widetilde{Q}= \begin{bmatrix} \tfrac{1}{2}&0&0&0\\ 0&\tfrac{1}{2}&0&0\\ 0&0&\tfrac{1}{2}&0\\ 0&0&0&\tfrac{1}{2}\\[2pt] 0&\tfrac{1}{2}&0&0\\ 0&0&\tfrac{1}{2}&0\\ 0&0&0&\tfrac{1}{2}\\ \tfrac{1}{2}&0&0&0\\[2pt] 0&0&\tfrac{1}{2}&0\\ 0&0&0&\tfrac{1}{2}\\ \tfrac{1}{2}&0&0&0\\ 0&\tfrac{1}{2}&0&0\\[2pt] 0&0&0&\tfrac{1}{2}\\ \tfrac{1}{2}&0&0&0\\ 0&\tfrac{1}{2}&0&0\\ 0&0&\tfrac{1}{2}&0 \end{bmatrix}.\] A direct computation confirms: \[\widetilde{A} \;=\; \widetilde{Q}^\top\,A_{LD(G/\pi)}\,\widetilde{Q} \;=\; J_4,\] and \(A_{LD(G/\pi)}\,\widetilde{Q} = \widetilde{Q}\,\widetilde{A}\), so \(\sigma\) is equitable for \(LD(G/\pi)\) with quotient \[LD(G/\pi)/\sigma \;\cong\; {K}_4 ^\circlearrowleft\;\cong\; G/\pi.\] This verifies \(LD(G/\pi)/\sigma\cong G/\pi\). Comparing the matrices above, we see \[{A_{LD(G/\pi)} \;=\; A'},\] that is,the line-digraph adjacency matrix of the quotient graph \(G/\pi\) equals the quotient adjacency matrix of \(LD(G)\) under \(\tau\). Consequently, by Theorem 15, PST on \(LD(G/\pi)\) is equivalent to PST on \(LD(G)\).

Remark. Note that \(\widetilde{Q}\neq Q_\pi\): the former lives in \(\mathbb{R}^{16\times 4}\) (arcs of \(G/\pi\) vs.cells of \(\sigma\)), while the latter lives in \(\mathbb{R}^{8\times 4}\) (vertices of \(G\) vs.cells of \(\pi\)). Hence one cannot directly transfer PST results from \(G/\pi\) to \(G\) or vice versa via \(\widetilde{Q}\) alone; the equivalence is instead mediated by the identity \(A_{LD(G/\pi)}=A'\) and Theorem 15.

Following Lemma 15 and Lemma 14, we establish PST in the lifted line digraph \(LD(K_{n,n}^{\rightleftharpoons})\) by applying Theorem 25 and Theorem 15, as shown in Theorem 28 below.

Theorem 28. Let \(K^{\rightleftharpoons}_{n,n}\) be the complete bipartite digraph, where \(n=2^s\) for some integer \(s\geq 1\). Let \(\tau = \{T_1, \ldots, T_{2m}\}\), \(m = 2n\), be an equitable arc partition of \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n})\), with normalized characteristic matrix \(Q_\tau\). Let \(\pi = \{C_1, \ldots, C_n\}\) be an equitable vertex partition of \(K^{\rightleftharpoons}_{n,n}\) with \(C_i = \{a_i, b_i\}\), and let \(\sigma = \{\sigma_1, \ldots, \sigma_n\}\) be an equitable arc partition of \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n}/\pi)\) with normalized characteristic matrix \(\widetilde{Q}\). Let \(U_\tau\) and \(U_\sigma\) be the transition matrices of \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n})\) and \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n}/\pi)\), respectively. Then:

  1. \(U_\sigma\) exhibits PST in \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n}/\pi)\) from \((I_d \otimes \widetilde{Q} )\,x\) to \((I_d \otimes \widetilde{Q} )\,y\), for all \(x, y \in \mathrm{Im}(I_d \otimes \widetilde{Q})\), at step \(k = n\) and is periodic at step \(2n\).

  2. \(U_\tau\) exhibits PST in \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n})\) from \((I_d \otimes Q_\tau )( I_d \otimes\widetilde{Q} )\,x\) to \((I_d \otimes Q_\tau )( I_d \otimes \widetilde{Q})\,y\), for all \(x, y \in \mathrm{Im}(I_d\otimes \widetilde{Q} )\), at step \(k = n\) and is periodic at step \(k=2n\).

Proof. Let \(\pi = \{C_1, C_2, \ldots, C_n\}\) be an equitable vertex partition where \(C_i = \{a_i, b_i\}\). By Lemma 15, we have \[K^{\rightleftharpoons}_{n,n}/\pi \;\cong\; K_n^{\circlearrowleft}, \label{eq:quotient95iso}\tag{35}\] the complete graph with a loop at every vertex. Let \(\sigma = \{\sigma_1, \ldots, \sigma_n\}\) be an equitable arc partition of \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n}/\pi)\). Then by Theorem 8, \[\mathrm{LD}(K^{\rightleftharpoons}_{n,n}/\pi)/\sigma \;\cong\; K^{\rightleftharpoons}_{n,n}/\pi \;\cong\; K_n^{\circlearrowleft}.\] Since \(\sigma\) is an equitable arc partition, by Lemma 5 we have \[A_{\mathrm{LD}(K^{\rightleftharpoons}_{n,n}/\pi)}\,\widetilde{Q} \;=\; \widetilde{Q}\,\widetilde{A},\] where \(\widetilde{A}\) is the adjacency matrix of \(K_n^{\circlearrowleft}\). By relabeling the arcs of \(K^{\rightleftharpoons}_{n,n}/\pi\), the normalized characteristic matrix takes the form \[\widetilde{Q} \;=\; \frac{1}{\sqrt{d}} \begin{bmatrix} I_n \\ \widetilde{P} \\ \widetilde{P}^2 \\ \vdots \\ \widetilde{P}^{d-1} \end{bmatrix},\] where \[I_n + \widetilde{P} + \widetilde{P}^2 + \cdots + \widetilde{P}^{d-1} \;=\; A(K_n^{\circlearrowleft}),\] that is, \(\widetilde{P}, \ldots, \widetilde{P}^{d-1}\) are the cyclic shifts (permutation matrices) of the adjacency matrix of \(K_n^{\circlearrowleft}\).

By Theorem 25, \(K_n^{\circlearrowleft}\) exhibits PST at step \(k = n\) and is periodic at step \(2n\). Moreover, by Lemma 14, \[\mathrm{LD}(K^{\rightleftharpoons}_{n,n})/\tau \;\cong\; \mathrm{LD}(K^{\circlearrowleft}_n).\] Therefore, by Theorem 15, the transition matrix \(U_\sigma\) of \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n}/\pi)\) exhibits PST from \((I_d\otimes \widetilde{Q} )\,x\) to \((I_d \otimes \widetilde{Q})\,y\), for all \(x, y \in \mathrm{Im}(I_d\otimes \widetilde{Q} )\), at step \(k = n\) and is periodic at step \(2n\). Furthermore, the transition matrix \(U_\tau\) of \(\mathrm{LD}(K^{\rightleftharpoons}_{n,n})\) exhibits PST from \[(I_d\otimes Q_\tau )(I_d \otimes \widetilde{Q})\,x \quad \text{to} \quad (I_d \otimes Q_\tau )(I_d \otimes \widetilde{Q} )\,y,\] for all \(x, y \in \mathrm{Im}(I_d \otimes \widetilde{Q} )\), at step \(k = n\) and is periodic at step \(2n\). ◻

10 Construction of \(LD(\operatorname{Circ}(2n, S))\), where \(S\) consists of all odd residues modulo \(2n\), with PST for \(n = 2^s,\, s \geq 0\)↩︎

a

b

Figure 7: Three representations of \(\mathrm{Circ}(8,\{1,3,5,7\})\) under the equitable partition \(\pi = \{C_1, C_2, C_3, C_4\}\), where \(C_1 = \{0,3\}\), \(C_2 = \{1,6\}\), \(C_3 = \{4,7\}\), and \(C_4 = \{2,5\}\). The corresponding quotient digraph is \(K_4^{\circlearrowleft}\).. a — image, b — image

A circulant graph \(\mathrm{Circ}(n, S)\) is an undirected graph on vertex set \(\mathbb{Z}_n = \{0, 1, \dots, n-1\}\) in which each vertex \(v\) is adjacent to \(v + s \pmod{n}\) for every \(s \in S\), where \(S \subseteq \mathbb{Z}_n \setminus \{0\}\) is symmetric, that is, \(s \in S \Rightarrow -s \in S\). The graph is \(|S|\)-regular. When \(n\) is even and \(S\) consists of all odd residues modulo \(n\), we write \(\mathrm{Circ}(2n, n)\); this yields an \(n\)-regular graph in which every vertex is adjacent to all vertices at odd distance modulo \(n\).

In this section we partition the vertices of \(\mathrm{Circ}(2n, S)\) into \(n\) cells \(\pi = \{C_1, \dots, C_n\}\), each containing exactly one even and one odd element of \(\mathbb{Z}_{2n}\). Hence \(C_{2n}/\pi\) is 2-regular quotient graph by Corollary 1. Since every \(s \in S\) is odd, adding \(s\) to any vertex flips its parity, so each vertex has exactly one neighbour in every cell. This uniform one-per-cell property makes \(\pi\) an equitable partition, whose quotient adjacency matrix is determined in the lemma below.

Lemma 16. Let \(G = \mathrm{Circ}(2n, S)\) where \(S = \{1, 3, \dots, 2n-1\}\) is the set of all odd residues modulo \(2n\). Partition \(\mathbb{Z}_{2n}\) into \(n\) cells \(\pi = \{C_1, \dots, C_n\}\) where each cell contains exactly one even and one odd element of \(\mathbb{Z}_{2n}\). Then \[A(G/\pi) = J_{n \times n},\] so the quotient multigraph \(G/\pi\) is the complete graph \(K_n^\circlearrowleft\) augmented with a loop at every vertex.

Proof. Write \(\mathbb{Z}_{2n} = \mathcal{E} \sqcup \mathcal{O}\) where \(\mathcal{E} = \{0,2,\dots,2n-2\}\) and \(\mathcal{O} = \{1,3,\dots,2n-1\}\) are the even and odd elements respectively, each of cardinality \(n\). By hypothesis, each cell \(C_{r'}\) satisfies \(|C_{r'} \cap \mathcal{E}| = |C_{r'} \cap \mathcal{O}| = 1\), so we may write \(C_{r'} = \{e_{r'}, o_{r'}\}\) with \(e_{r'} \in \mathcal{E}\) and \(o_{r'} \in \mathcal{O}\). Fix \(r \in \{1,\dots,n\}\) and let \(v \in C_r\) be arbitrary. Since every \(s \in S = \mathcal{O}\) is odd, \[v + s \equiv v + 1 \pmod{2},\] so all \(n\) neighbours \(N(v) = \{v + s \pmod{2n} : s \in S\}\) lie entirely in \(\mathcal{O}\) if \(v \in \mathcal{E}\), and entirely in \(\mathcal{E}\) if \(v \in \mathcal{O}\). Moreover, since \(0 \notin S\), the map \(s \mapsto v + s \pmod{2n}\) is injective on \(S\), so \(|N(v)| = |S| = n\). Now fix \(r' \in \{1,\dots,n\}\). We count \(|N(v) \cap C_{r'}|\) by considering two cases.

Case 1: \(v \in \mathcal{E}\). Then \(N(v) \subseteq \mathcal{O}\), so \(N(v) \cap C_{r'} = N(v) \cap \{o_{r'}\}\). The element \(o_{r'} \in N(v)\) if and only if \(o_{r'} - v \pmod{2n} \in S\). Since \(v \in \mathcal{E}\) and \(o_{r'} \in \mathcal{O}\), we have \(v \neq o_{r'}\), so \(o_{r'} - v \not\equiv 0 \pmod{2n}\). Furthermore \(o_{r'} - v\) is odd (odd minus even), hence \(o_{r'} - v \pmod{2n} \in \mathcal{O} = S\). Thus \(|N(v) \cap C_{r'}| = 1\).

Case 2: \(v \in \mathcal{O}\). Then \(N(v) \subseteq \mathcal{E}\), so \(N(v) \cap C_{r'} = N(v) \cap \{e_{r'}\}\). Since \(v \in \mathcal{O}\) and \(e_{r'} \in \mathcal{E}\), we have \(v \neq e_{r'}\), so \(e_{r'} - v \not\equiv 0 \pmod{2n}\). Furthermore \(e_{r'} - v\) is odd (even minus odd), hence \(e_{r'} - v \pmod{2n} \in \mathcal{O} = S\). Thus \(|N(v) \cap C_{r'}| = 1\).

In both cases \(|N(v) \cap C_{r'}| = 1\), and this count depends only on \(r\) and \(r'\), not on the particular choice of \(v \in C_r\). Hence by definition \(\pi\) is an equitable partition of \(G\) with \[A(G/\pi)_{r,r'} = 1 \qquad \text{for all } r,r' \in \{1,\dots,n\},\] giving \[A(G/\pi) = J_{n\times n}\]. The diagonal entries \(A(G/\pi)_{r,r} = 1\) correspond to loops at each vertex of \(G/\pi\), so the quotient multigraph is \(K_n^{\circlearrowleft}\). ◻

Example 29. For \(G=\mathrm{Circ}(8,\{1,3,5,7\})\) with \(n=4\), the partition \(C_1=\{0,3\}\), \(C_2=\{1,6\}\), \(C_3=\{4,7\}\), \(C_4=\{2,5\}\) satisfies the hypothesis with \(e_1=0,o_1=3\); \(e_2=6,o_2=1\); \(e_3=4,o_3=7\); \(e_4=2,o_4=5\). Vertex \(0\in\mathcal{E}\) has neighbours \(\{1,3,5,7\}=\mathcal{O}\), hitting \(o_2=1\), \(o_1=3\), \(o_4=5\), \(o_3=7\): exactly one per cell. Vertex \(3\in\mathcal{O}\) has neighbours \(\{0,2,4,6\}=\mathcal{E}\), hitting \(e_1=0\), \(e_4=2\), \(e_3=4\), \(e_2=6\): exactly one per cell. Hence \(A(G/\pi)=J_{4\times 4}\) ( see Figure 7).

We take the arc partition \(\tau\) of \(LD(\mathrm{Circ}(2n,S))\) and show that the quotient \(LD(\mathrm{Circ}(2n,S))/\tau\) is isomorphic to the line digraph \(LD(K_n^{\circlearrowleft})\) of the complete digraph with loops \(K_n^{\circlearrowleft}\), as established in Lemma 17 below.

Lemma 17. Let \(G=\mathrm{Circ}(2n,S)\) with \(S=\{1,3,5,\dots,2n-1\}\) all odd residues modulo \(2n\), so that \(|\mathcal{A}(G)|=2n^2\). Partition \(\mathbb{Z}_{2n}\) into \(n\) consecutive even–odd pairs \[m_i=\{e_i,o_i\}=\{2i-2,\;2i-1\},\quad 1\le i\le n.\] For each pair \((i,j)\in[n]^2\) define the cell \[C_{ij}=\{(e_i,\;o_j),\;(o_i,\;e_j)\}\subset\mathcal{A}(G).\] Then \(\tau=\{C_{ij}:1\le i,j\le n\}\) is an equitable partition of \(\mathcal{A}(G)\) into \(n^2\) cells of size \(2\), with quotient matrix \(B\in\{0,1\}^{n^2\times n^2}\) whose \(\big((i,j),(k,l)\big)\)-entry is \[B_{(i,j),(k,l)}=\begin{cases}1 & \text{if }j=k,\\0 & \text{if }j\neq k.\end{cases}\] Furthermore, \[LD(\mathrm{Circ}(2n,S))/\tau\;\cong\;LD(K^{\circlearrowleft}_n).\]

Proof. Observe that \(o_j - e_i = (2j-1)-(2i-2) = 2(j-i)+1 \in S,\) so \((e_i,o_j)\in\mathcal{A}(G)\), and \(e_j - o_i = (2j-2)-(2i-1) = 2(j-i)-1 \equiv 2(j-i)-1 \pmod{2n},\) which is odd and hence lies in \(S\), so \((o_i,e_j)\in\mathcal{A}(G)\). Thus \(|C_{ij}|=2\) for all \((i,j)\in[n]^2\). Since \[\mathcal{A}(G) = \{(v,w)\in\mathbb{Z}_{2n}^2 : w-v\in S\} = \{(e_i,o_j):1\le i,j\le n\} \cup\{(o_i,e_j):1\le i,j\le n\},\] and the maps \((e_i,o_j)\mapsto (i,j),\quad (o_i,e_j)\mapsto (i,j)\) are both bijections from their respective domains to \([n]^2\), each arc of \(G\) belongs to exactly one cell \(C_{ij}\). Hence \(\bigsqcup_{(i,j)\in[n]^2} C_{ij} = \mathcal{A}(G),\) so \(\tau\) partitions \(\mathcal{A}(G)\) into \(n^2\) cells each of size \(2\). For each cell \(C_{ij}\), \[\label{circ:tailhead} \mathrm{tail}(C_{ij})=\{e_i,o_i\}=m_i,\qquad \mathrm{head}(C_{ij})=\{o_j,e_j\}=m_j.\tag{36}\] By definition of the line digraph, \(C_{ij}\to C_{kl}\) in \(LD(G)\) if and only if \[\mathrm{head}(C_{ij})\cap\mathrm{tail}(C_{kl})\neq\emptyset,\] that is, \(m_j\cap m_k\neq\emptyset\), which holds if and only if \(j=k\). Hence the out-neighbours of \(C_{ij}\) are \[\label{circ:outnbr} \{C_{jl}:1\le l\le n\},\tag{37}\] and every cell has out-degree exactly \(n\). We must show that for every pair of cells \(C_{ij}\) and \(C_{kl}\), every arc \(e\in C_{ij}\) points to the same number of arcs in \(C_{kl}\), and that this number equals \(B_{(i,j),(k,l)}\).

Case 1: \(j\neq k\). By Equation  37 , no arc of \(C_{ij}\) points to any arc of \(C_{kl}\), so the count is \(0\).

Case 2: \(j=k\). Take any arc \(e\in C_{ij}\). From Equation 36 , \(e\) has a unique head vertex \(v\in\mathrm{head}(C_{ij})=m_j\), namely \[v=\begin{cases}o_j & \text{if }e=(e_i,o_j),\\ e_j & \text{if }e=(o_i,e_j).\end{cases}\] Now consider cell \(C_{jl}\) (since \(k=j\)). Its two arcs are \((e_j,o_l)\) and \((o_j,e_l)\), with tails \(e_j\) and \(o_j\) respectively. Exactly one of these tails equals \(v\) \[\begin{cases} (e_j,o_l)\text{ has tail }e_j=v & \text{if }e=(o_i,e_j),\\ (o_j,e_l)\text{ has tail }o_j=v & \text{if }e=(e_i,o_j). \end{cases}\] Hence exactly \(1\) arc in \(C_{jl}=C_{kl}\) follows \(e\), and this count is independent of which arc \(e\in C_{ij}\) we chose and independent of \(i\) and \(l\). Combining both cases, the number of arcs in \(C_{kl}\) that any arc \(e\in C_{ij}\) points to is \[B_{(i,j),(k,l)}=\begin{cases}1 & \text{if }j=k,\\0 & \text{if }j\neq k,\end{cases}\] which depends only on \(j\) and \(k\), not on \(i\), \(l\), or the choice of \(e\in C_{ij}\). Therefore \(\tau\) is an equitable partition with quotient matrix \(B\) as stated. If \(Q_\tau\) is the normalised characteristic matrix of \(\tau\), then \[A_{LD(G)}\,Q_\tau=Q_\tau\,B,\] where \(A_{LD(G)}\) is the adjacency matrix of \(L(\mathrm{Circ}(2n,S))\). Under the identification \(C_{ij}\mapsto(i\to j)\), the adjacency rule \[C_{ij}\to C_{kl}\iff j=k\] coincides exactly with the arc-composition rule \((i\to j)\to(j\to l)\) in \(L(K^{\circlearrowleft}_n)\). Hence \[LD(\mathrm{Circ}(2n,S))/\tau\cong LD(K^{\circlearrowleft}_n).\qquad\square\] ◻

Example 30. Consider \(G=\mathrm{Circ}(8,\{1,3,5,7\})\) on \(\mathbb{Z}_8=\{0,1,\dots,7\}\), so \(n=4\) and \(|\mathcal{A}(G)|=32\). The four even–odd pairs are \[m_1=\{0,1\},\quad m_2=\{2,3\},\quad m_3=\{4,5\},\quad m_4=\{6,7\}.\] The \(16\) cells \(C_{ij}=\{(e_i,o_j),(o_i,e_j)\}\) partitioning all \(32\) arcs are displayed in the following table. \[\renewcommand{\arraystretch}{1.3} \begin{array}{c|c|c|c|c} & j=1 & j=2 & j=3 & j=4 \\ \hline i=1 & T_1:\,(0,1),(1,0) & T_2:\,(0,3),(1,2) & T_3:\,(0,5),(1,4) & T_4:\,(0,7),(1,6)\\ \hline i=2 & T_5:\,(2,3),(3,2) & T_6:\,(2,5),(3,4) & T_7:\,(2,7),(3,6)& T_8:\,(2,1),(3,0) \\ \hline i=3 & T_9:\,(4,5),(5,4) & T_{10}:\,(4,7),(5,6)& T_{11}:\,(4,1),(5,0) & T_{12}:\,(4,3),(5,2) \\ \hline i=4 & T_{13}:\,(6,7),(7,6)& T_{14}:\,(6,1),(7,0) & T_{15}:\,(6,3),(7,2) & T_{16}:\,(6,5),(7,4) \end{array}\] Each cell \(C_{ij}\) has \(\mathrm{tail}(C_{ij})=m_i\) and \(\mathrm{head}(C_{ij})=m_j\). For example, \[\mathrm{tail}(C_{23})=m_2=\{2,3\},\quad\mathrm{head}(C_{23})=m_3=\{4,5\},\] and the out-neighbours of \(C_{23}\) in \(LD(G)\) are \(\{C_{31},C_{32}, C_{33},C_{34}\}=\{T_{11},T_{12},T_9,T_{10}\}\), exactly the four cells in row \(i=3\). Every arc of \(C_{23}\) points to exactly one arc of each of these cells, confirming \(B_{(2,3),(3,l)}=1\) for \(l=1,2,3,4\) and \(B_{(2,3),(k,l)}=0\) for \(k\neq 3\).

Following Lemma 16 and Lemma 17, we establish PST in the lifted line digraph \(LD(\mathrm{Circ}(2n,\, S))\) by applying Theorem 25 and Theorem 15, as shown in Theorem 31 below.

Theorem 31. Let \(G = \mathrm{Circ}(2n,\, S)\) where \(S = \{1, 3, \ldots, 2n-1\}\) is the set of all odd residues modulo \(2n\), be the circulant graph of degree \(d\), where \(n = 2^s\) for some integer \(s \geq 1\). Let \(\tau = \{T_1, \ldots, T_{2m}\}\), \(m = 2n\), be an equitable arc partition of \(\mathrm{LD}(G)\), with normalized characteristic matrix \(Q_\tau\). Let \(\pi = \{C_1, \ldots, C_n\}\) be an equitable vertex partition of \(G\), where each cell \(C_i\) contains exactly one even and one odd element of \(\mathbb{Z}_{2n}\), and let \(\sigma = \{\sigma_1, \ldots, \sigma_n\}\) be a equitable arc partition of \(\mathrm{LD}(G/\pi)\) with normalized characteristic matrix \(\widetilde{Q}\). Let \(U_\tau\) and \(U_\sigma\) be the transition matrices of \(\mathrm{LD}(G)\) and \(\mathrm{LD}(G/\pi)\), respectively. Then:

  1. \(U_\sigma\) exhibits PST in \(\mathrm{LD}(G/\pi)\) from \((I_d\otimes \widetilde{Q} )\,x\) to \((I_d \otimes \widetilde{Q} )\,y\), for all \(x,\, y \in \mathrm{Im}(I_d \otimes \widetilde{Q} )\), at step \(k = n\) and is periodic at step \(2n\).

  2. \(U_\tau\) exhibits PST in \(\mathrm{LD}(G)\) from \((I_d \otimes Q_\tau )(I_d \otimes \widetilde{Q} )\,x\) to \((I_d \otimes Q_\tau )(I_d \otimes \widetilde{Q})\,y\), for all \(x,\, y \in \mathrm{Im}(I_d \otimes \widetilde{Q} )\), at step \(k = n\) and is periodic at step \(2n\).

Proof. Let \(\pi = \{C_1, C_2, \ldots, C_n\}\) be an equitable vertex partition of \(G\) where each cell \(C_i\) contains exactly one even and one odd element of \(\mathbb{Z}_{2n}\). By Lemma 16, we have \[G/\pi \;\cong\; K_n^{\circlearrowleft}, \label{eq:circ95quotient95iso}\tag{38}\] the complete graph with a loop at every vertex. Let \(\sigma = \{\sigma_1, \ldots, \sigma_n\}\) be an equitable arc partition of \(\mathrm{LD}(G/\pi)\). Then by Theorem 8, \[\mathrm{LD}(G/\pi)/\sigma \;\cong\; G/\pi \;\cong\; K_n^{\circlearrowleft}.\] Since \(\sigma\) is an equitable arc partition, by Lemma 5 we have \[A_{\mathrm{LD}(G/\pi)}\,\widetilde{Q} \;=\; \widetilde{Q}\,\widetilde{A},\] where \(\widetilde{A}\) is the adjacency matrix of \(K_n^{\circlearrowleft}\). By relabeling the arcs of \(G/\pi\), the normalized characteristic matrix takes the form \[\widetilde{Q} \;=\; \frac{1}{\sqrt{d}} \begin{bmatrix} I_n \\[4pt] \widetilde{P} \\[4pt] \widetilde{P}^2 \\[4pt] \vdots \\[4pt] \widetilde{P}^{d-1} \end{bmatrix},\] where \[I_n + \widetilde{P} + \widetilde{P}^2 + \cdots + \widetilde{P}^{d-1} \;=\; A\!\left(K_n^{\circlearrowleft}\right),\] that is, \(\widetilde{P}, \widetilde{P}^2, \ldots, \widetilde{P}^{d-1}\) are the cyclic shifts (permutation matrices) of the adjacency matrix of \(K_n^{\circlearrowleft}\). By Theorem 25, \(K_n^{\circlearrowleft}\) exhibits PST at step \(k = n\) and is periodic at step \(2n\). Moreover, by Lemma 17, \[\mathrm{LD}(G)/\tau \;\cong\; \mathrm{LD}\!\left(K_n^{\circlearrowleft}\right).\] Therefore, by Theorem 15, the transition matrix \(U_\sigma\) of \(\mathrm{LD}(G/\pi)\) exhibits PST from \((I_d \otimes \widetilde{Q})\,x\) to \((I_d \otimes \widetilde{Q} )\,y\), for all \(x,\, y \in \mathrm{Im}(I_d \otimes \widetilde{Q})\), at step \(k = n\) and is periodic at step \(2n\). Furthermore, the transition matrix \(U_\tau\) of \(\mathrm{LD}(G)\) exhibits PST from \[(I_d \otimes Q_\tau)(I_d \otimes \widetilde{Q} )\,x \quad\text{to}\quad (I_d \otimes Q_\tau )(I_d \otimes \widetilde{Q} )\,y,\] for all \(x,\, y \in \mathrm{Im}(I_d \otimes \widetilde{Q} )\), at step \(k = n\) and is periodic at step \(2n\). ◻

11 Conclusion↩︎

In this work, we developed a framework for studying perfect state transfer (PST) in quotient graphs based on the equitable partition and the shunt decomposition of a graph \(G\). The main results are summarized in two cases.

In the first case, we defined the unitary evolution and established conditions under which PST on the quotient graph \(G/\pi\) is equivalent to PST on \(G\), using the Chebyshev representation of the unitary evolution for quotient graphs. We verified that the cycle graph \(C_{2n}\) with \(n = 2^s\), \(s \geq 1\), satisfies this condition, and provided illustrative examples. In the second case, we addressed the unitary evolution in settings where PST in the quotient graph \(G/\pi\) is not necessarily equivalent to PST in \(G\). In this setting, we established conditions under which, graph \(G\) can be reduced to a quotient graph isomorphic to \(K_n^{\circlearrowleft}\), then PST can be found in the line digraph \(LD(G)\). To this end, we constructed two families of line digraphs with PST by ordering the arcs of \(K_{n,n}^{\rightleftharpoons}\) and \(\operatorname{Circ}(2n, S)\), where \(S\) consists of all odd residues modulo \(2n\) and \(n = 2^s\) for some \(s \geq 1\).

Moreover, several promising directions remain for future research, including the exploration of PST in broader families of Cayley graphs, and to develop systematic methods for constructing larger graphs admitting PST from smaller ones for which PST is already established. It would also be of interest to investigate how the interplay between the shunt-decomposition configurations \(S\) and \(\widetilde{S}\) affects the entanglement entropy and average mixing matrices of the quantum walk. Finally, analysing the spectral gap of the reduced operators, which may provide deeper insights into hitting times and the algorithmic speedups achievable in quantum walks on symmetric network topologies.

References↩︎

[1]
R. Portugal, Quantum walks and search algorithms, vol. 19. Springer, 2013.
[2]
A. Ambainis, “Quantum walks and their algorithmic applications,” International Journal of Quantum Information, vol. 1, no. 4, pp. 507–518, 2003.
[3]
A. M. Childs, “Universal computation by quantum walk,” Physical Review Letters, vol. 102, no. 18, p. 180501, 2009.
[4]
L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the 28th annual ACM symposium on theory of computing, 1996, pp. 212–219.
[5]
C. Godsil and H. Zhan, Discrete quantum walks on graphs and digraphs, vol. 484. Cambridge University Press, 2023.
[6]
S. G. E. Farhi, “Quantum computation and decision trees,” Physical Review A, vol. 58, no. 2, p. 915, 1998.
[7]
G. Coutinho and C. Godsil, Monograph/Book draftGraph spectra and continuous quantum walks. University of Waterloo, 2016.
[8]
D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, “Quantum walks on graphs,” in Proceedings of the 33rd annual ACM symposium on theory of computing, 2001, pp. 50–59.
[9]
C. Godsil and H. Zhan, “Discrete-time quantum walks and graph structures,” Journal of Combinatorial Theory, Series A, vol. 167, pp. 181–212, 2019.
[10]
H. Zhan, “Quantum walks on embeddings,” Journal of Algebraic Combinatorics, vol. 53, no. 4, pp. 1187–1213, 2021.
[11]
A. Wing-Bocanegra and S. E. Venegas-Andraca, “Circuit implementation of discrete-time quantum walks via the shunt decomposition method,” Quantum Information Processing, vol. 22, no. 3, p. 146, 2023.
[12]
A. Wing-Bocanegra, C. E. Quintero-Narvaez, and S. E. Venegas-Andraca, “Circuit implementation and analysis of a quantum-walk based search complement algorithm,” Scientific Reports, vol. 15, no. 1, p. 4865, 2025.
[13]
B. Katuwal, S. M. S. Srinath, and Y. L. Naidu, “Graph-decomposition based shift matrices: Applications to quantum channels and circuit implementations,” in 2026 international conference on next-gen quantum and advanced computing (NQComp), 2026, pp. 753–760.
[14]
C. Godsil, “State transfer on graphs,” Discrete Mathematics, vol. 312, no. 1, pp. 129–147, 2012.
[15]
H. Zhan, “An infinite family of circulant graphs with perfect state transfer in discrete quantum walks,” Quantum Information Processing, vol. 18, no. 12, p. 369, 2019.
[16]
S. Kubota and E. Segawa, “Perfect state transfer in grover walks between states associated to vertices of a graph,” Linear Algebra and its Applications, vol. 646, pp. 238–251, 2022.
[17]
Y. Ge, B. Greenberg, O. Perez, and C. Tamon, “Perfect state transfer, graph products and equitable partitions,” International Journal of Quantum Information, vol. 9, no. 3, pp. 823–842, 2011.
[18]
A. Chan and H. Zhan, “Pretty good state transfer in discrete-time quantum walks,” Journal of Physics A: Mathematical and Theoretical, vol. 56, no. 16, p. 165305, 2023.
[19]
K. Guo and V. Schmeits, “Perfect state transfer in quantum walks on orientable maps,” Algebraic Combinatorics, vol. 7, no. 3, pp. 713–747, 2024.
[20]
G. Coutinho, C. Godsil, K. Guo, and F. Vanhove, “Perfect state transfer on distance-regular graphs and association schemes,” Linear Algebra and its Applications, vol. 478, pp. 108–130, 2015.
[21]
S. Dutta, “Perfect state transfer using markovian quantum walk,” Annals of Physics, vol. 488, p. 170411, 2026.
[22]
C. Godsil and G. Royle, Algebraic graph theory, vol. 207. New York: Springer, 2001.
[23]
C. Godsil, Algebraic combinatorics. Chapman; Hall, 1993.
[24]
M. Christandl, N. Datta, A. Ekert, and A. J. Landahl, “Perfect state transfer in quantum spin networks,” Physical Review Letters, vol. 92, no. 18, p. 187902, 2004.
[25]
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, “Exponential algorithmic speedup by a quantum walk,” in Proceedings of the 35th annual ACM symposium on theory of computing, 2003, pp. 59–68.
[26]
R. Bachman et al., “Perfect state transfer on quotient graphs,” arXiv preprint arXiv:1108.0339, 2011.
[27]
S. Kim, H. Monterde, B. Ahmadi, A. Chan, S. Kirkland, and S. Plosker, “A generalization of quantum pair state transfer,” Quantum Information Processing, vol. 23, no. 11, p. 369, 2024.
[28]
H. Zhan, \(\epsilon\)-uniform mixing in discrete quantum walks,” Journal of Algebraic Combinatorics, vol. 61, 2025.
[29]
H. Krovi and T. A. Brun, “Quantum walks on quotient graphs,” Physical Review A, vol. 75, no. 6, p. 062332, 2007.
[30]
R. A. Horn and C. R. Johnson, Matrix analysis, 2nd ed. Cambridge University Press, 2012.
[31]
M. Štefaňák and S. Skoupý, “Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs,” Physical Review A, vol. 94, no. 2, p. 022301, 2016.

  1. Corresponding author. Email: banitakatuwal@sssihl.edu.in↩︎

  2. Email: srinathms@sssihl.edu.in↩︎

  3. Email: ylakshminaidu@sssihl.edu.in↩︎

  4. Email:dosupriyo@gmail.com↩︎