Manuscript Hawk04-C@1 · Hawk04-C-v1.tex · proposition · 94d46352

Proposition: A register-level realization

A worked finite schedule and the quantum-computer narrative › A concrete transfer schedule · lines 1813–1851 · proof included or linked

Hawk04-C@1#prop:toy, Hawk04-C@1#eq:toy-record

Back to manuscript

Let consist of qubits. Prepare a blank -qubit register and swap the code into it, leaving the old visible register blank. For each , swap into a fresh blank outgoing qubit . Before outgoing readout, the first emitted qubits together with the untransferred part of contain the entire input, up to fixed register permutations and blank factors.

If each is destructively read immediately, the record after emissions is

An added destructive readout-and-drop of the remaining quantum core does not change (eq:toy-record).

Proof. Every SWAP is unitary and only relocates a tensor factor. After transfers, the logical tensor factors have been permuted into . All transferred positions of are blank. This proves complete preservation, including on entangled inputs.

The computational measurement effects on the transferred factors pull back to on the original code. This gives (eq:toy-record). The terminal operation acts only on the remaining quantum factors and returns none of its outputs, so Theorem thm:drop leaves the earlier record unchanged.

Displayed formulas in this passage

  • Hawk04-C@1#eq:toy-record · line 1825

Nearby in this section