Perfect state transfer in Grover walks on normal Cayley graphs

• URL: http://arxiv.org/abs/2607.19309v1
• Date: Tue, 21 Jul 2026 17:23:56 GMT
• Title: Perfect state transfer in Grover walks on normal Cayley graphs
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A Cayley graph $\operatorname{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.

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 dihedral Cayley graphs [5.8879697428274875]
  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.
  arXiv  Detail & Related papers  (2026-05-04T05:58:30Z)
• Engineering Perfect State Transfer Graphs via Givens Transformations [42.27843435279468]
  Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc.<n>We present a scheme based on the Givens Transformations to analyse and obtain a class of qubit graphs that possess perfect quantum state transmission.
  arXiv  Detail & Related papers  (2026-04-02T21:40:06Z)
• 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)
• CKGConv: General Graph Convolution with Continuous Kernels [24.58050212186722]
  We propose a novel and general graph convolution framework by parameterizing the kernels as continuous functions of pseudo-coordinates derived via graph positional encoding. We name this Continuous Kernel Graph Convolution (CKGConv) We show that CKGConv-based Networks outperform existing graph convolutional networks and perform comparably to the best graph transformers across a variety of graph datasets.
  arXiv  Detail & Related papers  (2024-04-21T10:26:13Z)
• Fractional revival on abelian Cayley graphs [23.909933791900322]
  Fractional revival is essential for entanglement generation in quantum spin networks. Two general constructions of abelian Cayley graphs having fractional revival are presented. We establish several new families of abelian Cayley graphs admitting fractional revival.
  arXiv  Detail & Related papers  (2022-08-10T02:01:44Z)
• Quantitative approach to Grover's quantum walk on graphs [62.997667081978825]
  We study Grover's search algorithm focusing on continuous-time quantum walk on graphs. Instead of finding specific graph topologies convenient for the related quantum walk, we fix the graph topology and vary the underlying graph endowed Laplacians.
  arXiv  Detail & Related papers  (2022-07-04T19:33:06Z)
• On state transfer in Cayley graphs for abelian groups [0.0]
  We characterize perfect state transfer in Cayley graphs for abelian groups that have a cyclic Sylow-2-subgroup. This generalizes a result of Bavsi'c from 2013 where he provides a similar characterization for Cayley graphs of cyclic groups.
  arXiv  Detail & Related papers  (2022-04-20T22:14:09Z)
• 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)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Fairness constraints can help exact inference in structured prediction [37.76221231305701]
  We study a generative model with an undirected connected graph $G$ and true vector of binary labels. We find that, in contrast to the known trade-offs between fairness and model performance, the addition of the fairness constraint improves the probability of exact recovery.
  arXiv  Detail & Related papers  (2020-07-01T04:11:29Z)
• 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.