Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. The main problem we study in this paper is to determine whether the two-fold Cayley tree, an extension of the Cayley tree, admits perfect state transfer between two roots using quantum walks. We show that PST can be achieved by means of the so-called nonrepeating quantum walk [Phys. Rev. A 89 042332 (2014)] within time steps that are the distance between the two roots; while both the continuous-time quantum walk and the typical discrete-time quantum walk with Grover coin approaches fail. Our results suggest that in some cases the dynamics of a discrete-time quantum walk may be much richer than that of the continuous-time quantum walk.
Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. The main problem we study in this paper is to determine whether the two-fold Cayley tree, an extension of the Cayley tree, admits perfect state transfer between two roots using quantum walks. We show that PST can be achieved by means of the so-called nonrepeating quantum walk [Phys. Rev. A 89 042332 (2014)] within time steps that are the distance between the two roots; while both the continuous-time quantum walk and the typical discrete-time quantum walk with Grover coin approaches fail. Our results suggest that in some cases the dynamics of a discrete-time quantum walk may be much richer than that of the continuous-time quantum walk.
The paper investigates perfect state transfer (PST) in Grover walks on Cayley graphs over the dihedral group Dn. The Grover walk is a discrete-time quantum walk widely studied in quantum information processing. A Cayley graph Cay(Γ,S) is called normal if S is the union of some conjugacy classes of the group Γ; otherwise, it is called non-normal. Most existing studies have been restricted to Cayley graphs over abelian groups. In contrast, we investigate both normal and non-normal cases for Cayley graphs over the non-abelian group Dn. By examining the parity of n and the normality of the Cayley graph, we obtain a complete characterization of PST on Cay(Dn,S). In particular, we establish necessary and sufficient conditions for the occurrence of PST in all possible cases, and prove that PST does not occur for normal Cayley graphs when n is odd. Furthermore, we construct several infinite families of normal and non-normal Cayley graphs Cay(Dn,S) that exhibit PST, illustrating the application of the main result. Our approach is based on the representation theory of the dihedral group.
A Cayley graph Cay(Γ,S) over a finite group Γ is said to be normal if its connection set S is a union of some conjugacy classes of Γ. This paper investigates perfect state transfer in Grover walks on normal Cayley graphs. The Grover walk is a widely studied discrete-time quantum walk. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on normal Cayley graphs. As applications, we derive explicit spectral criteria for perfect state transfer on Cayley graphs over abelian groups, dicyclic groups, and dihedral groups. These results yield several infinite families of Cayley graphs exhibiting perfect state transfer. We further obtain simple combinatorial characterizations of the existence of perfect state transfer on Cayley graphs over dihedral and dicyclic groups. Our general characterization also recovers a number of previously known results as special cases. As a further consequence, we obtain a complete characterization of perfect state transfer on unitary Cayley graphs. In particular, we prove that exactly four graphs in the class of unitary Cayley graphs exhibit perfect state transfer.
Let X be a graph, A its adjacency matrix, and t a non-negative real number. The matrix exp(i t A) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantum walk in X. We say that X admits perfect state transfer from a vertex u to a vertex v if there is a time t such that \n| exp(i t A)_(u,v) | = 1. \n \nThe main problem we study in this thesis is that of determining which simple graphs admit perfect state transfer. For some classes of graphs the problem is solved. For example, a path on n vertices admits perfect state transfer if and only if n=2 or n=3. However, the general problem of determining all graphs that admit perfect state transfer is substantially hard. \n \nIn this thesis, we focus on some special cases. We provide necessary and sufficient conditions for a distance-regular graph to admit perfect state transfer. In particular, we provide a detailed account of which distance-regular graphs of diameter three do so. \n \nA graph is said to be spectrally extremal if the number of distinct eigenvalues is equal to the diameter plus one. Distance-regular graphs are examples of such graphs. We study perfect state transfer in spectrally extremal graphs and explore rich connections to the topic of orthogonal polynomials. We characterize perfect state transfer in such graphs. \n \nWe also provide a general framework in which perfect state transfer in graph products can be studied. We use this to determine when direct products and double covers of graphs admit perfect state transfer. As a consequence, we provide many new examples of simple graphs admitting perfect state transfer. We also provide some advances in the understanding of perfect state transfer in Cayley graphs for the groups (Z_2)^d and Z_n. \n \nFinally, we consider the problem of determining which trees admit perfect state transfer. We show more generally that, except for the path on two vertices, if a connected bipartite graph contains a unique perfect matching, then it cannot admit perfect state transfer. We also consider this problem in the context of another model of quantum walks determined by the matrix exp(i t L), where L is the Laplacian matrix of the graph. In particular, we show that no tree on an odd number of vertices admits perfect state transfer according to this model.
Perfect state transfer between two marked vertices of a graph by means of a discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit calculation that, for the coined quantum walks on a star graph and a complete graph with self-loops, perfect state transfer between the sender and receiver vertex is achieved for an arbitrary number of vertices N in O(N) steps of the walk. Finally, we show that Szegedy's walk with queries on a complete graph allows for state transfer with unit fidelity in the limit of large N.
Recently, there are extensive studies on perfect state transfer on graphs due to their significant applications in quantum information processing and quantum computations. However, most of the graphs previously investigated are abelian Cayley graphs. In this paper, we study perfect state transfer on Cayley graphs over dihedral groups. Using the representations of the dihedral group , we present some necessary and sufficient conditions for the Cayley graph to have a perfect state transfer between two distinct vertices for some connection set S. Based on these conditions, we show that cannot have PST if n is odd and S is conjugation-closed. For some even integers n, it is possible for to have PST, some concrete constructions are provided.
We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles C4, C6 and C8 for three choices of coin operator. Perfect state transfer was found, in general, to be very rare, only being preserved for a very small number of ways of modifying the cycles. We observed that some of our useful modifications of C4 could be generalised to an arbitrary number of nodes, and present three families of graphs which admit quantum walks with interesting dynamics either in the continuous time walk, or in the discrete time walk for appropriate selections of coin and initial conditions. These dynamics are either periodicity, perfect state transfer, or very high fidelity state transfer. These families are modifications of families known not to exhibit periodicity or perfect state transfer in general. The robustness of the dynamics is tested by varying the initial state, interpolating between structures and by adding decoherence.