All manuscripts

Manuscript Em03-C@1 · Em03-C-v1.tex · 47dd71ec

Em03-C Joint Hawking-Packet Correlations and Certified Tests of Semiclassical Departures Finite-mode states, information-sensitive readout, and local-field matching obligations

Export Em03-C-v1.tex

Constructs a two-packet operational interface for the stationary free-scalar Hawking model. Under the inherited centered quasifree prescription, the joint restriction is a normal zero-mean gauge-invariant Gaussian, with a joint count generating function and interpacket covariance equal to the squared modulus of the off-diagonal occupation. Orthogonal packets are independent only when that off-diagonal covariance vanishes. Number counts do not determine its phase. A shared temporal port captures both compact tests during one switching interval. Joint preparation, memory coupling, and correlated assignment noise enter one reference-stable budget. Destructive count tails and coherent state-approximation tails are distinguished. After extraction, an informationally complete Pauli family has a trace-distance reconstruction certificate under an independent-trial assumption. A bounded-effect discrimination theorem certifies a record departure only when it exceeds the combined implementation budget. An input-independent radiation channel cannot recover an unknown microscopic label or preserve its reference entanglement. The two-mode specialization is proved in this manuscript. En02-E's finite-mode Gaussian theorem is a companion account, not an imported unseen premise, and it does not supply this shared port. Em03-A's packet mean does not construct this apparatus. Em03-B's one-packet budget is not this joint budget. En02-D's transmission probability does not select the occupation matrix. Landmark I is optional semantic input after the carrier is qubits and does not supply the field state. Bulk Unruh existence remains an external theorem. This is 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. Local-field matching, collapse-packet convergence, and microscopic evaporation dynamics remain open. 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. 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 147–179
    Open as its own page

    We construct a two-packet operational interface for the stationary free-scalar Hawking model. The inherited outgoing quasifree prescription determines a normal joint Gaussian density, its joint count generating function, and its interpacket number covariance. Orthogonal packet modes are independent precisely when their off-diagonal occupation covariance vanishes.

    The apparatus construction uses two memories coupled to one effective temporal port. Compact temporal tests are corrected at zero frequency, jointly orthonormalized, and compared with the desired packet plane. An explicit matrix-valued passive interaction captures both tests during the same switching interval. This avoids treating overlapping windows as independent apparatuses. Joint preparation errors, memory and register coupling, and correlated assignment noise enter one complete, reference-stable budget.

    After coherent extraction, bounded single-qubit rotations and destructive pointer readout implement an informationally complete Pauli measurement family. We prove its effects, its complete-record implementation bound, an independent-trial statistical estimate, and a trace-distance reconstruction certificate. Destructive count tails and coherent state-approximation tails are distinguished.

    A bounded-effect discrimination theorem translates a specified state departure into a certifiable record departure. A separate input-information theorem proves that an input-independent radiation channel cannot recover an unknown microscopic label or preserve its reference entanglement. The results concern a declared effective apparatus and a fixed-background baseline. They do not construct a local Schwarzschild detector, a collapse packet limit, a quantum-gravity correction, or microscopic evaporation dynamics.

Scope, dependencies, and the release boundary

  • sectionScope, dependencies, and the release boundaryScope, dependencies, and the release boundary · lines 185–226
    Open as its own page

    The progression is

    The supplied sources Em03A,Em03B do not contain an unknown black-hole microstate as a dynamical input. This manuscript does not insert one implicitly. A correction state, when discussed, must be supplied as additional model data.

    Three levels remain separate:

    1. Radiation-state interface: a specified algebraic field state and its normal finite-mode restrictions;

    2. Effective apparatus model: a temporal port, memories, register controls, preparations, and complete readout instruments;

    3. Physical correspondence: a local field–probe coupling, its relation to the effective port, and a calibrated implementation.

    Only the first two levels are constructed here.

    Figure fig:dependency records the dependency order used below. Solid arrows are channels or restrictions defined on their stated input spaces. Dashed boxes are comparisons that use a named state, not channels. The third level is drawn only as an open obligation.

  • figureDependency of the joint apparatusScope, dependencies, and the release boundary · Em03-C@1#fig:dependency · lines 227–251
    Radiation interface
    n(ω),  An(\omega),\; A
    Compact tests
    f1,f2f_1,f_2
    Shared port
    λ,Ω,τ\lambda,\Omega,\tau
    Settings
    UX,UYU_X,U_Y
    Extraction
    Ua,KU_{\boldsymbol a,\boldsymbol K}
    Storage
    s,  τ∗=τss,\;\tau_*=\tau s
    Pointer and WW
    failures kept
    Tomography and
    discrimination
    Not constructed: local probe, collapse, microstate channel
    Retained: spectators SS and reference RR. Discarded after use: memory, measured register, reset environment.

    Dependency of Em03-C. The first two columns are the radiation interface and the declared apparatus. The dashed box is not a constructed mechanism. Not a local Schwarzschild detector, and not an admission of a quantum coefficient.

  • sectionScope, dependencies, and the release boundaryScope, dependencies, and the release boundary · lines 251–291
    Open as its own page

    The finite-mode Gaussian construction is standard in structure Weedbrook. The supplied companion account attributes a general version to En02-E, at :gaussian, :outcov, and :K En02EAccount. The full En02-E source is not supplied. We therefore give the needed specialization and its proof explicitly rather than importing an unseen theorem or claiming novelty for Gaussian diagonalization.

    The remaining constructions are ordinary channel calculations. Landmark I is optional semantic input for calling finite destructive readout ; it is not a field-state or apparatus premise.

    boundary. The source supplies analytical arguments. No compilation, machine checking, numerical experiment, statistical calibration, or physical realization is asserted. The term “certified” refers to explicit mathematical estimates under stated model data.

    . We use , , and

    Channels are normal CPTP maps on trace-class operators. A finite spectator is denoted ; an arbitrary finite-dimensional external reference is denoted . Their tensor placements are retained throughout. The normal state identities also hold with separable references.

    We write for bosonic second quantization of a one-particle unitary. This notation is distinct from the greybody probability .

C0: the complete two-packet semiclassical baseline

  • assumptionAssumption: Stationary outgoing radiation inputC0: the complete two-packet semiclassical baseline › Inherited state and the covariance convention · Em03-C@1#ass:radiation, Em03-C@1#eq:radiationdensity · lines 298–324
    Open as its own page

    Fix one real angular harmonic of degree in the massless scalar model of Em03-A. The outgoing radiation state is centered, gauge-invariant, regular, and quasifree, with

    where

    Annihilation tests are conjugate-linear:

  • sectionInherited state and the covariance conventionC0: the complete two-packet semiclassical baseline › Inherited state and the covariance convention · Em03-C@1#eq:A · lines 324–370
    Open as its own page

    This input uses Em03-A's boundary-state prescription, :horizonoccupation, :quantumscatter, :numberdensity, and :packetlaw. Its bulk Hadamard identification remains the declared external Dappiaggi–Moretti–Pinamonti input DMP. Neither that global proof nor Em03-A's manuscript proofs are independently verified here.

    Choose orthonormal , supported in a common compact band

    Set and . Then . Define

    Thus

    The transposition is important. Equation (eq:A) is not the formula for with the same indices under the predecessor's test convention.

    The matrix is positive semidefinite and satisfies

    Figure fig:covariance fixes the index convention that the following characteristic function, passive transformation, and Wick formula all use. A complex off-diagonal entry is the control that exposes an accidental transpose.

  • figureCovariance orientationC0: the complete two-packet semiclassical baseline › Inherited state and the covariance convention · Em03-C@1#fig:covariance · lines 371–387
    Conjugate-linear test
    a(h)=∫h‾ aout dωa(h)=\int \overline h\, a_{\mathrm{out}}\,d\omega
    [bi,bj†]=δij[b_i,b_j^\dagger]=\delta_{ij}
    bi=a(hi)b_i=a(h_i)
    Aij=⟨bj†bi⟩A_{ij}=\langle b_j^\dagger b_i\rangle
    ⟨bi†bj⟩=Aji\langle b_i^\dagger b_j\rangle=A_{ji}
    Used by tr⁡ρD(z)\operatorname{tr}\rho D(z), Γ(W)\Gamma(W), and Wick
    Synthetic control: A12=0.2+0.1iA_{12}=0.2+0.1i is not A21A_{21}. Equal diagonals do not license a transpose.

    Covariance orientation. The diagram is a convention check, not a numerical diagonalization and not a physical calibration.

  • sectionNormal density and uniquenessC0: the complete two-packet semiclassical baseline › Normal density and uniqueness · lines 390–396
    Open as its own page

    For , define

  • theoremTheorem: Normal two-mode Gaussian restrictionC0: the complete two-packet semiclassical baseline › Normal density and uniqueness · Em03-C@1#thm:gaussian, Em03-C@1#eq:characteristic, Em03-C@1#eq:jointdensity · proof attached · lines 397–458
    Open as its own page

    Under Assumption ass:radiation, the two-packet state is the unique normal density on with characteristic function

    If , then

    A zero eigenvalue means vacuum in that diagonal mode. No density operator for the entire stationary continuum is required.

    Proof. Restriction and complex-linear scattering preserve the inherited centered quasifree prescription. Its zero anomalous covariance and number matrix (eq:A) give (eq:characteristic).

    For completeness, let be independent circular complex Gaussian random variables with variances , with a zero-variance variable identically zero, and put . The positive trace-class mixture

    has trace one and characteristic function

    For a single variance , angular and radial integration give the number probabilities

    Consequently the mixture is (eq:jointdensity). Equality of Weyl characteristic functions identifies the abstract restricted state and uniquely determines its normal density. This proves normality by construction.

  • sectionNormal density and uniquenessC0: the complete two-packet semiclassical baseline › Normal density and uniqueness · lines 458–464
    Open as its own page

    Figure fig:gaussian separates the two constructions of the same normal density: diagonal thermal modes, and a coherent-state mixture with covariance . Neither arrow is a density of the whole continuum.

  • figureTwo routes to the normal two-mode restrictionC0: the complete two-packet semiclassical baseline › Normal density and uniqueness · Em03-C@1#fig:gaussian · lines 465–481
    Characteristic function
    e−∣z∣2/2−z†Aze^{-|z|^2/2-z^\dagger A z}
    A=Wdiag⁡(λr)W†A=W\operatorname{diag}(\lambda_r)W^\dagger
    geometric factors
    Circular Gaussians β\beta
    α=Wβ\alpha=W\beta, mixture
    Unique normal ρ0\rho_0 on F(C2)\mathcal F(\mathbb C^2)

    Two routes to the normal two-mode restriction. A zero eigenvalue is vacuum in that diagonal mode. The figure does not execute a Fock truncation.

  • sectionJoint count law and correlationsC0: the complete two-packet semiclassical baseline › Joint count law and correlations · lines 484–491
    Open as its own page

    Write

  • theoremTheorem: Joint count generating function and Wick identitiesC0: the complete two-packet semiclassical baseline › Joint count law and correlations · Em03-C@1#thm:counts, Em03-C@1#eq:PGF, Em03-C@1#eq:numbercov, Em03-C@1#eq:wick · proof attached · lines 492–556
    Open as its own page

    For , with ,

    More explicitly,

    Its Taylor coefficients at give the complete joint count law.

    Each marginal is geometric with mean , and

    Moreover,

    The packet factors are statistically independent if and only if .

    Proof. Conditional on a coherent amplitude , the two counts are independent Poisson variables of means . The coherent-state mixture in Theorem thm:gaussian gives

    The circular Gaussian integral equals

    This also covers singular by its diagonal Gaussian construction. Setting either gives its geometric marginal.

    Gaussian contraction gives (eq:wick). For different modes, ; hence . The same-mode calculation gives the stated variance. All polynomial moments are finite.

    If , the characteristic function factorizes, so the state is the product of its marginals. Conversely, a product centered state has zero cross covariance.

  • exampleExample: Orthogonality without independenceC0: the complete two-packet semiclassical baseline › Joint count law and correlations · lines 558–567
    Open as its own page

    Let be normalized tests with disjoint supports and occupations . Then

    are orthonormal, but . Disjoint supports of themselves would instead force .

  • sectionJoint count law and correlationsC0: the complete two-packet semiclassical baseline › Joint count law and correlations · lines 567–579
    Open as its own page

    The joint number law depends on only through its modulus. A local phase transformation changes its phase without changing any number-diagonal probability. Number counts therefore do not determine the complete joint state.

    Figure fig:counts records what the generating function determines and what it does not. Orthogonal packets are independent only when . Equal moduli with different phases share the number law and are separated only by a phase-sensitive observable.

  • figureJoint count lawC0: the complete two-packet semiclassical baseline › Joint count law and correlations · Em03-C@1#fig:counts · lines 580–598
    G(s)=1/det⁡(I+A(I−S))G(s)=1/\det(I+A(I-S))
    Marginals
    geometric, mean νi\nu_i
    Cov⁡=∣A12∣2\operatorname{Cov}=|A_{12}|^2
    Var⁡=νi(1+νi)\operatorname{Var}=\nu_i(1+\nu_i)
    Phase of A12A_{12}
    not fixed by counts
    Synthetic split: h±=(u±v)/2h_\pm=(u\pm v)/\sqrt2 can be orthonormal with A12≠0A_{12}\neq 0 when νu≠νv\nu_u\neq\nu_v. Disjoint h1,h2h_1,h_2 force A12=0A_{12}=0.

    Joint count law. The dashed box is a state distinction invisible to number-diagonal records, including the later synthetic pair . Not an executed coefficient comparison.

C1 interface: joint carriers and referenced records

  • sectionTwo cutoffs per packetC1 interface: joint carriers and referenced records › Two cutoffs per packet · lines 606–643
    Open as its own page

    Choose reported saturation levels and control-domain cutoffs . To avoid confusing operators and cutoff values, abbreviate

    Let .

    The one-mode carrier map is

    Its Kraus maps are and , , whose effects sum strongly to the identity.

    Set

    The binary embeddings send carrier integer to its fixed binary word. Define

  • sectionComplete raw alphabet and decodingC1 interface: joint carriers and referenced records › Complete raw alphabet and decoding · Em03-C@1#eq:totaldecoder · lines 644–681
    Open as its own page

    For raw integers , put

    An ordinary record contains both raw words, both decoded integers, and an “ordinary” status:

    Enlarge this alphabet by all declared failure records. Failure records retain their labels; their decoded pair is . A different bounded assignment could be specified, but must be fixed before using a mean certificate.

    The record can be embedded into . We denote the whole classical output by . For arbitrary record operators, the total decoder is

    It is CPTP on the full alphabet.

    For computational destructive readout, set

    The measured register is absent from the output.

  • sectionExact record identity and tailC1 interface: joint carriers and referenced records › Exact record identity and tail · Em03-C@1#eq:jointrecord · lines 682–704
    Open as its own page

    For , define the positive blocks

    Let

    The ideal full record is

  • theoremTheorem: Joint referenced destructive recordC1 interface: joint carriers and referenced records › Exact record identity and tail · Em03-C@1#thm:jointrecord, Em03-C@1#eq:jointtail · proof attached · lines 705–746
    Open as its own page

    For every normal input,

    Let be its decoded version and the unsaturated joint number record. In the common countable record space,

    For the baseline,

    No independence assumption is needed.

    Proof. Tensor the two Kraus families. Destructive readout selects the number-diagonal input blocks and sums exactly the blocks with the same clipped pair. Positive block traces sum to one, so the series converge in trace norm.

    The two decoded records agree on the rectangular interior. Outside that rectangle, the unsaturated record has positive blocks that are absent from the clipped record. The clipped record adds their positive mass to boundary records inside the rectangle. These inside and outside differences occupy orthogonal classical records. Their total trace norm is twice the outside probability, proving (eq:jointtail). The union bound and the geometric marginal tails give the last assertion.

  • sectionExact record identity and tailC1 interface: joint carriers and referenced records › Exact record identity and tail · lines 746–753
    Open as its own page

    The marginal ideal mean deficit is exactly

    This statement is unaffected by interpacket correlations.

  • sectionA different tail for coherent comparisonsC1 interface: joint carriers and referenced records › A different tail for coherent comparisons · lines 754–764
    Open as its own page

    Embed the binary register into the oscillator pair by

    including unused binary words. Define

  • lemmaLemma: Coherent carrier approximationC1 interface: joint carriers and referenced records › A different tail for coherent comparisons · Em03-C@1#lem:coherenttail, Em03-C@1#eq:coherenttail · proof attached · lines 765–806
    Open as its own page

    For any normal packet–reference input,

    where

    Proof. The embedded carrier output is

    This follows by separating the low–low Kraus map from all other Kraus maps.

    Purify to , and set . Writing , one has . The rank-two calculation gives

    Partial trace contracts this norm. Adding costs at most in trace norm. Divide by two and cap at one.

  • sectionA different tail for coherent comparisonsC1 interface: joint carriers and referenced records › A different tail for coherent comparisons · lines 806–817
    Open as its own page

    The exact probability error (eq:jointtail) concerns destructive number records. It is not the coherent state certificate (eq:coherenttail).

    Figure fig:tails separates the two cutoff errors. The destructive distance is exactly the outside probability. The coherent comparison pays an additional square-root term because the inside and outside amplitudes need not occupy orthogonal record labels.

  • figureDestructive record tail against coherent approximationC1 interface: joint carriers and referenced records › A different tail for coherent comparisons · Em03-C@1#fig:tails · lines 818–833
    Retained rectangle
    ni≤ain_i\le a_i
    Overflow
    either mode, or both
    Record distance
    =pa=p_{\boldsymbol a}
    Coherent distance
    ≤t(p)=min⁡{1,p+p/2}\le t(p)=\min\{1,\sqrt p+p/2\}
    Saturation Kraus copies the low block and sends overflow to the corner ∣ai⟩\lvert a_i\rangle. Off-diagonal coherence across the cut is not preserved.

    Destructive record tail against coherent carrier approximation. Independence of the packets is not used. Not a laboratory histogram.

Joint temporal modes and participating radiation

  • sectionThe effective port and its domainJoint temporal modes and participating radiation › The effective port and its domain · lines 841–877
    Open as its own page

    As in Em03-B, the effective port has one-particle space . Its positive-frequency sector carries (eq:radiationdensity); its negative-frequency sector is a new independent auxiliary vacuum.

    This two-sided Markov envelope is model data. It is not a physical negative-energy sector of the Schwarzschild scalar. Unselected positive-frequency radiation is not replaced by vacuum.

    Use

    The input annihilator is the temporal smearing .

    Finite restrictions are defined on the weighted domain

    where on positive frequencies and zero on negative frequencies. Compact positive-frequency tests are dense in the positive-frequency weighted space. Covariances and Gaussian Weyl positivity extend by continuity. Every finite canonical subspace with finite occupation matrix has a normal density by the same diagonalization proof as Theorem thm:gaussian.

    This extension is a radiation-test construction, not a new local bulk characteristic-restriction theorem.

  • sectionJoint compact-window constructionJoint temporal modes and participating radiation › Joint compact-window construction · lines 878–908
    Open as its own page

    Choose real , equal to one on , and choose with . For , put

    Let have columns . For sufficiently large , is positive definite. First orthonormalize:

    Let have columns . Write the left polar decomposition

    and define

    The columns of are denoted .

  • lemmaLemma: Orthonormal finite windows with infrared controlJoint temporal modes and participating radiation › Joint compact-window construction · Em03-C@1#lem:windows · proof attached · lines 909–952
    Open as its own page

    For sufficiently large :

    1. are orthonormal smooth tests supported in , and each has zero integral;

    2. their Fourier transforms converge columnwise to in the Schwartz topology and in the weighted occupation norm;

    3. the participating plane

      has dimension at most four and a finite occupation matrix.

    Proof. Each is Schwartz, and because vanishes near zero. Hence

    decays faster than every inverse power of . The windowed error and the correcting bump tend to zero in every Schwartz seminorm. Thus ; the inverse square root and the polar factors tend to . Their finite matrix operations preserve supports and zero integrals.

    For ,

    A Fourier test with satisfies

    On , is bounded. Schwartz convergence therefore implies weighted convergence. It also proves finite occupation for every vector in .

  • sectionJoint compact-window constructionJoint temporal modes and participating radiation › Joint compact-window construction · lines 952–965
    Open as its own page

    Ordinary temporal windowing alone would not establish integrability at zero using only . The zero-integral correction avoids importing a low-frequency greybody asymptotic that has not been proved here.

    Figure fig:windows is the temporal-mode interface used before capture. The zero-integral correction is what makes the Fourier test vanish at . Ordinary compact windowing, without that correction, does not by itself give finite occupation from .

  • figureCompact temporal tests and infrared controlJoint temporal modes and participating radiation › Joint compact-window construction · Em03-C@1#fig:windows · lines 966–983
    Band-limited targets hih_i
    Window on (−2L,2L)(-2L,2L)
    plus zero-mean correction
    Joint Gram step
    then polar alignment
    Uncorrected window
    need not have finite ν\nu
    f^i(0)=0\widehat f_i(0)=0
    weighted nn integrable
    Orthonormal fif_i
    ∫fi=0\int f_i=0

    Compact temporal tests and infrared control. Convergence as increases is the analytical Schwartz statement of the window lemma. The figure is not a numerical quadrature.

  • sectionPrincipal-plane comparisonJoint temporal modes and participating radiation › Principal-plane comparison · lines 986–1014
    Open as its own page

    Diagonalize

    The principal target modes and captured modes obey

    For nonzero , the are orthonormal and orthogonal to the target plane. Zero-angle terms are omitted.

    Let be the passive one-particle rotation sending to in each principal plane and acting identically on its orthogonal complement. Let select the target pair and discard the other participating modes. Then the captured-pair selector is

    with both selected pairs identified with the same two memory coordinates. The operational input is the normal joint state , not merely its target marginal.

  • lemmaLemma: Joint Gaussian mode-selection errorJoint temporal modes and participating radiation › Principal-plane comparison · Em03-C@1#lem:mode, Em03-C@1#eq:jointmode · proof attached · lines 1015–1066
    Open as its own page

    For the inherited Gaussian marginal on , and any spectator–reference extension,

    Here each occupation is computed from the actual port covariance. Moreover, .

    Proof. The rotation generator in plane is

    These generators are self-adjoint on their total-number-sector direct sums. Purification, the spectral inequality , and the vector triangle inequality give the bound

    For a centered gauge-invariant Gaussian two-mode marginal, put . Wick contraction gives

    using . This depends only on the participating marginal, so arbitrary reference extensions obey the same estimate.

    The principal target occupations are bounded by . The residual vectors have weighted occupation tending uniformly to zero by Lemma lem:windows. Their occupations are . Therefore , proving the last assertion.

  • sectionPrincipal-plane comparisonJoint temporal modes and participating radiation › Principal-plane comparison · lines 1066–1085
    Open as its own page

    For a non-Gaussian input the same purification proof gives

    provided these moments are finite. Otherwise the trivial bound one remains valid. A proposed correction must justify its own participating-mode moments; the baseline's Wick estimate cannot be transferred to it.

    Figure fig:plane is the comparison between the desired packet plane and the plane spanned by the compact tests. A small weighted residual can still be a normalized mode of large occupation. The bound uses the residual occupations, not the norm of the residual alone.

  • figurePrincipal-plane selectionJoint temporal modes and participating radiation › Principal-plane comparison · Em03-C@1#fig:plane · lines 1086–1100
    Target plane
    span⁡{h1,h2}\operatorname{span}\{h_1,h_2\}
    Realized plane
    span⁡{f1,f2}\operatorname{span}\{f_1,f_2\}
    Residual modes
    principal angles
    Passive WW and Γ(W)\Gamma(W)
    Gaussian error from residual occupations

    Principal-plane selection. The passive rotation is one-particle data; its second quantization acts on the joint Gaussian state. Not a collapse-packet limit.

A shared-port two-memory capture construction

  • sectionA shared-port two-memory capture constructionA shared-port two-memory capture construction · lines 1104–1109
    Open as its own page

    This section constructs a combined apparatus. It does not add two one-packet capture budgets.

  • sectionMatrix synthesisA shared-port two-memory capture construction › Matrix synthesis · Em03-C@1#eq:matrixcapture · lines 1110–1126
    Open as its own page

    Fix the orthonormal temporal tests just constructed, supported in , and . Set

    Orthonormality gives , .

  • assumptionModel specification: Shared effective capture portA shared-port two-memory capture construction › Matrix synthesis · Em03-C@1#spec:jointcapture, Em03-C@1#eq:vectorODE · lines 1127–1154
    Open as its own page

    Two memory amplitudes and one incoming port amplitude evolve by

    The quantum evolution is the second quantization of this one-particle map.

    The initial memories have a named joint state , independent of radiation, spectators, and references. Write . An explicit allowed preparation is

    It may have internal correlations.

    A subsequent common storage interval has vacuum transmissivity on each memory, with independent vacuum loss ports and no additional unpriced interaction. Define . The clock is the predecessor's normalized asymptotic time.

  • sectionMatrix synthesisA shared-port two-memory capture construction › Matrix synthesis · lines 1154–1159
    Open as its own page

    This is a specified linear input–output model, in the setting of passive memory models GardinerCollett,YamamotoJames. The following synthesis and comparison are proved directly.

  • theoremTheorem: Simultaneous capture from one portA shared-port two-memory capture construction › Matrix synthesis · Em03-C@1#thm:sharedcapture, Em03-C@1#eq:capturepair, Em03-C@1#eq:capturebounds · proof attached · lines 1160–1233
    Open as its own page

    Equation (eq:vectorODE) is unitary from to itself. Its final memory annihilators obey

    The interaction is smooth and finitely switched, and

    Its resources satisfy

    Proof. Differentiating gives . It follows that

    Consequently

    Integration proves isometry. Substituting gives a bounded backward linear equation with a unique solution from the final memory and outgoing amplitude. The isometry is therefore onto.

    The final-time fundamental solution is , since and . Thus

    Second quantization proves (eq:capturepair).

    The integrated coupling follows from

    The peak bound uses . The Sylvester equation for has the integral solution

    Hence , and . The same bounds . Smoothness and finite switching follow from the supports of and the positive lower bound on .

  • sectionMatrix synthesisA shared-port two-memory capture construction › Matrix synthesis · lines 1233–1245
    Open as its own page

    The off-diagonal memory Hamiltonian is part of the construction, not an omitted cross-coupling error. The underlying bosonic evolution is not treated as a bounded full-oscillator Hamiltonian.

    Figure fig:port is the shared-port synthesis. One scalar input drives both memories because is a vector. The generator contains the memory mixing required by passivity. Two separate window approximations are not this joint port.

  • figureOne temporal port, two memoriesA shared-port two-memory capture construction › Matrix synthesis · Em03-C@1#fig:port · lines 1246–1261
    Incoming port
    u(t)u(t)
    λ(t)=τ G−1q\lambda(t)=\sqrt\tau\, G^{-1}q
    q=(f‾1,f‾2)Tq=(\overline f_1,\overline f_2)^{\mathsf T}
    Memories z∈C2z\in\mathbb C^2
    z˙=Cz+λu\dot z=Cz+\lambda u
    Ω=(C−C†)/(2i)\Omega=(C-C^\dagger)/(2i)
    off-diagonal mixing kept
    Final amplitudes
    1−τ ca+τ a(f^i)\sqrt{1-\tau}\,c_a+\sqrt\tau\, a(\widehat f_i)

    One temporal port, two memories. Passivity is . The drawing is the proved one-particle synthesis, not a laboratory capture trace.

  • lemmaLemma: Referenced multimode vacuum-loss comparisonA shared-port two-memory capture construction › Preparation, loss, and joint capture error · Em03-C@1#lem:jointloss · proof attached · lines 1266–1289
    Open as its own page

    Vacuum pure loss of common transmissivity on a finite mode family satisfies

    when .

    Proof. Purify the input and append vacuum loss modes. The overlap of the initial and beam-splitter-evolved purifications is

    For , , so . The pure-state distance is . Partial trace proves the assertion.

  • theoremTheorem: Combined capture certificateA shared-port two-memory capture construction › Preparation, loss, and joint capture error · Em03-C@1#thm:capturebudget, Em03-C@1#eq:capbudget · proof attached · lines 1297–1320
    Open as its own page

    For the baseline participating marginal and every admitted normal spectator–reference extension, the capture-plus-storage channel obeys

    Proof. Replace the independent memory preparation by vacuum at cost . By (eq:capturepair), the resulting reduced capture and storage are joint vacuum pure loss on the orthonormal -pair. Lemma lem:jointloss costs . Finally compare the -selector and target selector using Lemma lem:mode. All comparisons retain , and contractivity gives the result.

  • sectionPreparation, loss, and joint capture errorA shared-port two-memory capture construction › Preparation, loss, and joint capture error · lines 1320–1337
    Open as its own page

    This prices a common port, overlapping windows, and the nonvacuum background in one comparison. It does not assume that the two target packets or their environmental modes are independent.

    For a non-Gaussian input, replace and by its justified participating-mode values. The same interaction and loss proof then apply.

    Figure fig:capbudget prices preparation and storage once, on the joint memories. Unselected positive-frequency radiation stays in the input; it is not replaced by vacuum. The composite transmissivity is .

  • figureJoint capture budgetA shared-port two-memory capture construction › Preparation, loss, and joint capture error · Em03-C@1#fig:capbudget · lines 1338–1356
    Joint preparation
    distance pcp_c
    Vacuum storage ports
    transmissivity ss
    Capture τ\tau
    shared port
    Unselected modes
    not reset to vacuum
    τ∗=τs\tau_*=\tau s, certificate ξcap\xi_{\mathrm{cap}}

    Joint capture budget. Correlated preparation is allowed and is not two independent one-packet errors added after the fact.

Joint extraction and complete correlated readout

  • sectionExact extraction and global control errorJoint extraction and complete correlated readout › Exact extraction and global control error · lines 1363–1400
    Open as its own page

    Initialize two binary blocks in their joint zero state. For each memory and , swap the disjoint basis pairs

    All other states are fixed. Denote the resulting product unitary by .

    For each pair of normalized vectors , set

    An exact interaction-picture pulse is

    Within each block the projections are orthogonal; between blocks they commute. Since each pulse has area , its evolution is the stated swap with no relative swap phase.

    These number-selective matrix elements are a declared effective control set. They are not inferred from a generic oscillator controllability result.

    Let be the register channel obtained by discarding the memories.

  • propositionProposition: Joint extraction-domain tailJoint extraction and complete correlated readout › Exact extraction and global control error · Em03-C@1#prop:extraction, Em03-C@1#eq:Ktail · proof attached · lines 1401–1433
    Open as its own page

    For every normal referenced input,

    For the baseline,

    Proof. For one memory, the extraction channel preserves the number block through , prepares on , and prepares zero on . This follows by tracing the distinct memory labels after the swaps.

    Both joint channels annihilate cross terms between and its complement, and agree on the first block. On the complementary positive input block they are CP and have the same trace . The half trace norm of the difference of two positive operators of that trace is at most . The union bound gives the final assertion.

  • sectionExact extraction and global control errorJoint extraction and complete correlated readout › Exact extraction and global control error · lines 1433–1456
    Open as its own page

    The joint bound need not be an equality: different tail branches can overlap after finite preparation.

    Allow a global bounded perturbation

    on memories, registers, and , with identity on . It may include cross-memory and cross-register coupling. A permitted finite leakage model has

    Define

  • lemmaLemma: Bounded propagator and composition estimatesJoint extraction and complete correlated readout › Exact extraction and global control error · Em03-C@1#lem:stability · proof attached · lines 1457–1485
    Open as its own page

    For bounded self-adjoint generators,

    Their channels, including ancillas and partial traces, have half-diamond error bounded by the same quantity, capped at one.

    Compatible channel compositions telescope in half-diamond distance. Their error is at most the sum of the component errors, capped at one.

    Proof. Variation of constants gives

    Unitary factors have norm one. The purified-output vector comparison bounds trace distance, including references. Alternatively the complete induced trace norm of the channel difference is at most twice . The composition statement follows by inserting one changed factor at a time and using channel contraction.

  • sectionExact extraction and global control errorJoint extraction and complete correlated readout › Exact extraction and global control error · lines 1485–1497
    Open as its own page

    No unbounded oscillator drive is bounded by Lemma lem:stability without an additional domain theorem.

    Let the joint register preparation be

    independent of the participating radiation and . It may have internal register correlations.

  • theoremTheorem: Derived joint transfer budgetJoint extraction and complete correlated readout › Exact extraction and global control error · Em03-C@1#thm:transfer, Em03-C@1#eq:transferbudget · proof attached · lines 1498–1524
    Open as its own page

    Capture, storage, joint preparation, implemented extraction, and memory discard have referenced transfer error at most

    against .

    Proof. Apply the same implemented extraction first to the actual captured state and to the ideal target-in-memory state. Their difference costs . Replace the independent register preparation at cost . The remaining ideal memory input is the baseline packet pair, so Lemma lem:stability and Proposition prop:extraction apply with its own tail. This ordering does not assume a geometric tail for an imperfectly captured state.

  • sectionExact extraction and global control errorJoint extraction and complete correlated readout › Exact extraction and global control error · lines 1524–1544
    Open as its own page

    If controls are certified only on the initial domain, with arbitrary behavior outside it, the valid replacement for is

    Indeed, compare each channel through the normalized projected input, whose referenced distance from the original is at most . The sharp probability tail requires the global block structure just proved.

    Figure fig:extraction is the selective swap on one memory. Levels move into the register. Levels are clipped to the corner. States outside the control domain are not given the same exact tail; an implementation certified only on the low domain pays the square-root comparison.

  • figureSelective extractionJoint extraction and complete correlated readout › Exact extraction and global control error · Em03-C@1#fig:extraction · lines 1545–1559
    1≤n≤ai1\le n\le a_i
    swap into QiQ_i
    ai<n≤Kia_i<n\le K_i
    clip to ∣ai⟩\lvert a_i\rangle
    n>Kin>K_i
    not in the exact tail
    Ua,KU_{\boldsymbol a,\boldsymbol K}: orthogonal pulses, area π\pi, no relative swap phase

    Extraction-domain unitary for the synthetic cutoffs used as a schematic, for instance and . Not an executed pulse sequence.

  • sectionOne complete joint pointer modelJoint extraction and complete correlated readout › One complete joint pointer model · lines 1562–1614
    Open as its own page

    Let contain pointer qubits. Its joint state is independently prepared as

    Internal pointer correlations are allowed.

    The ideal copying interaction is

    For duration , the bounded generator

    generates it exactly.

    Append a fresh finite bath in its stated state, independent of . The actual pointer interaction is

    where , , are declared finite matrices on . They may couple both registers, pointers, spectators, and bath. This is one joint bounded noise model; its terms need not factor by packet.

    Define

    This includes only errors during that interval. It does not purport to include an unspecified unbounded leakage process.

    The pointer is destructively read in its computational basis. All of are then discarded; is returned. Let be a fixed stochastic matrix from the ideal raw pair to the reported joint record. It may include correlated assignment errors, timeout, and other declared flags.

    A fresh readiness variable has failure probability . On that branch the apparatus reports , consumes , and returns on . No trial is deleted.

  • theoremTheorem: Exact joint assignment error and readout budgetJoint extraction and complete correlated readout › One complete joint pointer model · Em03-C@1#thm:readout, Em03-C@1#eq:assignment, Em03-C@1#eq:readbudget · proof attached · lines 1615–1673
    Open as its own page

    For ideal destructive readout followed only by ,

    For the complete pointer model above, its error against the corresponding ideal readout is at most

    Proof. The assignment instrument is

    An isometry realizing its assignment sends to , with orthonormal environmental labels.

    For any input operator with a reference, pinching in the computational basis is trace-norm contractive. Its diagonal blocks obey . The complete norm of the assignment difference is therefore at most

    A basis input attaining the maximum gives equality.

    On a ready branch, replacing the independent pointer preparation costs . Lemma lem:stability gives for the actual joint pointer evolution. Assignment then costs . Convexity prices the visible failure branch by , proving (eq:readbudget).

  • sectionOne complete joint pointer modelJoint extraction and complete correlated readout › One complete joint pointer model · lines 1673–1688
    Open as its own page

    This construction includes common preparation and correlated assignment noise explicitly. It assumes fresh apparatus state, not unknown memory carried between trials. Finite-channel and instrument terminology follows the standard framework Watrous; the particular equalities above have their own proofs.

    Figure fig:pointer is one complete instrument. The measured register is absent from the output. Assignment noise may be correlated across the two words. Failure labels stay in the alphabet; a reset failure is a visible record, not a discarded trial.

  • figureJoint pointer modelJoint extraction and complete correlated readout › One complete joint pointer model · Em03-C@1#fig:pointer · lines 1689–1706
    Register QQ
    both words
    Pointers
    correlated preparation
    Finite bath
    joint generator
    Register removed
    after the copy
    Output yy
    raw, decoded, flags
    Assignment WW
    plus reset failure

    Joint pointer model. The half-diamond assignment error is an exact function of on the declared alphabet. Not a calibrated laboratory instrument.

C2: information-sensitive finite-register measurements

  • sectionA declared rotation familyC2: information-sensitive finite-register measurements › A declared rotation family · lines 1713–1757
    Open as its own page

    Let . For each nonidentity Pauli string , choose a product basis rotation using

    and use on positions where is the identity. These obey

    The rotations are generated by bounded single-qubit Hamiltonians with pulse area of magnitude . Their phase convention is fixed by the apparatus reference.

    The ideal selective maps are

    Their effects on are

    Thus

    is complete, including unused raw inputs. The setting label is also retained.

    For a selected setting , let its implemented rotation have bounded generator deviation on , and set

    The pointer budget is (eq:readbudget) for that setting.

  • theoremTheorem: Complete-record comparison in every settingC2: information-sensitive finite-register measurements › A declared rotation family · Em03-C@1#thm:settings, Em03-C@1#eq:settingbudget · proof attached · lines 1758–1783
    Open as its own page

    Let . For each number or Pauli setting , the complete model record obeys

    For the number setting, and the ideal target is (eq:jointrecord).

    Proof. Telescope through ideal transfer, ideal setting rotation, and ideal pointer readout. Their errors are respectively Theorem thm:transfer, Lemma lem:stability, and Theorem thm:readout. Every intermediate interface includes and the appended reference .

  • sectionA declared rotation familyC2: information-sensitive finite-register measurements › A declared rotation family · lines 1783–1793
    Open as its own page

    If settings are randomly chosen independently with probabilities , the full setting-labelled state has error at most . The record does not conceal which setting was used.

    In non-number settings, the raw-word decoder remains a declared classical label. It is not interpreted as measuring the original packet number after a basis rotation.

  • sectionInformational completenessC2: information-sensitive finite-register measurements › Informational completeness · lines 1794–1803
    Open as its own page

    For ordinary raw output , let

    Assign score zero to every failure record. Then .

  • propositionProposition: Informationally complete measurement familyC2: information-sensitive finite-register measurements › Informational completeness · Em03-C@1#prop:IC, Em03-C@1#eq:PauliExpansion · proof attached · lines 1804–1827
    Open as its own page

    For an ideal register density ,

    The family reconstructs every density on the full binary register:

    It is therefore informationally complete on the encoded retained subspace as well.

    Proof. The diagonal sign observable before rotation is the tensor product of 's on the nonidentity positions. Conjugation by gives . Pauli matrices obey and form a basis for register operators, proving (eq:PauliExpansion).

  • sectionInformational completenessC2: information-sensitive finite-register measurements › Informational completeness · lines 1827–1834
    Open as its own page

    Figure fig:pauli is the informationally complete family on the encoded register, including unused binary words. Scores of failure records are zero. A rotation error enters the complete-record budget before any statistical estimate.

  • figurePauli measurement familyC2: information-sensitive finite-register measurements › Informational completeness · Em03-C@1#fig:pauli · lines 1835–1850
    ZZ basis
    raw words
    UXU_X then ZZ
    score of XX
    UYU_Y then ZZ
    score of YY
    Identity setting
    normalization
    EvP=tr⁡(Pτ)\mathbb E v_P=\operatorname{tr}(P\tau) on an ideal register density. Reconstruction is a repeated-preparation statement, not one-shot recovery of RR.

    Pauli measurement family. Signs of and are part of the declared convention. The figure does not report an executed tomography.

  • sectionStatistical and reconstruction certificatesC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · lines 1853–1861
    Open as its own page

    Let

    be the ideal finite register state. Put and .

  • assumptionAssumption: Independent repeated preparationsC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · Em03-C@1#ass:trials · lines 1862–1868
    Open as its own page

    For statistical conclusions, each setting uses independent trials of the same participating radiation preparation and the specified fresh apparatus model. Scores in a setting are identically distributed. The input and apparatus parameters do not drift.

  • sectionStatistical and reconstruction certificatesC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · lines 1868–1872
    Open as its own page

    This is an additional repeated-experiment assumption. The one-shot referenced certificate alone does not imply it.

  • lemmaLemma: Bounded-score concentrationC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · Em03-C@1#lem:concentration · proof attached · lines 1873–1895
    Open as its own page

    For independent ,

    For independent Bernoulli variables the exponent improves to .

    Proof. For a bounded variable on an interval of length , let . Under exponential tilting, is a variance and is at most ; this follows by centering at the interval midpoint. Since , . Multiply the moment bounds for independent variables, apply exponential Markov inequality, and optimize over . Apply the same argument to the lower tail.

  • sectionStatistical and reconstruction certificatesC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · lines 1895–1906
    Open as its own page

    Let be the empirical score in setting . Define the Hermitian trace-one estimate

    Let be its nearest density matrix in Hilbert–Schmidt norm. This finite convex minimization has a unique solution.

  • theoremTheorem: Finite-state reconstruction and coherent cutoff errorC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · Em03-C@1#thm:reconstruction, Em03-C@1#eq:tomography, Em03-C@1#eq:fullreconstruction · proof attached · lines 1907–1965
    Open as its own page

    Under Assumption ass:trials, for , define

    With probability at least ,

    In the oscillator embedding,

    For the baseline, .

    Proof. A score in has expectation error at most under a record trace-distance error . Lemma lem:concentration and a union bound over settings therefore imply, with the stated probability,

    Pauli orthogonality gives

    Euclidean projection onto the convex set of densities cannot increase distance from a member of that set. To see this, the minimizing projection satisfies for every density ; expanding squares proves the asserted distance property. Thus

    The second conclusion is Lemma lem:coherenttail and the triangle inequality.

  • sectionStatistical and reconstruction certificatesC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · lines 1965–1971
    Open as its own page

    The theorem reconstructs the reduced packet state. Its measurement comparisons are reference-stable, but observations of the packets alone do not reconstruct an inaccessible packet–reference density.

  • corollaryCorollary: A finite tomography tolerance scheduleC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · lines 1972–1982
    Open as its own page

    For desired reduced-state trace-distance tolerance , it suffices that

    Then (eq:fullreconstruction) is at most with probability at least .

  • sectionStatistical and reconstruction certificatesC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · lines 1982–1996
    Open as its own page

    This schedule is usable only when the apparatus can meet its systematic-error allowance. The dimension and number of settings increase with the cutoffs. A fixed error floor is not removed by increasing the number of trials.

    Figure fig:ledger is the order in which errors are composed. The ideal baseline tail is applied only after the apparatus has been compared with the ideal memory input. Adding two one-packet histogram errors is not this ledger. Trials reduce the statistical term only; they do not remove a fixed systematic floor.

  • figureJoint error ledgerC2: information-sensitive finite-register measurements › Statistical and reconstruction certificates · Em03-C@1#fig:ledger · lines 1997–2014
    ξcap\xi_{\mathrm{cap}}
    transfer η\eta
    rotations
    pointer δs\delta_s
    record ese_s
    Caps at 1 stay visible. State-specific tails are not replaced by the baseline tail before the ideal-input comparison.

    Joint error ledger. Synthetic numerical values are not supplied: the manuscript prices symbols, and this sheet does not report an executed evaluation.

Joint count certificates and bounded diagnostics

  • sectionOperational joint countsJoint count certificates and bounded diagnostics › Operational joint counts · Em03-C@1#eq:countcertificates · lines 2021–2037
    Open as its own page

    Let be the number-setting budget of Theorem thm:settings. Then

    The second line embeds the decoded actual law into . The same bound compares decoded records with retained .

  • proofProofJoint count certificates and bounded diagnostics › Operational joint counts · lines 2038–2043
    Open as its own page

    Proof. The report is an observable between zero and . Its mean changes by at most . Use the exact marginal ideal deficit and Theorem thm:jointrecord.

  • sectionOperational joint countsJoint count certificates and bounded diagnostics › Operational joint counts · lines 2043–2056
    Open as its own page

    The clipped covariance, unlike the true unbounded covariance, is automatically controlled:

    The product expectation costs , and the product of means costs at most . This does not assert that the clipped ideal covariance equals .

  • exampleExample: Same number law, different coherencesJoint count certificates and bounded diagnostics › Information that number records miss · lines 2059–2074
    Open as its own page

    The states

    have identical joint number laws. They are orthogonal. For cutoffs , their exact finite encodings have a two-qubit expectation of and , respectively, on the two active qubits; unused qubits are zero. A Pauli setting distinguishes them, whereas any number-diagonal record does not.

    These are synthetic controls, not states claimed to be produced by the inherited Hawking model.

  • sectionInformation that number records missJoint count certificates and bounded diagnostics › Information that number records miss · lines 2074–2080
    Open as its own page

    Figure fig:phase is that example. The two states share every number-diagonal probability. On the two active qubits the correlator has opposite signs. A number record cannot see the sign.

  • figurePhase missed by number recordsJoint count certificates and bounded diagnostics › Information that number records miss · Em03-C@1#fig:phase · lines 2081–2093
    ∣ψ+⟩=(∣10⟩+∣01⟩)/2\lvert\psi_+\rangle=(\lvert 10\rangle+\lvert 01\rangle)/\sqrt2
    X⊗X=+1X\otimes X=+1
    same NN law
    ∣ψ−⟩=(∣10⟩−∣01⟩)/2\lvert\psi_-\rangle=(\lvert 10\rangle-\lvert 01\rangle)/\sqrt2
    X⊗X=−1X\otimes X=-1
    Same joint number law. Unused encoded qubits are zero. The distinguishing setting is a Pauli string, not a count. Synthetic controls.

    A phase-sensitive distinction missed by number records. The states are synthetic controls.

  • sectionA hierarchy of bounded testsJoint count certificates and bounded diagnostics › A hierarchy of bounded tests · lines 2096–2143
    Open as its own page

    The baseline gives the unbounded connected expression

    A general apparatus conclusion about this unbounded expression requires uniform moment and tail control.

    A safe finite alternative is to choose a finite matrix observable on the retained subspace, compute its baseline expectation from (eq:jointdensity), and compare the corresponding bounded register observable. Examples include real and imaginary parts of compressed , compressed , or a compressed fourth-order polynomial, each rescaled by its actual finite norm.

    If is measured indirectly through tomography, the certificate is

    Compression and saturation need not preserve Gaussian Wick identities. Their finite baseline value must be calculated; it must not be set to zero merely because the uncompressed Gaussian connected expression vanishes.

    The diagnostic hierarchy is:

    These are distinct questions, not interchangeable conclusions.

    Figure fig:diagnostics keeps bounded diagnostics separate from field moments. A saturated output is not Gaussian, so a truncated Wick identity is not an automatic baseline. The same record error that controls a bounded observable does not control an unbounded moment.

  • figureBounded diagnostics against unbounded momentsJoint count certificates and bounded diagnostics › A hierarchy of bounded tests · Em03-C@1#fig:diagnostics · lines 2144–2155
    Bounded OaO_{\boldsymbol a}
    cross coherence, clipped covariance
    not the same bound
    Unbounded KijklK_{ijkl}
    needs its own tails
    Baseline values are computed on the saturated state, not imported from the unsaturated Wick formula.

    Diagnostic hierarchy. Count means and clipped covariances are operational. They are not a mechanism identification.

C3: certified discrimination of specified departures

  • sectionBounded-effect theoremC3: certified discrimination of specified departures › Bounded-effect theorem · lines 2162–2184
    Open as its own page

    Let and let be a named alternative normal state. For the effective capture model, an alternative must also specify its participating environmental state and provide the needed mode moments and occupations. A two-packet marginal alone does not determine its capture certificate.

    Let be a finite-register effect implemented by one of the constructed settings and classical postprocessing:

    Assign a bounded score in to each failure record as part of the test definition. Define the exact field-interface effect

    It is a bounded effect on the packet pair.

  • theoremTheorem: Operational departure certificateC3: certified discrimination of specified departures › Bounded-effect theorem · Em03-C@1#thm:discrimination, Em03-C@1#eq:discrimination, Em03-C@1#eq:fielddiscrimination · proof attached · lines 2185–2238
    Open as its own page

    Suppose the two participating preparations have complete record errors for the same declared test. Then

    The right-hand side may be replaced by its positive part.

    More generally, if an independently specified bounded field effect is compared with the compressed register effect

    and that finite effect is implemented with the same type of certificate, then

    Here is the finite low-number encoding. The second assertion does not claim that every is a single setting of the constructed product-basis family.

    Proof. An effect expectation changes by at most the record trace distance. Apply this once for each preparation and use the reverse triangle inequality. The ideal probabilities equal the expectations of , proving (eq:discrimination).

    For the second assertion, the embedded carrier is within of the original state by Lemma lem:coherenttail. Its expectation of equals the register expectation of , since the ideal carrier is supported in the low-number box. Add both coherent errors before the record comparisons.

  • sectionBounded-effect theoremC3: certified discrimination of specified departures › Bounded-effect theorem · lines 2238–2245
    Open as its own page

    The primary release is the first assertion for the explicitly constructed Pauli settings and their postprocessings. An arbitrary spectral measurement of would require its own finite control construction or would instead be estimated tomographically.

  • corollaryCorollary: Some constructed setting detects every finite departureC3: certified discrimination of specified departures › Bounded-effect theorem · Em03-C@1#cor:Pauliwitness · proof attached · lines 2246–2272
    Open as its own page

    Let , , and . There is a nonidentity Pauli string for which the effect has ideal probability gap at least

    Its actual gap is at least this value minus its two complete implementation errors.

    Proof. Expand the traceless difference in the Pauli basis. Writing ,

    The effect gap is . The constructed setting measures its sign event, and Theorem thm:discrimination gives the actual bound.

  • sectionBounded-effect theoremC3: certified discrimination of specified departures › Bounded-effect theorem · lines 2272–2277
    Open as its own page

    Finite informational completeness does not guarantee a useful gap on a fixed apparatus: dimension factors, cutoff distortion, and error floors remain in the bound.

  • sectionFinite-trial discriminationC3: certified discrimination of specified departures › Finite-trial discrimination · lines 2278–2306
    Open as its own page

    For two independent ensembles with trials, consider the binary postprocessed event in a fixed setting. It can be realized by independent classical randomization when the scores are not zero or one.

    For , put

    With probability at least ,

    where . This follows from the Bernoulli form of Lemma lem:concentration and the two probability comparisons.

    Conversely, an observed gap exceeding excludes equality of the two ideal test probabilities at that confidence level, under the stated preparation and apparatus assumptions.

  • sectionInterpretation and externally supplied correctionsC3: certified discrimination of specified departures › Interpretation and externally supplied corrections · lines 2307–2333
    Open as its own page

    A departure from can arise from altered preparation, ordinary matter interactions, changed scattering, or a changed background. It does not by itself identify quantum gravity or information recovery.

    If a separate theory supplies

    then the certified lower bound is obtained by subtracting , both apparatus errors, and any proved cutoff comparison from . This is a substitution rule, not an evaluated effective-field-theory correction. No effective action, loop coefficient, regulator removal, or microscopic horizon model is introduced by that formula.

    Figure fig:discrimination is the operational gap. A specified ideal effect gives a probability difference. Both implementation errors and, when trials are used, the finite-sample allowance are subtracted. A positive lower bound certifies a record departure. It does not name the physical cause.

  • figureDiscrimination certificateC3: certified discrimination of specified departures › Interpretation and externally supplied corrections · Em03-C@1#fig:discrimination · lines 2334–2347
    Ideal gap
    ∣tr⁡E(ρθ−ρ0)∣|\operatorname{tr} E(\rho_\theta-\rho_0)|
    Subtract eθ+e0e_\theta+e_0
    and the trial allowance
    Certified record
    departure, or not
    The alternative must name its participating preparation and moment bounds. A detectable gap is not quantum gravity, recovery, or a firewall resolution.

    Discrimination certificate. The figure does not exhibit a numerical gap for a named alternative.

C4: input information and reference limitations

  • theoremTheorem: No label recovery from identical accessible inputsC4: input information and reference limitations · Em03-C@1#thm:nolabel · proof attached · lines 2354–2379
    Open as its own page

    Let have prior distribution . If every gives the same density on all degrees of freedom participating in the apparatus, and the apparatus channel and independent preparations do not depend on , then all output record–spectator states are identical.

    Any classical estimator based on those outputs has success probability at most . For equal priors on labels the bound is .

    Proof. A fixed linear channel maps identical inputs to identical outputs. Every subsequent measurement or postprocessing therefore has an -independent output law . For an estimator ,

    The same conclusion holds if the returned spectator is measured as part of the output.

  • remarkRemark: Necessary accessible-input correctionC4: input information and reference limitations · lines 2381–2395
    Open as its own page

    Equality of the target two-packet marginals alone is insufficient for this theorem if the apparatus also receives other modes or spectators. Those systems could carry , or their correlations with the packets could depend on . The shared capture acts on , not only on . A label dependence in the orthogonal participating modes can change captured records even when is fixed.

    For a radiation-only ideal channel acting exclusively on the target pair, equality of its two-packet inputs does suffice. This distinction prevents a side-channel signal from being renamed microscopic radiation recovery.

  • propositionProposition: Approximate accessible-input limitationC4: input information and reference limitations · proof attached · lines 2397–2410
    Open as its own page

    If all accessible inputs obey , and the apparatus is fixed, then every estimator has success probability at most .

    Proof. Contractivity gives output law distance at most from the law for . The probability of the estimator's correct decision changes by at most for each . Average over the priors and apply Theorem thm:nolabel.

  • theoremTheorem: Constant radiation channel cannot recover entanglementC4: input information and reference limitations · Em03-C@1#thm:noreference · proof attached · lines 2412–2443
    Open as its own page

    Let a finite microscopic message space have dimension . If a channel maps every message density to the same radiation density , then it is a replacement channel:

    For a maximally entangled message–reference input, every decoder acting only on radiation has entanglement fidelity exactly , and its output has trace distance at least from the maximally entangled target.

    Proof. Linearity and decomposition of Hermitian matrices into scalar and traceless parts show that a channel constant on all densities vanishes on traceless matrices. Complex linearity proves the replacement formula.

    The referenced radiation output is . A decoder produces . Its overlap with the maximally entangled projector is

    Testing that projector gives the trace-distance lower bound.

  • sectionC4: input information and reference limitationsC4: input information and reference limitations · lines 2443–2461
    Open as its own page

    This theorem requires constancy on all message inputs, not merely on a chosen set of classical basis states.

    The A–B stationary preparation is a fixed state, not a microstate-dependent evaporation channel. A successor claiming microscopic recovery must specify a message space, a preparation or encoding map, evolution, radiation access, and a referenced recovery criterion. Adding tomography or a decoder cannot supply those dynamics.

    Figure fig:information is the information limitation. Identical accessible inputs cannot reveal a label, even if some unaccessed environment still carries it. A channel that ignores the message is a replacement channel, and a radiation-only decoder then has entanglement fidelity .

  • figureNo label recovery from a constant channelC4: input information and reference limitations · Em03-C@1#fig:information · lines 2462–2475
    Label or message
    dimension DMD_M
    Input-independent
    radiation channel
    Same ρrad\rho_{\mathrm{rad}}
    fidelity DM−2D_M^{-2}
    Counterexample: the label sits only in an unaccessed mode

    No label recovery and no preserved reference entanglement from a constant radiation channel. Equal target marginals are not equal records of every environmental mode.

Resources, attainable tolerances, and semantic scope

  • sectionA joint apparatus ledgerResources, attainable tolerances, and semantic scope › A joint apparatus ledger · lines 2483–2568
    Open as its own page

    The construction uses two oscillator memories, not two qubits. Initial extraction-domain dimensions are ; the modeled maximum leakage-domain dimensions are . Capture itself is not restricted to finite occupation support.

    With spectator qubits, the retained register and pointer occupancy is . If the finite joint noise bath is stored in the laboratory, its qubit embedding must also be counted. Fresh reset registers and their peak overlap with retained registers are additional preparation resources, not silently included in this number.

    {}1.12

    ResourceDeclared quantity
    ResourceDeclared quantity
    Shared captureOne effective temporal port; window ; two compact orthonormal tests; vector ; memory mixing ; bounds (eq:capturebounds).
    MemoriesTwo oscillators; joint preparation ; storage duration , rate ; initial cutoffs ; maximum controlled leakage levels .
    Extraction selective pulse components; duration ; finite-rank exact generator; joint bounded deviation ; register preparation .
    Phase-sensitive controlsAt most single-qubit rotations per setting; fixed phase convention; rotation error integrals .
    Readout pointer qubits; ideal controlled-NOT copies; duration ; joint finite bath and generator ; full matrix .
    Reset and readinessFresh independent preparation systems; joint errors ; readiness failure probability ; visible failure output.
    Repeated testsA sufficient, not optimized, schedule has preparations for tomography. Different Pauli strings can share bases, but such reuse is not needed by the proved schedule.
    Classical recordsSetting, both raw words, both declared decoded values, all failure flags, and trial identifier. No failed trial is removed.
    SpectatorsStored throughout the sequence; all modeled coupling errors are included in the named joint generators. Additional decoherence requires an additional complete comparison.
    ReferencesRetained in correctness statements; not laboratory memory.
    Energy and workOscillator free energies, control phase references, cooling, bath delivery, and reset work require separately supplied physical models. No thermodynamic optimum is claimed.

    The preparations can be represented by replacement through swaps with fresh systems in the stated states, discarding old apparatus states into the preparation environment. This supplies complete preparation channels. It does not prove cooling costs or independence in a reused experimental device.

  • sectionAccuracy within the declared model familyResources, attainable tolerances, and semantic scope › Accuracy within the declared model family · lines 2569–2591
    Open as its own page

    For a fixed finite retained box, the model budgets can approach zero if the allowed family permits:

    1. arbitrarily long finite windows;

    2. capture and storage transmissivity approaching one;

    3. arbitrarily accurate joint independent preparations;

    4. the stated selective controls for each finite ;

    5. bounded control deviations approaching zero;

    6. joint pointer, assignment, and readiness errors approaching zero.

    Indeed, Lemma lem:mode controls the first item, Lemma lem:jointloss controls the second, geometric tails control finite , and the displayed perturbation integrals control the remaining dynamics.

    These are tunability properties of a model family, not a theorem of arbitrary accuracy for fixed hardware. In particular, (eq:capturebounds) shows the increasing capture resources as , and tomography's statistical and systematic requirements scale with .

  • assumptionAssumption: Finite semantic characterizationResources, attainable tolerances, and semantic scope › Optional Enter interpretation · Em03-C@1#ass:Enter · lines 2594–2602
    Open as its own page

    The supplied Landmark I characterization LandmarkI is admitted with :strategy-class, :requirements, and :main. The global finite-qubit strategy satisfies with the source's continuation restrictions.

  • sectionOptional Enter interpretationResources, attainable tolerances, and semantic scope › Optional Enter interpretation · lines 2602–2621
    Open as its own page

    Under this assumption, finite allocation, rotations, pointer couplings, destructive Born readout, and classical postprocessing have the displayed Enter interpretation. Mixed finite inputs are treated by finite purification. Values of residual rays on zero-probability branches are not required.

    Without this assumption, all channel theorems remain ordinary quantum-channel statements with specified Born instruments. Landmark I neither selects the Unruh state nor constructs the effective port or its local field counterpart.

    Figure fig:resources separates parameters that can be driven down inside the declared family from resources that grow with that demand, and from error floors that extra trials do not remove. No thermodynamic optimum is claimed.

  • figureResource reading of the joint ledgerResources, attainable tolerances, and semantic scope › Optional Enter interpretation · Em03-C@1#fig:resources · lines 2622–2633
    Tunable in the family
    L,  τ,  pc,  Ki,  ΔHL,\;\tau,\;p_c,\;K_i,\;\Delta H
    Grows with the demand
    window, ∫∥λ∥2\int\|\lambda\|^2, n(d2−1)n(d^2-1) trials
    Not removed by trials
    fixed hardware floors, open local coupling

    Resource reading of the joint ledger. Attainability is a property of the model family, not a theorem for fixed hardware, and not a reported optimization.

Open physical bridges: not additional release claims

  • sectionOpen physical bridges: not additional release claimsOpen physical bridges: not additional release claims · lines 2637–2643
    Open as its own page

    Figure fig:open is the boundary of the release. Each column is an obligation list, not a mechanism constructed in this manuscript.

  • figureOpen physical bridgesOpen physical bridges: not additional release claims · Em03-C@1#fig:open · lines 2644–2655
    Local probe
    coupling region, scattering map, packet observable, derived error
    Collapse packet
    named geometry, propagated profile, local, tail, and propagation errors
    Microscopic channel
    one theory, action, state, regulator, message space
    Em03-C supplies the joint baseline and the effective tests. It does not cross any of these three bridges. O.1 stays open.

    Open physical bridges. A certified departure from the semiclassical baseline is not identification of a quantum-gravity mechanism. O.1 stays open. No quantum coefficient is admitted.

  • sectionA local Schwarzschild system–probe correspondenceOpen physical bridges: not additional release claims › A local Schwarzschild system–probe correspondence · lines 2658–2689
    Open as its own page

    The effective port has not been identified with a local Schwarzschild coupling. A possible successor begins with a specified probe field and compact bilinear interaction

    The Fewster–Verch framework supplies a setting for local system–probe scattering and induced observables FewsterVerch. Asymptotic local-observable measurement constructions give additional comparison tools FewsterJubbRuep. Neither result is an identification of this manuscript's matrix capture with a local asymptotic packet-number instrument.

    The successor must specify:

    1. probe state, coupling region, and switching;

    2. coupled classical evolution and quantum scattering map;

    3. a selected outgoing probe observable;

    4. its relation to the asymptotic packet algebra;

    5. unwanted modes, creation-operator mixing, probe noise, angular resolution, and finite-radius propagation;

    6. a common comparison topology and a derived error.

    A passive pure-loss reduction is a theorem target, not a default property of a bilinear local coupling. A first induced smeared-field observable is a narrower target than exact packet-number detection.

  • sectionA collapse packet theoremOpen physical bridges: not additional release claims › A collapse packet theorem · lines 2690–2709
    Open as its own page

    Em03-A's :peeling concerns compact time tests under explicit peeling and affine-regularity assumptions. The Fourier packet profiles here are noncompact. A collapse successor needs a named collapse geometry and initial state, characteristic restriction, propagated packet identification, and uniform tails.

    A possible error decomposition is

    No term in this decomposition is proved for a collapse spacetime by the present stationary apparatus analysis. The stationary Unruh construction DMP does not discharge those additional obligations.

  • sectionOne controlled correction and microscopic dynamicsOpen physical bridges: not additional release claims › One controlled correction and microscopic dynamics · lines 2710–2761
    Open as its own page

    A correction successor must choose one theory and specify its action, expansion parameter, state, renormalization, observable, regulator removal, and remainder. Altered classical geometry, interacting matter, graviton loops, and quantum horizon dynamics are different models.

    The broader information problem motivates joint-state rather than mean-spectrum questions. Fine-grained radiation entropy calculations EntropyReview are not, by themselves, a complete set of radiation amplitudes or the message channel required in Section sec:information. The horizon-smoothness and unitarity tension AMPS likewise requires hypotheses about interior observables and their relation to exterior radiation. No interior algebra is constructed here.

    {}1.12

    QuestionBoundary of this construction
    Microscopic recoveryWe supply distinguishability tests; a microscopic input-dependent evaporation channel is absent.
    Smooth horizon and unitarityExterior finite-mode tests do not construct interior partners or decide which locality or factorization hypothesis changes.
    Gravitational path integralsNo path integral, ensemble identification, or factorization theorem is introduced.
    Four-dimensional physical correspondenceThe field baseline is Schwarzschild scalar radiation; the apparatus-to-local-field bridge remains open.
    Ultraviolet robustnessNo universality class of ultraviolet completions is specified or compared.
    Evaporation endpointThe fixed-background model has no Planck-regime endpoint dynamics.

    No result here closes O.1, changes XVI-N's hypotheses, discharges the XIV–XV characteristic-product chain, or admits its separate quantum coefficient. The supplied documentary excerpts about those programmes are not apparatus premises.

Source repairs and logical checks

  • sectionSource repairs and logical checksSource repairs and logical checks · lines 2763–2825
    Open as its own page
    1. Covariance orientation. With conjugate-linear annihilation tests, , while . The characteristic function, passive transformation, and Wick formula use this convention consistently.

    2. Orthogonality is not independence. Joint normality comes from quasifreeness and the full occupation matrix, not from two means.

    3. Two separate window approximations are not a joint port. The compact tests are jointly orthonormalized. A shared-port matrix interaction captures them simultaneously and explicitly contains the required memory mixing.

    4. Background modes are retained. The participating input has dimension at most four in its one-particle restriction and includes nonvacuum background covariance. Auxiliary vacuum ports are new model preparations.

    5. Errors are derived at named interfaces. Joint preparation and assignment are priced once. Shared Hamiltonian perturbations are not silently replaced by the sum of two one-packet histogram errors.

    6. A global control bound is not a support-only bound. The sharp extraction tail uses the defined global block behavior. An arbitrary outside-domain implementation requires the separately stated square-root estimate.

    7. Count clipping and coherent approximation differ. Equation (eq:jointtail) is an exact record probability. Equation (eq:coherenttail) controls a coherent state comparison, including references.

    8. Failure labels stay visible. Raw words, decoder values, setting, and failure records remain in the comparison. Statistical samples do not discard failures.

    9. Tomography is a repeated-preparation statement. Reference-stable one-shot correctness does not prove independent trials or reconstruct an inaccessible reference state.

    10. Compressed Wick tests require their own baseline. The finite saturated output is generally not Gaussian. A truncated cumulant is not automatically zero.

    11. Equal target marginals need not imply equal actual records. The no-information theorem concerns all apparatus-accessible inputs, not an omitted environment or spectator.

    12. Departure is not mechanism identification. A certified departure from this specified semiclassical state does not establish quantum gravity, recovery, evaporation, or a firewall resolution.

Final analytical release

  • theoremTheorem: Em03-C joint operational releaseFinal analytical release · Em03-C@1#thm:release · proof attached · lines 2830–2896
    Open as its own page

    Under the stated stationary radiation input and effective apparatus specification:

    1. the complete normal two-packet Gaussian state, joint count law, independence criterion, and Wick correlations are constructed;

    2. the joint finite carrier and complete destructive record retain spectators and references, with exact joint count-tail error and a separately proved coherent-tail comparison;

    3. compact orthonormal temporal modes and a shared-port two-memory interaction are constructed, with a derived joint capture certificate;

    4. joint preparations, coherent extraction, global bounded controls, correlated assignment noise, and complete pointer readout give the derived setting budgets (eq:transferbudget)–(eq:settingbudget);

    5. a phase-sensitive informationally complete finite measurement family has the statistical and trace-distance reconstruction bounds of Theorem thm:reconstruction;

    6. specified bounded state departures have the operational discrimination certificate of Theorem thm:discrimination;

    7. identical accessible inputs cannot reveal an unknown label, and a constant message-to-radiation channel cannot recover reference entanglement.

    Statistical conclusions retain Assumption ass:trials; Enter terminology retains Assumption ass:Enter. Alternative-state certificates require their own named joint participating preparation and moment bounds.

    No local Schwarzschild detector, collapse-packet limit, quantum-gravity correction, microstate-dependent evaporation channel, Page curve, island construction, restored unitarity, firewall resolution, or evaporation endpoint is established.

    Proof. Theorems thm:gaussian and thm:counts prove (i). Theorem thm:jointrecord and Lemma lem:coherenttail prove (ii). Lemmas lem:windows–lem:mode and Theorems thm:sharedcapture–thm:capturebudget prove (iii). Proposition prop:extraction and Theorems thm:transfer, thm:readout, and thm:settings prove (iv). Proposition prop:IC and Theorem thm:reconstruction prove (v). Theorem thm:discrimination proves (vi). Theorems thm:nolabel and thm:noreference prove (vii).

    The constructed model contains none of the local-coupling, collapse, or microscopic dynamics required for the excluded physical conclusions. Their outstanding interfaces are stated in Section sec:open.

  • sectionFinal analytical releaseFinal analytical release · lines 2896–2907
    Open as its own page

    scope statement. Em03-C constructs a joint-packet semiclassical baseline and certified, information-sensitive measurement interfaces. It identifies which specified departures can be distinguished operationally, while retaining explicit local-coupling, collapse, and microscopic-dynamics obligations. It does not derive a Page curve, restore unitarity, resolve the firewall paradox, or determine the endpoint of evaporation.

Declarations

  • sectionDeclarationsDeclarations · lines 2908–2926
    Open as its own page

    and verification availability. All analytical constructions used in the release are included. No executed packet dataset, control optimization, experimental calibration, formal proof certificate, or compilation record is supplied or asserted.

    and predecessor status. The radiation prescription is inherited from the supplied Em03-A source. Em03-B supplies the one-packet construction being extended. The En02-E comparison is identified as a supplied companion account, not independently checked full text. The finite-mode Gaussian specialization is proved here for self-containment and is not presented as a new Gaussian-state classification theorem.

  • bibliographyReferencesDeclarations · lines 2927–3050
    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. Inputs: boundary-state prescription, :horizonoccupation, :quantumscatter, :numberdensity, and :packetlaw. The compact-test collapse boundary is :peeling.

    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-mode normality, coherent extraction, effective capture, complete instruments, and the distinction between destructive record tails and coherent comparisons.

    En02EAccount

    Supplied companion account of En02-E and related manuscripts. Documentary source reproduced with the revision programme, including corpus identifier 48702295 and retrieval identifier -3. Reported locators: :gaussian, :outcov, :K, :stats, :cutoff, and :ancilla. The full En02-E manuscript was not supplied; this entry is not represented as full-text verification or a formal premise.

    LandmarkI

    N. Cheung, I, version 1. Supplied characterization theorem and excerpts: :strategy-class, :requirements, and :main. Used only for the optional finite-qubit semantic interpretation.

    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 global state construction is inherited through Em03-A, not reproved here.

    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 context; the required finite-mode construction and statistics are proved explicitly in this manuscript.

    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. Linear-memory context, not a local Hawking-detector correspondence or a substitute for the matrix synthesis proved here.

    Watrous

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

    FewsterVerch

    C. J. Fewster and R. Verch, Quantum fields and local measurements, arXiv:1810.06512v3 (2020). Local system–probe scattering, induced observables, and measurement instruments. No identification of the present effective port with a local Schwarzschild coupling is imported.

    FewsterJubbRuep

    C. J. Fewster, I. Jubb, and M. H. Ruep, Asymptotic measurement schemes for every observable of a quantum field theory, arXiv:2203.09529. doi:10.1007/s00023-022-01239-0. A comparison framework for the open local-observable programme, not an exact finite packet-number apparatus certificate.

    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. Information-problem context only; not a premise for a radiation encoding or recovery channel in this manuscript.

    AMPS

    A. Almheiri, D. Marolf, J. Polchinski, and J. Sully, Black Holes: Complementarity or Firewalls?, Journal of High Energy Physics 02 (2013), 062. arXiv:1207.3123. doi:10.1007/JHEP02(2013)062. Interpretation boundary only; exterior tomography here does not decide the compatibility assumptions in that argument.