--- title: Continuous-Time Chiral Quantum Walk url: https://www.emergentmind.com/topics/continuous-time-chiral-quantum-walk type: topic --- # Continuous-Time Chiral Quantum Walk Searching arXiv for recent and foundational papers on continuous-time chiral quantum walks. arxiv_search(query="continuous-time chiral quantum walk", max_results=10) arxiv_search({"query":"continuous-time chiral quantum walk","max_results":10}) Searching arXiv for “continuous-time chiral quantum walk”, “uniform mixing chiral quantum walks”, and related terms. A continuous-time chiral quantum walk is a continuous-time quantum walk generated by a Hermitian graph Hamiltonian with complex off-diagonal phases, so that edge direction is encoded without sacrificing unitarity. In the standard formulation, chirality is carried by gauge-invariant net phases around loops, and these phases break time-reversal symmetry, probability time symmetry, or spatial-swap symmetry in ways that are impossible for real-symmetric adjacency or Laplacian generators. Across graph-theoretic, transport-theoretic, and Floquet settings, continuous-time chiral quantum walks have been used to analyze directional transport, zero transfer, rapid departure from high-degree vertices, uniform mixing on signed complete graphs and Hamming graphs, average uniform mixing on oriented circulants, and long-time asymmetric hydrodynamics on lattices [2605.04414]. ## 1. Definition and gauge structure A unitary-signed graph \(X^\sigma\) consists of an underlying simple graph \(X=(V,E)\) and a signing \(\sigma:E\to U(1)\subset\mathbb C\) such that the Hermitian signed adjacency matrix satisfies \[ A^\sigma_{uv}=\sigma_{uv}\quad\text{if }(u,v)\in E,\qquad \sigma_{vu}=\overline{\sigma_{uv}}. \] Oriented graphs are the special case \(\sigma_{uv}\in\{\pm i\}\). The continuous-time chiral quantum walk is generated by \[ H^\sigma:=A(X^\sigma),\qquad |\psi(t)\rangle=e^{-itH^\sigma}|\psi(0)\rangle, \] with Born probabilities \[ p_v(t)=|\langle v|\psi(t)\rangle|^2. \] Equivalently, one may use the mixing matrix \[ M_X^\sigma(t)=U_X^\sigma(t)\circ \overline{U_X^\sigma(t)},\qquad U_X^\sigma(t)=e^{-itA(X^\sigma)}, \] where \(\circ\) denotes the Schur product [2605.04414]. A broader formulation writes the Hamiltonian on a graph \(G(V,E)\) as \[ H=\sum_{(j,k)\in E,\;j\neq k}\Big[e^{i\theta_{jk}}|j\rangle\langle k|+e^{-i\theta_{jk}}|k\rangle\langle j|\Big]+\sum_{s=1}^N\gamma_s|s\rangle\langle s|, \] or, with explicit hopping strengths, \[ H=\sum_{\langle i,j\rangle}J_{ij}\Big(e^{i\phi_{ij}}|i\rangle\langle j|+e^{-i\phi_{ij}}|j\rangle\langle i|\Big), \] with \(\phi_{ji}=-\phi_{ij}\) and \(J_{ij}=J_{ji}>0\) [2302.08472]. The central structural fact is gauge equivalence. If \[ H'=\Lambda_\alpha H\Lambda_\alpha^\dagger,\qquad (\Lambda_\alpha)_{jj}=e^{i\alpha_j}, \] then site-to-site probabilities are unchanged. On trees, all phases can be gauged away, so chirality has no measurable effect on transfer probabilities. On graphs with cycles, the gauge-invariant data are the net phases around independent loops. For planar graphs with \(E\) edges and \(N\) vertices, the number of independent loop phases is \[ F=E-N+1. \] This is why chiral effects are intrinsically loop phenomena rather than merely consequences of complex matrix entries [2308.14747]. ## 2. Symmetry breaking and interference For real Hamiltonians in the site basis, transport probabilities obey \[ p_{j\to k}(t)=p_{j\to k}(-t),\qquad p_{j\to k}(t)=p_{k\to j}(t). \] These identities express time-reversal symmetry and the absence of directional bias. Complex phases on loops generically break these equivalences and thereby enable asymmetric transport [2308.14747]. On the triangular chain, chirality is implemented by assigning a phase \(\theta\) to directed edges. For \(N=5\) and \(\theta=\pi/2\), the Hamiltonian is \[ H= \begin{bmatrix} 0 & -i & -i & 0 & 0\\ i & 0 & -i & -i & 0\\ i & i & 0 & -i & -i\\ 0 & i & i & 0 & -i\\ 0 & 0 & i & i & 0 \end{bmatrix}, \] and the net cycle phase per triangle is \(\Phi=3\theta=3\pi/2\). In this setting, \(P_{nm}(t)\neq P_{mn}(t)\) and \(P_{nm}(t)\neq P_{nm}(-t)\). The paper associates the directional bias with asymmetric interference between amplitudes traversing odd- and even-length paths, controlled by the gauge-invariant cycle phase \(\Phi\) [2101.01472]. A related lattice formulation uses nearest-neighbor and next-nearest-neighbor hoppings on an infinite one-dimensional lattice. After gauging away the nearest-neighbor phase, the Hamiltonian is \[ H=\sum_n\big(c_{n+1}^\dagger c_n+c_n^\dagger c_{n+1}\big)+g\sum_n\big(e^{i\phi}c_{n+2}^\dagger c_n+e^{-i\phi}c_n^\dagger c_{n+2}\big), \] with dispersion and group velocity \[ \omega(q)=2\cos q+2g\cos(2q+\phi),\qquad v(q)=\omega'(q)=-2\sin q-2g\sin(2q+\phi). \] For \(\phi\neq 0\), inversion symmetry is broken, \(v(-q)\neq -v(q)\), and the causal cone becomes asymmetric about the origin. The third moment and skewness are \[ \mu_3=12g\,\sin\phi\,t^3,\qquad \gamma=\frac{3\sqrt{2}\,g\sin\phi}{(1+4g^2)^{3/2}}, \] so chirality is reflected directly in odd moments of the position distribution [2101.11240]. These formulations make precise a common misconception. Chirality is not simply “complex hopping”; it is the physically nontrivial part of complex hopping that survives gauge transformations. On trees there is no such invariant content, whereas on loopy graphs the loop flux controls interference, directional bias, and transport asymmetry [2203.13857]. ## 3. Transport enhancement and routing On open chains, chiral phases are gauge-equivalent to a non-chiral Hamiltonian with a phase-imprinted initial state. For a chain Hamiltonian \[ H_c=\sum_n J_n\big(e^{i\theta_n}|n\rangle\langle n+1|+e^{-i\theta_n}|n+1\rangle\langle n|\big), \] a diagonal unitary with \(\alpha_n-\alpha_{n+1}=\theta_n\) removes the phases from the Hamiltonian and transfers them to the initial packet. The resulting local wavenumber shift is \[ \Delta k\approx \alpha_{n+1}-\alpha_n, \] so the “directionality” of a chiral chain can be interpreted as a momentum-shifted initial state on a standard chain. For a uniform chain, \[ E(k)=2\cos k,\qquad v_g(k)=2\sin k,\qquad E''(k)=-2\cos k, \] and \(k=\pm \pi/2\) minimizes dispersion while maximizing ballistic speed [2308.12516]. A non-gauge-trivial example is the Y-junction graph, where three open chains meet in a triangle carrying a gauge-invariant flux. The Hamiltonian is \[ H=H_t+\sum_{l=1}^3 H_c^{(l)}, \] with \[ H_c^{(l)}=J\sum_{n=1}^{N-1}\big(|l,n\rangle\langle l,n+1|+\text{h.c.}\big), \] and \[ H_t=Je^{i\theta}\big(|1,N\rangle\langle 2,N|+|2,N\rangle\langle 3,N|+|3,N\rangle\langle 1,N|\big)+\text{h.c.} \] The dynamics reduces to three effective open chains with boundary potentials \[ \omega_\nu=2\cos\!\left(\frac{2\pi \nu}{3}+\theta\right),\qquad \nu=1,2,3, \] and scattering phase shifts \[ \delta_\nu=2k_0-2\arctan\!\left[\frac{\omega_\nu-\cos k_0}{\sin k_0}\right]-\pi \pmod{2\pi}. \] After a single encounter with the junction, the branch amplitudes are \[ T_l=\frac{1}{3}\sum_{\nu=1}^3 \sigma^{\nu(l-1)}e^{i\delta_\nu},\qquad \sigma=e^{i2\pi/3},\qquad n_l=|T_l|^2. \] Directed complete transport is obtained under the explicit condition \[ 3\theta+k_0=\pi \pmod{2\pi}, \] which gives \(100\%\) efficiency toward a selected branch [2308.12516]. A minimal six-vertex chiral router realizes the same principle on a graph with one triangular loop. With \(\gamma=0\), the transfer probabilities from input vertex \(1\) to output vertices \(5\) and \(6\) can be tuned by a single flux \(\theta\). At \(t^*\approx 2.629\), \(\theta=\pi/2\) yields \(P_{15}\approx 1\) and \(P_{16}\approx 0\), while \(\theta=3\pi/2\) swaps the outputs. At the same time, the router also realizes universal routing of superpositions, with \[ P_R\approx 0.83 \] independent of the input phase \(\phi\). The same model supports phase estimation; for large \(\gamma\), the quantum Fisher information prefactor obeys \(\kappa(\theta)\to 2/9\) [2302.08472]. Chirality also improves entanglement transfer on triangular chains. For \(N=5\), edge phase \(\theta=\pi/2\), and Bell injection \(\phi=\pi\), the concurrence on the target pair satisfies \[ C_{4,5}\approx 0.9\quad\text{at}\quad t\approx 1.02, \] while the site-transfer probability reaches \[ P_5\approx 0.95\quad\text{at}\quad t\approx 1.64. \] For the non-chiral walk on the same graph, the best short-time two-site entanglement transfer occurs at \(\phi=\pm 3\pi/4\), with \[ C_{4,5}\approx 0.8\quad\text{at}\quad t\approx 1.12. \] The long-time regime exhibits pretty good state transfer, with \(C_{4,5}\approx 0.999\) at \(t\approx 28.1\) for the chiral walk [2101.01472]. ## 4. Mixing, delocalization, and complete-graph phenomena Three mixing notions are standard. Instantaneous global uniform mixing at time \(t\) is \[ M_X^\sigma(t)=\frac{1}{n}J_n. \] Local uniform mixing from vertex \(a\) is \[ M_X^\sigma(t)e_a=\frac{1}{n}1_n. \] Average uniform mixing is defined through \[ \widehat M_X^\sigma=\lim_{T\to\infty}\frac{1}{T}\int_0^T M_X^\sigma(t)\,dt, \] and occurs when \[ \widehat M_X^\sigma=\frac{1}{n}J_n. \] These notions separate one-time exact uniformity, vertex-specific uniformity, and long-time Cesàro uniformity [2605.04414]. A major recent result is a stopping-rule construction for probabilistic uniform mixing on signed complete graphs. If \(X\) has order \(n\) and \(A(X)1_n=0\) with \(\lambda=0\) simple, then the cone \[ \widehat X=K_1+X \] has uniform mixing in expected \(n^{3/2}\) time under adjacency scaling by \(n\). Without this scaling, the expected time is \[ E[T]=nt_1+t_0=O(\sqrt n), \] where \[ t_1=\frac{\pi}{2\sqrt n},\qquad t_0=\frac{1}{\sqrt n}\arccos\!\left(\frac{1}{\sqrt{n+1}}\right). \] The stopping rule evolves from an arbitrary non-conical vertex for time \(t_1\), measures the cone vertex, repeats until success with probability \(1/n\), and then evolves from the cone for time \(t_0\) to obtain the uniform distribution. The resulting corollary is that for every \(n\ge 2\) there exists a unitary signing \(\sigma\) such that \(K_n^\sigma\) has probabilistic uniform mixing, in contrast with the non-chiral theorem that \(K_n\) has instantaneous uniform mixing if and only if \(n\in\{2,3,4\}\) [2605.04414]. The required signings can be constructed explicitly. For odd \(n\), one uses the \(\pm i\) circulant \[ A=\operatorname{Circ}(0,-i,i,-i,i,\ldots,-i,i), \] which is Hermitian and satisfies \(A1_n=0\) with \(\lambda=0\) simple. For even \(n\), one uses a block skew-circulant built from roots of unity. These constructions provide a chiral route around complete-graph no-go results [2605.04414]. Chiral mixing also appears on Hamming graphs. There exists a signing of \(K_4\) that is switching equivalent to \(K_1+\vec K_3\), and \(K_1+\vec K_3\) has local uniform mixing at \[ t=\frac{\pi}{3\sqrt 3} \] from the cone vertex. By Cartesian closure, for all \(n\ge 1\) there exists a signing of \[ H(n,4)=(K_4^\sigma)^{\square n} \] with instantaneous uniform mixing at the same time \[ t=\frac{\pi}{3\sqrt 3}. \] The comparison quoted in the same source is \[ H(n,2):\ \pi/4,\qquad H(n,3):\ 2\pi/9,\qquad H(n,4)\ \text{(unoriented)}:\ \pi/4,\qquad H(n,4)^\sigma:\ \pi/(3\sqrt3), \] so the oriented \(H(n,4)\) mixes strictly faster than the other listed families [2605.04414]. Average uniform mixing behaves even more sharply. If a \((\mathbb Z/n\mathbb Z)\)-circulant has distinct eigenvalues, then \[ \widehat M_X^\sigma=\frac{1}{n}J_n. \] The proof uses the Fourier basis, in which each spectral idempotent \(E_r\) is rank one and satisfies \[ E_r\circ \overline{E_r}=\frac{1}{n^2}J. \] Infinite families include oriented odd cycles \(\vec C_n\) with \(n\) odd and transitive tournaments arising from skew-circulants. This is described as a chiral violation of Godsil’s no-go theorem, since in the non-chiral setting the only graph with average uniform mixing is \(K_2\) [2605.04414]. A parallel line of work uses the quantum-classical distance to optimize phases. On complete graphs, maximizing this quantity identifies optimal Hermitian matrices \(H_O\) whose evolution from a localized state \(|1\rangle\) is \[ e^{-itH_O}e_1=\cos[\sqrt{N-1}\,t]\,e_1-\frac{i}{\sqrt{N-1}}\sin[\sqrt{N-1}\,t]\,h. \] The walk reaches the flat state \[ |f\rangle=\frac{1}{\sqrt N}\Big(|1\rangle+\sum_{j=2}^N e^{i\phi_j}|j\rangle\Big) \] at \[ t_f=\frac{1}{\sqrt{N-1}}\arccos\frac{1}{\sqrt N}, \] which saturates the Mandelstam–Tamm quantum speed limit and yields instantaneous uniform mixing for all \(N\) [2106.11685]. ## 5. Zero transfer, suppression, and swift departure Zero transfer is the condition \[ \langle b|e^{-itH}|a\rangle=0\qquad \text{for all }t, \] so that a connected network forbids amplitude flow between designated vertices by exact destructive interference. One route to zero transfer uses merged path graphs. If \(b\) identical branches of length \(n\) meet at a hub and the initial state is the equal-weight superposition on the \(b\) outer vertices, then the amplitude at the hub is \[ \beta_N(t)=\alpha_N(t)\sum_{p=1}^b e^{-i\sum_{\ell=0}^{n-1}\alpha_\ell^p}. \] Hence the sufficient and necessary cancellation condition is \[ \sum_{p=1}^b e^{-i\sum_{\ell=0}^{n-1}\alpha_\ell^p}=0. \] This produces all-time suppression at the hub without requiring time-dependent control [1902.11115]. An explicit four-branch example takes accumulated phases \(e^{-i\pi/2}\), \(e^{-i\pi}\), \(e^{-i3\pi/2}\), and \(1\), whose sum is zero, so the hub probability vanishes for all \(t\). Another basic example is the even cycle \(C_4\) with a single \(\pi\)-phase on one edge, for which two equal-magnitude paths interfere destructively and \(P_4(t)=0\) for all \(t\). The same source emphasizes that breaking time-reversal symmetry is not necessary for zero transfer, because this \(C_4\) example is bipartite and still exhibits exact suppression [1902.11115]. A spectral characterization is available for even cycles. Let \(C_{2m}\) carry phases whose product around the cycle equals \(-1\), equivalently \[ \sum_{j=1}^{2m}\alpha(j,j+1)=\pi \pmod{2\pi}. \] Then the Hermitian adjacency satisfies \[ \phi_{H_\alpha}(x)=\phi_H(x)+4=[2T_m(x/2)]^2, \] where \(T_m\) is the Chebyshev polynomial of the first kind, and there is zero transfer between antipodal vertices \(a\) and \(a+m\) for all \(t\). This family provides a graph-theoretic description of zero transfer in terms of cycle holonomy rather than branch phasor cancellation [2203.13857]. A distinct but related phenomenon is swift departure from a high-degree starting vertex. For a cone graph with apex \(1\) over a base \(G'\) of order \(N\), if chiral phases on the base satisfy \[ A^{(\phi)}1_N=0, \] then the reduced adjacency on \(\{|1\rangle,|e_E\rangle\}\) is \[ H_{\text{red}}= \begin{bmatrix} 0 & \sqrt N\\ \sqrt N & 0 \end{bmatrix}, \] and the return probability is \[ p^{A^{(\phi)}}_{1\to1}(t)=\cos^2(\sqrt N\,t). \] The first zero occurs at \[ t_*=\frac{\pi}{2\sqrt N}, \] and this saturates the Mandelstam–Tamm bound because \(\Delta E=\sqrt N\) for any chiral Hamiltonian compatible with a degree-\(N\) starting vertex. Even-degree graphs, cubic graphs with a perfect matching, complete graphs, and complete bipartite graphs admit such phase assignments [2207.05168]. The same paper proves a no-go theorem for Laplacian-type generators. If \(G\) is a cone over \(G'\) and \(d^>\) is the largest degree in \(G'\), then for any chiral Laplacian, \[ p^{L^{(\phi)}}_{1\to1}(t)\ge 1-\frac{\sqrt N}{N-2d^>} \qquad\text{provided }2d^>0. \] This model was realized on the IBM quantum computer platform, and the reported chiral wave packets were robust against external perturbations but had a finite lifetime due to intrinsic device errors [2312.02979]. ## 7. Limitations, design principles, and open problems Several limitations recur across the literature. First, chirality requires gauge-invariant loop structure: on trees all phases are gauge-trivial, so transport probabilities are identical to those of the undirected walk [2308.14747]. Second, exact phenomena such as zero transfer and perfect phase-cancellation are sensitive to decoherence. In the three-vertex chain used as a decoherence probe, the ideal chiral Hamiltonian \[ A'= \begin{bmatrix} 0 & -1 & 0\\ -1 & 0 & 1\\ 0 & 1 & 0 \end{bmatrix} \] gives \(P_2(t)=0\) for all \(t\), but the inclusion of Lindblad decoherence lifts the zero and drives the long-time probability toward \(1/3\) [1902.11115]. Input purity is another constraint. On the triangular chain, the mixed initial state \[ \rho_W(b)=b\rho(0)+(1-b)\rho_{\text{mixed}} \] shows monotonically decreasing fidelity as \(b\) is reduced from \(1\) to \(0\), so entanglement routing is sensitive to coherence in the injection manifold [2101.01472]. A similar trade-off appears in routing and transport more broadly: early-time peaks are typically more robust to phase fluctuations, whereas later peaks may be higher but sharper in parameter space [2302.08472]. From a spectral viewpoint, chiral advantages are not universal. Average uniform mixing on abelian circulants relies on distinct eigenvalues and rank-one Fourier idempotents, but nonabelian Cayley graphs retain repeated eigenvalues by representation theory, which forbids average uniform mixing even with chirality [2605.04414]. Likewise, Laplacian-type chirality does not generally overcome high-degree localization, whereas adjacency-type chirality can be quantum-speed-limit optimal [2207.05168]. The constructive side is comparatively systematic. For rapid departure or complete-graph mixing, one seeks signings with \[ A(X^\sigma)1_n=0 \] and \(\lambda=0\) simple. For average uniform mixing, one targets \((\mathbb Z/n\mathbb Z)\)-circulants with simple spectrum. For directional routing, one engineers gauge-invariant loop fluxes so that interference phases satisfy explicit scattering constraints such as \[ 3\theta+k_0=\pi \pmod{2\pi}. \] For topology-dependent phase optimization, the quantum-classical distance has been proposed as a figure of merit because on cycles and switches it correlates with transport-oriented localization, whereas on complete graphs it correlates with mixing-oriented delocalization [2106.11685]. Open problems remain broad and concrete. Recent work asks for the existence of high-diameter trees with probabilistic uniform mixing under suitable chiral signings and stopping rules, the optimization of Las Vegas uniform mixing via stopping-time distributions, and Monte Carlo protocols that achieve \(\epsilon\)-uniform distributions in bounded time [2605.04414]. On the swift-walk side, necessary and sufficient conditions are still incomplete beyond the even-degree, cubic, complete, and complete-bipartite families already characterized [2207.05168]. A plausible implication is that continuous-time chiral quantum walks now occupy a dual role: they are both a subject in spectral graph theory and a design framework for interference-controlled transport, mixing, and routing on quantum networks. Source: https://www.emergentmind.com/topics/continuous-time-chiral-quantum-walk