Perfect state transfer in Grover walks on dihedral Cayley graphs

• URL: http://arxiv.org/abs/2605.02254v1
• Date: Mon, 04 May 2026 05:58:30 GMT
• Title: Perfect state transfer in Grover walks on dihedral Cayley graphs
• Abstract summary: The paper investigates perfect state transfer in Grover walks on Cayley graphs over the dihedral group $D_n$.<n>A Cayley graph $operatornameCay(,S)$ is called normal if $S$ is the union of some conjugacy classes of the group $$; otherwise, it is called non-normal.
• Score: 5.8879697428274875
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The paper investigates perfect state transfer (PST) in Grover walks on Cayley graphs over the dihedral group $D_n$. The Grover walk is a discrete-time quantum walk widely studied in quantum information processing. A Cayley graph $\operatorname{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 $D_n$. By examining the parity of $n$ and the normality of the Cayley graph, we obtain a complete characterization of PST on $\operatorname{Cay}(D_n,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 $\operatorname{Cay}(D_n,S)$ that exhibit PST, illustrating the application of the main result. Our approach is based on the representation theory of the dihedral group.

Related papers

• Perfect state transfer and Cayley presentations [0.0]
  We study perfect state transfer on Cayley graphs from the point of view that state transfer is a property of a graph and not of a group.<n>We show that a Cayley graph of a group with an abelian subgroup of index two is a Cayley graph of an abelian group under any one of three hypotheses.
  arXiv  Detail & Related papers  (2026-08-20T18:08:45Z)
• Perfect state transfer in Grover walks on normal Cayley graphs [0.0]
  We investigate perfect state transfer in Grover walks on normal Cayley graphs.<n>We prove that exactly four graphs in the class of unitary Cayley graphs exhibit perfect state transfer.
  arXiv  Detail & Related papers  (2026-07-21T17:23:56Z)
• Quantum state isomorphism problems for groups [41.49556721904551]
  We study the computational complexity of quantum state isomorphism problems under group actions.<n>For pure-state version, we show that the problem is BQP-hard for all nontrivial groups.<n>For the mixed-state version, for nontrivial, finite and efficiently representable groups, the problem is QSZK-complete.
  arXiv  Detail & Related papers  (2026-05-12T18:05:27Z)
• Pretty good state transfer in Grover walks on abelian Cayley graphs [0.0]
  We study pretty good state transfer (P GST) walks on graphs.<n>In general, we find a necessary and sufficient condition for the occurrence of P GST on graphs.<n>Our results yield infinite families of graphs that exhibit P GST but fail to exhibit perfect state transfer.
  arXiv  Detail & Related papers  (2025-08-13T11:03:25Z)
• Quantum fractional revival governed by adjacency matrix Hamiltonian in unitary Cayley graphs [0.0]
  We prove existence of quantum fractional revival in unitary Cayley graph utilizing adjacency matrix Hamiltonian. Quantum fractional revival is analogous to quantum entanglement.
  arXiv  Detail & Related papers  (2024-10-04T10:47:43Z)
• Quantum walks advantage on the dihedral group for uniform sampling problem [0.0]
  This paper advances the general understanding of quantum walk mixing on Cayley graphs.<n>It highlights the improved mixing time achieved by continuous-time quantum walks on $D_2n$.<n>This work has potential applications in algorithms for a class of sampling problems based on non-abelian groups.
  arXiv  Detail & Related papers  (2023-12-25T11:21:55Z)
• The Spectrum of Asymptotic Cayley Trees [0.0]
  We show that there is a continuous spectrum identical to that for a Cayley tree and, in general, a non-empty pure point spectrum. If the pure point spectrum is nonempty the walk is in general confined with a nonzero probability.
  arXiv  Detail & Related papers  (2023-12-15T14:40:03Z)
• On the Unlikelihood of D-Separation [69.62839677485087]
  We provide analytic evidence that on large graphs, d-separation is a rare phenomenon, even when guaranteed to exist. For the PC Algorithm, while it is known that its worst-case guarantees fail on non-sparse graphs, we show that the same is true for the average case. For UniformSGS, while it is known that the running time is exponential for existing edges, we show that in the average case, that is the expected running time for most non-existing edges as well.
  arXiv  Detail & Related papers  (2023-03-10T00:11:18Z)
• Detection-Recovery Gap for Planted Dense Cycles [72.4451045270967]
  We consider a model where a dense cycle with expected bandwidth $n tau$ and edge density $p$ is planted in an ErdHos-R'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree algorithms.
  arXiv  Detail & Related papers  (2023-02-13T22:51:07Z)
• The Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) Equation for Two-Dimensional Systems [62.997667081978825]
  Open quantum systems can obey the Franke-Gorini-Kossakowski-Lindblad-Sudarshan (FGKLS) equation. We exhaustively study the case of a Hilbert space dimension of $2$.
  arXiv  Detail & Related papers  (2022-04-16T07:03:54Z)
• Random Subgraph Detection Using Queries [29.192695995340653]
  The planted densest subgraph detection problem refers to the task of testing whether in a given (random) graph there is a subgraph that is unusually dense. In this paper, we consider a natural variant of the above problem, where one can only observe a relatively small part of the graph using adaptive edge queries. For this model, we determine the number of queries necessary and sufficient (accompanied with a quasi-polynomial optimal algorithm) for detecting the presence of the planted subgraph.
  arXiv  Detail & Related papers  (2021-10-02T07:41:17Z)
• Convergence Analysis of Riemannian Stochastic Approximation Schemes [39.32179384256228]
  This paper analyzes a class of correlated approximation (SA) schemes to tackle optimization problems. We show that the conditions we derive are considerably milder than previous works. Third, we consider the case where the mean-field function can only be estimated up to a small bias, and/or the case in which the samples are drawn from a chain.
  arXiv  Detail & Related papers  (2020-05-27T11:24:58Z)
• Continuous-time quantum walks in the presence of a quadratic perturbation [55.41644538483948]
  We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$. We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
  arXiv  Detail & Related papers  (2020-05-13T14:53:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.