Perfect State Transfer on Oriented Circulant Graphs: A Complete Classification

{ "core_finding": "Perfect state transfer (PST) in oriented circulant graphs occurs exclusively when the conductor is 3, 4, or 8, and the paper provides a complete classification of the connection sets, admissible vertex pairs, and transfer times for these graphs.", "caveats": "The classification relies strictly on the spectrum being generated by odd primitive quadratic Dirichlet characters, meaning the results do not extend to oriented circulant graphs whose eigenvalues fall outside this specific family of square-root structures.", "markdown": "## Research Question and Context\n\nContinuous-time quantum walks on oriented graphs are governed by the Hermitian adjacency matrix rather than the standard symmetric adjacency matrix. While undirected circulant graphs and their quantum walk properties are well-understood, characterizing quantum state transfer in oriented circulant graphs requires analyzing how asymmetric connection sets impact the Fourier spectrum. This paper addresses the complete classification of perfect state transfer (PST) and multiple state transfer (MST) in oriented circulant graphs, determining exactly which graphs allow a quantum state to transfer perfectly between distinct vertices.\n\n## Approach and Methodology\n\nThe author investigates the Hermitian spectrum of oriented circulant graphs using harmonic analysis on cyclic groups. By connecting the connection sets to odd primitive quadratic Dirichlet characters of conductor $\\Delta$, the paper evaluates complete character sums without assuming coprimality between the graph order $n$ and the conductor $\\Delta$. The methodology separates these character sums into quadratic Gauss sums and Ramanujan sums, yielding an explicit formula for every Fourier eigenvalue. These spectral results are then combined with number-theoretic congruences to determine valid PST vertex pairs, transfer times, and graph enumerations.\n\n## Main Findings\n\nThe primary result is a complete classification showing that PST in nonempty oriented circulant graphs occurs if and only if the character conductor $\\Delta$ belongs to \\{3, 4, 8\}, which corresponds to square-free radicands of $1, 2,$ and $3$. The paper explicitly identifies the necessary and sufficient conditions on the connection sets for each of these conductors. Furthermore, the analysis proves that pretty good state transfer (PGST) is equivalent to PST in this graph class, and establishes that no oriented circulant graph can support multiple state transfer on more than four vertices.\n\n## Why It Matters\n\nThis work provides a definitive classification of quantum state transfer in a major family of directed algebraic graphs, moving beyond undirected or restricted integral cases. By linking graph-theoretic properties to deep tools in algebraic number theory—such as quadratic Dirichlet characters and Gauss sums—the findings offer structural insights into how directionality and symmetry interact in quantum information transport.\n\n## Key Terms and Definitions\n\n- Oriented circulant graph — A directed graph whose vertices form a cyclic group and whose arc set is invariant under cyclic shifts, represented by a Hermitian adjacency matrix with purely imaginary off-diagonal entries.\n- Conductor — The minimum modulus $\\Delta$ associated with a Dirichlet character, which dictates the algebraic field extension governing the graph's eigenvalues.\n- Odd primitive quadratic Dirichlet character — A quadratic character $\\chi$ satisfying $\\chi(-1) = -1$ that generates a negative fundamental discriminant and controls the asymmetric structure of the connection set.\n- Quadratic Gauss sum — An exponential sum formed by evaluating a character over additive roots of unity, which evaluates to $i\\sqrt{\\Delta}$ for odd primitive characters and determines the scale of the graph eigenvalues.\n- Perfect state transfer (PST) — The phenomenon where the quantum transition probability between two distinct vertices reaches exactly one at a specific time, allowing lossless transmission of quantum states." }