← 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

Nobody has reviewed this record for gaps yet.

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.