Manuscript VII-A-ST@1 · VII-A-ST.tex · section · c39a67a3

A target-adapted route

Schedule locality and causal certificate transport › A target-adapted route · lines 1968–2008

For $n$ hops the laboratory resource ledger is

item payload storage clock table probe payload communication classical route storage score record charge n + 1 two-qubit registers 2 qubits, then consumed 1 fresh qubit after clock consumption n endpoint SWAPs 2 (n + 1) bits 1 bit

With all route sites reserved in advance,

Q_{lab} \leq 2 (n + 1) + 2, C_{lab} \leq 2 (n + 1) + 1.

External reference storage is charged separately.

The exact theorem uses a target-adapted installed chain, not exact null attainment on every endpoint of one fixed lattice. It supplies no continuous relativistic Hamiltonian for a spatially extended SWAP. Its model is a finite network of admitted causal communication channels, not a continuum field simulation.

For implemented compatible channels, replacing one factor at a time and using complete trace-norm contraction gives

d_{⋄} (Φ, Φ) \leq min {1, ϵ_{enc} + j \sum ϵ_{j} + ϵ_{dec}} .

This is a conditional error ledger, not reported experimental performance or an executed compilation.

Displayed formulas in this passage

unlabeled · line 1971
$item payload storage clock table probe payload communication classical route storage score record charge n + 1 two-qubit registers 2 qubits, then consumed 1 fresh qubit after clock consumption n endpoint SWAPs 2 (n + 1) bits 1 bit$
unlabeled · line 1984
$Q_{lab} \leq 2 (n + 1) + 2, C_{lab} \leq 2 (n + 1) + 1.$
unlabeled · line 1999
$d_{⋄} (Φ, Φ) \leq min {1, ϵ_{enc} + j \sum ϵ_{j} + ϵ_{dec}} .$

A target-adapted route

Displayed formulas in this passage

Nearby in this section