Skip to content
Shadow Theory

Chapter 29 Version 2

Massive material records, retained resources and protection

Reading position 41 of 53

The point of the material construction is to use the same Hamiltonian for source response and physical access. The finite resource states below describe coherent fuel, excitation and remnant amplitudes. Their algebra can also appear in a finite Bell or pilot model, but here a declaration occurs only through the actual position of a massive pointer. A resource amplitude is therefore not a sampled reaction history. Every null, loss, copy and reset receiver remains available to later coherent contacts.

The endpoint reasoning of Theorem 25.5 is retained, while truth about an earlier actual declaration requires a further fact: pointwise zero archive current during its promised hold. This chapter proves that fact for stored Gaussian records, and preserves it through the explicit transported-trap reset. Its finite tails enter the error budget; they are not replaced by exact compact support.

29.1 A finite coherent source–actuator–resource module

Here is a nontrivial receptor that is physically in the same inventory. On a finite factor DD use orthogonal states

r,pa,ca,la(a=0,1). \ket r,\quad\ket{p_a},\quad\ket{c_a},\quad\ket{l_a}\quad(a=0,1).

They include the following actual material degrees in their internal wave description:

StateProductionFuelSiteExcitationMemoryRemnant
rr11ready0blankvacuum
pap_a01readymode aablankvacuum
cac_a00spent0aacapture aa
lal_a01ready0blankloss aa

Assign energy E>0E>0 to a production cofactor, fuel unit, excitation and loss remnant, and 2E2E to a capture remnant; the displayed labels are degenerate. Every row has total resource energy 2E2E. Hence the conversion gates conserve this resource energy exactly while spending readiness and retaining energy in products. Their full tensor-factor implementation is defined to be zero outside the indicated equal-energy active subspace. Other exhausted sectors stay present.

For source projectors PaP_a, set

Gw=iaPa(parrpa),ba=ηca+1ηla,0<η<1,Gr=ia(bapapaba).\begin{align} G_w&=i\sum_aP_a\otimes(\ket{p_a}\bra r-\ket r\bra{p_a}),\tag{29.1}\\ \ket{b_a}&=\sqrt\eta\ket{c_a}+\sqrt{1-\eta}\ket{l_a},\qquad 0<\eta<1,\notag\\ G_r&=i\sum_a(\ket{b_a}\bra{p_a}-\ket{p_a}\bra{b_a}). \notag\end{align}

These Hermitian generators have norm one on their active subspaces. Nonoverlapping pulses gw(t)Gw\hbar g_w(t)G_w and gr(t)Gr\hbar g_r(t)G_r with areas θ,φ\theta,\varphi give exactly

ΨD=cosθψr+sinθaPaψ(cosφpa+sinφηca+sinφ1ηla). \begin{aligned} \Psi_D={}&\cos\theta\,\psi\ket r+\sin\theta\sum_aP_a\psi \left(\cos\varphi\ket{p_a}+\sin\varphi\sqrt\eta\ket{c_a} +\sin\varphi\sqrt{1-\eta}\ket{l_a}\right). \end{aligned} (29.2)

Indeed each generator is a two-dimensional σy\sigma_y rotation, and the active aa sectors are orthogonal. There was no sampled reaction time in this calculation. Reduced excitation populations are not actual level trajectories in the adopted ontology. The actual event is a subsequent spatial registration governed by Sections 28.128.2.

The finite response has four exact orthogonal status weights (and ideal resolved-pointer probabilities):

(Pr,Pp,Pc,Pl)=(cos2θ, sin2θcos2φ, ηsin2θsin2φ, (1η)sin2θsin2φ). (P_r,P_p,P_c,P_l)= (\cos^2\theta,\ \sin^2\theta\cos^2\varphi,\ \eta\sin^2\theta\sin^2\varphi,\ (1-\eta)\sin^2\theta\sin^2\varphi). (29.3)

The pending excitation remains a vector in the actual model at a finite cutoff. Continuing GrG_r processes it coherently; a finite closed receptor can recur. A zero response window does not erase it. Neither an absorbing boundary nor a restart clock is imposed when a coefficient begins to populate pap_a.

29.1.1 Physical null, capture and loss

Use three spatial readout centres L,0,L-L,0,L for captured a=0a=0, null, and captured a=1a=1. The same forced oscillator construction applies to each orthogonal control projector, using signed trajectories. Noncaptured r,p,lr,p,l components share the null packet. Nearest-centre cells have worst tail at most 2δ2\delta, with δ=F(L/(2σ))\delta=\mcNtail(L/(2\sigma)). The ideal orthogonal-label comparator has capture coefficient

qPaψca,q=ηsin2θsin2φ, \sqrt q\,P_a\psi\ket{c_a},\qquad q=\eta\sin^2\theta\sin^2\varphi,

and complete null vector

ΨN=cosθψr+sinθaPaψ(cosφpa+sinφ1ηla). \Psi_N=\cos\theta\,\psi\ket r+ \sin\theta\sum_aP_a\psi\left(\cos\varphi\ket{p_a} +\sin\varphi\sqrt{1-\eta}\ket{l_a}\right). (29.4)

Only for a declared reduced comparison, tracing DD gives

N(ρ)=cos2θρ+sin2θ(cos2φ+(1η)sin2φ)aPaρPa. \mathcal N(\rho)=\cos^2\theta\,\rho+ \sin^2\theta\bigl(\cos^2\varphi+(1-\eta)\sin^2\varphi\bigr) \sum_aP_a\rho P_a. (29.5)

Equation (29.4), along with pointer and all receiving systems, is the retained continuation. Equation (29.5) is not a global collapse rule. Finite spatial classifiers approximate these ideal labels; Section 30.2 bounds the complete output error.

29.1.2 Finite stock and exhaustion

For a promised mm-epoch experiment allocate mm ready cells, their blank archives, and receivers. Gate the active conversion only on sectors containing the required cofactor, fuel, site and blank capacity. Extend the unitary by identity on explicitly exhausted sectors, which can be spatially flagged by the same writer. A failed or null attempt does not receive a new r\ket r for free. The consumed-ready-cell count is bounded by the allocated finite schedule; no infinite Poisson bath is hidden in this implementation.

29.2 Physical records that remain true about their past

After a write, retain its internal orthogonal key KK and hold the pointer in

Hstore=py22M+Mω22(yLK)2. H_{\rm store}=\frac{p_y^2}{2M}+\frac{M\omega^2}{2}(y-LK)^2. (29.6)

Known branch phases can be corrected by bounded internal potentials. A single stationary packet need not have compact support; its classification error was already accounted for.

Theorem 29.1 (Exact historical storage)

Suppose the wave after the write has form

Ψ(y,z,t)=kϕ0(yLk)kKΞk(z,t)eiωt/2, \Psi(y,z,t)=\sum_k\phi_0(y-Lk)\ket k_K\,\Xi_k(z,t)e^{-i\omega t/2}, (29.7)

where zz denotes all other coordinates and internal factors. Future gates preserve KK, hold yy as in (29.6), and may be noncommuting on the source or act on zz. Then jy=0j_y=0 pointwise on the complete configuration space. The actual coordinate YY and its finite readout label remain exactly fixed throughout that interval.

Proof

Orthogonality of the key eliminates cross terms. Each remaining contribution to ΨyΨ\Psi^\dagger\partial_y\Psi is ϕ0(yLk)ϕ0(yLk)Ξk(z,t)2\phi_0(y-Lk)\phi_0'(y-Lk)\norm{\Xi_k(z,t)}^2, which is real. Equation (28.3) gives the conclusion away from the almost-sure excluded nodes.

This is a path statement, not an inference from equal endpoint weights. It controls actual old declarations even when later source measurements do not commute with the first. Unknown interactions that violate its Hamiltonian conditions require their own bound.

29.2.1 A genuine copy and its classification error

Copy the key by a finite reversible unitary into a blank internal factor, amplify that factor into a fresh massive pointer, and retain both. Throughout this operation the old key is preserved, so Theorem 29.1 holds for the old actual position. If the two classifiers have worst errors ϵ1,ϵ2\epsilon_1,\epsilon_2, their disagreement probability is at most ϵ1+ϵ2\epsilon_1+\epsilon_2. To prove it, expand their joint squared-norm density over the orthogonal key and apply a union bound to the two conditional Gaussian tails. The key in this proof is an orthogonal expansion index, not an additional secretly actual spin variable. The copy is faithful to the first actual declaration because the old pointer stayed fixed during the write; its finite misclassification remains in the bound.

29.2.2 Reset with the receiving system retained

Supply an identical ready factor DD' and let WDDW_{DD'} be SWAP. With

Hsw=π2τsWDD,S(t)=eitHsw/,S(τs)=iWDD, H_{\rm sw}=\frac{\pi\hbar}{2\tau_s}W_{DD'},\quad S(t)=e^{-itH_{\rm sw}/\hbar},\quad S(\tau_s)=-iW_{DD'}, (29.8)

an old entangled state is transferred as

jψjdjDrDirDjψjdjD. \sum_j\psi_j\ket{d_j}_D\ket r_{D'}\longmapsto -i\ket r_D\sum_j\psi_j\ket{d_j}_{D'}.

The old pending excitation, remnant, lost product and reference correlation remain in DD'. Identical free resource Hamiltonians have [W,HD+HD]=0[W,H_D+H_{D'}]=0.

There is a subtle control issue: if a stationary trap followed the old DD label, a bare SWAP would change its centre. The exact physical repair is

H(t)=Hsw+S(t)HstoreS(t). H(t)=H_{\rm sw}+S(t)H_{\rm store}S(t)^\dagger. (29.9)

Its propagator is S(t)eitHstore/S(t)e^{-itH_{\rm store}/\hbar} by differentiation. Because SS is coordinate independent, it preserves the position density and current pointwise. The old spatial record remains held while the trap's controlling key is transferred to DD'. The potential is a unitary conjugate of a nonnegative matrix potential plus a bounded matrix, so it stays semibounded. Expanding its square gives a scalar quadratic term and affine matrix coefficients, within the common inventory. Simply declaring a rewired trap after SWAP would omit this interaction.

If the original pointer itself is to be restored, a reverse smooth forced trap can take its branch centre back to zero while a copied key/record or receiving cell is retained. The receiving systems carry the old correlations. Future use proceeds from this full state and its conditional law; it is not assigned an independent fresh initial rank merely because a local packet now looks ready. The finite measurement theorem below uses a finite stock of fresh pointers; reset is included as a real operation and as a return test.

29.2.3 Feedback from a literal spatial record

An internal key-controlled source gate is an exact coherent operation, but it follows a finite position display only up to the display's error. Literal position feedback also belongs to (28.2). Let g(y)g(y) be smooth, 0g10\le g\le1, equal to zero for yhry\le h-r and one for yh+ry\ge h+r, with 0<r<L/20<r<L/2. Let BB be a bounded Hermitian source generator and compare

Hpos=Hstore+g(y)B,Hkey=Hstore+KB. H_{\rm pos}=H_{\rm store}+g(y)B,\qquad H_{\rm key}=H_{\rm store}+KB.

The second gives the intended branch gate. Define

ϵg=maxk=0,1g(y)k2ϕ0(yLk)2dyF(L/2rσ). \epsilon_g=\max_{k=0,1}\int |g(y)-k|^2|\phi_0(y-Lk)|^2dy \le\mcNtail\left(\frac{L/2-r}{\sigma}\right). (29.10)

Duhamel, evaluated on the exactly stationary ideal packet, gives

Ψpos(t)Ψkey(t)tBϵg. \norm{\Psi_{\rm pos}(t)-\Psi_{\rm key}(t)} \le\frac{t\norm B}{\hbar}\sqrt{\epsilon_g}. (29.11)

This bound is uniform in an inaccessible reference. The physical position contact has reciprocal backaction; it is not claimed to leave the actual pointer fixed. The derivative and crossing estimate in Section 30.1 supplies a history bound as well. Thus literal spatial feedback, rather than an idealized outside observer, has a complete implementation.

Here g(y)g(y) is a multiplication operator on the wave, not a coefficient obtained by inserting the actual YtY_t into an externally controlled Hamiltonian.

29.3 Protected coherent transport in the same inventory

The code and gap argument of Chapter 23 apply to the finite internal bank in the present inventory. They concern coherent Hamiltonian transport, so their proof survives the change of actual ontology. We give the complete bounded-bank estimate here with explicit \hbar and with the spatial-spectator condition stated before its use. It supplies protection, not a statistical selection of guidance.

Actual archive storage and protection of unknown logical amplitudes are different tasks. The bounded internal gap construction can be implemented here without a stochastic interface. To display its nonempty domain, encode two qubits into four by

Ca,b=0,a,b,ab+1,1a,1b,1ab2. C\ket{a,b}=\frac{\ket{0,a,b,a\oplus b}+\ket{1,1\oplus a,1\oplus b,1\oplus a\oplus b}}{\sqrt2}.

Let SX=X1X2X3X4S_X=X_1X_2X_3X_4, SZ=Z1Z2Z3Z4S_Z=Z_1Z_2Z_3Z_4, P=(I+SX)(I+SZ)/4P=(I+S_X)(I+S_Z)/4 and

Hpen=Δ2(ISX)+Δ2(ISZ),HΔ=Hpen+H0+V. H_{\rm pen}=\tfrac\Delta2(I-S_X)+\tfrac\Delta2(I-S_Z),\quad H_\Delta=H_{\rm pen}+H_0+V.

Assume [H0,P]=0[H_0,P]=0, H0b\norm{H_0}\le b, and

V=i=14α=x,y,zσiαBiα,Biα=Biα,Vv. V=\sum_{i=1}^4\sum_{\alpha=x,y,z}\sigma_i^\alpha\otimes B_{i\alpha}, \quad B_{i\alpha}=B_{i\alpha}^\dagger,\quad\norm V\le v.

The BB's act on retained finite internal nuisance systems. During the protected exposure, the spatial holding Hamiltonian is a commuting spectator; it is factored out. We do not assert a bounded-norm theorem for arbitrary unbounded coordinate couplings. One-site Paulis anticommute with a stabilizer, so PVP=0PVP=0. All encoding and decoding gates are finite internal unitaries.

Proposition 29.2 (Retained-bank gap bound)

For Δ2bv=γ>0\Delta-2b-v=\gamma>0,

(eitHΔ/eitH0/)Pmin{2,2v+tv2/γ}. \norm{\bigl(e^{-itH_\Delta/\hbar}-e^{-itH_0/\hbar}\bigr)P} \le\min\left\{2,\frac{2v+tv^2/\hbar}{\gamma}\right\}. (29.12)

The same bound holds with every inaccessible reference and retained internal nuisance system included.

Proof

Block the Hamiltonian into Hd=diag(A,D)H_d=\operatorname{diag}(A,D) and off-diagonal WW, with lower spectral separation γ\gamma and B=QVPB=QVP. The integral X=0erDBerAdrX=\int_0^\infty e^{-rD}Be^{rA}dr solves DXXA=BDX-XA=B and has norm at most v/γv/\gamma. With S=(0XX0)S=\left(\begin{smallmatrix}0&-X^\dagger\\X&0\end{smallmatrix}\right), [S,Hd]=W[S,H_d]=-W and

eSHΔeS=Hd+01ueuS[S,W]euSdu. e^SH_\Delta e^{-S}=H_d+\int_0^1u e^{uS}[S,W]e^{-uS}du.

The remainder is bounded by v2/γv^2/\gamma. Two changes of frame cost 2v/γ2v/\gamma and Duhamel costs tv2/(γ)tv^2/(\hbar\gamma). On PP, Hd=PH0PH_d=PH_0P. This proves the claim.

This is the book's coherent protection estimate, with its assumptions preserved; Hamiltonian error suppression has independent primary precedent [ML]. Its role here is compatibility with actual material writes and records, not selection of a noise generator.