State transfer with explicit resources and timing

This is the standard teleportation resource identity BennettTeleport. If two bits can be batched, $m=1$; if only one bit per tick is available, $m=2$. If local wrappers and transport are admitted as one compound exceptional-block instrument, a different timing convention may charge fewer ticks, but that closure must be stated.

Bell-pair distribution requires a certified ordinary route. On a suitable ${\mathbb{Z}}^D$ schedule it can take $\lceil \ell /r\rceil$ ticks; an arbitrary metric substrate need not admit such a route. A constant-time transfer protocol is not automatically super-cone at every distance $\ell >r$ when its local processing stages are charged separately.