Chapter 29 Version 2
Massive material records, retained resources and protection
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 use orthogonal states
They include the following actual material degrees in their internal wave description:
| State | Production | Fuel | Site | Excitation | Memory | Remnant |
|---|---|---|---|---|---|---|
| 1 | 1 | ready | 0 | blank | vacuum | |
| 0 | 1 | ready | mode | blank | vacuum | |
| 0 | 0 | spent | 0 | capture | ||
| 0 | 1 | ready | 0 | blank | loss |
Assign energy to a production cofactor, fuel unit, excitation and loss remnant, and to a capture remnant; the displayed labels are degenerate. Every row has total resource energy . 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 , set
These Hermitian generators have norm one on their active subspaces. Nonoverlapping pulses and with areas give exactly
Indeed each generator is a two-dimensional rotation, and the active 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.1–28.2.
The finite response has four exact orthogonal status weights (and ideal resolved-pointer probabilities):
The pending excitation remains a vector in the actual model at a finite cutoff. Continuing 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 .
29.1.1 Physical null, capture and loss
Use three spatial readout centres for captured , null, and captured . The same forced oscillator construction applies to each orthogonal control projector, using signed trajectories. Noncaptured components share the null packet. Nearest-centre cells have worst tail at most , with . The ideal orthogonal-label comparator has capture coefficient
and complete null vector
Only for a declared reduced comparison, tracing gives
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 -epoch experiment allocate 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 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 and hold the pointer in
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.
Suppose the wave after the write has form
where denotes all other coordinates and internal factors. Future gates preserve , hold as in (29.6), and may be noncommuting on the source or act on . Then pointwise on the complete configuration space. The actual coordinate and its finite readout label remain exactly fixed throughout that interval.
Orthogonality of the key eliminates cross terms. Each remaining contribution to is , 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 , their disagreement probability is at most . 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 and let be SWAP. With
an old entangled state is transferred as
The old pending excitation, remnant, lost product and reference correlation remain in . Identical free resource Hamiltonians have .
There is a subtle control issue: if a stationary trap followed the old label, a bare SWAP would change its centre. The exact physical repair is
Its propagator is by differentiation. Because 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 . 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 be smooth, , equal to zero for and one for , with . Let be a bounded Hermitian source generator and compare
The second gives the intended branch gate. Define
Duhamel, evaluated on the exactly stationary ideal packet, gives
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 is a multiplication operator on the wave, not a coefficient obtained by inserting the actual 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 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
Let , , and
Assume , , and
The '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 . All encoding and decoding gates are finite internal unitaries.
For ,
The same bound holds with every inaccessible reference and retained internal nuisance system included.
Block the Hamiltonian into and off-diagonal , with lower spectral separation and . The integral solves and has norm at most . With , and
The remainder is bounded by . Two changes of frame cost and Duhamel costs . On , . 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.