We consider a system of qubits coupled via nearest-neighbour in-teraction governed by the Heisenberg Hamiltonian. We further sup-pose that all coupling constants are equal to 1. We are interested in determining which graphs allow for a transfer of quantum state with fidelity equal to 1. To answer this question, it is enough to consider the action of the Laplacian matrix of the graph in a vector space of suitable dimension. Our main result is that if the underlying graph is a tree with more than two vertices, then perfect state transfer does not happen. We also explore related questions, such as what happens in bipartite graphs and graphs with an odd number of spanning trees. Finally, we consider the model based on the XY-Hamiltonian, whose action is equivalent to the action of the adjacency matrix of the graph. In this case, we conjecture that perfect state transfer does not happen in trees with more than three vertices. 1
We consider a system of qubits coupled via nearest-neighbour in-teraction governed by the Heisenberg Hamiltonian. We further sup-pose that all coupling constants are equal to 1. We are interested in determining which graphs allow for a transfer of quantum state with fidelity equal to 1. To answer this question, it is enough to consider the action of the Laplacian matrix of the graph in a vector space of suitable dimension. Our main result is that if the underlying graph is a tree with more than two vertices, then perfect state transfer does not happen. We also explore related questions, such as what happens in bipartite graphs and graphs with an odd number of spanning trees. Finally, we consider the model based on the XY-Hamiltonian, whose action is equivalent to the action of the adjacency matrix of the graph. In this case, we conjecture that perfect state transfer does not happen in trees with more than three vertices. 1
We consider a system of qubits coupled via nearest-neighbor interaction governed by the Heisenberg Hamiltonian. We further suppose that all coupling constants are equal to 1. We are interested in determining which graphs allow for a transfer of quantum state with fidelity equal to 1. To answer this question, it is enough to consider the action of the Laplacian matrix of the graph in a vector space of suitable dimension. Our main result is that if the underlying graph is a tree with more than two vertices, then perfect state transfer does not happen. We also explore related questions, such as what happens in bipartite graphs and graphs with an odd number of spanning trees. Finally, we consider the model based on the XY-Hamiltonian, whose action is equivalent to the action of the adjacency matrix of the graph. In this case, we conjecture that perfect state transfer does not happen in trees with more than three vertices.
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.
Let G be a graph and let t be a positive real number. Then the evolution of the continuous quantum walk defined on G is described by the transition matrix U(t)=exp(itH).The matrix H is called Hamiltonian. So far the most studied quantum walks are the ones whose Hamiltonians are the adjacency matrices of the underlying graphs and initial states are vertex states e_a, with e_a being the characteristic vector of vertex a. \n \nThis thesis focuses on Laplacian edge state transfer, that is, the quantum walks whose initial states are edge states e_a-e_b and Hamiltonians are the Laplacians of the underlying graphs. So far the research about perfect state transfer only involves vertex states and Laplacian edge state transfer has not been studied before. We extend the known results of perfect vertex state transfer and periodicity of vertex states to Laplacian edge state transfer. \n \nWe prove two useful closure properties for perfect Laplacian edge state transfer. One is that complementation preserves perfect edge state transfer. The other is that if G has perfect Laplacian edge state transfer at time τ and H has perfect Laplacian vertex state transfer also at time τ, then with some mild assumption on the pairs of vertex states and edge states that have perfect state transfer, the Cartesian product G □ H also admits perfect edge state transfer. Those two properties provide us new ways to construct graphs with perfect Laplacian edge state transfer. We also observe one phenomenon that happens in Laplacian edge state transfer which never happens in vertex state transfer: if there is perfect state transfer from e_a-e_b to e_α-e_β and also from e_b-e_c to e_β-e_γ at the same time t in G, then G admits perfect state transfer from e_a-e_c to e_α-e_γ at time t. \n \nWe give characterizations of perfect Laplacian edge state transfer in cycles, paths and complete bipartite graphs K_{2,4n}. We study perfect state transfer and periodicity on edge states with special spectral features. We also consider the case when the unsigned Laplacian is Hamiltonian and initial states are plus states of the form e_a+e_b. In this case, we characterize perfect state transfer in paths, cycles and bipartite graphs. \nWe close this thesis by a list of open questions.
This record contains a short preliminary note (TeX source and PDF), Python code and its output, on the question posed in Section 11 of H. Monterde, H. Pal and S. Kirkland, "Laplacian quantum walks on blow-up graphs" (Linear Algebra Appl., 2025, doi:10.1016/j.laa.2025.10.001; numbering of arXiv:2504.11585v1): whether their Theorem 10 (Laplacian perfect state transfer after adding a matching inside the copies of a vertex in the blow-up of n copies of a graph, n divisible by 4) holds for the adjacency matrix. The same question is Problem 10 in H. Monterde's PhD thesis "Quantum pure state transfer" (University of Manitoba, 2025). For matchings whose edges join twin vertices of the blow-up and even n, the note proves that adjacency perfect state transfer between the ends a, b of an added edge forces the matching to cover every neighbour of a, and gives parity conditions on the uncovered vertices. Consequently a nonempty matching inside the copies of a single non-isolated vertex never gives adjacency perfect state transfer, for every graph and every even n. These results, and exact computations on small graphs supporting a conjecture that all sets of copies must be perfectly matched (finite computations only), are the parts claimed as new; a literature search in October 2026 found no earlier treatment of them, which does not establish that none exists. When every set of copies carries a perfect matching (a lexicographic product G[(n/2)K_2]), the note shows that for n divisible by 4 adjacency perfect state transfer between the ends of an added edge occurs if and only if the adjacency eigenvalue support of the vertex is integral, at time pi/2. This is not claimed as new: since G[(n/2)K_2] is isomorphic to Z[K_2], where Z is the blow-up of n/2 copies of G, it follows in a few lines from Proposition 6.3 of A. S. Árnadóttir and K. Guo (arXiv:2608.20476), and its sufficiency for integral graphs is a special case of a lemma of Ge, Greenberg, Perez and Tamon (arXiv:1009.1340). The criterion used for perfect state transfer between adjacent twins is a special case of a theorem of Kirkland, Monterde and Plosker (arXiv:2201.02720). When the matching lies inside the sets of copies, the graphs are edge-perturbed blow-ups in the sense of Monterde and Pal (arXiv:2505.07982v5, Section 9); their Theorem 20 concerns states orthogonal to the all-ones vector of a set of copies and does not cover vertex states. This is a personal hobby/independent research record in which AI was used for exploration, drafting proof candidates, checking and writing; it has not been peer-reviewed by human experts.
Abstract. Pure states correspond to one-dimensional subspaces of [Formula: see text] represented by unit vectors. In this paper, we develop the theory of perfect state transfer (PST) between real pure states with emphasis on the adjacency and Laplacian matrices as Hamiltonians of a graph representing a quantum spin network. We characterize PST between real pure states based on the spectral information of a graph and prove three fundamental results: (i) every periodic real pure state [Formula: see text] admits PST with another real pure state [Formula: see text], (ii) every connected graph admits PST between real pure states, and (iii) for any pair of real pure states [Formula: see text] and [Formula: see text] and for any time [Formula: see text], there exists a real symmetric matrix [Formula: see text] such that [Formula: see text] and [Formula: see text] admit PST relative to [Formula: see text] at time [Formula: see text]. We also determine all real pure states that admit PST in complete graphs, complete bipartite graphs, paths, and cycles. This leads to a complete characterization of pair and plus state transfer in paths and complete bipartite graphs. We give constructions of graphs that admit PST between real pure states. Finally, using results on the spread of graphs, we prove that amongst all [Formula: see text]-vertex simple unweighted graphs, the least minimum PST time between real pure states is attained by any join graph for the Laplacian case, while it is attained by the join of an empty graph and a complete graph of appropriate sizes for the adjacency case. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at none . [Formula: see text]
A continuous-time quantum walk on a graph is represented by the complex matrix , where is the adjacency matrix of and is a non-negative time. If the graph models a network of interacting qubits, transfer of state among such qubits throughout time can be formalized as the action of the continuous-time quantum walk operator in the characteristic vectors of the vertices. Here, we are concerned with the problem of determining which graphs admit a perfect transfer of state. More specifically, we will study graphs whose adjacency matrix is a sum of tensor products of -matrices, focusing on the case where a graph is the tensor product of two other graphs. As a result, we will construct many new examples of perfect state transfer.