Manuscript Em03-B@2 · Em03-B-v2.tex · c1a0977d
Em03-B A Certified Apparatus-Model Readout of One Hawking Packet Passive capture, coherent finite extraction, and complete destructive records
Constructs a specified apparatus-model realization of finite destructive number readout for one outgoing Hawking packet. The stationary centered quasifree prescription is an inherited input, not rederived here. Under that input, one selected oscillator has a normal geometric density. The mean alone does not determine that density, and the identification is not a density operator for the whole stationary field. A smooth finite-switching passive capture interaction has an explicit transfer kernel. Unselected positive-frequency radiation is not replaced by vacuum. Coherent extraction is generated by explicit number-selective swap pulses. When the stated global block structure is present, the control-domain error is exactly the probability above a second cutoff. A complete noisy readout instrument includes assignment errors, quantum readout errors, spectator coupling, imperfect preparation, and visible failure outcomes. Derived budgets replace unspecified transfer and implementation errors. Landmark I characterizes the finite readout after the carrier is already qubits. It does not supply the capture, the field state, or the Unruh occupation. Em03-A's packet mean is a predecessor hypothesis and does not construct this apparatus. En02-D's transmission probability is not q_h. En02-E's nonvacuum probability is not q_h, and En02-E's calibrated benchmark is not this destructive instrument. Em02-D's inverse-cubic coefficient is not this occupation. Em02-E's relational lapse is not this state. Bulk Unruh existence and the Hadamard property remain an external theorem. A packet occupation is not an emission rate. This is a model-level result, not a local Schwarzschild detector, not a laboratory realization, not a collapse theorem, not backreaction, not a Page curve, not an island, and not quantum-gravitational evaporation. Numerical execution and experimental calibration are not reported as executed. It does not close O.1, discharge the XVI-N insertion, or admit the XIV-XV characteristic coefficient. XVI-P is registered and is not a premise. H2, I3, and J2 remain unresolved. XV-B is not opened. No quantum coefficient is admitted. No compilation is asserted.
Front matter
abstractAbstractFront matter · lines 134–169
Open as its own pageWe construct and analyze a specified apparatus-model realization of finite destructive number readout for one outgoing Hawking packet. The stationary field prescription is an explicit predecessor input. Its centered quasifree restriction gives a normal geometric one-mode density, proved here without assuming a density operator for the entire stationary radiation field.
The apparatus consists of a passive temporal-mode capture port, a memory oscillator, a binary register, and a complete readout instrument. A smooth, finitely switched capture interaction has an explicit transfer kernel. A zero-integral temporal-window construction controls packet mismatch and prevents an infrared integrability shortcut. Unselected positive-frequency radiation is not replaced by vacuum: its occupation and correlations enter a reference-stable mode-comparison bound. Vacuum auxiliary ports and independent apparatus preparations are separately declared model data.
Coherent oscillator–register extraction is generated by explicit number-selective swap pulses. Its finite control-domain error is exactly the probability above a second cutoff when the stated global block structure is present. Bounded control perturbations and a distinct support-only certificate are treated separately. A complete noisy readout instrument includes assignment errors, quantum readout errors, spectator coupling, imperfect preparation, and visible failure outcomes.
The resulting transfer and implementation budgets are derived from model parameters and substituted into finite-count, mean-bias, and record–spectator–reference bounds. A constructive tolerance schedule and an apparatus resource ledger are supplied. These are model-level results. A local Schwarzschild-field coupling, a justified laboratory effective model, and experimental implementation remain separate obligations.
Scope, evidence, and the three levels of the claim
sectionScope, evidence, and the three levels of the claimScope, evidence, and the three levels of the claim · lines 175–261
Open as its own pageThe architecture is
Here is a memory oscillator, is a finite binary register, and contains raw words, decoded values, and declared failures.
Three levels are kept separate.
{}1.15
Level Evidence supplied Permitted conclusion Mathematical interface Channels, normal finite-mode states, adjoints, and record identities The B0–B3 interface Specified apparatus model Capture dynamics, preparations, extraction pulses, noise instruments, and derived budgets Model-level B4–B5 realization Physical realization Local coupling, effective-model justification, calibrated parameters, and implementation evidence Not established here The capture port is a one-dimensional Markov input–output model. It is not identified with a local detector coupled to the massless scalar on Schwarzschild. In particular, its two-sided temporal envelope includes auxiliary degrees of freedom that are not negative-energy modes of that scalar field.
Our model uses explicitly available number-selective control Hamiltonians. This is a declared control set, not a claim that a dispersive oscillator–qubit laboratory automatically implements those Hamiltonians. General oscillator-control constructions Krastanov do not supply a compiler or a leakage certificate for the pulses constructed below.
Local system–probe measurement theory requires a separate spacetime coupling and an induced-observable identification FewsterVerch. No theorem below supplies that missing correspondence.
boundary. The arguments are analytical. Compilation, formal verification, numerical pulse optimization, parameter calibration, and laboratory execution are not asserted. “Certified” means that the displayed implications have stated hypotheses and mathematical proofs.
and distances. We use , , and
A channel on trace-class operators is understood as the predual of a normal completely positive unital map when its input is infinite dimensional. All operational comparisons retain finite spectators and arbitrary finite-dimensional external references. The mathematical identities also hold for normal extensions to separable reference spaces.
status. Em03-A and Landmark I are used through the supplied text Em03A,LandmarkI. Their proofs and registry status are not independently verified here. Other internal manuscript names are not formal premises of the apparatus construction.
Audited field input and the packet marginal
sectionThe inherited dataAudited field input and the packet marginal › The inherited data · lines 266–278
Open as its own pageFix one angular harmonic of degree , a mass parameter , and
The normalized Killing time is the predecessor's time, and .
assumptionAssumption: Inherited radiation prescriptionAudited field input and the packet marginal › The inherited data · Em03-B@2#ass:field, Em03-B@2#eq:nomega · lines 279–317
Open as its own pageThe horizon and past-infinity input states are independent, centered, regular, and quasifree. Their positive-Killing-frequency covariances are
The infinity state is its positive-frequency vacuum, hence is centered with zero anomalous covariance. Cross-channel covariances vanish.
Stationary scattering is complex linear:
Write
The outgoing state is therefore centered, gauge-invariant, and quasifree, with number covariance .
sectionThe inherited dataAudited field input and the packet marginal › The inherited data · Em03-B@2#eq:nu · lines 317–369
Open as its own pageThe components of this assumption have distinct source roles.
{}1.15
Component Supplied Em03-A locator or status Product boundary prescription and quasifreeness State subsection and declared bulk-to-boundary input Horizon number and anomalous covariance :horizonoccupationInfinity vacuum and independence State subsection and :horizonoccupationComplex-linear stationary scattering :quantumscatterOutgoing compact-band number covariance :packet,:numberdensityPacket occupation integral :packetlawBulk existence and Hadamard identification Declared Dappiaggi–Moretti–Pinamonti input DMP Weighted radiation-test completion used below Explicit mathematical completion in Section subsec:completion; not a new bulk theorem Hadamard regularity alone does not select these covariances.
Define
where annihilation operators are conjugate-linear in their test: . Set
Then
theoremTheorem: Normal geometric packet marginalAudited field input and the packet marginal › B0: complete one-mode identification · Em03-B@2#thm:marginal, Em03-B@2#eq:rhoh · proof attached · lines 372–426
Open as its own pageUnder Assumption ass:field, the selected packet state is represented normally on by
For , it is the vacuum. Its count law has mean , variance , and generating function
when .
Proof. Complex-linear scattering and restriction preserve centered quasifreeness. The packet has and . Thus its displacement characteristic function is
For , construct the trace-class coherent-state mixture
The measure has total mass one. Its characteristic function is the displayed Gaussian, since
Angular and radial integration give
This is (eq:rhoh). Equality of characteristic functions identifies the states on the Weyl algebra, because its dense linear span consists of Weyl operators. The vacuum case follows directly. Summing the geometric series proves the moment and generating-function statements.
sectionB0: complete one-mode identificationAudited field input and the packet marginal › B0: complete one-mode identification · lines 426–431
Open as its own pageThis is a finite-mode identification, consistent with the Gaussian framework Weedbrook. It neither constructs nor requires a trace-class density operator for the entire stationary continuum.
exampleExample: The mean-only stopAudited field input and the packet marginal › B0: complete one-mode identification · lines 432–439
Open as its own pageThe density is centered and gauge-invariant, has , and has mean one. It is not the geometric state with mean one. Quasifreeness is essential to Theorem thm:marginal.
sectionA weighted test completion, not a global Fock densityAudited field input and the packet marginal › A weighted test completion, not a global Fock density · lines 442–467
Open as its own pageFor positive-frequency tests, use the norm
The compact positive-frequency covariance extends by continuity to its completion. The resulting Gaussian characteristic functional remains positive: each finite matrix and each Weyl positivity condition is a limit of the corresponding compact-test condition.
For any finite-dimensional canonical subspace with finite occupation matrix , the restricted state is normal. Indeed, diagonalize by a passive finite-mode unitary. The characteristic function becomes a product of one-mode characteristic functions; Theorem thm:marginal constructs their normal product density. Transforming it back constructs the normal finite-mode restriction.
This completion provides the radiation-mode calculations used below. It does not assert a new characteristic restriction theorem for local bulk fields.
The B1–B3 mathematical interface
sectionThe saturating carrierThe B1–B3 mathematical interface › The saturating carrier · Em03-B@2#eq:carrier · lines 472–490
Open as its own pageFix integers and, later, . The reported saturation level and the control-domain cutoff are different parameters.
Let
Let identify the number bases on and . Define
propositionProposition: Channel and observable identificationThe B1–B3 mathematical interface › The saturating carrier · Em03-B@2#prop:carrier · proof attached · lines 491–519
Open as its own pageThe map is CPTP. Its adjoint is
For ,
The readout effects pulled back to the oscillator are
Proof. The Kraus maps are and , . Their effects sum strongly to . The positive output series converges in trace norm on positive trace-class inputs. This proves the normal CPTP extension. The adjoint and its specializations follow by substitution.
sectionThe saturating carrierThe B1–B3 mathematical interface › The saturating carrier · lines 519–523
Open as its own pageLow-block coherences are preserved before readout. Saturation is not postselection.
sectionBinary register and a total decoderThe B1–B3 mathematical interface › Binary register and a total decoder · Em03-B@2#eq:idealread, Em03-B@2#eq:decoder · lines 524–573
Open as its own pageSet
Identify carrier basis with binary integer in ; write the isometry as , and set
For every , including unused words, define
Let contain all distinct and any declared failure symbols. The full record space is . Ideal readout has zero weight on failures.
For a spectator , define
The selective map is , whereas its effect is . Define
Assign every failure symbol a fixed decoded value in ; below all failure values are zero. Write this total decoder as , with . Its channel on arbitrary record operators is
This is CPTP on the full record space, not merely a prescription on its populated diagonal.
sectionComplete referenced record identityThe B1–B3 mathematical interface › Complete referenced record identity · Em03-B@2#eq:fullomega, Em03-B@2#eq:omega · lines 574–592
Open as its own pageFor a normal state , where collects unmeasured systems, put
Define
theoremTheorem: Complete destructive recordThe B1–B3 mathematical interface › Complete referenced record identity · Em03-B@2#thm:record · proof attached · lines 593–612
Open as its own pageFor every normal packet–spectator–reference state,
Applying gives . All positive diagonal block sums converge in trace norm.
Proof. The low-block Kraus map contributes the diagonal blocks at . Every Kraus index contributes its reference block to the same carrier state . Readout adds those positive blocks to the block. Their traces sum to at most one, proving convergence. The total decoder gives the second identity.
sectionComplete referenced record identityThe B1–B3 mathematical interface › Complete referenced record identity · lines 612–618
Open as its own pageSpectators undergo the identity operation in this ideal channel. Their conditional state can change when they are correlated with the carrier. No nondestructive residual field instrument is identified by this destructive record.
sectionExact tails and mean biasThe B1–B3 mathematical interface › Exact tails and mean bias · Em03-B@2#eq:generalbias · lines 619–635
Open as its own pageFor an arbitrary normal oscillator state of finite mean ,
Let
The finite decoded record is embedded into this countable record space by assigning zero weight above .
propositionProposition: Exact referenced record tailThe B1–B3 mathematical interface › Exact tails and mean bias · Em03-B@2#prop:recordtail, Em03-B@2#eq:idealtails · proof attached · lines 636–670
Open as its own pageFor every normal input,
Consequently, for the geometric marginal,
Proof. At record , the difference is the positive block ; at each larger record it is . Orthogonal record blocks have additive trace norm. The half trace norm is therefore the discarded probability. Equation (eq:generalbias) follows from . Geometric summation gives and
sectionExact tails and mean biasThe B1–B3 mathematical interface › Exact tails and mean bias · lines 670–682
Open as its own pageFor ,
Indeed, , with , has bias . A mean-only constraint gives a probability bound , not a uniformly vanishing mean bias.
The apparatus input: radiation plus participating modes
sectionAn effective temporal portThe apparatus input: radiation plus participating modes › An effective temporal port · lines 687–727
Open as its own pageLet
Its positive-frequency part carries the outgoing radiation covariance (eq:nomega). Its negative-frequency part is a new, independent auxiliary vacuum in the apparatus model. Define
The Fourier convention is
with extended by zero outside its band.
Annihilators on this port satisfy
as smeared identities. The two-sided envelope makes the Markov port canonical. It is not a claim that the physical scalar field contains independent negative-Killing-frequency annihilators.
All positive-frequency components outside the target packet retain their actual prescribed radiation covariance. In particular, no vacuum substitution is made for unselected Hawking radiation.
sectionFinite participating reductionsThe apparatus input: radiation plus participating modes › Finite participating reductions · Em03-B@2#eq:idealcapture · lines 728–767
Open as its own pageFor a chosen capture envelope , the memory output depends only on . Together with the target , it therefore requires at most two canonical input modes. Define their plane by
The normal state on its Fock space is justified by Section subsec:completion whenever its occupation matrix is finite.
The declared operational input is a normal state
Here will be the orthogonal participating mode. The ideal capture target identifies with and traces out :
It does not assume factorizes.
The Hawking input class used for the model theorem consists of all such normal extensions with the specified two-mode Gaussian marginal. External finite references are unrestricted. A general occupation-constrained class is treated separately below.
No normal density representation of the entire continuum is assumed. The capture model defines its reduced channel through its output Weyl operators on these finite participating modes. A physical continuum interaction with further participating degrees of freedom would require a larger input interface.
Finite switching and nonvacuum mode mismatch
sectionFinite switching and nonvacuum mode mismatchFinite switching and nonvacuum mode mismatch · Em03-B@2#eq:windowconstruction, Em03-B@2#eq:modeplane · lines 769–804
Open as its own pageA compactly switched temporal capture cannot exactly select the nonzero band-limited packet . We construct an explicit approximation, including a low-frequency integrability repair.
Choose real , with and on . Choose with . For , set
For sufficiently large , . Normalize and choose its constant phase so that
Write
When , omit and all mismatch terms.
lemmaLemma: Window, zero moment, and finite occupationsFinite switching and nonvacuum mode mismatch · Em03-B@2#lem:window · proof attached · lines 805–874
Open as its own pageFor sufficiently large :
, , and .
in the Schwartz topology and in that topology. In particular, .
The occupations
are finite for every nondegenerate participating plane.
With
one has , , and
Proof. The support and zero integral follow from (eq:windowconstruction). The inverse Fourier transform is Schwartz. Also , because vanishes near zero. Hence
which decays faster than every inverse power of . Differentiating the window shows that in every Schwartz seminorm. The scaled bump has the same property. Normalization and the phase alignment therefore preserve Schwartz convergence.
For positive frequencies,
The zero integral gives . Thus at zero; the same holds for and, for fixed , . Their weighted integrals are finite near zero. At high frequencies, the occupation is bounded and the tests are square integrable.
More quantitatively, for any differentiable with ,
On , is bounded. Schwartz convergence proves and . Finally,
remarkRemark: Why ordinary windowing was insufficientFinite switching and nonvacuum mode mismatch · lines 876–883
Open as its own pageWithout the subtraction in (eq:windowconstruction), a compact temporal window generally has nonzero Fourier value at zero. The predecessor bound alone would then not prove integrability against . We do not import an unproved low-frequency greybody asymptotic to bypass this issue.
sectionReference-stable mode comparison with a nonvacuum backgroundFinite switching and nonvacuum mode mismatch › Reference-stable mode comparison with a nonvacuum background · lines 885–897
Open as its own pageFor simplicity write , . Let
Up to the choice of rotation sign, identifies mode with . The generator is self-adjoint as the direct sum of finite total-number sectors.
lemmaLemma: Gaussian mode-mismatch certificateFinite switching and nonvacuum mode mismatch › Reference-stable mode comparison with a nonvacuum background · Em03-B@2#lem:modeerror, Em03-B@2#eq:modeerror · proof attached · lines 898–941
Open as its own pageSuppose the marginal is centered, gauge-invariant, and quasifree, with occupations . For every normal spectator–reference extension,
For the radiation marginal, , and . No independence between the two modes is required.
Proof. Purify the joint input, retaining its external systems. The unitary comparison and partial-trace contractivity give
The last inequality follows from the scalar spectral inequality .
Put . Wick's rule gives
Cauchy–Schwarz gives , hence . All these moments depend only on the two-mode marginal, so the bound is unchanged by its reference extension.
For the radiation input,
by Lemma lem:window. This proves convergence.
sectionReference-stable mode comparison with a nonvacuum backgroundFinite switching and nonvacuum mode mismatch › Reference-stable mode comparison with a nonvacuum background · lines 941–948
Open as its own pageThe background contribution in (eq:modeerror) is computed from and the actual orthogonal mode . It includes its possible correlation with , through a uniform Wick bound. There is no separate “background vacuum” assumption or overlapping additive background-error label.
propositionProposition: A non-Gaussian occupation-constrained alternativeFinite switching and nonvacuum mode mismatch › Reference-stable mode comparison with a nonvacuum background · Em03-B@2#prop:generalmodemismatch · proof attached · lines 949–969
Open as its own pageIf only is known, then for every integer the same mode comparison obeys
Proof. Project onto total occupation at most . Its discarded probability is at most . The distance to the normalized projected state is at most the square root of that probability, as follows by purification. On this invariant sector, , so the unitary comparison is at most . Two projection comparisons and contractivity give the result.
sectionReference-stable mode comparison with a nonvacuum backgroundFinite switching and nonvacuum mode mismatch › Reference-stable mode comparison with a nonvacuum background · lines 969–976
Open as its own pageThe constraint is packet-plane occupation, not a separately identified packet Hamiltonian. Occupation-constrained comparisons are a specialization of infinite-dimensional constrained-channel methods Shirokov.
B4 capture: an explicit passive input–output interaction
sectionDynamics, switching, and the unitary modelB4 capture: an explicit passive input–output interaction › Dynamics, switching, and the unitary model · Em03-B@2#eq:captcontrol · lines 981–993
Open as its own pageFix a normalized , supported in , and a capture transmissivity . Set
Outside , the coupling is zero.
assumptionModel specification: Passive capture portB4 capture: an explicit passive input–output interaction › Dynamics, switching, and the unitary model · Em03-B@2#spec:capture, Em03-B@2#eq:passiveODE · lines 994–1018
Open as its own pageThe effective interaction is defined first on one-particle amplitudes of the memory and incoming amplitudes :
Its quantum evolution is the bosonic second quantization of this one-particle input–output map.
The memory is initially independent of the radiation, spectators, and references. Its specified preparation is the geometric state of mean . A subsequent storage interval of duration has vacuum attenuation rate , implemented by an independent auxiliary loss port. Define
All phases are defined in a fixed interaction picture. Its clock is the predecessor's asymptotic retarded-time coordinate, up to a fixed translation.
sectionDynamics, switching, and the unitary modelB4 capture: an explicit passive input–output interaction › Dynamics, switching, and the unitary model · lines 1018–1024
Open as its own pageThis is a declared passive model in the input–output tradition GardinerCollett,YamamotoJames. We give its transfer calculation directly, rather than assuming an exact pulse-capture claim from those references.
theoremTheorem: Unitary passive evolution and transfer kernelB4 capture: an explicit passive input–output interaction › Dynamics, switching, and the unitary model · Em03-B@2#thm:capturekernel, Em03-B@2#eq:captureann, Em03-B@2#eq:capturecost · proof attached · lines 1025–1077
Open as its own pageEquation (eq:passiveODE) defines a unitary map
from initial memory and incoming port to final memory and outgoing port. Its memory annihilator is
The switching is smooth and finite, and
Proof. The energy identity
follows by substitution. Integration proves that the map is isometric. Given final memory and outgoing amplitude, solve backwards the equation obtained by substituting ; bounded coefficients give a unique initial memory and incoming amplitude. Thus the isometry is onto.
The memory solution is
Since , , and ,
The transfer kernel is therefore . Second quantization gives (eq:captureann). The integral and peak bound follow from the same identities. Because is smooth and supported away from the endpoints and , the switched coefficient is smooth.
sectionDynamics, switching, and the unitary modelB4 capture: an explicit passive input–output interaction › Dynamics, switching, and the unitary model · lines 1077–1090
Open as its own pageThe formal white-noise interaction has not been treated as a bounded Hamiltonian. Its well-defined unitary model is the one-particle map just proved and its second quantization. Accordingly, no finite-dimensional Hamiltonian norm estimate is applied to this unbounded bosonic capture evolution.
The storage attenuation is an ordinary vacuum beam-splitter channel with transmissivity ; it can be defined by the same passive dilation. With the initial memory replaced by vacuum, capture and storage together are vacuum pure loss of transmissivity on the selected port mode.
lemmaLemma: Referenced pure-loss boundB4 capture: an explicit passive input–output interaction › A direct pure-loss benchmark · Em03-B@2#lem:loss, Em03-B@2#eq:lossbound · proof attached · lines 1093–1118
Open as its own pageLet be the vacuum pure-loss channel of transmissivity . If , then, including any normal reference,
Proof. Purify , append a vacuum loss oscillator, and apply the beam splitter. The overlap with the initial purified state is
This is nonnegative. The inequality , , gives . The pure-state trace distance is . Partial trace proves (eq:lossbound).
sectionA direct pure-loss benchmarkB4 capture: an explicit passive input–output interaction › A direct pure-loss benchmark · lines 1118–1123
Open as its own pageThis lemma is used only after the independent vacuum-environment reduction has been established by Specification spec:capture. It is not applied directly to unselected radiation.
sectionDerived capture budgetB4 capture: an explicit passive input–output interaction › Derived capture budget · lines 1124–1132
Open as its own pageThe initial memory's distance from vacuum is exactly
This preparation error is priced once, before the common capture evolution.
theoremTheorem: Capture certificate on the stated joint inputB4 capture: an explicit passive input–output interaction › Derived capture budget · Em03-B@2#thm:captureerror, Em03-B@2#eq:capbudget · proof attached · lines 1133–1162
Open as its own pageFor the radiation two-mode marginal and every admitted spectator–reference extension,
Here is the capture-plus-storage channel obtained from Specification spec:capture.
Proof. Replacing the independently prepared memory by vacuum costs , including references, by tensor-product equality and contractivity. For that preparation, capture and storage reduce to on the -mode, so Lemma lem:loss costs . The comparison between the -mode and the target -mode costs , by Lemma lem:modeerror. The ideal target traces out the other participating mode; no independence between that mode and is used. Apply the triangle inequality.
sectionDerived capture budgetB4 capture: an explicit passive input–output interaction › Derived capture budget · Em03-B@2#eq:memorymean · lines 1162–1181
Open as its own pageThe three terms have different comparisons: preparation, mode selection including the nonvacuum background, and vacuum loss. There is no additional overlapping “window” or “background” term.
For this Gaussian input, the actual memory marginal is geometric with mean
This follows directly from (eq:captureann), independence of the memory preparation, and gauge-invariant quasifreeness. It is an apparatus-model prediction, not a replacement for the target value .
B4 extraction: explicit swaps and control certificates
sectionThe exact finite-domain interactionB4 extraction: explicit swaps and control certificates › The exact finite-domain interaction · lines 1186–1200
Open as its own pageUse the binary register itself, initially in . For , define the disjoint pairs
These pairs are mutually disjoint. Let swap each and act as the identity on the remaining basis states.
theoremTheorem: Exact coherent extraction and sharp tailB4 extraction: explicit swaps and control certificates › The exact finite-domain interaction · Em03-B@2#thm:extraction, Em03-B@2#eq:extractionchannel, Em03-B@2#eq:sharpK · proof attached · lines 1201–1241
Open as its own pageTracing out after , with initial register , induces
For every normal memory–reference state,
For the ideal target packet this error is .
Proof. For , the output memory is the same vacuum. Consequently all low-block coherences survive in . For , memory state labels the environment and the register is . For , the untouched input has memory state and register zero. Distinct such memory states are orthogonal, proving (eq:extractionchannel).
The channel difference on a referenced input is exactly
Because , the two register states are orthogonal. Its half trace norm is .
sectionThe exact finite-domain interactionB4 extraction: explicit swaps and control certificates › The exact finite-domain interaction · lines 1241–1248
Open as its own pageThis is coherent extraction, not copying all number labels while leaving a distinguishable low-number environment. Finite output does not imply a finite environment on the whole oscillator: an isometry from an infinite-dimensional input cannot have finite-dimensional output and environment simultaneously.
sectionA declared control set and an exact pulse sequenceB4 extraction: explicit swaps and control certificates › A declared control set and an exact pulse sequence · Em03-B@2#eq:swapPulse · lines 1249–1272
Open as its own pageDefine the orthogonal rank-one projections
The available extraction controls in our effective model are
These are the specified number-selective matrix elements; their availability is part of the model.
For a common duration , choose
The pulses are zero outside this interval. They have area , maximum , and derivative bounded by .
propositionProposition: Exact pulse compilation in the declared control setB4 extraction: explicit swaps and control certificates › A declared control set and an exact pulse sequence · Em03-B@2#prop:compile · proof attached · lines 1273–1298
Open as its own pageThe simultaneous pulses (eq:swapPulse) generate exactly, with no relative swap phases. If the envelope limits are and , it suffices to take
For input supported at occupation at most , the ideal sequence never exceeds occupation .
Proof. The projections commute and are mutually orthogonal. On each pair,
is the swap matrix, including its phase. Outside the pairs the evolution is the identity. The bounds follow by differentiating (eq:swapPulse). Its invariant subspace contains only memory occupations .
sectionA declared control set and an exact pulse sequenceB4 extraction: explicit swaps and control certificates › A declared control set and an exact pulse sequence · lines 1298–1317
Open as its own pageThe constant-pulse version is the Hamiltonian
on each pair, as a special case.
-energy convention. A memory Hamiltonian , , may be specified, with degenerate computational register levels. The displayed controls are in its interaction picture. Their laboratory-frame version contains the corresponding number-dependent phase modulation. The required frequency range grows with ; it is not hidden in the envelope derivative bound. No field packet Hamiltonian is identified with , and extraction is not asserted to conserve the memory's free energy without work exchange.
sectionGlobal bounded perturbations and finite leakage domainsB4 extraction: explicit swaps and control certificates › Global bounded perturbations and finite leakage domains · Em03-B@2#eq:globalcontrol · lines 1318–1342
Open as its own pageSuppose the implemented interaction-picture generator is
Here is explicitly bounded and self-adjoint. One permitted leakage model takes it supported on
with finite-dimensional matrix elements. This allows temporary occupation up to , rather than silently identifying the initial cutoff with the maximum populated level.
Put
lemmaLemma: Bounded propagator comparisonB4 extraction: explicit swaps and control certificates › Global bounded perturbations and finite leakage domains · Em03-B@2#lem:Duhamel · proof attached · lines 1343–1364
Open as its own pageFor bounded self-adjoint generators ,
The induced channels, including references and partial traces, have half-diamond distance at most the same bound, capped at one.
Proof. Variation of constants gives
The unitary factors have norm one. For a purified input, output trace distance is at most the norm of the difference of output vectors; then take the supremum and use contractivity.
sectionGlobal bounded perturbations and finite leakage domainsB4 extraction: explicit swaps and control certificates › Global bounded perturbations and finite leakage domains · lines 1364–1370
Open as its own pageBecause the are orthogonal, . Thus (eq:globalcontrol) is a derived global certificate. It is not an estimate for an unbounded full-oscillator drive.
propositionProposition: Two distinct extraction-error regimesB4 extraction: explicit swaps and control certificates › Global bounded perturbations and finite leakage domains · Em03-B@2#prop:controlregimes · proof attached · lines 1371–1406
Open as its own pageFor an ideal target input with geometric marginal:
Under the global bounded model above, implemented extraction with a correctly prepared register differs from by at most
If instead an implementation is certified only on inputs supported in , with referenced error , and its behavior outside that domain is arbitrary, then a valid bound is
The sharp probability tail is not available merely from a support-only control certificate.
Proof. For (i), compare the implemented channel with using Lemma lem:Duhamel, then use Theorem thm:extraction.
For (ii), project and normalize the referenced input on . Its distance from the original is at most the square root of the discarded probability, by purification. The implementation and each contract this distance. On the projected input, , and the support certificate costs . Add the two projection costs.
sectionRegister preparation and the derived transfer budgetB4 extraction: explicit swaps and control certificates › Register preparation and the derived transfer budget · lines 1408–1424
Open as its own pageThe extraction register preparation is independent and specified as
Its distance from is exactly .
The actual model transfer is capture, storage, register preparation, implemented extraction, and memory discard. Denote it by . Its ideal target is
theoremTheorem: Derived B4 transfer budgetB4 extraction: explicit swaps and control certificates › Register preparation and the derived transfer budget · Em03-B@2#thm:transfer, Em03-B@2#eq:transferbudget · proof attached · lines 1425–1452
Open as its own pageIn the global bounded-control model,
bounds the transfer trace distance, including all admitted spectators and references. For a support-only implementation, replace the last two terms by .
Proof. First apply the same implemented extraction to the actual captured state and the ideal packet-in-memory state. Contractivity and Theorem thm:captureerror cost . Replacing the independent register preparation costs . Now the input memory is the ideal packet, so Proposition prop:controlregimes supplies the appropriate control and tail terms. This ordering avoids making an unjustified geometric-tail claim about an imperfectly captured state.
B5: a complete readout apparatus and its errors
sectionPointer interaction and complete instrumentB5: a complete readout apparatus and its errors › Pointer interaction and complete instrument · Em03-B@2#eq:assignmentinstrument · lines 1459–1497
Open as its own pageLet consist of pointer qubits. With ideal preparation , the readout interaction is
One explicit bounded generator for duration is
with identity placement on the other factors. Its summands commute, and its time- evolution is .
The pointer is read in its computational basis, both and are consumed, and is returned. With no noise this induces exactly (eq:idealread), including correlated references.
For a stochastic assignment matrix , , define
This is a complete instrument, not a fitted probability rule for one input.
An explicit assignment dilation maps pointer word to
The orthonormal environment labels make this an isometry and produce (eq:assignmentinstrument) after the discarded systems are traced out. Failure records remain in .
theoremTheorem: Exact assignment-noise distanceB5: a complete readout apparatus and its errors › Pointer interaction and complete instrument · Em03-B@2#thm:assignment, Em03-B@2#eq:assignmenterror · proof attached · lines 1498–1526
Open as its own pageWith the ideal output alphabet enlarged by zero-weight failure records,
Proof. For an arbitrary operator on the input and a reference, first pinch into the -basis blocks . Pinching is trace-norm contractive and . The difference of the two output maps has norm at most
This gives the complete upper bound. A basis input attaining the maximum has classical output distance , proving equality.
sectionPointer interaction and complete instrumentB5: a complete readout apparatus and its errors › Pointer interaction and complete instrument · lines 1526–1536
Open as its own pageIndependent reported-bit flips with probabilities give the special case
provided raw strings are retained. Coarsening to decoded counts can merge erroneous strings and need not preserve this equality.
sectionSpecified quantum errors before assignmentB5: a complete readout apparatus and its errors › Specified quantum errors before assignment · lines 1537–1541
Open as its own pageThe following is one complete model, not an assertion that all real detector imperfections have this form.
assumptionModel specification: Readout noise and preparationB5: a complete readout apparatus and its errors › Specified quantum errors before assignment · Em03-B@2#spec:readnoise · lines 1542–1592
Open as its own pageAll apparatus baths and preparation records are fresh and independent of .
With probability , a preparation protocol reports the visible symbol , consumes , and returns on . Its decoded value is zero.
Conditional on readiness, pointer preparation is
Its distance from the all-zero pointer is
Before pointer copying, register qubit undergoes amplitude damping with
Its Kraus maps are
A known residual basis rotation is
A separate spectator-coupling interval has a bounded self-adjoint generator on . Its ideal comparison is the identity.
The pointer-copy generator is , where is bounded on the finite space. It includes the errors assigned to this interval, but not the separate interval already priced by .
Computational pointer readout is followed by the fixed matrix , including any timeout or other declared assignment failures. The raw record or failure label and its decoded value are always retained.
sectionSpecified quantum errors before assignmentB5: a complete readout apparatus and its errors › Specified quantum errors before assignment · Em03-B@2#eq:noisyselective · lines 1592–1622
Open as its own pageAmplitude damping is explicitly a bath model; each displayed Kraus pair has a unitary system–bath dilation. The pointer assignment isometry was given above. Thus these are complete channels and instruments, rather than unsigned additive “measurement errors.”
For clarity, write for the composition of damping, basis rotation, and spectator evolution. On a ready branch, the selective record map is
where , with tensor factors placed in the stated order. Summing gives the ready record channel. The full channel is its mixture with the reset-failure branch.
No failure is deleted and no surviving branch is renormalized.
sectionDerived quantum and preparation boundsB5: a complete readout apparatus and its errors › Derived quantum and preparation bounds · Em03-B@2#eq:readcomponents · lines 1623–1639
Open as its own pageDefine
and
lemmaLemma: Complete error certificates for the readout componentsB5: a complete readout apparatus and its errors › Derived quantum and preparation bounds · Em03-B@2#lem:readcomponents · proof attached · lines 1640–1663
Open as its own pageThe quantities in (eq:readcomponents) bound the respective half-diamond distances from ideal damping-free, basis-correct, spectator-identity, and exact-pointer-copy operations.
Proof. For one damping channel, the no-jump operator is a contraction with . On any input operator, including a reference,
The jump map has complete induced trace norm , since . Divide the sum by two. Tensor-product telescoping proves the bound.
For , by integrating its bounded generator. Lemma lem:Duhamel gives the two remaining bounds.
lemmaLemma: Complete-channel telescopingB5: a complete readout apparatus and its errors › Derived quantum and preparation bounds · Em03-B@2#lem:telescoping · proof attached · lines 1665–1681
Open as its own pageIf and are compatible compositions of channels and , then their half-diamond distance is at most . Every step interface must include retained quantum systems and classical histories.
Proof. Insert and subtract compositions differing at one factor. Pre- and postcomposition by channels contract the complete trace norm. Apply the triangle inequality.
theoremTheorem: Derived B5 implementation budgetB5: a complete readout apparatus and its errors › Derived quantum and preparation bounds · Em03-B@2#thm:readbudget, Em03-B@2#eq:readbudget · proof attached · lines 1683–1713
Open as its own pageThe complete readout channel of Specification spec:readnoise obeys
Proof. On a ready branch, replace the independent pointer preparation by the all-zero state at cost . Telescope the quantum operations using Lemma lem:readcomponents. Then apply Theorem thm:assignment. This gives the ready-branch bound.
The failure branch has the same output alphabet and differs from the ideal channel by half-diamond distance at most one. Convexity therefore costs , while the ready budget has weight .
sectionDerived quantum and preparation boundsB5: a complete readout apparatus and its errors › Derived quantum and preparation bounds · lines 1713–1722
Open as its own pageThe displayed budget separates actual comparisons. For example, a spectator error during copying belongs in ; the same interaction must not also be charged to . A correlated assignment matrix is allowed, but hidden apparatus memory correlated with the message is not covered by this fresh preparation model.
Finite Enter interpretation
assumptionAssumption: Supplied Landmark I characterizationFinite Enter interpretation · Em03-B@2#ass:I · lines 1727–1739
Open as its own pageThe supplied theorem
:mainof Landmark I is admitted with its:strategy-classand:requirements. The global strategy, on every finite qubit configuration, satisfies the stated structural class and .These are global composability, no-signaling, nullity, continuity, and record requirements, with the source's continuation restriction. They are not established by testing one packet or the program in this paper.
sectionFinite Enter interpretationFinite Enter interpretation · lines 1739–1745
Open as its own pageIts conclusion identifies destructive finite-register readout with the Born selective maps and the normalized residual on positive-probability pure branches. No residual ray is specified on a zero-probability branch.
propositionProposition: Semantic scopeFinite Enter interpretation · proof attached · lines 1746–1763
Open as its own pageUnder Assumption ass:I, the ideal finite program reads the carrier qubits destructively, retains their raw tuple, applies the total decoder, and returns untested spectators with the channel (eq:idealread). The specified finite pointer instrument has the corresponding ordinary Born interpretation.
Proof. For pure finite-register inputs the characterization gives the displayed measurement maps. Sequential reads compose to . A finite mixed carrier–spectator state has a finite purification; embed its purifying space into qubits, apply the pure-state statement, and trace out the ancillary factors. The result is , independent of the chosen purification. Pointer allocation, finite interactions, readout, and classical assignment compose the same way.
sectionFinite Enter interpretationFinite Enter interpretation · lines 1763–1769
Open as its own pageThis semantic statement begins after the finite registers exist. It is not a derivation of the radiation state, the Markov capture port, or the oscillator's control Hamiltonians.
End-to-end theorem and constructive tolerances
sectionThe general interface theoremEnd-to-end theorem and constructive tolerances › The general interface theorem · lines 1774–1778
Open as its own pageThe following statement remains useful for any independently certified transfer and implementation.
theoremTheorem: General finite-record interfaceEnd-to-end theorem and constructive tolerances › The general interface theorem · Em03-B@2#thm:interface, Em03-B@2#eq:outerbounds · proof attached · lines 1779–1832
Open as its own pageSuppose a transfer on a named joint input class differs from the ideal by at most in half trace norm, including finite references. Suppose a complete readout channel with the common alphabet has half-diamond error at most . Set .
For an input whose packet marginal is , its actual full record satisfies
where . Its decoded mean and law satisfy
The decoded record–spectator–reference state has the same second bound against .
Proof. Telescope through the ideal readout applied to the actual transferred state. Transfer contractivity and implementation complete-channel error give the full-record bound.
The reported observable
satisfies . For two states and such an observable,
because the positive and negative parts of each have trace . Combine this with the exact ideal bias .
Classical decoding and reference discard are contractive. A triangle inequality through the saturated ideal record, followed by Proposition prop:recordtail, costs exactly for the unsaturated comparison.
sectionThe general interface theoremEnd-to-end theorem and constructive tolerances › The general interface theorem · lines 1832–1838
Open as its own pageFor an arbitrary normal packet state of finite mean , replace the two geometric errors by and , respectively. A mean alone does not supply the geometric law.
sectionThe model-level theoremEnd-to-end theorem and constructive tolerances › The model-level theorem · lines 1839–1849
Open as its own pageDefine
using the derived budgets (eq:transferbudget) and (eq:readbudget).
theoremTheorem: Apparatus-model realization of the finite Hawking readoutEnd-to-end theorem and constructive tolerances › The model-level theorem · Em03-B@2#thm:model, Em03-B@2#eq:modelrecord, Em03-B@2#eq:modelbounds · proof attached · lines 1850–1893
Open as its own pageRetain Assumption ass:field, the weighted test completion, the finite-window construction, and the model specifications for capture, controls, independent preparations, and readout. The input has the specified participating Gaussian marginal and any admitted normal spectator–reference extension.
The complete model record obeys
Its decoded statistics obey
The decoded complete-record comparison with the unsaturated number record retains spectators and references and has the same bound as the second line.
For the finite Enter terminology, also retain Assumption ass:I.
Proof. Theorem thm:transfer supplies the transfer certificate from the capture kernel, preparation, pulses, and control domain. Theorem thm:readbudget supplies the complete-instrument certificate from its specified components. Substitute both into Theorem thm:interface.
sectionThe model-level theoremEnd-to-end theorem and constructive tolerances › The model-level theorem · lines 1893–1898
Open as its own pageThis theorem replaces unspecified by explicit model quantities. It does not identify the model with a local Schwarzschild detector.
sectionAn exact noise-free model controlEnd-to-end theorem and constructive tolerances › An exact noise-free model control · Em03-B@2#eq:exactmodelcounts · lines 1899–1925
Open as its own pageWith exact extraction, correctly prepared register, and ideal readout, let , where is (eq:memorymean). Then the actual model's decoded law is
Its mean is
These formulas follow directly from (eq:extractionchannel); they also hold for , with the middle line empty. Classical assignment noise subsequently gives
This is an analytical model control, not an experimentally measured Hawking histogram.
theoremTheorem: Tolerance scheduleEnd-to-end theorem and constructive tolerances › Constructive accuracy and its limitations · Em03-B@2#thm:tolerance · proof attached · lines 1928–1970
Open as its own pageFix a packet with finite and a requested mean tolerance . Any admissible model parameters satisfying
give
In the family of idealized models allowing arbitrary finite windows, capture transmissivity approaching one, arbitrarily accurate independent preparation, no fixed readout or control error floor, and the stated selective controls for every finite , such parameters exist.
Proof. The first assertion is (eq:modelbounds).
For existence in the stated model family, choose by geometric decay; if , the ideal bias already vanishes. Then choose finite with sufficiently small. Choose large enough that is sufficiently small, using Lemmas lem:window–lem:modeerror. For this finite , . Choose sufficiently close to one that is small. The corresponding capture coupling is smooth with finite peak for each chosen parameter.
Choose and the bounded pulse deviations sufficiently small; exact pulses are included in the family. Choose the readiness, pointer-preparation, damping, basis, cross-talk, pointer-control, and assignment parameters so that (eq:readbudget) meets the final allowance. There are finitely many error terms, so these choices meet the two required budgets.
sectionConstructive accuracy and its limitationsEnd-to-end theorem and constructive tolerances › Constructive accuracy and its limitations · lines 1970–1995
Open as its own pageFor , a sufficient bias choice is
The conservative band estimate
can be used without a numerical transmission table.
The existence assertion is not arbitrary accuracy on fixed hardware. A maximum capture rate, restricted bandwidth, fixed temperature, fixed storage loss, or irreducible assignment error may prevent the stated parameter choices. A nonzero lower bound on the certificate budget prevents that certificate from proving arbitrary accuracy; it is not, by itself, a lower bound on the actual statistical error, which can exhibit cancellations.
For convergence of the displayed mean certificates as grows, one needs , not merely a small fixed record error.
Resource ledger, reset model, and verification requirements
sectionWhat the model countsResource ledger, reset model, and verification requirements › What the model counts · lines 2000–2080
Open as its own pageThe capture memory is an oscillator, not one qubit. The extraction input control-domain dimension is . With the finite leakage model it is , and these dimensions must not be confused.
The capture state itself need not have finite occupation support. Its geometric tail is priced by the extraction comparison. The control Hamiltonian is defined on the full oscillator and acts identically outside its specified finite domain, except for the explicitly bounded perturbation when included.
Let be the number of laboratory spectator qubits. The construction uses register qubits and pointer qubits. Allocating both blocks before readout gives peak laboratory qubit occupancy
External references are retained in correctness specifications but are not laboratory storage.
{}1.15
Component Explicit resource or boundary Component Explicit resource or boundary Capture Window duration ; coefficient ; integrated coupling ; peak rate and derivatives obtained from (eq:captcontrol). A hardware bandwidth restriction must be checked against this actual coefficient. Memory One oscillator; initial mean ; storage time ; storage rate ; control input dimension ; maximum modeled leakage domain . Extraction simultaneous number-selective pulse components; duration ; amplitude and envelope-derivative limits; frequency modulation through ; deviation integral . No oscillator drive or ancillary control qubit is concealed. Register qubits, independently initialized with error . The Hamiltonian operates directly on their binary basis; a separate unpriced encoding unitary is unnecessary. Pointer readout pointer qubits; copy duration ; computational readout; damping time ; assignment matrix ; pointer preparation . The aggregate ideal copy uses controlled-NOT operations. Spectators Storage through the capture, storage, extraction, and readout intervals. The only modeled error is the stated spectator-coupling budget; additional decoherence must be added as a separate complete channel. Classical output Raw words and decoded values, together with all failure labels. Classical storage is not counted as quantum slots. Preparation and reset Fresh bath systems, their specified states, reset duration, and readiness probability. Independence across shots must be justified before invoking this one-shot model repeatedly. Energy and work If memory energy is , its pre-extraction mean is . Control norm and duration are specified. A thermodynamic work or reset-cost theorem is not asserted. sectionA specified reset realizationResource ledger, reset model, and verification requirements › A specified reset realization · lines 2081–2105
Open as its own pageThe preparations can be implemented within the effective model by replacement through swaps with fresh independent bath systems: one oscillator in the geometric state of mean , a register bath block in , and pointer bath qubits in their specified diagonal states. Discard the old apparatus states into those baths. Finite-dimensional swaps have bounded generators; the oscillator swap is a passive two-mode rotation with a known phase correction.
This specifies a replacement channel and the destination of the discarded information. It does not claim unitary erasure in an isolated finite environment. The readiness branch is generated by a fresh classical variable with probability ; its failure output remains visible.
The bath preparations, cooling work, and delivery of fresh bath systems are external resources of this model. Their thermodynamic costs are not fixed by channel notation. Post-measurement reset does not retroactively change a completed record. Reuse in a later trial requires the newly specified preparation and independence, rather than an unreported apparatus memory carried between shots.
sectionVerification required for a physical successorResource ledger, reset model, and verification requirements › Verification required for a physical successor · lines 2106–2145
Open as its own pageA physical implementation must supply:
a justified effective port and its relation to the scalar field species, positive-frequency convention, and selected partial wave;
a coupling region and switching in spacetime, with a proved induced-observable or transfer identification;
the clock and redshift conversion. Our clock is asymptotic time. If a static proper-time clock at radius is used, the Schwarzschild relation must be carried through all pulse parameters. This relation alone does not construct the detector;
the actual participating field degrees of freedom and their joint state. The auxiliary vacuum port and nonvacuum radiation occupations cannot be inferred from a mean histogram;
availability or a certified compilation of the number-selective control set, including detunings, amplitude, frequency range, temporary occupation, and leakage;
complete readout-process characterization, not only a single-state assignment histogram. Spectator effects, apparatus memory, reset failures, and correlated errors must be included;
independently justified values or bounds for every parameter substituted into the analytical certificate. Statistical calibration uncertainty must be propagated into those bounds.
A compilation log, archive manifest, or numerical optimization objective is not a replacement for any of these proofs.
Debugging and retained non-transfer boundaries
sectionDebugging and retained non-transfer boundariesDebugging and retained non-transfer boundaries · lines 2147–2227
Open as its own pageSource repairs. The Fock macro is defined. The decoder (eq:decoder) acts on arbitrary record operators. Inherited radiation inputs and new apparatus preparations are separated explicitly.
A mean does not determine the packet density. The geometric law is proved using quasifreeness. The mean-only stop remains valid.
A finite marginal is not a global radiation density. Only finite participating reductions are represented normally. The weighted radiation-test extension does not reprove the bulk Hadamard construction.
A finite temporal switch is not exact band-limited capture. The constructed differs from . Its mismatch is proved, not silently ignored.
Unselected radiation is not vacuum. The participating occupation and its correlation with are retained. Only newly declared auxiliary apparatus ports are prepared in vacuum.
The Markov envelope is an effective-model extension. Its negative-frequency auxiliary sector is not a new physical negative-energy scalar sector. Correspondence to a local Schwarzschild interaction is unproved.
Coherent transfer is not number copying. Low occupations leave the same vacuum memory state and preserve register coherences. High occupations are saturating environment branches.
The two cutoffs and three tails differ. Reported saturation begins at , giving probability . The ideal count-law error is . The global extraction-domain tail is . A support-only certificate instead uses a square-root tail.
A bounded finite-domain estimate is not an unbounded-drive estimate. Global control certification here uses explicitly bounded generators. Other oscillator drives require their own invariant domain or leakage theorem.
Complete instruments include failures. Raw words, decoder values, spectators, and failure records share one output interface. No trial is postselected away.
Spectator identity is an operation statement. Conditioning on a correlated readout can change the spectator state even when the ideal operation on its tensor factor is the identity.
Landmark I starts with finite qubit kinematics. Its global starred requirements do not supply field preparation, capture, or oscillator control.
Packet occupation is not an emission rate. The inherited is a normalized packet mean. The predecessor's rate uses a separate temporal-window normalization and observation schedule.
The result is not a recovery or evaporation model. The parameter is not an energy-labelled transmission probability from another channel. No Page curve, microscopic message recovery, backreaction, or mass-loss theorem is inferred.
Unrelated admission gates are untouched. No construction concerns O.1, XVI-N, XV-B, or an inherited characteristic quantum coefficient. Their objects are not identified with this apparatus model.
Final analytical release
theoremTheorem: Em03-B version 2 releaseFinal analytical release · Em03-B@2#thm:release · proof attached · lines 2232–2294
Open as its own pageUnder the explicitly stated radiation input and apparatus model:
the normal geometric packet marginal and finite carrier–record interface are constructed;
a smooth finite-switching passive capture interaction has the exact kernel (eq:captureann), and its referenced certificate (eq:capbudget) includes nonvacuum mode mismatch, preparation, and justified vacuum loss;
coherent oscillator–register extraction is implemented by the explicit swap pulses, with exact sharp-tail comparison (eq:sharpK);
global bounded perturbations and support-only control certificates yield their distinct proved tail regimes;
a complete pointer instrument with quantum noise, assignment noise, spectator coupling, preparation imperfections, and visible failures has the derived budget (eq:readbudget);
the derived transfer and readout budgets give the complete referenced record comparison and the mean and count-law bounds of Theorem thm:model;
the tolerance schedule is constructive within its stated parameter family, with its resource growth and possible error floors retained.
These statements establish a specified apparatus-model realization, not a local Schwarzschild detector or a laboratory realization. No global radiation Fock density, collapse packet limit, nondestructive field instrument, evaporation mechanism, or quantum-gravitational correction is established.
Proof. Theorem thm:marginal, Proposition prop:carrier, and Theorem thm:record prove (i). Theorem thm:capturekernel, Lemmas lem:window–lem:modeerror, and Theorem thm:captureerror prove (ii). Theorem thm:extraction and Proposition prop:compile prove (iii). Lemma lem:Duhamel and Proposition prop:controlregimes prove (iv). Theorems thm:assignment and thm:readbudget prove (v). Theorems thm:transfer and thm:model prove (vi). Theorem thm:tolerance and Section sec:resources prove (vii).
The specifications include no local Schwarzschild system–probe coupling or experimental correspondence theorem. None of the excluded conclusions is an additional implication of the constructed finite interfaces.
sectionFinal analytical releaseFinal analytical release · lines 2294–2304
Open as its own pagescope statement. Em03-B version 2 constructs and analyzes an effective apparatus-model realization of finite packet transfer and destructive readout. Its reference-stable budgets are derived from declared preparations, interactions, control pulses, and complete instruments. Its correspondence to a local Schwarzschild-field detector and its laboratory realization remain separately identified obligations.
Declarations
sectionDeclarationsDeclarations · lines 2305–2321
Open as its own pageand verification availability. The analytical constructions are contained in this source. No executed numerical dataset, compilation record, formal proof certificate, experimental calibration, or apparatus demonstration is supplied or asserted.
of attribution. The inherited field prescription and supplied Landmark I theorem are identified as predecessor inputs. The capture, extraction, instrument calculations, and error-budget substitutions are mathematical constructions of this manuscript. Bibliographic comparisons are not transfers of all results from the cited works.
bibliographyReferencesDeclarations · lines 2322–2419
Open as its own pageEm03A
N. Cheung, Em03-A: A Fixed-Background Hawking Emission Theorem, version 1, 8 October 2026. Supplied source
03-A-v1.tex. Used through its stated boundary prescription,:horizonoccupation,:quantumscatter,:numberdensity, and:packetlaw. Its manuscript proofs are not independently verified here.LandmarkI
N. Cheung, I, version 1. Supplied characterization statement and excerpts:
:strategy-class,:requirements, and:main. The characterization is an admitted semantic premise, not reproved in this paper.DMP
C. Dappiaggi, V. Moretti, and N. Pinamonti, Rigorous construction and Hadamard property of the Unruh state in Schwarzschild spacetime, Advances in Theoretical and Mathematical Physics 15 (2011), 355–447. arXiv:0907.1034. The bulk-state construction is inherited through Em03-A.
Weedbrook
C. Weedbrook, S. Pirandola, R. García-Patrón, N. J. Cerf, T. C. Ralph, J. H. Shapiro, and S. Lloyd, Gaussian Quantum Information, Reviews of Modern Physics 84 (2012), 621–669. arXiv:1110.3234. doi:10.1103/RevModPhys.84.621. General Gaussian-state context; the finite-mode identifications used here are proved explicitly.
GardinerCollett
C. W. Gardiner and M. J. Collett, Input and output in damped quantum systems: Quantum stochastic differential equations and the master equation, Physical Review A 31 (1985), 3761–3774. doi:10.1103/PhysRevA.31.3761.
YamamotoJames
N. Yamamoto and M. R. James, Zero-dynamics principle for perfect quantum memory in linear networks, New Journal of Physics 16 (2014), 073032. arXiv:1403.1698. doi:10.1088/1367-2630/16/7/073032. Pulse-selective linear-memory context, not a proof of the particular Hawking capture model.
Shirokov
M. E. Shirokov, Energy-constrained diamond norms and their use in quantum information theory, Problems of Information Transmission 54 (2018), 20–33. arXiv:1706.00361. doi:10.1134/S0032946018010027. The constraints used in this paper are explicitly oscillator occupation constraints.
Krastanov
S. Krastanov, V. V. Albert, C. Shen, C.-L. Zou, R. W. Heeres, B. Vlastakis, R. J. Schoelkopf, and L. Jiang, Universal Control of an Oscillator with Dispersive Coupling to a Qubit, Physical Review A 92 (2015), 040303(R). arXiv:1502.08015. doi:10.1103/PhysRevA.92.040303. A comparison for a different control set, not a compiler or leakage certificate for the number-selective primitives here.
FewsterVerch
C. J. Fewster and R. Verch, Quantum fields and local measurements, arXiv:1810.06512, published version. Used for the separate local system–probe measurement obligation, not to identify the present Markov port with a local scalar-field apparatus.
Watrous
J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018. Chapters 2 and 3: channels, instruments, trace distances, and the completely bounded trace norm. The specific channel identities and distance formulas in this manuscript are proved directly.