All manuscripts

Manuscript Em03-E@1 · Em03-E-v1.tex · c4b07e6a

Em03-E Microscopic Input Dependence and Certified Recovery in a Dynamical Radiation Model Specified emission dynamics, semiclassical matching, complementary channels, and operational access

Export Em03-E-v1.tex

Specifies a finite sequential radiation model in which a qubit message is randomized by an independent key and transferred by explicit bounded Hamiltonians. Each emitted cell is message-independent, while the collective output can transmit the message. For transfer probability p equal to the sine squared of the ciphertext pulse and coherence parameter eta, the optimal worst-case recovery error is (3-p-2p eta)/4. That p is not En02-D's full-transmission probability. Occupation ladders are calibrated to clipped geometric laws from the Em03-A--C interface. That calibration is not a derivation of the greybody law and not an identification of the full cell with Em03-C's two-packet state. Em03-A does not supply the Hamiltonians. No Em03-D source is assumed. Entropy, reference mutual information, and recovery fidelity are reported separately: entropy is not a decoder certificate and not a Page curve. The construction is not a local Schwarzschild detector, not a local Schwarzschild evaporation process, not a firewall resolution, not unitarity restoration, not an evaporation endpoint, not an island, and not quantum-gravitational evaporation. H2, I3, and J2 remain unresolved. Numerical execution is 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. XV-B is not opened. No quantum coefficient is admitted. No compilation is asserted.

Front matter

  • abstractAbstractFront matter · lines 120–155
    Open as its own page

    We specify and solve a finite sequential radiation model in which a qubit message is encoded in a degenerate source-energy sector. Explicit bounded Hamiltonians randomize the message with an independent two-bit key, emit the key into a first cell, and transfer the encrypted qubit into a second cell with a tunable probability. A separately tunable dephasing interaction supplies a complete coherence-loss control. Every inaccessible system, including the key purification and the dephasing environment, is retained in the complementary channel.

    The full radiation channel, its action on all message matrix units, and an explicit decoder are calculated. Each individual emitted cell is exactly independent of the message, while the collective output can transmit the message perfectly. For transfer probability and coherence parameter , the optimal worst-case recovery error is , and the optimal maximally entangled test fidelity is . The distance of a named complementary channel from a replacement channel is evaluated exactly.

    Independent finite occupation ladders are emitted by additional energy-preserving Hamiltonians. Their amplitudes are calibrated to clipped geometric packet laws from the Em03-A–C interface. We prove the occupation-state, count-law, and mean comparisons, while distinguishing those comparisons from agreement of the full information-bearing radiation state. An explicit finite coherent access construction and bounded-generator implementation estimates give end-to-end recovery and destructive-record certificates. Entropy, reference mutual information, and recovery fidelity are reported separately.

    The construction is a designed finite dynamical information-transfer model. It does not derive the interactions from quantum gravity, identify the cells with a local Schwarzschild evaporation process, or resolve horizon-smoothness and evaporation-endpoint questions.

Question, contribution, and evidence boundary

  • sectionQuestion, contribution, and evidence boundaryQuestion, contribution, and evidence boundary · lines 161–246
    Open as its own page

    The construction follows the chain

    The decisive distinction from Em03-C is that alternative radiation states are not supplied independently. The radiation channel is calculated from the Hamiltonians and preparations printed below.

    Three levels of conclusion remain separate:

    1. Finite dynamics: a message-dependent channel generated by a declared sequence of bounded interactions;

    2. Semiclassical comparison: agreement or controlled disagreement with a named family of Em03-A–C occupation observables;

    3. Black-hole identification: derivation of those interactions and degrees of freedom from a specified gravitational theory.

    The first level is proved. A restricted comparison at the second level is proved. The third level is not claimed.

    The information-transfer mechanism is the familiar Pauli randomization mechanism of a private quantum channel PrivateChannel. It is not presented as a new encryption scheme. The contribution is its explicit finite emission Hamiltonians, complete channel and complement calculations, exact recovery benchmarks, occupation calibration, and operational error accounting in one specified model.

    General information–disturbance and approximate-correction theorems provide a broader setting KSW,BenyOreshkov. We do not import their constants into a different metric. The recovery and leakage constants needed here are proved directly. Hayden–Preskill models likewise retain unitarity, mixing, and radiation-access assumptions HaydenPreskill; none of those assumptions is derived by the present decoder.

    . The supplied Em03-A, Em03-B, and Em03-C sources Em03A,Em03B,Em03C supply the stated semiclassical and operational comparison interfaces. No manuscript registry or companion retrieval account is a premise of the finite dynamics. In particular, no Em03-D source is assumed.

    boundary. All results are analytical. Compilation, formal verification, numerical pulse execution, calibration, and experimental realization are not asserted. “Certified” means that an explicitly stated comparison follows from the printed mathematical hypotheses.

    . All model Hilbert spaces are finite dimensional. We use

    The diamond norm retains arbitrary external references. We write

    Entropy is in bits. The binary entropy is

    with . Channel and instrument conventions are standard Watrous; the particular formulas used below are proved in this manuscript.

E0: message, source, environments, and emitted cells

  • sectionMicroscopic source and encodingE0: message, source, environments, and emitted cells › Microscopic source and encoding · Em03-E@1#eq:encoding · lines 251–306
    Open as its own page

    The message is a qubit. Its external reference is not controlled by the source or receiver.

    The source contains:

    Here is the source message qubit, are fuel qubits, are key qubits, and are finite occupation-source registers.

    Choose integers , positive energy spacings , and source energies

    The register has basis

    Its Hamiltonian is

    The initial and the daughter states are distinct degenerate states.

    For a payload energy , set

    The source factors are energetically degenerate.

    The encoding is

    Its image lies in the common energy eigenspace

    Thus different messages do not begin with different source energy.

  • sectionIndependent environmentsE0: message, source, environments, and emitted cells › Independent environments · lines 307–317
    Open as its own page

    There are two inaccessible key-purification qubits , initially in , and a dephasing qubit , initially in . Their free Hamiltonians are zero.

    All initial environments are independent of . The key purification is not discarded from the complementary channel.

  • sectionTwo radiation cellsE0: message, source, environments, and emitted cells › Two radiation cells · lines 318–354
    Open as its own page

    Each emitted cell has an occupation register and a payload register:

    The occupation spaces are

    The first payload space has basis

    and the second has basis

    Their free Hamiltonians are

    All cells begin in

    The occupied payload labels are degenerate internal states. They are additional model degrees of freedom, not unmentioned scalar-field packet modes.

  • remarkRemark: Finite boundariesE0: message, source, environments, and emitted cells › Two radiation cells · lines 355–361
    Open as its own page

    The occupation registers are finite ladders. No canonical commutation relation is assigned to their boundary. Payload raising maps such as are finite matrices, not continuum annihilation or creation distributions.

  • sectionAccess and time orderingE0: message, source, environments, and emitted cells › Access and time ordering · lines 363–381
    Open as its own page

    At the first emission the observer receives ; at the second emission the observer receives . Emitted cells do not interact again with the source.

    The receiver never receives . Unused cells and all source registers belong to the complementary output at the relevant prefix.

    All formulas are in the interaction picture of

    The finite energy spacings are model parameters. A positive-frequency wavepacket is not assumed to have the exact Hamiltonian .

E1: explicit internal and emission Hamiltonians

  • sectionPulse conventionE1: explicit internal and emission Hamiltonians › Pulse convention · lines 386–401
    Open as its own page

    For each operation choose a real smooth compactly supported pulse , with prescribed area

    An interaction , with fixed self-adjoint matrix , has exact evolution . The operation intervals are disjoint unless explicitly stated to commute.

    A normalized smooth pulse can be rescaled to any finite duration. For each chosen duration its amplitude and all its derivatives are finite. No universal hardware bandwidth is assumed.

  • sectionKey preparationE1: explicit internal and emission Hamiltonians › Key preparation · Em03-E@1#eq:keypurification · lines 402–428
    Open as its own page

    Prepare the key purification by applying Hadamard gates to , followed by

    The resulting state is

    Tracing gives .

    These are actual finite controls. For example, Hadamard is generated exactly by a pulse of area multiplying , and a controlled-NOT is generated by a pulse of area multiplying

    These matrices act within zero-energy sectors.

  • sectionDephasing controlE1: explicit internal and emission Hamiltonians › Dephasing control · Em03-E@1#eq:dephasingisometry, Em03-E@1#eq:Lambdaeta · lines 429–457
    Open as its own page

    Before encryption, apply

    Define

    On the initial environment this gives the isometry

    The reduced source channel is

    This is verified by the overlap .

  • sectionControlled Pauli randomizationE1: explicit internal and emission Hamiltonians › Controlled Pauli randomization · lines 458–477
    Open as its own page

    Put . Apply controlled from to , then controlled from to . The resulting unitary is

    Its generators are the two explicit projections

    each with pulse area .

    The ordering fixes all phases. In particular, is not replaced silently by a differently phased Pauli matrix. Its conjugation action is nevertheless that of .

  • sectionKey emissionE1: explicit internal and emission Hamiltonians › Key emission · Em03-E@1#eq:keyemission · lines 478–498
    Open as its own page

    Define the partial isometry

    Unprinted factors carry the identity. Use

    On the prepared subspace,

  • sectionCiphertext emissionE1: explicit internal and emission Hamiltonians › Ciphertext emission · Em03-E@1#eq:cipheremission · lines 499–530
    Open as its own page

    Define

    Use a pulse area , and set

    Then

    The same source state appears for both successful message basis states. This is the coherence-preserving part of the emission.

    Both are partial isometries with orthogonal initial and final subspaces, so are self-adjoint with norm one. Their action on every unpaired basis state is zero. The model therefore specifies the full Hamiltonians, not merely an isometry with an unspecified unitary extension.

  • sectionOccupation emissionE1: explicit internal and emission Hamiltonians › Occupation emission · Em03-E@1#eq:numberemission · lines 531–562
    Open as its own page

    For each , choose a probability vector

    Its semiclassical calibration is specified in Section sec:matching. Define

    These are orthonormal. Set

    The exact emission is

    The generator is a norm-one finite matrix. Its terms, including the zero-occupation daughter term, are part of the specification.

  • sectionThe two emission stepsE1: explicit internal and emission Hamiltonians › The two emission steps · lines 563–577
    Open as its own page

    Let be the ordered key preparation, dephasing, and controlled-Pauli sequence. The first emission step applies key emission and occupation emission . The second applies ciphertext emission and occupation emission . Within each step the two printed emission interactions commute.

    Write

  • theoremTheorem: Evolution, channels, and conserved free energyE1: explicit internal and emission Hamiltonians › The two emission steps · Em03-E@1#thm:evolution · proof attached · lines 578–620
    Open as its own page

    The specified dynamics has a unique finite-dimensional unitary evolution. Its radiation prefixes are CPTP channels on all message operators:

    A complementary channel is obtained by tracing the accessible prefix instead, retaining the whole source, the key purification, the dephasing environment, and unused cells.

    Every printed interaction commutes with . Consequently the expectation and full probability distribution of are conserved.

    Proof. All generators are bounded matrices with smooth coefficients. Existence and uniqueness follow from the finite linear evolution equation; unitarity follows from self-adjointness. The pure-environment evolution composed with the encoding is an isometry. Partial trace gives CPTP channels and their complements.

    The internal key and message controls act in degenerate sectors. For key emission, the source fuel decreases by while gains the same amount. For ciphertext emission the analogous equality holds for ; is degenerate. Every term of occupation emission takes source energy to and adds in the cell. Thus every interaction commutes with . The full evolution commutes with , proving the conservation statement.

  • sectionThe two emission stepsE1: explicit internal and emission Hamiltonians › The two emission steps · lines 620–627
    Open as its own page

    This is conservation of the declared free energy. It is not a thermodynamic theorem about switching work, reset cost, or the energy of a continuum wavepacket. Nor does it select the vectors .

E2: complete radiation-channel calculation

  • sectionE2: complete radiation-channel calculationE2: complete radiation-channel calculation · lines 629–643
    Open as its own page

    Define the independently emitted occupation densities

    Let be . For a qubit operator , write

  • theoremTheorem: All prefix channels and all message coherencesE2: complete radiation-channel calculation · Em03-E@1#thm:channel, Em03-E@1#eq:N1, Em03-E@1#eq:N2, Em03-E@1#eq:diagonalunits, Em03-E@1#eq:offdiagonalunit · proof attached · lines 644–705
    Open as its own page

    At prefix zero there is no accessible radiation factor. At prefix one,

    At prefix two,

    In particular, for ,

    The other off-diagonal matrix unit is the adjoint of (eq:offdiagonalunit).

    Proof. Occupation emission leaves the displayed diagonal densities after the daughter states are traced. These operations act on factors independent of the message.

    Key preparation gives (eq:keypurification). The inaccessible key purification makes the radiation key diagonal with weight for every . Tracing the still-internal message at prefix one gives (eq:N1).

    After ciphertext emission, the successful and unsuccessful source fuel states are orthogonal. Their cross terms therefore vanish in the radiation channel. On success the source message has the common terminal state, leaving its full encrypted density in . On failure is vacuum, and tracing the remaining source message contributes . Tracing gives . This proves (eq:N2) on arbitrary operators. Equations (eq:diagonalunits)–(eq:offdiagonalunit) then follow directly.

  • sectionExactly private individual cellsE2: complete radiation-channel calculation › Exactly private individual cells · Em03-E@1#eq:twirl · lines 707–717
    Open as its own page

    Pauli averaging obeys

    This follows by expanding in the Pauli basis: every nonidentity coefficient cancels.

  • corollaryCorollary: Single-cell replacement channelsE2: complete radiation-channel calculation › Exactly private individual cells · Em03-E@1#cor:private · proof attached · lines 718–737
    Open as its own page

    For every , each individual emitted cell is exactly independent of the message, including references:

    Nevertheless, when , the collective channel is exactly quantum-correctable.

    Proof. The first marginal is unchanged by a later source interaction. The second follows from (eq:twirl), which applies to because its trace is . The collective recovery assertion is proved in Theorem thm:recovery.

  • sectionExactly private individual cellsE2: complete radiation-channel calculation › Exactly private individual cells · lines 737–742
    Open as its own page

    The private marginals use a mixed key whose purification is kept in the model. They are not a claim that an arbitrary pure encoding can hide a qubit in two pure shares with private marginals.

  • propositionProposition: Two distinct discrimination benchmarksE2: complete radiation-channel calculation › Classical and coherence-sensitive distinguishability · Em03-E@1#prop:distinguish · proof attached · lines 745–768
    Open as its own page

    For computational-basis inputs,

    For the states ,

    Equal-prior optimal single-shot success probabilities are, respectively, and .

    Proof. The common failure block cancels. The remaining key blocks are orthogonal, and Pauli conjugation preserves trace norm. Computational-basis inputs are unchanged by . The difference of the two -eigenstate densities is attenuated by . Tensoring preserves trace norm. The optimal binary discrimination formula follows by maximizing the effect against the positive part of the difference.

  • exampleExample: Three required controlsE2: complete radiation-channel calculation › Classical and coherence-sensitive distinguishability · lines 770–784
    Open as its own page
    1. : the whole radiation channel is a replacement channel. The source and environments retain the message.

    2. : computational-basis information is fully available collectively, but input coherence is lost to the dephasing environment. The channel is entanglement breaking.

    3. : the collective radiation permits exact referenced quantum recovery.

    The emitted occupation statistics and the individual-cell privacy do not distinguish these three information tasks.

E4: explicit decoder and optimal referenced recovery

  • sectionA complete decoderE4: explicit decoder and optimal referenced recovery › A complete decoder · lines 791–820
    Open as its own page

    On the physical payload support, define

    Here

    The first term has trace . Its Kraus maps are the count- and key-conditioned extraction maps. The second term is a replacement CP map of trace . Hence is CPTP on every physical input, not only on emitted states.

    The Pauli correction is applied before destructive logical readout. Discarding the count and key metadata does not discard the returned message.

  • propositionProposition: Decoded channelE4: explicit decoder and optimal referenced recovery › A complete decoder · Em03-E@1#prop:decoded, Em03-E@1#eq:decoded · proof attached · lines 821–837
    Open as its own page

    The exact decoded channel is

    Proof. In each successful key block the correction removes , while the failure block is replaced by . The key weights sum to one, and the count densities have trace one. This proves the identity on all message operators.

  • lemmaLemma: Pauli comparisonE4: explicit decoder and optimal referenced recovery › A Pauli-channel distance identity · Em03-E@1#lem:Pauli · proof attached · lines 841–861
    Open as its own page

    For qubit Pauli channels

    In particular, .

    Proof. The triangle inequality and give the upper bound. On a maximally entangled input, the four Pauli outputs are orthogonal Bell projectors. Their trace-distance difference is exactly the stated classical distance, proving equality.

  • sectionA Pauli-channel distance identityE4: explicit decoder and optimal referenced recovery › A Pauli-channel distance identity · lines 861–877
    Open as its own page

    Let

    For a decoder , define

    The first is a worst-case referenced criterion; the second is the specified Bell-input test.

  • theoremTheorem: Exact optimal recoveryE4: explicit decoder and optimal referenced recovery › A Pauli-channel distance identity · Em03-E@1#thm:recovery, Em03-E@1#eq:optimalrecovery · proof attached · lines 878–940
    Open as its own page

    Over all deterministic CPTP decoders with access to both full cells,

    The explicit decoder attains both values.

    At prefixes zero and one, the corresponding optimal recovery error is , and the maximal Bell-test fidelity is .

    Proof. The decoded channel (eq:decoded) has Pauli probabilities

    Lemma lem:Pauli gives error ; its Bell-test fidelity is .

    For optimality, the orthogonal successful and failed ciphertext sectors have probabilities and , independent of the message. The key and count labels give independent classical conditioning, not an additional message channel.

    On a successful sector, undoing the known Pauli leaves

    For any subsequent decoder, Bell overlap from the identity term is at most one. The dephased Bell state is separable across reference and output; local decoding preserves separability. A separable two-qubit state has Bell overlap at most . Therefore every successful-sector decoder has overlap at most .

    A failed sector is input-independent. Every decoded constant qubit channel has Bell overlap . Consequently every decoder has

    Testing the Bell projector gives worst-case recovery error at least , proving optimality.

    At the earlier prefixes, (eq:N1) and the empty output are replacement channels. Every decoder again has Bell overlap , giving error at least . Preparing attains by Lemma lem:Pauli.

  • sectionA Pauli-channel distance identityE4: explicit decoder and optimal referenced recovery › A Pauli-channel distance identity · lines 940–946
    Open as its own page

    This is an optimality result for the declared accessible information, not an unrestricted physical black-hole decoder theorem.

The full complementary channel and leakage constants

  • sectionThe full complementary channel and leakage constantsThe full complementary channel and leakage constants · Em03-E@1#eq:dephcomplement · lines 948–972
    Open as its own page

    Define the complementary dephasing channel

    Let

    The occupation-source complement is the independent density

    Suppress the fixed terminal and all fixed initial factors. The fuel labels two orthogonal complementary sectors: success , and failure .

  • theoremTheorem: Complete complementary outputThe full complementary channel and leakage constants · Em03-E@1#thm:complement, Em03-E@1#eq:fullcomplement · proof attached · lines 973–1022
    Open as its own page

    Up to insertion of fixed factors, the prefix-two complementary channel is

    The direct-sum notation refers to the orthogonal fuel sectors. The key purification and dephasing environment are part of this output.

    At prefix one the complementary channel, apart from independent occupation-source and unused-cell factors, is

    It is reversible when all its factors are accessible.

    Proof. Tracing the emitted key eliminates different cross terms but retains both the source key and its purifying copy. Tracing the ciphertext eliminates success–failure cross terms because occupied and vacuum radiation states are orthogonal. On success, tracing the emitted qubit leaves ; on failure, the source qubit and its dephasing environment retain the isometric state . Occupation registers contribute the independent diagonal daughter densities. This proves the complete formula.

    At prefix one the encrypted qubit has not been emitted. Reading the retained key, undoing , and reversing the known dephasing unitary on recovers the input.

  • sectionThe full complementary channel and leakage constantsThe full complementary channel and leakage constants · lines 1022–1031
    Open as its own page

    We compare with the named replacement channel

    This is a specified center, not an unproved optimization over all replacement outputs.

  • lemmaLemma: Leakage of the dephasing environmentThe full complementary channel and leakage constants · Em03-E@1#lem:dephleak · proof attached · lines 1032–1061
    Open as its own page

    For ,

    The Bell input attains this distance.

    Proof. The channel difference is

    The stabilized norm of the functional is . The trace norm of the difference of the two pure-state projectors is . This gives the stated upper bound.

    On the Bell input the difference is

    Its half trace norm is the same value.

  • theoremTheorem: Exact named complementary-channel distanceThe full complementary channel and leakage constants · Em03-E@1#thm:leakage, Em03-E@1#eq:leakage · proof attached · lines 1063–1105
    Open as its own page

    The complete complement obeys

    At prefixes zero and one, comparison with the respective complementary output on gives distance .

    For ,

    This equality is specific to this model and these metrics.

    Proof. The key blocks and fuel sectors in (eq:fullcomplement) are orthogonal, so their trace norms add. On a failed sector is an isometry. Its comparison with the replacement output on is therefore the comparison of with , of distance . On success use Lemma lem:dephleak. This proves the weighted upper bound.

    The same Bell input attains the value in every failure block and the value in Lemma lem:dephleak in every success block. Hence it attains the weighted sum. Independent tensor factors do not change trace norm.

    At prefix zero the whole purified evolution is an isometric input channel. At prefix one the complement is an orthogonal mixture of isometric channels with known independent labels. The same calculation gives . The final displayed equality follows from Theorem thm:recovery at .

  • sectionThe full complementary channel and leakage constantsThe full complementary channel and leakage constants · lines 1105–1111
    Open as its own page

    A comparison that omitted or would be a reduced environmental observation, not this complementary channel. It could give a misleading impression of decoupling.

E3: controlled semiclassical comparison

  • sectionA specified occupation baselineE3: controlled semiclassical comparison › A specified occupation baseline · Em03-E@1#eq:Hbaseline, Em03-E@1#eq:calibration · lines 1116–1158
    Open as its own page

    Choose two orthonormal positive-frequency packet tests in the Em03-A–C scalar model, with disjoint frequency supports contained in compact bands away from zero. The stationary outgoing prescription then has vanishing off-diagonal occupation covariance.

    Its selected state is the product of geometric densities

    where

    These are predecessor inputs, with state selection retained. They are not calculated from the finite Hamiltonians of this paper.

    For the occupation emissions choose

    We use . This is a normalized probability vector.

    Equation (eq:calibration) is an explicit calibration of interaction amplitudes to a clipped packet law. It is not a derivation of the Hawking law from the finite dynamics.

  • sectionState, count, mean, and channel comparisonsE3: controlled semiclassical comparison › State, count, mean, and channel comparisons · lines 1159–1164
    Open as its own page

    Embed into the oscillator number space by . Let be the resulting oscillator density.

  • theoremTheorem: Exact occupation correspondence and its limitsE3: controlled semiclassical comparison › State, count, mean, and channel comparisons · Em03-E@1#thm:matching, Em03-E@1#eq:Htail, Em03-E@1#eq:meanmatch · proof attached · lines 1165–1236
    Open as its own page

    For every message input, including external references:

    1. the joint occupation channel is the replacement channel

    2. its occupation-state and joint count-law comparison with (eq:Hbaseline) is exactly

    3. the corresponding replacement channels have the same half-diamond distance ;

    4. the finite occupation mean is

    Each bounded occupation effect changes in probability by at most . No all-observable or local-field correspondence is asserted.

    Proof. The occupation emissions act on independent factors and have the exact output densities in (eq:numberemission). Tracing all payload systems therefore gives the stated replacement channel.

    The finite law is the deterministic clipping of the product geometric law. In the common countable number basis, mass above the finite rectangle is removed and added to its boundary. The positive inside change and negative outside change occupy orthogonal number records. Their half trace norm is the outside probability, which is (eq:Htail). The geometric marginals are independent for the chosen baseline.

    For replacement channels,

    Complete trace-norm contraction of partial trace gives the upper bound ; a normalized input attains it. Thus the half-diamond distance is the state distance.

    Finally,

    An effect expectation is Lipschitz with constant one in trace distance, proving the bounded-observable statement.

  • sectionState, count, mean, and channel comparisonsE3: controlled semiclassical comparison › State, count, mean, and channel comparisons · lines 1236–1241
    Open as its own page

    The mean estimate is an explicit geometric-tail calculation. It does not follow for an arbitrary unbounded observable from a trace-distance estimate alone.

  • sectionPrivate cells versus private occupation observablesE3: controlled semiclassical comparison › Private cells versus private occupation observables · lines 1242–1267
    Open as its own page

    Define the message-independent payload references

    After occupation embedding, the single-cell channel comparison with

    has half-diamond distance exactly .

    This comparison has two qualifications:

    1. describes new degenerate payload degrees of freedom. It is not supplied by the scalar Hawking baseline;

    2. count and mean matching concern , not every observable of .

    The payload energy and payload occupation are part of the finite energy ledger, but are not hidden inside the matched scalar number observable.

  • propositionProposition: Collective departure from replacementE3: controlled semiclassical comparison › The collective channel is not a replacement channel · Em03-E@1#prop:fullreplacement, Em03-E@1#eq:fullreplacement · proof attached · lines 1275–1319
    Open as its own page

    For the named replacement center,

    For every replacement channel ,

    Thus exact private single-cell channels can coexist with a nonconstant collective radiation channel, but the collective channel cannot simultaneously be arbitrarily close to a replacement channel at fixed nonzero .

    Proof. In the comparison with , the failure blocks cancel. The successful key blocks are unitary copies of . Its Pauli coefficient vectors are

    Lemma lem:Pauli gives . Orthogonal key blocks and the common occupation factor preserve this distance, giving (eq:fullreplacement).

    For an arbitrary replacement output, the triangle inequality between the two computational-basis radiation outputs and that common output gives

  • sectionThe collective channel is not a replacement channelE3: controlled semiclassical comparison › The collective channel is not a replacement channel · lines 1319–1326
    Open as its own page

    This explicitly separates occupation matching, finite-state matching on a named subsystem, and full message-channel matching. A nonzero is not inferred from the Hawking spectrum. It is selected by the independently specified ciphertext pulse.

Perturbations of the specified dynamics

  • lemmaLemma: Bounded-generator channel stabilityPerturbations of the specified dynamics · Em03-E@1#lem:stability · proof attached · lines 1331–1359
    Open as its own page

    For finite self-adjoint paths ,

    The induced channels, with references, fixed ancillas, and partial traces, have half-diamond distance bounded by this quantity, capped at one.

    Compatible complete channel comparisons telescope: their half-diamond errors add, capped at one.

    Proof. Variation of constants gives

    The unitary factors have norm one. Expanding the induced channel difference in two terms bounds its complete trace norm by twice the unitary operator-norm difference. Pre- and postcomposition by channels contract that norm. Inserting one changed factor at a time proves telescoping.

  • sectionPerturbations of the specified dynamicsPerturbations of the specified dynamics · Em03-E@1#eq:dynbudget · lines 1359–1375
    Open as its own page

    Let the implemented encoding isometry obey . Let the named purified initial environment be within trace distance of the ideal preparation. Let the finite dynamics have generator deviations over the prescribed operation intervals. Define

  • theoremTheorem: Radiation and complementary stabilityPerturbations of the specified dynamics · Em03-E@1#thm:dynstability · proof attached · lines 1376–1400
    Open as its own page

    The implemented prefix channels and the complements defined with the same complete environment interface differ from their ideal counterparts by at most .

    With the exact decoder,

    A fixed Bell-test fidelity changes by at most .

    Proof. Encoding, independent preparation, and dynamics telescope by Lemma lem:stability. Either accessible or complementary partial trace is contractive. Decoder postcomposition and the triangle inequality give the recovery bound. The Bell projector is an effect, so its expectation changes by at most trace distance.

  • sectionPerturbations of the specified dynamicsPerturbations of the specified dynamics · lines 1400–1413
    Open as its own page

    A bound only on a mixed environmental marginal is enough for the corresponding radiation-channel comparison. It is not, by itself, a comparison of chosen full complementary channels: their purifications and environmental identifications must also be specified.

    The exact energy conservation of Theorem thm:evolution persists under a perturbation only if that perturbation also commutes with . A small channel error is not an exact conservation law.

E5: constructed coherent access and decoder implementation

  • sectionA finite block interface, not a field-capture extrapolationE5: constructed coherent access and decoder implementation › A finite block interface, not a field-capture extrapolation · lines 1418–1445
    Open as its own page

    The emitted cells are finite systems. We construct their whole coherent access map directly. We do not extrapolate Em03-C's two-mode field-capture theorem to an unspecified radiation block.

    Encode occupation into

    qubits. Encode using one occupied/vacuum bit and two key bits, and encode using one occupied/vacuum bit and one data bit:

    The total receiver width is

    Unused binary words are invalid, not postselected away. Let denote this fixed isometric encoding.

  • sectionExact coherent transferE5: constructed coherent access and decoder implementation › Exact coherent transfer · lines 1446–1462
    Open as its own page

    For each physical cell choose its all-vacuum vector . For every other physical basis label , swap the disjoint pairs

    The all-vacuum input is fixed. Define

    The rank-one projections are orthogonal. A pulse of area on gives all swaps exactly, because .

  • propositionProposition: Whole-block coherent accessE5: constructed coherent access and decoder implementation › Exact coherent transfer · Em03-E@1#prop:access · proof attached · lines 1463–1478
    Open as its own page

    With a zero receiver register, the two-cell transfer leaves the same all-vacuum cell state for every basis input and induces

    It preserves every input coherence and every external reference.

    Proof. The final cell factor is for every input basis vector. Linearity gives a common cell environment for every superposition. Tracing that common environment leaves the stated isometric channel, including referenced inputs.

  • sectionExact coherent transferE5: constructed coherent access and decoder implementation › Exact coherent transfer · Em03-E@1#eq:accessbudget · lines 1478–1502
    Open as its own page

    Let receiver preparation have trace-distance error , independent of the cells and their references. Allow a joint bounded transfer perturbation , including cross-cell and spectator coupling. Then

    bounds the complete coherent-access error by Lemma lem:stability.

    An optional whole-block erasure is a complete flagged channel

    Its distance from ideal access in the enlarged interface is exactly , because its failure flag is orthogonal to all ordinary outputs. It is not a postselected survival model.

  • sectionAn executable complete decoderE5: constructed coherent access and decoder implementation › An executable complete decoder · Em03-E@1#eq:decoderbudget · lines 1503–1546
    Open as its own page

    On valid successful binary words, the two key bits and the ciphertext data bit implement recovery by:

    1. controlled from key bit to the data bit;

    2. controlled from key bit to the data bit;

    3. return the data bit and discard the count, occupancy, and key metadata.

    The order applies .

    For every invalid word or vacuum ciphertext, swap the data bit with a fresh independent qubit prepared in , then discard the other systems. This gives the failure output .

    The validity projector is diagonal and depends on count ranges and payload occupancy, not on the successful ciphertext data bit. A projector-controlled swap with the fresh qubit is generated by

    with pulse area . This is a specified bounded multi-register control. It is not claimed to be a free single-qubit operation or an unpriced efficient compilation into a more restrictive gate library.

    All metadata is discarded without logical destructive readout. On arbitrary receiver-register inputs this implements the complete extension of : invalid words are consumed and replaced by .

    Let the receiver decoder's fixed fresh-bath preparation error be , and let its bounded generator deviations have total integral . Put

    This is a complete-channel certificate, including invalid inputs and references.

  • theoremTheorem: End-to-end coherent recoveryE5: constructed coherent access and decoder implementation › An executable complete decoder · Em03-E@1#thm:endrecovery, Em03-E@1#eq:endrecovery · proof attached · lines 1547–1580
    Open as its own page

    For the implemented dynamics, whole-block coherent access, and complete decoder,

    The corresponding Bell-test fidelity is at least

    Proof. The exact composed channel is (eq:decoded). The three complete-channel comparisons telescope through the same intermediate interfaces. Apply Theorem thm:recovery and effect contraction for the Bell test.

  • sectionAn executable complete decoderE5: constructed coherent access and decoder implementation › An executable complete decoder · lines 1580–1595
    Open as its own page

    For ideal whole-block erasure with probability , decoded by fixed preparation on erasure, the exact decoded channel is

    Its optimal recovery error is

    The optimality proof is the same orthogonal-sector Bell argument as in Theorem thm:recovery.

Destructive verification and complete records

  • sectionA complete pointer instrumentDestructive verification and complete records › A complete pointer instrument · lines 1600–1624
    Open as its own page

    Destructive verification uses different trials from coherent message return.

    After finite access and, when desired, the decoder, choose a bounded basis rotation on the retained finite register. Computational measurement has selective maps

    An ordinary raw record is . The record alphabet is enlarged by access failures, reset failures, assignment failures, and any other declared visible status. Each failure has a fixed bounded score; no failed trial is deleted.

    A fresh pointer block is copied by controlled-NOT gates, read computationally, and consumed together with the tested register. A correlated stochastic assignment matrix gives

    It is a complete channel on arbitrary tested states.

  • lemmaLemma: Assignment and pointer certificateDestructive verification and complete records › A complete pointer instrument · Em03-E@1#lem:readout · proof attached · lines 1625–1658
    Open as its own page

    For ideal destructive readout ,

    If readiness fails with probability , the ready pointer preparation has error , and its joint bounded copying-generator deviation has integral , then a complete readout budget is

    Proof. Pinch a referenced input operator into its tested computational blocks . Pinching is trace-norm contractive and . The complete assignment difference is at most

    A maximizing basis input attains equality. Preparation replacement, bounded-generator stability, and assignment telescope on the ready branch. The visible failed branch costs at most one and has weight .

  • sectionA complete pointer instrumentDestructive verification and complete records › A complete pointer instrument · lines 1658–1664
    Open as its own page

    This is the same complete-record logic used in Em03-B and Em03-C, instantiated on a newly constructed finite access interface. It does not invoke an unproved field-to-cell capture correspondence.

  • sectionDynamical departures become record departuresDestructive verification and complete records › Dynamical departures become record departures · lines 1665–1677
    Open as its own page

    Let a fixed bounded event be implemented after access and optional decoding. Write its ideal field of finite-cell effects as . For each message preparation , let its complete record error be . For example, with decoder and basis rotation,

  • theoremTheorem: Complete operational discriminationDestructive verification and complete records › Dynamical departures become record departures · Em03-E@1#thm:recordgap · proof attached · lines 1678–1699
    Open as its own page

    For two named message preparations,

    All ordinary and failure records are included.

    Applying and then -readout gives ideal gap for . Applying and then -readout gives ideal gap for .

    Proof. An effect expectation changes by at most the trace distance of the complete records. Apply this to each preparation and use the reverse triangle inequality. The two explicit gaps follow from .

  • sectionDynamical departures become record departuresDestructive verification and complete records › Dynamical departures become record departures · lines 1699–1704
    Open as its own page

    The computational-basis witness remains nonzero at . The -basis witness vanishes there. A classical recovery success is therefore not substituted for quantum recovery.

  • sectionIndependent-trial statistical certificateDestructive verification and complete records › Independent-trial statistical certificate · lines 1705–1721
    Open as its own page

    Suppose independent attempted trials are made with fixed preparations and fresh independent apparatus. For , set

    Then with probability at least ,

    where is the named ideal event gap.

  • proofProofDestructive verification and complete records › Independent-trial statistical certificate · lines 1722–1731
    Open as its own page

    Proof. For an independent Bernoulli sample, . One elementary proof bounds the centered log moment-generating function by : its second derivative is a variance on an interval of length one and is at most . Exponential Markov inequality and optimization prove the concentration estimate. Apply it to the two ensembles, take a union bound, and combine with Theorem thm:recordgap.

  • sectionIndependent-trial statistical certificateDestructive verification and complete records › Independent-trial statistical certificate · lines 1731–1736
    Open as its own page

    Independent trials and fresh resets are additional experimental requirements. They are not consequences of a one-shot diamond-distance estimate.

  • propositionProposition: Destructive measure-and-prepare obstructionDestructive verification and complete records › Why classical records cannot replace the coherent output · Em03-E@1#prop:EB · proof attached · lines 1739–1765
    Open as its own page

    Any protocol that first reduces all message-bearing receiver systems to classical records and then prepares a qubit from those records is entanglement breaking. Its recovery half-diamond error on an arbitrary qubit message is at least .

    At , this lower bound is attained by logical -measurement followed by preparation of its reported eigenstate, but that protocol is not exact quantum recovery.

    Proof. The referenced output is a sum

    of positive product operators, hence is separable. For a normalized pure product state, Bell overlap is at most by Cauchy–Schwarz. Convexity gives the same bound for all separable two-qubit states. Testing the Bell projector gives half-diamond error at least .

    Logical -measurement and preparation implement . Lemma lem:Pauli gives error .

  • sectionWhy classical records cannot replace the coherent outputDestructive verification and complete records › Why classical records cannot replace the coherent output · lines 1765–1774
    Open as its own page

    The measure-and-prepare characterization is standard EntanglementBreaking; the qubit obstruction has been proved here. It applies when all continuing quantum influence is replaced by classical records. It does not prohibit discarding independent key and count metadata after coherent logical correction.

E6: entropy trajectories and reference information

  • sectionE6: entropy trajectories and reference informationE6: entropy trajectories and reference information · lines 1776–1786
    Open as its own page

    Let

    The entropy calculations use the same dynamics as the channel and recovery calculations.

  • theoremTheorem: Named entropy and information trajectoriesE6: entropy trajectories and reference information · Em03-E@1#thm:entropy · proof attached · lines 1787–1839
    Open as its own page

    For pure message input , radiation entropies are

    For the maximally entangled input,

    These are entropy trajectories of the declared finite model.

    Proof. Occupation outputs contribute independent entropies . The emitted key contributes two bits. For input , each occupied ciphertext conditioned on the key is pure, and vacuum and occupied sectors are orthogonal. Their mixture contributes .

    For the Bell input the message marginal is . Each successful ciphertext marginal is , contributing one bit with weight . Thus

    The successful reference–ciphertext state conditioned on the key is a mixture of two orthogonal Bell states with probabilities , of entropy . The failed reference state is , of entropy one. Therefore

    Using gives . At the earlier prefixes the output is independent of . The optimal fidelities are Theorem thm:recovery.

  • sectionE6: entropy trajectories and reference informationE6: entropy trajectories and reference information · lines 1839–1854
    Open as its own page

    At , pure-input radiation entropy is the same for and , although their optimal recovery errors are and zero. The reference mutual information is one and two bits, respectively. This is an explicit reason to report entropy, classical distinguishability, and referenced recovery separately.

    No Page-curve interpretation is assigned to these tables. Fine-grained gravitational entropy calculations address a different construction problem EntropyReview; an entropy trajectory alone does not specify the microscopic channel used here.

Resources, tolerance schedules, and model limitations

  • sectionFinite resource ledgerResources, tolerance schedules, and model limitations › Finite resource ledger · lines 1859–1967
    Open as its own page

    Let

    The source requires binary slots under the stated embedding. The inaccessible key purification and dephasing environment require three more slots. The emitted cells require slots in their binary embedding. These systems are counted separately from the observer's registers.

    {}1.12

    ComponentExplicit resource or boundary
    ComponentExplicit resource or boundary
    EncodingOne message qubit; two fuel qubits; two key qubits; two occupation-source registers of dimensions .
    PurificationsTwo inaccessible key-copy qubits and one dephasing qubit. They are included in the complement, not observer assistance.
    Internal controlsTwo key Hadamards; two key-copy controlled-NOT gates; one controlled dephasing rotation; controlled and controlled encryption.
    EmissionTwo norm-one payload exchange generators and two norm-one occupation exchange generators; specified pulse areas, durations, and ordering.
    Occupation calibrationThe amplitudes are parameters of the Hamiltonian. Preparing those control coefficients is a model resource, not a dynamical derivation of the Hawking spectrum.
    Coherent access receiver qubits. Each physical nonvacuum basis label has a specified swap pair. The full finite transfer generator is bounded.
    Transfer occupancyIf cells and receiver registers are simultaneously laboratory systems, transfer uses up to binary slots, before adding spectators or preparation systems.
    DecoderTwo controlled Pauli corrections and one validity-controlled swap with a fresh qubit. The stated primitive decoder uses peak , before spectators. No optimality for a restricted gate compiler is claimed.
    ReadoutPointer width equals the tested register width. Raw outcomes, assignment failures, and readiness failures remain visible. Full-register readout can require another pointer slots.
    Classical storageRaw words, validity status, setting, failure labels, and trial index. Classical records are not quantum memory.
    Preparation and resetFresh independent systems, their states, replacement channels, and any readiness flag. Cooling and bath delivery are external physical resources.
    EnergyInitial source energy . Payload radiation mean energy ; occupation radiation mean energy . The remaining source has the complementary mean energy.
    Work and physical localityThe free-energy conservation theorem is not a reset-work, switching-work, local-field, or apparatus-cost theorem.

    Supplier buffering, environmental purification storage, and observer live storage are different resources. No quantum storage outside this ledger is used to claim a receiver memory optimum.

  • sectionA constructive recovery allowanceResources, tolerance schedules, and model limitations › A constructive recovery allowance · lines 1968–1998
    Open as its own page

    For a requested recovery tolerance , it suffices that

    A useful sufficient parameter bound is

    Thus finite pulses with close to one and sufficiently small complete implementation deviations meet the allowance within the declared tunable model family.

    Occupation accuracy is a separate allowance:

    For fixed , finite can meet any positive occupation-state tolerance.

    These choices are not arbitrary accuracy on fixed hardware. Pulse selectivity, preparation error floors, storage loss, control bandwidth, and correlated apparatus memory can prevent the required bounds.

  • sectionNo efficient-decoder claim beyond the declared controlsResources, tolerance schedules, and model limitations › No efficient-decoder claim beyond the declared controls · lines 1999–2011
    Open as its own page

    The decoder is explicit and executable in the printed finite control set. Its validity-controlled swap is a named bounded matrix. Translating that primitive into a restricted laboratory architecture needs a separate compilation and leakage proof.

    The model requires access to both key and ciphertext payloads. Restricting access to either whole cell gives a replacement channel and optimal error , regardless of an observer's classical computational power.

Debugging and retained non-transfer boundaries

  • sectionDebugging and retained non-transfer boundariesDebugging and retained non-transfer boundaries · lines 2013–2084
    Open as its own page

    • Dynamics precedes output states. All source controls, pulse areas, emission matrices, initial states, and radiation factors are specified before the channel calculation. The off-diagonal matrix unit is evaluated explicitly.

    • Degenerate input energy is not thermal selection. Messages have the same initial energy. Energy conservation does not determine , or the occupation amplitudes.

    • Mixed key purification is retained. The key is random only after tracing its independent purifying system. That system belongs to every relevant complementary output.

    • The dephasing environment is not silently discarded. Its distinguishable states quantify successful-sector leakage. An observer who lacks it cannot invert dephasing on an unknown entangled input.

    • Private marginals are not a private collective channel. Each single cell is a replacement channel. The two-cell channel contains the key–ciphertext correlations needed for recovery.

    • Calibration is not Hawking-law derivation. The occupation weights are taken from the specified Em03-A–C baseline and inserted into finite Hamiltonians. The result derives their finite model output, not the original greybody-weighted Bose law.

    • Payload degrees of freedom are not hidden in scalar modes. They have their own Hilbert spaces and energy ledger. Scalar occupation matching does not identify the full cell state with an Em03-C two-packet state.

    • Diamond recovery and a Bell test are distinct criteria. They have different definitions. Their simultaneous optimal values here follow from a model-specific Pauli and Bell argument, not a silent fidelity-to-diamond substitution.

    • Complementary leakage uses a named metric and center. Equation (eq:leakage) includes every inaccessible system. It is not an unrestricted optimization over replacement centers, nor a general equality between leakage and recovery.

    • Coherent return precedes destructive verification. Classical records cannot replace the returned quantum message. Metadata can be discarded after coherent correction without measuring the logical output.

    • Finite access is newly constructed. The access proof concerns these complete finite cells. It does not extend a two-packet scalar capture theorem to an arbitrary evaporation history.

    • Entropy is not a decoder certificate. The same pure-input radiation entropy can accompany different reference correlations and recovery errors.

    • Perturbation estimates require complete interfaces. Initial purification, independent preparation, invalid words, failure outcomes, cross-register coupling, and references are part of the stated comparisons.

    • The model is not a gravity-generated-entanglement test. The specified non-gravitational finite controls can transfer pre-existing reference entanglement. They do not demonstrate a gravitational mediator or exclude classical gravity models.

  • sectionDebugging and retained non-transfer boundariesDebugging and retained non-transfer boundaries · lines 2084–2093
    Open as its own page

    • Unrelated analytic admission gates remain untouched. No local gravitational insertion, characteristic graph product, Ward coefficient, O.1 completion, or XIV–XV admission is constructed or inferred.

Physical successors and the exact release

  • sectionWhat a black-hole identification would requirePhysical successors and the exact release › What a black-hole identification would require · lines 2098–2123
    Open as its own page

    A physical successor must supply:

    1. a named microscopic gravitational theory and a source input space with a justified encoding;

    2. an independently motivated interaction law, rather than a designed private-channel circuit;

    3. the relation of emitted degrees of freedom to local or asymptotic field observables, including species and angular resolution;

    4. collapse, propagation, and accessible-mode identification;

    5. the regime of validity, approximation topology, renormalization where relevant, and remainder estimates;

    6. a receiver coupling and calibrated coherent-access model.

    The compact-test peeling estimate in Em03-A is not a collapse packet theorem. The effective port of Em03-B–C is not a local Schwarzschild detector. Neither missing identification is supplied by the finite exchange interactions here.

  • theoremTheorem: Em03-E finite dynamical releasePhysical successors and the exact release › What a black-hole identification would require · Em03-E@1#thm:release · proof attached · lines 2124–2193
    Open as its own page

    For the explicitly specified finite model:

    1. a message qubit is encoded into a degenerate source-energy sector with independent initial environments;

    2. explicit bounded internal and emission Hamiltonians generate the two radiation prefixes and conserve the declared free energy;

    3. the complete radiation channel, all message matrix-unit outputs, and the complementary channel are calculated;

    4. individual cells are exactly message-independent, while collective radiation has the distinguishability values of Proposition prop:distinguish;

    5. an explicit complete decoder attains the optimal referenced recovery error and Bell-test fidelity (eq:optimalrecovery);

    6. the named complementary-channel replacement distance is exactly (eq:leakage);

    7. calibrated finite occupation emissions have the state, count, mean, and replacement-channel comparisons in Theorem thm:matching;

    8. newly constructed finite coherent access and complete decoder controls give the end-to-end budget (eq:endrecovery);

    9. destructive verification has complete-record and independent-trial certificates, while classical measure-and-prepare processing has the stated quantum-recovery obstruction;

    10. the exact entropy and reference-information trajectories are those of Theorem thm:entropy.

    These conclusions are finite model statements. They do not derive the interactions from quantum gravity, identify the payloads with scalar Hawking packets, construct local black-hole evaporation, derive a Page curve, restore black-hole unitarity, resolve the firewall question, or determine an evaporation endpoint.

    Proof. The encoding and model specification establish (i). Theorem thm:evolution proves (ii). Theorems thm:channel and thm:complement prove (iii). Corollary cor:private and Proposition prop:distinguish prove (iv). Theorem thm:recovery proves (v). Theorem thm:leakage proves (vi). Theorem thm:matching proves (vii). Proposition prop:access, Lemma lem:stability, and Theorem thm:endrecovery prove (viii). Lemma lem:readout, Theorem thm:recordgap, the printed concentration argument, and Proposition prop:EB prove (ix). Theorem thm:entropy proves (x).

    No named gravitational microscopic dynamics or local field–probe correspondence is among the model inputs. The separate comparison maps explicitly concern selected occupation factors. The excluded physical conclusions therefore are not additional assertions of the release.

  • sectionWhat a black-hole identification would requirePhysical successors and the exact release › What a black-hole identification would require · lines 2193–2204
    Open as its own page

    scope statement. Em03-E derives microscopic-input-dependent radiation channels from a specified finite dynamical model, evaluates classical distinguishability and referenced quantum recovery, and compares selected outputs with the Em03-A–C semiclassical interface. It does not derive those dynamics from quantum gravity, identify the model with a local black-hole evaporation process, or resolve the horizon-smoothness and evaporation-endpoint questions.

Declarations

  • sectionDeclarationsDeclarations · lines 2205–2229
    Open as its own page

    and verification availability. The analytical specifications and proofs are contained in this source. No numerical execution, compiled archive, formal proof certificate, experimental calibration, or apparatus demonstration is supplied or asserted.

    . Pauli randomization, measure-and-prepare channels, and general recovery/complementarity frameworks are established quantum-information constructions. The present manuscript claims the explicitly stated finite dynamical realization and its model-specific calculations, not novelty for those underlying principles.

    status. Em03-A–C are used through the supplied sources and the exact comparison data stated here. Unrelated retrieved manuscript passages and registry descriptions are not formal premises. No statement about a missing physical construction is promoted to a universal nonexistence theorem.

  • bibliographyReferencesDeclarations · lines 2230–2324
    Open as its own page

    Em03A

    N. Cheung, Em03-A: A Fixed-Background Hawking Emission Theorem, version 1, 8 October 2026. Supplied source 03-A-v1.tex. Used for the specified outgoing occupation density and packet mean, not as a microscopic evaporation channel.

    Em03B

    N. Cheung, Em03-B: A Certified Apparatus-Model Readout of One Hawking Packet, version 2, 8 October 2026. Supplied source 03-B-v2.tex. One-packet effective capture, coherent finite extraction, complete instruments, and reference-stable model comparisons.

    Em03C

    N. Cheung, Em03-C: Joint Hawking-Packet Correlations and Certified Tests of Semiclassical Departures, version 1, 8 October 2026. Supplied source 03-C.tex. Joint finite-mode Gaussian baseline, complete records, information-sensitive finite measurements, and retained local-field matching obligations.

    PrivateChannel

    M. Mosca, A. Tapp, and R. de Wolf, Private Quantum Channels and the Cost of Randomizing Quantum Information, arXiv:quant-ph/0003101. Pauli randomization and private quantum-channel context. The finite emission Hamiltonians in this manuscript are specified and evaluated independently.

    KSW

    D. Kretschmann, D. Schlingemann, and R. F. Werner, The Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation, IEEE Transactions on Information Theory 54 (2008), 1708–1717. arXiv:quant-ph/0605009. doi:10.1109/TIT.2008.917696. General channel-continuity and information–disturbance context. No general theorem constant is substituted for the exact model calculations here.

    BenyOreshkov

    C. Bény and O. Oreshkov, General conditions for approximate quantum error correction and near-optimal recovery channels, Physical Review Letters 104 (2010), 120501. arXiv:0907.5391. doi:10.1103/PhysRevLett.104.120501. Approximate correction and environmental optimization in a worst-case entanglement-fidelity framework. The diamond and Bell-test optima used here are proved directly.

    HaydenPreskill

    P. Hayden and J. Preskill, Black holes as mirrors: quantum information in random subsystems, Journal of High Energy Physics 09 (2007), 120. arXiv:0708.4025. doi:10.1088/1126-6708/2007/09/120. Conditional scrambling and extensive-radiation-access comparison; not a derivation of the present emission interactions.

    EntanglementBreaking

    M. Horodecki, P. W. Shor, and M. B. Ruskai, General Entanglement Breaking Channels, arXiv:quant-ph/0302031. Measure-and-prepare and separability characterizations. The qubit Bell-overlap obstruction required here is proved explicitly.

    Watrous

    J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018. Chapters 2–3: channels, instruments, trace distances, and completely bounded trace norms.

    EntropyReview

    A. Almheiri, T. Hartman, J. Maldacena, E. Shaghoulian, and A. Tajdini, The entropy of Hawking radiation, Reviews of Modern Physics 93 (2021), 035002. arXiv:2006.06872. doi:10.1103/RevModPhys.93.035002. Gravitational entropy context only; not the microscopic dynamics, decoder, or finite entropy trajectory constructed here.