Absence of Ballistic Transport in Quantum Walks with Asymptotically Reflecting Sites

This paper establishes general sufficient conditions for zero velocity and the absence of ballistic transport in one-dimensional quantum walks with position-dependent coins, utilizing sparse site sequences and local coin parameters to derive deterministic criteria that remain valid even in the CMV setting.

The Gist

Imagine a quantum walk as a tiny, magical particle (let's call it a "quantum traveler") hopping along an infinite number line. Unlike a normal person walking down a street who might wander randomly, this traveler follows strict quantum rules: it can be in two places at once, and its path is determined by a hidden "coin" it flips at every step.

Usually, if the street is uniform, this traveler zooms away at a constant, fast speed. This is called ballistic transport—like a bullet fired from a gun. It spreads out linearly: after 1 second, it's 1 meter away; after 100 seconds, it's 100 meters away.

The Big Question:
What happens if we put up "walls" or "mirrors" along the street? Specifically, what if we place imperfect mirrors that get better and better as you go further out in both directions? Does the traveler still zoom away, or does it get stuck?

This paper answers that question with a resounding "It gets stuck." The authors prove that under certain conditions, the traveler's average speed drops to zero. It stops moving ballistically.

Here is the breakdown using simple analogies:

1. The Perfect Mirror vs. The Imperfect Mirror

• The Perfect Mirror: Imagine a wall that reflects 100% of the traveler. If you put two of these walls far apart, the traveler is trapped in the middle, bouncing back and forth forever. It can never escape to the horizon.
• The Imperfect Mirror: In the real world, mirrors aren't perfect. Some light leaks through. The authors ask: What if the mirrors are slightly leaky, but they get more reflective the further you go?
  • Near the center, the mirrors might be leaky (the traveler can slip through).
  • Far away, the mirrors become almost perfect.

2. The "Sparse" Strategy

The authors discovered a clever trick. You don't need a wall everywhere to stop the traveler. You just need a sparse sequence of very strong reflectors (mirrors) placed at specific spots, provided two things happen:

1. The Reflectors Get Stronger: As you go further out, the mirrors become more reflective (the "leak" gets smaller).
2. The Gaps Don't Grow Too Fast: The distance between these mirrors can get larger, but not too large compared to how far out you are.

The Analogy of the "Fence":
Imagine trying to run through a field.

• Scenario A (Ballistic): There are no fences. You run straight and fast.
• Scenario B (Trapped): There is a fence every 5 feet. You are stuck.
• Scenario C (The Paper's Discovery): There are no fences near the start. But as you run further, fences appear.
  • At mile 1, the fence has a tiny hole.
  • At mile 10, the hole is smaller.
  • At mile 100, the hole is microscopic.
  • Crucially: Even if the fences are miles apart, if the holes get small fast enough relative to the distance, you can't run fast anymore. You might still wiggle forward slowly, but you can't sprint. Your average speed over a long time becomes zero.

3. The "Modified Position" Trick (The Secret Weapon)

How did the authors prove this? They didn't just watch the traveler; they changed the rules of the game slightly to make the math easier.

Think of the infinite line as a series of rooms separated by these special mirror sites.

• Normally, we measure how far the traveler is from the start (Position = 1, 2, 3...).
• The authors invented a "Block Position". Instead of counting every single step, they grouped the line into chunks (rooms) between the mirrors.
• Inside a room, the traveler bounces around, but the "Block Position" doesn't change. The traveler only changes their "Block Position" when they cross a mirror.
• Because the mirrors are getting stronger (leakage is decreasing), the chance of crossing a mirror becomes vanishingly small as you go further out.
• By looking at the problem this way, they could mathematically prove that the traveler spends so much time bouncing inside the rooms that they never make it far enough to have a non-zero average speed.

4. The Random Case (The Casino)

The paper also looks at a chaotic scenario: What if the mirrors are placed randomly, and their "reflectiveness" is determined by a roll of the dice?

• The Condition: If the dice are rigged so that there is a decent chance of rolling a "super-reflective" mirror (a value close to zero) often enough, the traveler will almost certainly get stuck.
• The Metaphor: Imagine a casino where you keep rolling a die. If you roll a "1," you hit a wall. If you roll a "6," you pass through. If the casino is rigged so that "1"s appear frequently enough (specifically, if the probability of rolling a small number doesn't drop off too quickly), you will eventually hit enough walls to stop your forward momentum, even if the walls are scattered randomly.

Why Does This Matter?

• Quantum Computing: Quantum computers rely on particles moving and interacting. If you want to trap a particle in a specific spot (for memory) or stop it from spreading out (to prevent errors), you need to know how to design these "walls."
• New Materials: This helps scientists design materials that control how energy or information flows, potentially creating "quantum insulators" where electricity (or quantum information) stops moving under certain conditions.

Summary

The paper proves that you don't need a solid wall to stop a quantum traveler. You just need a series of "almost perfect" mirrors that get stronger as you go further out, provided they aren't spaced out too wildly. If these conditions are met, the traveler loses its ability to sprint (ballistic transport) and its long-term speed drops to zero. It's a mathematical guarantee that in a sufficiently "reflective" universe, you can't go anywhere fast.

Technical Summary

1. Problem Statement

The paper investigates the dynamical behavior of one-dimensional discrete-time quantum walks (QWs), specifically focusing on the conditions under which ballistic transport (linear spreading of wave packets over time) is absent.

• Context: In periodic systems, QWs typically exhibit ballistic transport ($v > 0$). In disordered systems, they often exhibit localization (zero transport). The authors study inhomogeneous split-step quantum walks where the coin operators vary spatially.
• Core Question: Can the presence of a bi-infinite sequence of "imperfect reflectors" (sites where the coin parameter approaches a perfect reflector value) suppress ballistic transport, even if the reflectors are not perfect everywhere?
• Specific Challenge: The authors aim to establish deterministic criteria for zero maximal velocity ($v(W)=0$) that depend only on the behavior of coin parameters along a sparse subsequence of sites, independent of the coin values elsewhere. This addresses a gap in the literature regarding local, sparse-reflector mechanisms in bi-infinite QWs.

2. Methodology

The authors develop a novel analytical framework centered on a modified position operator tailored to a sparse decomposition of the Hilbert space.

A. Mathematical Setting

• Model: The system is a split-step quantum walk $W = S_+ C_1 S_- C_2$ on $\ell^2(\mathbb{Z}) \otimes \mathbb{C}^2$.
• CMV Connection: The walk is mapped to generalized extended CMV matrices (orthogonal polynomials on the unit circle), where the coin parameters correspond to Verblunsky coefficients.
• Velocity Definition: The maximal velocity is defined as:
  $$v(W) = \sup_{\|\psi\|=1} \limsup_{t \to \infty} \frac{1}{t} \|Q W^t \psi\|$$
  where $Q$ is the position operator. $v(W)=0$ implies the absence of ballistic transport.

B. The Modified Position Operator Technique

The central innovation is the introduction of a block-scalar modified position operator $\tilde{Q}_N$.

1. Sparse Decomposition: The lattice is decomposed into finite "cavities" ($H_m$) defined by a strictly increasing sequence of indices $(j_m)_{m \in \mathbb{Z}}$. These indices represent sites where the coin parameter $a_k(j_m)$ is small (acting as near-perfect reflectors).
2. Operator Construction: Instead of the standard position operator $Q$, the authors define $\tilde{Q}_N$ which is constant within each cavity $H_m$ but jumps between cavities.
3. Commutation Properties:
   • $\tilde{Q}_N$ is constructed to commute with the "inactive" part of the dynamics (specifically the block-diagonal part of the evolution operator associated with one of the coin sequences).
   • This reduces the problem of bounding transport to estimating the commutator $[\tilde{Q}_N, W]$, which depends only on the inter-cavity couplings (the coin parameters at the interface sites $j_m$).
4. Stability: Using Theorem 3.1, they prove that if the difference $(Q - \tilde{Q}_N)$ is $Q$-bounded with a relative bound $b < 1$, the maximal velocity defined via $\tilde{Q}_N$ is equivalent to the standard velocity up to a constant factor.

C. Derivation of Bounds

By expanding the commutator $[\tilde{Q}_N, W^t]$, the authors derive an a priori upper bound on the velocity (Theorem 2.5). This bound is:

• Subsequence-driven: It depends only on the coin parameters $a_k(j_m)$ along the chosen sequence $(j_m)$.
• Gap-weighted: It incorporates the geometric gaps $g_m = j_{m+1} - j_m$ between reflectors.
• Decoupled: It treats the two coin sequences ($C_1$ and $C_2$) separately, avoiding complex interference analysis.

3. Key Contributions and Results

A. General A Priori Bound (Theorem 2.5)

The paper establishes a general upper bound for the maximal velocity:
$$v(W) \leq \min_{k \in \{1,2\}} \inf_{(j_m) \in \mathcal{J}} \inf_{N \in \mathbb{N}} (1+q)^{N+1} \max \left( \sup_{m \geq N} g_{m-N} |a_k(j_{m+1})|, \dots \right)$$
where $q$ relates to the growth rate of gaps relative to position. This result is significant because it proves that transport is governed by the existence of sufficiently weak scattering sites with controlled spacing, regardless of the global coin profile.

B. Deterministic Zero-Velocity Criteria (Theorem 2.3)

The authors derive three sufficient conditions for $v(W)=0$ based on the decay of coin parameters $|a_k(j_m)| \to 0$ and the growth of gaps $g_m$:

1. Uniformly Bounded Gaps: If the distance between reflectors is bounded ($\sup g_m < \infty$), any decay $|a_k(j_m)| \to 0$ is sufficient to kill ballistic transport.
2. Sublinear Gaps with Quantitative Decay: If gaps grow sublinearly ($g_m/|j_m| \to 0$) and the coin parameters decay as $O(|j_m|^{-1})$, then $v(W)=0$.
3. Gap-Weighted Decay: If the product of the gap size and the coin parameter decays ($g_m |a_k(j_m)| \to 0$), then $v(W)=0$. This allows for exponentially growing gaps provided the reflectors become sufficiently strong (closer to perfect).

Key Feature: These criteria are local and sparse. They do not require knowledge of the coin parameters outside the sequence $(j_m)$.

C. Random Setting Application (Corollary 2.7)

The deterministic framework is applied to i.i.d. random quantum walks.

• Result: If the distribution of the coin modulus $|a(n)|$ has a lower tail satisfying $P(|a(0)| \leq x) \geq c x^\alpha$ for $\alpha \in (0,1)$, then $v(W)=0$ almost surely.
• Mechanism: The Borel-Cantelli lemma ensures the almost-sure existence of a sparse sequence of "good" sites (small $|a(n)|$) satisfying the gap conditions required by Theorem 2.3.
• Novelty: Unlike standard localization proofs that rely on transfer matrices or Lyapunov exponents, this result isolates a simple probabilistic mechanism based on the frequency of near-perfect reflectors.

4. Significance and Implications

• New Mechanism for Localization: The paper identifies a mechanism for suppressing transport that relies on sparse, asymptotically perfect reflectors rather than global disorder or periodicity. This bridges the gap between perfect localization (infinite barriers) and ballistic transport.
• Methodological Innovation: The modified position operator technique is a new tool in the QW/CMV setting. It allows for the reduction of a global dynamical problem to a local estimation of interfacial couplings, bypassing the need for spectral analysis of the full operator.
• Robustness: The results show that ballistic transport is fragile; it can be destroyed by a sparse set of sites that become increasingly reflective, even if the rest of the system is perfectly transmitting.
• Limitations and Future Work: The authors note that their method is less effective for quasi-periodic models (e.g., Fibonacci walks), suggesting that transport suppression in those systems relies on global interference effects rather than sparse local reflectors. They also leave open the question of whether $v(W)=0$ implies pure point spectrum (localization) or merely sub-ballistic transport in these regimes.

In summary, the paper provides a rigorous, deterministic, and probabilistic framework for proving the absence of ballistic transport in 1D quantum walks by leveraging sparse sequences of asymptotically reflecting sites, utilizing a novel modified position operator to decouple local geometry from global dynamics.