The switching effect of the side chain on quantum walks on triple graphs

Li-Hua Lu; Yi-Mu Du; You-Quan Li

arxiv: 1907.10870 · v1 · pith:UGOAML5Ynew · submitted 2019-07-25 · 🪐 quant-ph

The switching effect of the side chain on quantum walks on triple graphs

Yi-Mu Du , Li-Hua Lu , You-Quan Li This is my paper

Pith reviewed 2026-05-24 16:41 UTC · model grok-4.3

classification 🪐 quant-ph

keywords continuous-time quantum walktriple graphside chainswitching effectprobability interchangeodd-even paritytight-binding model

0 comments

The pith

A side chain with an odd number of sites switches the probability flow between the two segments of the main chain in a continuous-time quantum walk on a triple graph, provided length and position conditions hold; even lengths produce nosuch

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

The paper examines continuous-time quantum walks on a triple graph formed by a main chain with one side chain attached at a chosen point. It tracks how the probability of finding the walker at the left versus right ends of the main chain evolves in time and isolates the effect of the side chain. When the side chain contains an odd number of sites and the total length of the main chain together with the attachment point meet specific matching conditions, the probabilities at the two ends interchange after a characteristic time. The same interchange fails to appear when the side chain has an even number of sites. The authors note that the geometric control this supplies could be harnessed to build a quantum switching device and outline two experimental routes to observe it.

Core claim

We consider a continuous-time quantum walk on a triple graph and investigate the influence of the side chain on the propagation in the main chain. Calculating the interchange of the probabilities between the two parts of the main chain, we find that a switching effect appears if there are odd number of points on the side chain when concrete conditions between the length of the main chain and the position of the side chain are satisfied. Whereas, such an effect does not occur if there are even number of points on the side chain.

What carries the argument

The parity of the number of sites on the side chain, which controls whether the time-evolution operator produces an interchange of probabilities between the two segments of the main chain when length and attachment conditions are met.

If this is right

The switching occurs only when the side chain has an odd number of sites and the concrete length-position conditions are satisfied.
No switching effect occurs for an even number of sites on the side chain.
The effect supplies a geometric mechanism that could be used to design a new type of switching device.
Two experimental proposals are given that would allow the switching to be observed.

Where Pith is reading between the lines

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

The same parity rule may appear in quantum walks on other graphs that contain a single attached branch, allowing flow control without external potentials.
The mechanism could be tested for robustness by adding weak disorder or by increasing the total size of the graph while keeping the parity fixed.
If the switching survives in the presence of decoherence, it might serve as a passive router for quantum information on lattice-based hardware.

Load-bearing premise

The walker evolves exactly under the nearest-neighbor tight-binding Hamiltonian on this fixed graph geometry, and the probability interchange appears only when the stated relations between main-chain length and side-chain position hold.

What would settle it

A direct calculation or measurement of the time-dependent probabilities at the two ends of the main chain that shows interchange for an even-length side chain or shows no interchange for an odd-length side chain even when the length and position conditions are satisfied.

Figures

Figures reproduced from arXiv: 1907.10870 by Li-Hua Lu, Yi-Mu Du, You-Quan Li.

**Figure 2.** Figure 2: FIG. 2. (color online) The time evolution of the probabiliti [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

**Figure 3.** Figure 3: FIG. 3. (color online) The time evolution of the probabiliti [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

read the original abstract

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.

Desk Editor's Note private letter to a colleague

The paper reports a parity-dependent switching effect in continuous-time quantum walks on triple graphs, where odd side-chain length enables probability interchange under specific conditions but even does not.

read the letter

The one thing to know is that this paper finds a switching effect in continuous-time quantum walks on triple graphs where the side chain's odd site count enables probability switching between main chain segments under certain length and position conditions, but even counts block it. The authors use the standard tight-binding Hamiltonian and look at the probability interchange over time. The parity dependence arises from the structure of the graph's adjacency matrix eigenvalues. They back it with two experimental proposals for observation, which ties the theory to potential devices. What the paper does well is isolate this parity rule clearly. It's a direct consequence of the model on this geometry, and the conditions are spelled out. The result is presented as new within the cited quantum walks literature. The soft spots are minor but real. The finding is quite specific to triple graphs and the nearest-neighbor case, so it doesn't generalize immediately. The math is conventional and the central claim holds without internal contradiction or unsupported steps. This is aimed at researchers studying quantum transport on graphs or looking for geometric controls in quantum walks. Someone working on similar models would get value from the parity observation and the experimental ideas. Overall, the paper shows clear thinking on its own terms and deserves a serious referee to verify the calculations and assess the experimental suggestions. It is not revolutionary but adds a usable detail.

Referee Report

2 major / 2 minor

Summary. The manuscript examines continuous-time quantum walks on triple graphs consisting of a main chain with an attached side chain. Using the standard nearest-neighbor tight-binding Hamiltonian, the authors compute the time evolution and report a switching effect in which probability interchanges between the two segments of the main chain. This effect occurs when the side chain has an odd number of vertices and specific conditions relating the main-chain length to the attachment position are satisfied; the effect is absent for even-length side chains. Two experimental proposals are outlined for realizing the effect in a switching device.

Significance. If the parity-dependent switching result holds under the stated conditions, it provides a concrete, model-specific illustration of how graph geometry controls quantum transport in finite systems. The conventional CTQW setup on the adjacency matrix makes the claim directly testable by diagonalization or numerical propagation, and the experimental suggestions link the finding to potential device applications.

major comments (2)

[Model and Results sections] The central claim rests on the spectrum of the adjacency matrix of the triple graph, yet the manuscript does not display the explicit form of the Hamiltonian or the characteristic equation whose roots determine the parity dependence (see the derivation leading to the probability interchange formula).
[Results section] The 'concrete conditions' between main-chain length and side-chain position are invoked repeatedly but are not stated as a compact set of equations or tabulated for representative cases; without this, the numerical evidence for the odd/even distinction cannot be independently verified.

minor comments (2)

[Figures] Figure captions should explicitly label the vertex numbering and the initial state location used in the probability plots.
[Introduction] A short paragraph comparing the triple-graph results to known perfect-state-transfer conditions on paths or stars would help situate the parity effect within the existing CTQW literature.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive suggestions. We address the major comments point by point below.

read point-by-point responses

Referee: [Model and Results sections] The central claim rests on the spectrum of the adjacency matrix of the triple graph, yet the manuscript does not display the explicit form of the Hamiltonian or the characteristic equation whose roots determine the parity dependence (see the derivation leading to the probability interchange formula).

Authors: We agree that the explicit Hamiltonian and characteristic equation are not displayed. The Hamiltonian is the adjacency matrix of the triple graph in the standard tight-binding form, but we will add its explicit matrix representation together with the characteristic equation and the steps leading to the parity-dependent probability interchange formula in the revised Model section. revision: yes
Referee: [Results section] The 'concrete conditions' between main-chain length and side-chain position are invoked repeatedly but are not stated as a compact set of equations or tabulated for representative cases; without this, the numerical evidence for the odd/even distinction cannot be independently verified.

Authors: We agree that the conditions are not presented compactly. In the revised Results section we will state the conditions as an explicit set of equations relating main-chain length N, attachment position k, and side-chain length M, and include a table of representative (N, k, M) triples that satisfy or violate the conditions for both odd and even M. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The derivation consists of applying the standard continuous-time quantum walk evolution operator (generated by the adjacency matrix of the finite triple graph) to an initial state localized on one segment of the main chain, then computing the time-dependent probability on the other segment. The reported parity-dependent switching effect is obtained directly from the eigenvalues and eigenvectors of that matrix under the stated length/position conditions; no parameters are fitted to data, no result is renamed as a prediction, and no load-bearing premise reduces to a self-citation or self-definition. The abstract and skeptic summary confirm the argument is self-contained against the conventional CTQW model on the given geometry.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract alone supplies no identifiable free parameters, background axioms, or invented entities; all modeling details remain unspecified.

pith-pipeline@v0.9.0 · 5631 in / 1078 out tokens · 24579 ms · 2026-05-24T16:41:31.476024+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

switching effect appears if there are odd number of points on the side chain when concrete conditions between the length of the main chain and the position of the side chain are satisfied. Whereas, such an effect does not occur if there are even number of points on the side chain.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Green function ... eigenvalues ... z/J² − ⟨ℓ|g0|ℓ⟩ = 0

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages · 1 internal anchor

[1]

and ℓ because the non-zero energy levels near zero are also existed for the system with the side chain of two points. That implies that the particle can always cross the connection point into the other part of the main chain no matter whether ( N + 1) and ℓ have the greatest common divisor larger than two, which can be conﬁrmed by Fig. 2. 0 5 10 15 200 0....

work page 2000
[2]

Aharonov, L

Y. Aharonov, L. Davidovich, and N. Zagury, Phys. Rev. A, 48,1687 (1993)

work page 1993
[3]

Mohseni, P

M. Mohseni, P. Rebentrost, S. Lloyd, and A. Aspuru- Guzik, J. Chem. Phys, 129, 174106 (2008)

work page 2008
[4]

Shenvi, J

N. Shenvi, J. Kempe, and R.B. Whaley, Phys. Rev. A, 67,052307 (2003)

work page 2003
[5]

S. E. Venegas-Andraca, Quantum Information Process- ing 11, 1015 (2012)

work page 2012
[6]

Farhi and S

E. Farhi and S. Gutmann, Phys. Rev. A, 58, 915 (1998)

work page 1998
[7]

Kempe, Probability Theory Relat.Fields, 133(2), 215 (2005)

J. Kempe, Probability Theory Relat.Fields, 133(2), 215 (2005)

work page 2005
[8]

Koˇ s ´ ık and V

J. Koˇ s ´ ık and V. Buˇ zek, Phys. Rev. A,71, 012306 (2005)

work page 2005
[9]

Krovi and T

H. Krovi and T. A. Brun, Phys. Rev. A, 73, 032341(2006)

work page 2006
[10]

F. L. Marquezino, R. Portugal, G. Abal, and R. Donan- gelo, Phys. Rev. A, 77, 042312 (2008)

work page 2008
[11]

Makmal, M

A. Makmal, M. Zhu, D. Manzano, M. Tiersch, and H. J. Briegel, Phys. Rev. A, 90, 022314 (2014). 7

work page 2014
[12]

Bednarska, A

M. Bednarska, A. Grudka, P. Kurzy´ nski, T. /suppress Luczak and A. W´ ojcik, Phys. Lett. A, 317, 21 (2003)

work page 2003
[13]

Solenov and L

D. Solenov and L. Fedichkin, Phys. Rev. A, 73, 012313 (2006)

work page 2006
[14]

D’Alessandro, G

D. D’Alessandro, G. Parlangeli, and F. Albertini, Jour . Phys. A, 40, 14447 (2007)

work page 2007
[15]

Solenov and L

D. Solenov and L. Fedichkin, Phys. Rev. A, 73, 012308 (2006)

work page 2006
[16]

Leung, P

G. Leung, P. Knott, J. Bailey and V. Kendon, New. Jour. Phys. 12, 123018 (2010)

work page 2010
[17]

Koll´ ar, T

B. Koll´ ar, T. Kiss, J. Novotn´ y, and I. Jex, Phys. Rev. Lett, 108, 230505 (2012)

work page 2012
[18]

Koll´ ar, J

B. Koll´ ar, J. Novotn´ y, T. Kiss and I. Jex, New Jour. Phys, 16, 023002 (2014)

work page 2014
[19]

B. L. Douglas, J. B. Wang, Jour. Phys. A, 41, 075303 (2008)

work page 2008
[20]

J. K. Gamble, M. Friesen, D. Zhou, R. Joynt, and S. N. Coppersmith, Phys. Rev. A, 81, 052313 (2010)

work page 2010
[21]

S. D. Berry and J. B. Wang, Phys. Rev. A, 83, 042317 (2011)

work page 2011
[22]

Rudinger, J

K. Rudinger, J. K. Gamble, M. Wellons, E. Bach, M. Friesen, R. Joynt, and S. N. Coppersmith, Phys. Rev. A, 86, 022334 (2012)

work page 2012
[23]

C. P. Yang, and S. Y. Han, Phys. Rev. A, 72, 032311 (2005)

work page 2005
[24]

A Quantum Algorithm for the Hamiltonian NAND Tree

E. Farhi, J.Goldstone, S.Gutmann, - eprint arXiv:quant-ph/0702144 - 2007

work page internal anchor Pith review Pith/arXiv arXiv 2007
[25]

Ho-Fai Cheung, Yuval Gefen, Eberhard K.Riedel, and Wei-Heng Shih, Phys. Rev. B, 37, 6050 (1988)

work page 1988

[1] [1]

and ℓ because the non-zero energy levels near zero are also existed for the system with the side chain of two points. That implies that the particle can always cross the connection point into the other part of the main chain no matter whether ( N + 1) and ℓ have the greatest common divisor larger than two, which can be conﬁrmed by Fig. 2. 0 5 10 15 200 0....

work page 2000

[2] [2]

Aharonov, L

Y. Aharonov, L. Davidovich, and N. Zagury, Phys. Rev. A, 48,1687 (1993)

work page 1993

[3] [3]

Mohseni, P

M. Mohseni, P. Rebentrost, S. Lloyd, and A. Aspuru- Guzik, J. Chem. Phys, 129, 174106 (2008)

work page 2008

[4] [4]

Shenvi, J

N. Shenvi, J. Kempe, and R.B. Whaley, Phys. Rev. A, 67,052307 (2003)

work page 2003

[5] [5]

S. E. Venegas-Andraca, Quantum Information Process- ing 11, 1015 (2012)

work page 2012

[6] [6]

Farhi and S

E. Farhi and S. Gutmann, Phys. Rev. A, 58, 915 (1998)

work page 1998

[7] [7]

Kempe, Probability Theory Relat.Fields, 133(2), 215 (2005)

J. Kempe, Probability Theory Relat.Fields, 133(2), 215 (2005)

work page 2005

[8] [8]

Koˇ s ´ ık and V

J. Koˇ s ´ ık and V. Buˇ zek, Phys. Rev. A,71, 012306 (2005)

work page 2005

[9] [9]

Krovi and T

H. Krovi and T. A. Brun, Phys. Rev. A, 73, 032341(2006)

work page 2006

[10] [10]

F. L. Marquezino, R. Portugal, G. Abal, and R. Donan- gelo, Phys. Rev. A, 77, 042312 (2008)

work page 2008

[11] [11]

Makmal, M

A. Makmal, M. Zhu, D. Manzano, M. Tiersch, and H. J. Briegel, Phys. Rev. A, 90, 022314 (2014). 7

work page 2014

[12] [12]

Bednarska, A

M. Bednarska, A. Grudka, P. Kurzy´ nski, T. /suppress Luczak and A. W´ ojcik, Phys. Lett. A, 317, 21 (2003)

work page 2003

[13] [13]

Solenov and L

D. Solenov and L. Fedichkin, Phys. Rev. A, 73, 012313 (2006)

work page 2006

[14] [14]

D’Alessandro, G

D. D’Alessandro, G. Parlangeli, and F. Albertini, Jour . Phys. A, 40, 14447 (2007)

work page 2007

[15] [15]

Solenov and L

D. Solenov and L. Fedichkin, Phys. Rev. A, 73, 012308 (2006)

work page 2006

[16] [16]

Leung, P

G. Leung, P. Knott, J. Bailey and V. Kendon, New. Jour. Phys. 12, 123018 (2010)

work page 2010

[17] [17]

Koll´ ar, T

B. Koll´ ar, T. Kiss, J. Novotn´ y, and I. Jex, Phys. Rev. Lett, 108, 230505 (2012)

work page 2012

[18] [18]

Koll´ ar, J

B. Koll´ ar, J. Novotn´ y, T. Kiss and I. Jex, New Jour. Phys, 16, 023002 (2014)

work page 2014

[19] [19]

B. L. Douglas, J. B. Wang, Jour. Phys. A, 41, 075303 (2008)

work page 2008

[20] [20]

J. K. Gamble, M. Friesen, D. Zhou, R. Joynt, and S. N. Coppersmith, Phys. Rev. A, 81, 052313 (2010)

work page 2010

[21] [21]

S. D. Berry and J. B. Wang, Phys. Rev. A, 83, 042317 (2011)

work page 2011

[22] [22]

Rudinger, J

K. Rudinger, J. K. Gamble, M. Wellons, E. Bach, M. Friesen, R. Joynt, and S. N. Coppersmith, Phys. Rev. A, 86, 022334 (2012)

work page 2012

[23] [23]

C. P. Yang, and S. Y. Han, Phys. Rev. A, 72, 032311 (2005)

work page 2005

[24] [24]

A Quantum Algorithm for the Hamiltonian NAND Tree

E. Farhi, J.Goldstone, S.Gutmann, - eprint arXiv:quant-ph/0702144 - 2007

work page internal anchor Pith review Pith/arXiv arXiv 2007

[25] [25]

Ho-Fai Cheung, Yuval Gefen, Eberhard K.Riedel, and Wei-Heng Shih, Phys. Rev. B, 37, 6050 (1988)

work page 1988