Perfect state transfer in Grover walks on association schemes and distance-regular graphs

• URL: http://arxiv.org/abs/2506.07439v2
• Date: Wed, 18 Jun 2025 18:27:34 GMT
• Title: Perfect state transfer in Grover walks on association schemes and distance-regular graphs
• Authors: Koushik Bhakta, Bikash Bhattacharjya,
• Abstract summary: We study perfect state transfer in Grover walks, a model of discrete-time quantum walks.<n>We characterize all graphs on the classes of Hamming and Johnson schemes that exhibit perfect state transfer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association scheme. Our focus includes specific association schemes, namely the Hamming and Johnson schemes. We characterize all graphs on the classes of Hamming and Johnson schemes that exhibit perfect state transfer. Furthermore, we study perfect state transfer on distance-regular graphs. We provide complete characterizations for exhibiting perfect state transfer on distance-regular graphs of diameter $2$ and diameter $3$, as well as integral distance-regular graphs.

Related papers

• Real state transfer on edge perturbed graphs with generalized clusters [0.0]
  We study the existence of real state transfer in edge-perturbed graphs containing generalized clusters.<n>A central observation is that the evolution of certain quantum states depends solely on the local structure of the underlying graph.
  arXiv  Detail & Related papers  (2025-05-12T18:26:59Z)
• Self-supervised Shape Completion via Involution and Implicit Correspondences [89.18705005095359]
  3D shape completion is traditionally solved using supervised training or by distribution learning on complete shape examples. Recently self-supervised learning approaches that do not require any complete 3D shape examples have gained more interests. We propose a non-adversarial self-supervised approach for the shape completion task.
  arXiv  Detail & Related papers  (2024-09-24T10:04:38Z)
• A generalization of quantum pair state transfer [0.0]
  An $s$-pair state in a graph is a quantum state of the form $mathbfe_u+smathbfe_v$. We develop the theory of perfect $s$-pair state transfer in continuous quantum walks.
  arXiv  Detail & Related papers  (2024-04-25T14:45:49Z)
• All You Need is Resistance: On the Equivalence of Effective Resistance and Certain Optimal Transport Problems on Graphs [48.84819106277247]
  We claim that effective resistance and optimal transport on graphs should be understood as one and the same, up to a choice of $p$.<n>We show explicit connections to optimal stopping times and random walks on graphs, graph Sobolev spaces, and a Benamou-Brenier type formula for $2$-Beckmann distance.<n>We propose further study of the usage of these metrics where Wasserstein distance may produce computational bottlenecks.
  arXiv  Detail & Related papers  (2024-04-23T17:50:52Z)
• Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks [0.0]
  We characterize circulant graphs with valency up to $4$ that admit perfect state transfer. On the other hand, circulant graphs with valency $4$ admit perfect state transfer only in two infinite families: one discovered by Zhan and another new family, while no others do.
  arXiv  Detail & Related papers  (2024-02-27T09:20:09Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Robust Graph Matching Using An Unbalanced Hierarchical Optimal Transport Framework [30.05543844763625]
  We propose a novel and robust graph matching method based on an unbalanced hierarchical optimal transport framework. We make the first attempt to exploit cross-modal alignment in graph matching. Experiments on various graph matching tasks demonstrate the superiority and robustness of our method compared to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2023-10-18T16:16:53Z)
• MAPConNet: Self-supervised 3D Pose Transfer with Mesh and Point Contrastive Learning [32.97354536302333]
  3D pose transfer is a challenging generation task that aims to transfer the pose of a source geometry onto a target geometry with the target identity preserved. Current pose transfer methods allow end-to-end correspondence learning but require the desired final output as ground truth for supervision. We present a novel self-supervised framework for 3D pose transfer which can be trained in unsupervised, semi-supervised, or fully supervised settings.
  arXiv  Detail & Related papers  (2023-04-26T20:42:40Z)
• Perfect state transfer in Grover walks between states associated to vertices of a graph [0.0]
  We study perfect state transfer in Grover walks, which are typical discrete-time quantum walk models. We call such states type states. We derive a necessary condition on eigenvalues of a graph for perfect state transfer between type states to occur.
  arXiv  Detail & Related papers  (2021-09-14T03:59:47Z)
• Self-Point-Flow: Self-Supervised Scene Flow Estimation from Point Clouds with Optimal Transport and Random Walk [59.87525177207915]
  We develop a self-supervised method to establish correspondences between two point clouds to approximate scene flow. Our method achieves state-of-the-art performance among self-supervised learning methods.
  arXiv  Detail & Related papers  (2021-05-18T03:12:42Z)
• GraphOpt: Learning Optimization Models of Graph Formation [72.75384705298303]
  We propose an end-to-end framework that learns an implicit model of graph structure formation and discovers an underlying optimization mechanism. The learned objective can serve as an explanation for the observed graph properties, thereby lending itself to transfer across different graphs within a domain. GraphOpt poses link formation in graphs as a sequential decision-making process and solves it using maximum entropy inverse reinforcement learning algorithm.
  arXiv  Detail & Related papers  (2020-07-07T16:51:39Z)
• Wasserstein-based Graph Alignment [56.84964475441094]
  We cast a new formulation for the one-to-many graph alignment problem, which aims at matching a node in the smaller graph with one or more nodes in the larger graph. We show that our method leads to significant improvements with respect to the state-of-the-art algorithms for each of these tasks.
  arXiv  Detail & Related papers  (2020-03-12T22:31:59Z)
• Perfect State Transfer on Oriented Graphs [0.0]
  We study the phenomena, unique to oriented graphs, of multiple state transfer. We give a characterization of multiple state transfer, and a new example of a graph where it occurs.
  arXiv  Detail & Related papers  (2020-02-11T20:34:54Z)

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.