Pulsation of quantum walk between two arbitrary graphs with weakly connected bridge

• URL: http://arxiv.org/abs/2511.12872v1
• Date: Mon, 17 Nov 2025 02:01:37 GMT
• Title: Pulsation of quantum walk between two arbitrary graphs with weakly connected bridge
• Authors: Taisuke Hosaka, Etsuo Segawa,
• Abstract summary: We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge.<n>For sufficiently small values of $$, a phenomenon called pulsation occurs.<n>The pulsation is characterized by the periodic transfer of the quantum walker between the two graphs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $ε>0$ assigned at the bridge represents the strength of connectivity: if $ε=0$, then the graph is completely separated. We show that for sufficiently small values of $ε$, a phenomenon called pulsation occurs. The pulsation is characterized by the periodic transfer of the quantum walker between the two graphs. An asymptotic expression with respect to small $ε$ for the probability of finding the walker on either of the two graphs is derived. This expression reveals that the pulsation depends solely on the number of edges in each graph, regardless of their structure. In addition, we obtain that the quantum walker is transferred periodically between the two graphs, with a period of order $O(ε^{-1/2})$. Furthermore, when the number of edges of two graphs is equal, the quantum walker is almost completely transferred.

Related papers

• Strongly regular and strongly walk-regular graphs that admit perfect state transfer [0.0]
  We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs.<n>We first give a complete classification of strongly regular graphs that admit perfect state transfer. The only such graphs are the complete bipartite graph $K_2,2 and the complete graph $K_2,2,2.
  arXiv  Detail & Related papers  (2025-06-03T07:10:06Z)
• Pulsation of quantum walk on Johnson graph [0.0]
  We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation. The pulsation means that the state periodically transfers between $G_1$ and $G_2$ with the initial state of the uniform superposition. The proof is based on Kato's theory in finite-dimensional vector spaces.
  arXiv  Detail & Related papers  (2024-11-03T07:32:19Z)
• The quantum beam splitter with many partially indistinguishable photons: multiphotonic interference and asymptotic classical correspondence [44.99833362998488]
  We present the analysis of the quantum two-port interferometer in the $n rightarrow infty$ limit of $n$ partially indistinguishable photons. Our main result is that the output distribution is dominated by the $O(sqrtn)$ channels around a certain $j*$ that depends on the degree of indistinguishability. The form is essentially the doubly-humped semi-classical envelope of the distribution that would arise from $2 j*$ indistinguishable photons, and which reproduces the corresponding classical intensity distribution.
  arXiv  Detail & Related papers  (2023-12-28T01:48:26Z)
• Generalized Graphon Process: Convergence of Graph Frequencies in Stretched Cut Distance [30.279435887366578]
  sparse graph sequences converge to the trivial graphon under the conventional definition of cut distance. We utilize the concepts of generalized graphons and stretched cut distance to describe the convergence of sparse graph sequences. Our results indicate the possibility of transfer learning between sparse graphs.
  arXiv  Detail & Related papers  (2023-09-11T06:34:46Z)
• Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs [48.79929516665371]
  Graphs with homophily-prone edges tend to connect nodes with the same class. Heterophily-prone edges tend to build relationships between nodes with different classes. Existing GNNs only take the original graph during training.
  arXiv  Detail & Related papers  (2023-06-13T08:06:10Z)
• Limits, approximation and size transferability for GNNs on sparse graphs via graphops [44.02161831977037]
  We take a perspective of taking limits of operators derived from graphs, such as the aggregation operation that makes up GNNs. Our results hold for dense and sparse graphs, and various notions of graph limits.
  arXiv  Detail & Related papers  (2023-06-07T15:04:58Z)
• A convergence time of Grover walk on regular graph to stationary state [0.0]
  We consider a quantum walk model on a finite graph which has an interaction with the outside. We show that larger degree of the regular graph makes the convergence speed of this quantum walk model slower.
  arXiv  Detail & Related papers  (2022-10-16T02:57:33Z)
• Exact solution of a family of staggered Heisenberg chains with conclusive pretty good quantum state transfer [68.8204255655161]
  We work out the exact solutions in the one-excitation subspace. We present numerical evidence that pretty good transmission is achieved by chains whose length is not a power of two.
  arXiv  Detail & Related papers  (2022-06-28T18:31:09Z)
• Perfect State Transfer in Weighted Cubelike Graphs [0.0]
  A continuous-time quantum random walk describes the motion of a quantum mechanical particle on a graph. We generalize the PST or periodicity of cubelike graphs to that of weighted cubelike graphs.
  arXiv  Detail & Related papers  (2021-09-26T13:44:44Z)
• Equivalent Laplacian and Adjacency Quantum Walks on Irregular Graphs [0.0]
  The continuous-time quantum walk is a particle evolving by Schr"odinger's equation in discrete space. In some physical systems, however, the Hamiltonian is proportional to the adjacency matrix instead.
  arXiv  Detail & Related papers  (2021-07-12T16:59:06Z)
• A Thorough View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy [37.34153902687548]
  We tackle the problem of exactly recovering an unknown ground-truth binary labeling of the nodes from a single corrupted observation of each edge. We apply a hierarchy of relaxations known as the sum-of-squares hierarchy, to the problem. We show that the solution of the dual of the relaxed problem is related to finding edge weights of the Johnson and Kneser graphs.
  arXiv  Detail & Related papers  (2021-02-16T08:36:19Z)
• Spectral Embedding of Graph Networks [76.27138343125985]
  We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2020-09-30T04:59:10Z)
• 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.