Manuscript En08-B@1 · En08-B.tex · lemma · 23cac52a
Lemma: Uniform lattice routing
Explicit routing and complete quantum transport › A deterministic rounding convention · lines 512–587 · proof included or linked
En08-B@1#lem:routing, En08-B@1#eq:route-count, En08-B@1#eq:lattice-delay, En08-B@1#eq:uniform-ticks, En08-B@1#eq:route-points
Let and . Set . For , set . For , set
There is an explicit route
whose increments belong to . Its time
satisfies
If and , then
Proof. The zero case uses the single point , no gates, and zero time.
For , let be given by (eq:route-count) and define
Because rounding fixes lattice points, and . Write
Then
Both points are lattice points, so every increment is in . An increment may be zero; it is a permitted wait.
The triangle inequality along the route gives , proving the lower bound. Also,
so
Subtracting proves (eq:lattice-delay). Finally, gives
Displayed formulas in this passage
En08-B@1#eq:route-count · line 518
En08-B@1#eq:lattice-delay · line 533
En08-B@1#eq:uniform-ticks · line 540
En08-B@1#eq:route-points · line 550
unlabeled · line 524
unlabeled · line 529
unlabeled · line 557
unlabeled · line 561
unlabeled · line 573
unlabeled · line 577
unlabeled · line 583