pith. sign in

arxiv: 2511.12872 · v2 · submitted 2025-11-17 · 🪐 quant-ph · math-ph· math.MP

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

Taisuke Hosaka , Etsuo Segawa This is my paper

Pith reviewed 2026-05-17 22:32 UTC · model grok-4.3

classification 🪐 quant-ph math-phmath.MP
keywords Grover walkquantum walkbridged graphpulsationasymptotic analysisperiodic transferedge count dependence
0
0 comments X

The pith

For small bridge strengths, a quantum walker on two graphs pulsates periodically between them with timing set only by edge counts.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines Grover quantum walks on a finite graph formed by two arbitrary simple graphs joined by one bridge edge whose strength is set by a small positive parameter ε. It shows that when ε is small enough, the probability of locating the walker on either component displays periodic pulsation, with the walker moving back and forth between the graphs. An asymptotic expression for these probabilities demonstrates that the oscillation depends only on the total number of edges in each graph and is insensitive to their internal structure. The period of the pulsation scales as O(ε^{-1/2}), and when the two graphs have equal edge counts the transfer approaches completeness at regular intervals.

Core claim

We show that for sufficiently small values of ε, a phenomenon called pulsation occurs. 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. 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.

What carries the argument

Asymptotic expansion of the time-evolution operator for the Grover walk on the bridged graph, isolating the slow inter-graph dynamics induced by the weak bridge.

If this is right

  • The pulsation period is independent of the specific connectivity inside each graph.
  • Nearly complete periodic transfer occurs whenever the two graphs have the same number of edges.
  • The probability of finding the walker in one graph or the other oscillates with an amplitude fixed exclusively by the edge counts.
  • The phenomenon is expected for any pair of finite connected simple graphs joined by the bridge.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The edge-count dependence suggests an effective two-state model in which each graph acts as a single site whose coupling strength is set by its size.
  • This mechanism could be exploited to route quantum information periodically across subnetworks by tuning only the bridge and the relative sizes of the components.
  • Analogous slow pulsation might appear in continuous-time quantum walks or in open quantum systems with similar weak links.

Load-bearing premise

That ε is small enough for the leading asymptotic terms to dominate the long-time dynamics and that the graphs are finite, simple, and linked only by the single parameterized bridge.

What would settle it

Numerical simulation of the time-dependent probability for a concrete pair of graphs at small fixed ε (for example ε=0.01), checking whether the observed oscillation period scales as predicted with ε and remains unchanged when the internal edges are rearranged while keeping edge counts fixed.

Figures

Figures reproduced from arXiv: 2511.12872 by Etsuo Segawa, Taisuke Hosaka.

Figure 1
Figure 1. Figure 1: The solid and doted curves correspond to [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The solid and doted curves correspond to the finding probability on [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The solid and doted curves correspond to [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
read the original 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 $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if $\epsilon=0$, then the graph is completely separated. We show that for sufficiently small values of $\epsilon$, 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 $\epsilon$ 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(\epsilon^{-1/2})$. Furthermore, when the number of edges of two graphs is equal, the quantum walker is almost completely transferred.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The paper examines the Grover quantum walk on a finite graph formed by two arbitrary simple connected graphs joined by a single bridge edge of strength ε. For sufficiently small ε it derives an asymptotic expression for the probability of finding the walker on either subgraph and shows that this probability exhibits pulsation: periodic transfer between the two subgraphs with period scaling as O(ε^{-1/2}). The leading-order behavior depends only on the number of edges in each subgraph; when these numbers are equal the transfer is nearly complete.

Significance. If the perturbative analysis is correct, the result isolates a simple, structure-independent mechanism for controlled quantum transport across weakly linked graphs. The explicit dependence on edge counts alone and the O(ε^{-1/2}) period furnish falsifiable predictions that could guide experimental realizations on photonic or superconducting lattices.

major comments (2)
  1. [§3.2] §3.2, around Eq. (12): the reduction of the composite unitary to an effective two-level system for small ε relies on a spectral gap assumption between the bridge mode and the rest of the spectrum; the manuscript should supply an explicit lower bound on this gap in terms of the two graphs' adjacency spectra to justify that the O(ε) perturbation remains valid uniformly.
  2. [Theorem 4.1] Theorem 4.1: the claimed O(ε^{-1/2}) period is obtained from the imaginary part of the perturbed eigenvalue; the error term in the asymptotic probability is stated as o(1) but no explicit remainder estimate (e.g., O(ε^{1/2})) is given, which is needed to confirm that the pulsation remains visible for any fixed finite graphs when ε is small but nonzero.
minor comments (3)
  1. [§2] Notation: the symbol for the number of edges in each subgraph is introduced late; define m_1 and m_2 immediately after the graph construction in §2.
  2. [Figure 2] Figure 2: the plotted probability curves for unequal edge counts should include the analytic asymptotic curve for direct visual comparison.
  3. [Introduction] The statement that the graphs are 'arbitrary' should be qualified by the standing assumptions (finite, simple, connected) already used in the proof.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading, positive assessment, and recommendation for minor revision. We address each major comment below and will incorporate the suggested clarifications and estimates in the revised manuscript.

read point-by-point responses

  1. Referee: [§3.2] §3.2, around Eq. (12): the reduction of the composite unitary to an effective two-level system for small ε relies on a spectral gap assumption between the bridge mode and the rest of the spectrum; the manuscript should supply an explicit lower bound on this gap in terms of the two graphs' adjacency spectra to justify that the O(ε) perturbation remains valid uniformly.

    Authors: We agree that an explicit bound strengthens the argument. In the revision we will add a lower bound derived from the spectra of the individual graphs: the unperturbed operator is block diagonal, the bridge mode eigenvalue is isolated from the rest of the spectrum by a positive distance controlled by the minimal gap in the normalized adjacency spectra of the two graphs (minus possible overlap), which is strictly positive for any fixed finite connected graphs. This justifies uniform validity of the O(ε) perturbation for sufficiently small ε. revision: yes

  2. Referee: [Theorem 4.1] Theorem 4.1: the claimed O(ε^{-1/2}) period is obtained from the imaginary part of the perturbed eigenvalue; the error term in the asymptotic probability is stated as o(1) but no explicit remainder estimate (e.g., O(ε^{1/2})) is given, which is needed to confirm that the pulsation remains visible for any fixed finite graphs when ε is small but nonzero.

    Authors: We concur that an explicit remainder improves rigor. Using standard analytic perturbation theory for isolated eigenvalues, the error between the exact probability and the leading two-level asymptotic is bounded by C ε^{1/2} where C depends only on the fixed graphs, the gap, and the initial state. We will insert this O(ε^{1/2}) estimate into the statement and proof of Theorem 4.1 to confirm visibility of the pulsation for small but positive ε. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained perturbative analysis

full rationale

The paper performs a direct asymptotic expansion of the Grover walk unitary operator on the composite graph for small bridge strength ε. The pulsation period O(ε^{-1/2}) and the probability expression depending only on edge counts are obtained by spectral analysis and powers of the evolution operator on the finite graph. No load-bearing step reduces to a fitted parameter renamed as prediction, nor to a self-citation chain; the central claims follow from the standard definition of the Grover walk and explicit perturbation for the given bridge setup. The analysis is self-contained against the finite-graph assumptions stated in the paper.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claim rests on the standard definition of the Grover walk operator and the assumption that the graphs are finite and simple with a single parameterized bridge; no free parameters are fitted and no new entities are postulated.

axioms (2)
  • standard math Grover walk is defined via the standard coin and shift operators on the line graph of a simple undirected graph
    Invoked implicitly as the evolution rule for the quantum walker.
  • domain assumption The composite graph is finite, simple, and connected solely by one bridge edge whose weight is ε
    Stated in the setup of the model.

pith-pipeline@v0.9.0 · 5469 in / 1214 out tokens · 36340 ms · 2026-05-17T22:32:21.927905+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    Ambainis

    A. Ambainis. Quantum walk algorithm for element distinctness.SIAM Journal on Computing, 37(1):210–239, 2007

    work page 2007

  2. [2]

    Ambainis, E

    A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous. One-dimensional quantum walks.Proc. 33rd Annual ACM Symp. Theory of Computing, pages 37–49, 2001

    work page 2001

  3. [3]

    L. Grover. A fast quantum search mechanical algorithm for database search.Proceedings of the 28th annual ACM symposium on theory of computing, page 212–219, 1996

    work page 1996

  4. [4]

    F. D. Nicola, L. Sansoni, A. Crespiand R. Ramponi, R. Osellame, V. Giovannetti, R. Fazioand P. Mataloni, and F. Sciarrino. Quantum simulation of bosonic-fermionic noninteracting particles in disordered systems via a quantum walk.Physical Review A, 89(3):032322, 2014

    work page 2014

  5. [5]

    Vlachou, J

    C. Vlachou, J. Rodrigues, P. Mateus, N. Paunkovi´c, and A. Souto. Quantum walk public-key cryptographic system.International Journal of Quantum Information, 13(7):1550050, 2015

    work page 2015

  6. [6]

    Inui and N

    N. Inui and N. Konno. Localization of multi-state quantum walk in one dimension. Physica A: Statistical Mechanics and its Applications, (1):133–144, 2005

    work page 2005

  7. [7]

    N. Inui, N. Konno, and E. Segawa. One-dimensional three-state quantum walk.Physical Review E, (5):056112, 2005

    work page 2005

  8. [8]

    Konno, T

    N. Konno, T. Luczak, and E. Segawa. Limit measures of inhomogeneous discrete-time quantum walks in one dimension.Quantum information processing, (1):33–53, 2013

    work page 2013

  9. [9]

    N. Konno. Quantum random walks in one dimension.Quantum Infformation Processing, 1:345–354, 2002

    work page 2002

  10. [10]

    Panda and C

    A. Panda and C. Benjamin. Order from chaos in quantum walks on cyclic graphs. Physical Review A, page 012204, 2021

    work page 2021

  11. [11]

    Kubota, E

    S. Kubota, E. Segawa, T. Taniguchi, and Y. Yoshie. Periodicity of grover walks on generalized bethe trees.Linear Algebra and its Application, pages 371–391, 2018

    work page 2018

  12. [12]

    Higuchi, N

    Yu. Higuchi, N. Konno, I. Sato, and E. Segawa. Periodicity of the discrete-time quantum walk on a finite graph.Interdisciplinary Information Sciences, pages 75–86, 2017. 12

    work page 2017

  13. [13]

    Portugal.Quantum Walk and Search Algorithm, 2nd Ed.Springer Nature Switzer- land, 2018

    R. Portugal.Quantum Walk and Search Algorithm, 2nd Ed.Springer Nature Switzer- land, 2018

    work page 2018

  14. [14]

    C. Godsil. State transfer on graphs.Discrete Math, (1):129–147, 2012

    work page 2012

  15. [15]

    Aharonov, L

    Y. Aharonov, L. Davidovich, and N. Zagury. Quantum random walks.Physical Review A, 48(2):1690–1993, 1993

    work page 1993

  16. [16]

    Ambainis, A

    A. Ambainis, A. Gily´ en, J. Jeffery, and M. Kokainis. Quadratic speedup for finding marked vertices by quantum walks.Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 19:412–424, 2020

    work page 2020

  17. [17]

    C. Godsil. When can perfect state transfer occur?The Electronic Journal of Linear Algebra, page 877–890, 2012

    work page 2012

  18. [18]

    Segawa S

    E. Segawa S. Kubota. Perfect state transfer in grover walks between states associated to vertices of a graph.Linear Algebra and its Applications, pages 238–251, 2022

    work page 2022

  19. [19]

    Kubotaand K

    S. Kubotaand K. Yoshino. Circulant graphs with valency up to 4 that admit perfect state transfer in grover walks.Journal of Combinatorial Theory, Series A, (106064), 2025

    work page 2025

  20. [20]

    Skoup´ y M.ˇStefaˇ n´ ak

    S. Skoup´ y M.ˇStefaˇ n´ ak. Quantum walk state transfer on a hypercube.Physica Scripta, (104003), 2023

    work page 2023

  21. [21]

    Hosaka and E

    T. Hosaka and E. Segawa. Pulsation of quantum walk on johnson graph. arXiv:2411.01468, 2024

    work page arXiv 2024

  22. [22]

    Kato.A Short Introduction to Perturbation Theory for Linear Operator

    T. Kato.A Short Introduction to Perturbation Theory for Linear Operator. Springer- Verlag, New York, 1982

    work page 1982

  23. [23]

    Higuchi, N

    Yu. Higuchi, N. Konno, I. Sato, and E. Segawa. Spectral and asymptotic properties of grover walks on crystal lattices.Journal of Functional Analysis, 267:4197–4235, 2014

    work page 2014

  24. [24]

    Bohm.Quantum Theory

    D. Bohm.Quantum Theory. Dover Books on Physics Series. Dover Publications, 1951

    work page 1951

  25. [25]

    Davis and E

    M. Davis and E. Heller. Quantum dynamical tunneling in bound states.The Journal of Chemical Physics, 75:246, 1981

    work page 1981

  26. [26]

    Alicki and M

    R. Alicki and M. Fannes. Entanglement boost for extractable work from ensembles of quantum batteries.Physical Review E, 87, 2013. 13

    work page 2013