← Atlas

Algorithms · Quantum walk

Discrete-time quantum walk on a line

A coin-and-shift circuit that spreads a walker's position amplitude ballistically, in contrast to the diffusive spread of a classical random walk.

Strong empiricalUpdated

View frozen graph

A small worked example, computed in your browser. It is not a result from this record's papers.

A discrete-time quantum walk on a 4-cycle

One coin qubit, two position qubits (4 positions on a cycle), 3 steps starting at position 0.

q0q1q2Step 1 of 3 · Quantum walk step (4-cycle)Quantum walk step (4-cycle)Step 2 of 3 · Quantum walk step (4-cycle)Quantum walk step (4-cycle)Step 3 of 3 · Quantum walk step (4-cycle)Quantum walk step (4-cycle)

Step 1 of 3 · Quantum walk step (4-cycle)

Probability of each outcome after this step

  • 01150%
  • 11050%
  1. Flips the coin with a Hadamard, then shifts the position by +1 if the coin is |1⟩ or -1 mod 4 if the coin is |0⟩; with the coin in superposition, both shifts happen at once, entangling coin and position.

    Probability leaves the outcome it was on and appears on 2 entirely different ones — not one outcome is populated both before and after. This is the step that entangles the qubits: from here on no single qubit has a state of its own, only the register as a whole does.

  2. The same coin flip and shift, applied again.

    Probability leaves all 2 outcomes it was on and appears on 4 entirely different ones — not one outcome is populated both before and after.

  3. The same coin flip and shift, a third time.

    Probability leaves all 4 outcomes it was on and appears on 2 entirely different ones — not one outcome is populated both before and after. The entanglement comes apart here: each qubit has a state of its own again.

Readout The position always reads 3, for either value of the coin: constructive interference on this small cycle concentrates the walk onto a single position after exactly 3 steps.

Open in Studio
  • Steps3
  • Wires4
  • Qubits1 coin + 3 position (8 sites)
  • Steps shown2
  • Spreadingσ∝t (quantum) vs σ∝√t (classical)
  • Papers2

A coined discrete-time quantum walk on the integer line pairs a 2-dimensional coin register with a position register. Each step applies a coin operator CC (Hadamard, by default) to the coin, then a conditional shift SS that moves the position by −1-1 if the coin reads ∣0⟩|0\rangle and +1+1 if it reads ∣1⟩|1\rangle — applied coherently, so all branches persist and can later interfere.

Long-run behavior. After tt steps, the position distribution of this walk spreads with standard deviation σ∝t\sigma \propto t (ballistic spreading), in contrast to a classical random walk's σ∝t\sigma \propto \sqrt t (diffusive spreading) — a quadratic gain in spreading rate that several quantum-walk-based search and graph algorithms exploit (Aharonov, Ambainis, Kempe, Vazirani, 2001).

Small worked instance. Start at position 00 with coin ∣0⟩|0\rangle. Step 1: HH on the coin gives 12(∣0⟩+∣1⟩)⊗∣0⟩pos\tfrac1{\sqrt2}(|0\rangle+|1\rangle)\otimes|0\rangle_{\text{pos}}; the shift then gives 12∣0,−1⟩+12∣1,+1⟩\tfrac1{\sqrt2}|0,-1\rangle + \tfrac1{\sqrt2}|1,+1\rangle (coin, position) — each position ±1\pm1 with probability 1/21/2, matching a classical single step.

Step 2 applies HH to the coin in each branch: H∣0⟩=12(∣0⟩+∣1⟩)H|0\rangle=\tfrac1{\sqrt2}(|0\rangle+|1\rangle), H∣1⟩=12(∣0⟩−∣1⟩)H|1\rangle=\tfrac1{\sqrt2}(|0\rangle-|1\rangle), giving

12∣0,−1⟩+12∣1,−1⟩+12∣0,+1⟩−12∣1,+1⟩,\tfrac12|0,-1\rangle+\tfrac12|1,-1\rangle+\tfrac12|0,+1\rangle-\tfrac12|1,+1\rangle,

then the shift moves each term (∣0,x⟩→∣0,x−1⟩|0,x\rangle\to|0,x-1\rangle, ∣1,x⟩→∣1,x+1⟩|1,x\rangle\to|1,x+1\rangle):

12∣0,−2⟩+12∣1,0⟩+12∣0,0⟩−12∣1,+2⟩.\tfrac12|0,-2\rangle+\tfrac12|1,0\rangle+\tfrac12|0,0\rangle-\tfrac12|1,+2\rangle.

Reading off probabilities: P(−2)=1/4P(-2)=1/4; at position 00 the two contributions carry different coin states so they do not interfere, giving P(0)=(1/2)2+(1/2)2=1/2P(0)=(1/2)^2+(1/2)^2=1/2; and P(+2)=1/4P(+2)=1/4. At this short length the result numerically coincides with the classical 2-step binomial walk — the quantum/classical divergence (from interference between equal-coin-state paths reaching the same site) only becomes visible from step 3 onward, which is worth stating honestly rather than implying an advantage is visible after 2 steps.

References

  • Quantum Walks On Graphs

    Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh Vazirani · 2000

    Establishes the ballistic spreading of coined quantum walks and contrasts it with classical diffusive spreading.

  • Quantum random walks - an introductory overview

    Julia Kempe · 2003

    Accessible review of coined and continuous-time quantum walks and their algorithmic applications.

Strong empirical
  • Verified by construction
  • Small-instance agreement
  • Peer-reviewed paper
Method
The coin-plus-shift circuit is checked against the standard Hadamard-coin quantum walk recursion. The exact amplitude/probability distribution after 2 steps from the origin is derived analytically term by term.
Result
Pass · after 2 steps the derived distribution is P(-2)=1/4, P(0)=1/2, P(+2)=1/4, matching the circuit's coin-and-shift construction (and, at this short length, coinciding with the classical 2-step random walk).
Caveat
This record verifies construction and a 2-step hand-derived distribution; the asymptotic ballistic-spread claim (σ∝t) is literature-backed, not re-derived at scale.
Quantum Walks On Graphs ↗
Kind
curated reference
Reviewed by
Leona Quantum curation pass
License
CC BY 4.0-compatible reference metadata
quantum walkcoin operatorballistic spreadinggraph algorithms
  • Spatial search and element-distinctness algorithms built on quantum walks
  • Quantum-walk-based graph algorithms (hitting times, network centrality)
  • Sampling primitives for simulating transport phenomena

Atlas stars stay in the public catalog. Saving this entry to your workspace starts an unstarred private copy.