All manuscripts

Manuscript Em05-A@1 · Em05-A-v1.tex · 9cac0def

Em05-A Excitation Transfer, Subsystem Purity, and Referenced Information Recovery Exact Diagnostics and Population-Preserving Noise in a Fermionic Extraction Channel

Export Em05-A-v1.tex

Specifies version 1 of one even-parity excitation-qubit extraction channel and its complete complementary channel. Ordinary quantum states, channels, tensor products, and Born probabilities are assumptions of this construction, not theorems inherited from I. Em03-H and Em04-A motivate the comparison and are not formal premises. The XY-chain identities of Em04-A are not imported. thm:channels proves that the phase-corrected signed map is an isometry and writes the Kraus family and the complete complement. thm:marginals gives transferred occupation, occupation-basis coherence, and subsystem purity. thm:information gives the Bell-input spectra and the mutual-information balance. prop:rawneg gives the reference-accessible negativity. thm:specified gives a complete decoder with half-diamond error one minus eta, Bell fidelity (1+3 eta)/4, worst-case target overlap eta, and decoded concurrence eta. That decoder is not presumed optimal at intermediate eta. prop:optimal gives optimal errors 3/4 and 0 at zero and full transfer, and an elementary positive lower bound for eta less than one. An independently declared population-preserving dephasing experiment retains an additional environment. thm:fullNoise gives optimal recovery error (1-lambda)/2 at full transfer, while the Bell-input accessible marginal, occupation, and purity are independent of lambda. Identical marginal diagnostics do not certify recovery. prop:noexact restates that a declared one-species continuum model does not attain exact finite-time transfer. That obstruction is not a numerical error floor and not a quarter-error exclusion. No numerical execution is asserted. The proposed verification checks are unexecuted. Independent execution is not asserted. No reported number is validated. Eta is an extraction probability, not evaporation time. This channel is not passive Hawking evaporation, not a Page curve, not an island, not a black-hole microstate identification, and not a constructed gravitational dictionary. Em03-H's quartic bath and reported P8 numbers do not supply this theorem. Em03-E's pulse-probability error, Em03-F's entanglement-breaking error, Em03-G's packet decoder, En02-C's one-live-qubit error, and En02-D's transmission gap are not this optimal error. H2, I3, and J2 remain unresolved. 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. The series Route B is not discharged. No quantum coefficient is admitted. No compilation is asserted.

Front matter

  • abstractAbstractFront matter · lines 98–123
    Open as its own page

    We analyze a completely specified even-parity excitation-qubit extraction channel and its full complementary channel. The signed isometry yields exact formulas for transferred occupation, occupation-basis coherence, subsystem purity, reference correlations, and deterministic recovery performance. For a Bell input, we determine the accessible and residual spectra, their mutual-information balance, and the reference–accessible negativity. A complete specified decoder has half-diamond error , Bell fidelity , worst-case target overlap , and decoded reference concurrence . We distinguish these formulas from optimal recovery and determine the optimal errors at zero and full transfer.

    An independently declared population-preserving output dephasing experiment retains its additional environment. At full transfer, its optimal recovery error is , while the Bell-input accessible marginal, occupation, and purity are independent of . Complete dephasing therefore leaves perfect occupation delivery and an unchanged accessible marginal, but destroys reference entanglement and prevents exact quantum recovery. These results provide a self-contained information-flow benchmark. They neither identify the channel with black-hole evaporation nor establish a gravitational Page curve. No numerical execution or completed verification package is asserted.

Scope, prior work, and the diagnostic question

  • sectionThe questionScope, prior work, and the diagnostic question › The question · lines 128–148
    Open as its own page

    The following quantities are often considered together:

    1. excitation transferred to an accessible subsystem;

    2. coherence in a specified occupation basis;

    3. entanglement across a specified partition;

    4. purity of an accessible or residual marginal;

    5. recoverability of an unknown quantum message, including its correlations with an external reference.

    They answer different questions.

    This manuscript constructs an exact comparison within a specified channel family. In particular, we prove that a pure accessible subsystem can contain no message information, and that a mixed accessible subsystem can carry a perfectly recoverable quantum message. We also construct two experiments with identical Bell-input accessible marginals and identical excitation populations, but different optimal quantum-recovery errors.

  • sectionEstablished background and contribution boundaryScope, prior work, and the diagnostic question › Established background and contribution boundary · lines 149–179
    Open as its own page

    Finite-dimensional evaporation models have substantial precedent. Avery studies a class encompassing unitary and nonunitary toy evaporation processes Avery. Hayden and Preskill formulate an information-retrieval task under assumptions including unitary, rapidly mixing internal dynamics and extensive access to radiation HaydenPreskill. Neither model is identified with the extractor specified below.

    Reference-based exact recovery is part of the established quantum-error-correction framework KnillLaflamme. Channel continuity and information–disturbance relations are developed by Kretschmann, Schlingemann, and Werner KSW. Bény and Oreshkov formulate approximate-correctability conditions and an environmental dual optimization using worst-case entanglement fidelity BenyOreshkov.

    Our contribution is the explicit diagnostic comparison, complete signed channel construction, and population-preserving noise counterexample for the declared extraction family. We do not claim a new general information–disturbance principle, a new definition of quantum recovery, or first-in-literature priority for the elementary dephasing and replacement-channel calculations.

    The finite channel is restated and proved independently here. The supplied Em03-H-v8 and Em04-A-v2 manuscripts motivate the comparison, but are not formal premises of its proofs. The XY-chain diagnostic identities of Em04-A are not imported into this different excitation code.

  • sectionEvidence and physical boundariesScope, prior work, and the diagnostic question › Evidence and physical boundaries · lines 180–192
    Open as its own page

    Ordinary quantum states, channels, tensor products, and Born probabilities are assumed. The mathematical results are analytical. No compiler log, numerical archive, executed symbolic check, machine-checked proof, or physical receiver accompanies this source.

    The parameter is an extraction probability. It is not identified with black-hole age, radiated entropy, or evaporation time. No passive evaporation, horizon state, gravitational factorization, backreaction estimate, or microscopic gravity dictionary is supplied.

Notation and referenced channel metrics

  • sectionNotation and referenced channel metricsNotation and referenced channel metrics · Em05-A@1#eq:diamond, Em05-A@1#eq:optimal · lines 194–254
    Open as its own page

    For a finite matrix , write

    For states,

    For channels with the same input and output spaces,

    For a difference of finite-dimensional channels, this equals the supremum of the output trace distance over referenced input states. A reference of input dimension suffices. These are standard finite-channel conventions Watrous.

    Let be a logical qubit, an external reference, the accessible two-mode output, and the residual two-mode output. The decoded qubit is . All logarithms in entropy and entanglement expressions are base two.

    For a qubit-output channel , define

    For a purification of , define

    The target overlaps are squared fidelities against their pure targets.

    For an accessible channel , set

    where the input and decoded logical bases are identified.

    A replacement channel is

    and .

  • lemmaLemma: Elementary contraction and effect boundsNotation and referenced channel metrics · Em05-A@1#lem:contraction · proof attached · lines 255–280
    Open as its own page

    A CPTP map contracts trace norm on Hermitian inputs. Consequently trace distance contracts under channels, and channel half-diamond distance contracts under fixed CPTP postprocessing. For states and an effect ,

    Proof. For the Hermitian Jordan decomposition , positivity and trace preservation give

    The same argument applies with a reference because a CPTP map remains positive after tensoring with its identity. For the effect bound, the trace-zero difference has positive and negative parts of equal trace . Testing either part against proves the assertion.

The complete signed extraction channel

  • sectionOccupation ordering and the declared isometryThe complete signed extraction channel › Occupation ordering and the declared isometry · lines 285–304
    Open as its own page

    Set

    with ordered occupation bases

    The two occupations in each subsystem refer to two distinct species or modes. The fixed tensor representation is bath first, residual second.

    Let

    Here is a residual probability, not a time variable.

  • definitionDefinition: Phase-corrected signed extractorThe complete signed extraction channel › Occupation ordering and the declared isometry · Em05-A@1#def:extractor, Em05-A@1#eq:Vzero, Em05-A@1#eq:Vone · lines 305–326
    Open as its own page

    The map is

    Define the accessible and complete complementary channels by

  • remarkRemark: Fermionic signs and logical parityThe complete signed extraction channel › Occupation ordering and the declared isometry · lines 328–342
    Open as its own page

    The minus sign in (eq:Vone) is the bath-first CAR sign. For residual creators and bath creators , expand

    Moving bath creators before residual creators gives precisely (eq:Vone). Both logical basis vectors have even total fermionic parity. The reference is an abstract logical register, not an additional occupation mode. All partial traces use the specified occupation representation.

  • remarkRemark: Relation to a complex transfer amplitudeThe complete signed extraction channel › Occupation ordering and the declared isometry · lines 344–353
    Open as its own page

    If an uncorrected amplitude is , the occupied column has coefficients . Applying the accessible phase correction gives Definition def:extractor. The phase is fixed independently of the logical input. The ideal-phase results below do not certify an estimated or implemented phase correction.

  • theoremTheorem: Physicality and explicit channelsThe complete signed extraction channel › Kraus operators and the complete complement · Em05-A@1#thm:channels, Em05-A@1#eq:kraus, Em05-A@1#eq:complement · proof attached · lines 357–398
    Open as its own page

    The map is an isometry for every . Both channels in Definition def:extractor are CPTP.

    A Kraus family for , indexed by residual occupation, is

    The complete complement is

    These formulas retain arbitrary external references.

    Proof. The two columns of are orthogonal, and the occupied column has squared norm

    Thus . Reading its coefficients in the residual basis gives (eq:kraus). Direct calculation gives

    The accessible map is therefore CPTP. The second partial trace of the same isometry is CPTP and gives (eq:complement). Tensoring the defining isometry with proves the reference statement.

  • remarkRemark: Fixed spectator systemsThe complete signed extraction channel › Kraus operators and the complete complement · lines 400–406
    Open as its own page

    Tensoring with a fixed pure spectator state does not change any formula below. The spectator remains part of the complete environment, but adds no entropy or logical dependence. An input-correlated or mixed spectator is not covered by this simplification without retaining its preparation purification.

Excitation, coherence, and subsystem purity

  • sectionExcitation, coherence, and subsystem purityExcitation, coherence, and subsystem purity · Em05-A@1#eq:input · lines 409–421
    Open as its own page

    Write an arbitrary logical density matrix as

  • theoremTheorem: Exact marginal matrices and diagnosticsExcitation, coherence, and subsystem purity · Em05-A@1#thm:marginals, Em05-A@1#eq:rhoR, Em05-A@1#eq:rhoE, Em05-A@1#eq:occupation, Em05-A@1#eq:coherence, Em05-A@1#eq:purity · proof attached · lines 422–494
    Open as its own page

    In the declared occupation bases,

    \rho_R=\mathcal N_\eta(\rho_M)
     &=
     \begin{pmatrix}
     1-p+pt^2&0&0&\eta z\\
     0&p\eta t&0&0\\
     0&0&p\eta t&0\\
     \eta z^*&0&0&p\eta^2
     \end{pmatrix},
     \label{eq:rhoR}\\
     \rho_E=\mathcal C_\eta(\rho_M)
     &=
     \begin{pmatrix}
     1-p+p\eta^2&0&0&t z\\
     0&p\eta t&0&0\\
     0&0&p\eta t&0\\
     t z^*&0&0&pt^2
     \end{pmatrix}.
     \label{eq:rhoE}

    For

    on the respective subsystems,

    The distinguished occupation-basis coherences are

    The accessible purity is

    The residual purity follows by interchanging and .

    Proof. Insert (eq:input) into the Kraus expressions. Only contributes the accessible coherence. For the complement, the only off-diagonal residual matrix units are and their adjoints, with coefficient . This gives (eq:rhoR) and (eq:rhoE).

    Tracing either marginal against its number operator gives

    The coherence formulas are their displayed entries. For a Hermitian matrix, . Applying this identity to (eq:rhoR) gives (eq:purity).

  • corollaryCorollary: Global retention versus marginal lossExcitation, coherence, and subsystem purity · Em05-A@1#cor:global · proof attached · lines 496–518
    Open as its own page

    For every logical state,

    The nonzero eigenvalues of are those of . In particular,

    For every purified input, the joint referenced output is pure. Thus the declared isometry does not globally destroy information.

    Proof. The occupation statement follows from . An isometry preserves inner products and embeds the spectral decomposition of its input with the same nonzero eigenvalues. Tensoring with a reference preserves the norm and purity of a purified input.

  • remarkRemark: Different diagnostic contentExcitation, coherence, and subsystem purity · lines 520–527
    Open as its own page

    Occupation means depend only on . The purity also depends on , and the coherence depends on the declared basis. A single input's marginal purity or coherence is not a criterion for recovery of all referenced inputs. Loss of accessible information means failure of recovery from , not nonunitarity of the retained experiment.

Bell-input reference correlations

  • sectionBell-input reference correlationsBell-input reference correlations · lines 530–539
    Open as its own page

    Set

    The logical marginal is , so and in the marginal formulas.

  • theoremTheorem: Spectra and mutual-information balanceBell-input reference correlations · Em05-A@1#thm:information, Em05-A@1#eq:BellSpectrum, Em05-A@1#eq:MIr, Em05-A@1#eq:MIe, Em05-A@1#eq:balance · proof attached · lines 540–601
    Open as its own page

    For the Bell input,

    including zero multiplicities. The residual spectrum is obtained by interchanging and .

    With

    using , one has

    Consequently,

    and

    Proof. For the Bell input the matrices (eq:rhoR) and (eq:rhoE) are diagonal, giving the spectra. The global state is pure and . For a pure bipartite state the two reduced states have the same nonzero spectrum: expand its coefficient matrix and compare the nonzero eigenvalues of and . Apply this to and to obtain and . This proves (eq:MIr)–(eq:balance).

    At the endpoints the spectra give entropies in opposite orders. At , the spectra coincide. Squaring and summing the accessible eigenvalues gives the three displayed purities.

  • remarkRemark: No duplication theorem is claimedBell-input reference correlations · lines 603–608
    Open as its own page

    Equation (eq:balance) is a pure-state mutual-information identity. Mutual information includes classical correlations. It is neither a statement that both subsystems contain an independently recoverable qubit nor a gravitational entropy law.

  • sectionEntanglement before decodingBell-input reference correlations › Entanglement before decoding · lines 610–619
    Open as its own page

    For an ordinary bipartite density matrix, define negativity by

    with partial transpose in the declared reference basis VidalWerner.

  • propositionProposition: Exact reference–accessible negativityBell-input reference correlations › Entanglement before decoding · Em05-A@1#prop:rawneg, Em05-A@1#eq:rawneg · proof attached · lines 620–658
    Open as its own page

    For the Bell-input state,

    Thus the reference and accessible output are entangled for every .

    Proof. The only coherence of connects and , with coefficient . Under , it enters the block on :

    Its eigenvalues are

    All remaining eigenvalues are nonnegative diagonal entries or zeros. The negative eigenvalue therefore gives (eq:rawneg). A separable state's partial transpose is positive, because transposition preserves positivity of each factor in a separable decomposition. The strictly negative eigenvalue at proves entanglement.

  • sectionEntanglement before decodingBell-input reference correlations › Entanglement before decoding · lines 658–663
    Open as its own page

    This proposition concerns , not the partition between the two bath modes. Reference entanglement can survive even when exact recovery is impossible.

A complete specified decoder and optimal-recovery boundaries

  • sectionA complete specified decoder and optimal-recovery boundariesA complete specified decoder and optimal-recovery boundaries · lines 665–673
    Open as its own page

    Let

  • definitionDefinition: Specified complete decoderA complete specified decoder and optimal-recovery boundaries · Em05-A@1#eq:decoder · lines 674–683
    Open as its own page

    Define

    Every off-code event is retained and mapped to the maximally mixed decoded qubit.

  • lemmaLemma: Decoder physicalityA complete specified decoder and optimal-recovery boundaries · proof attached · lines 685–698
    Open as its own page

    The map is CPTP on every input state on .

    Proof. Use the retained Kraus operator , together with

    Their effects sum to . Their Kraus sum is exactly (eq:decoder).

  • theoremTheorem: Exact specified-decoder performanceA complete specified decoder and optimal-recovery boundaries · Em05-A@1#thm:specified, Em05-A@1#eq:decoded, Em05-A@1#eq:specifiedError, Em05-A@1#eq:BellFid, Em05-A@1#eq:WorstFid, Em05-A@1#eq:decodedBell, Em05-A@1#eq:decodedConc · proof attached · lines 700–774
    Open as its own page

    The decoded channel is

    It satisfies

    For the Bell-input decoded state,

    the two-qubit concurrence is

    No optimality of is asserted for intermediate .

    Proof. The odd occupations in (eq:rhoR) contribute after decoding. The decoded lower-right entry is , and its off-diagonal entry is . The upper-left entry is . This proves (eq:decoded).

    A half-diamond distance between channels is at most one. The identity and replacement by attain distance one on input . Homogeneity therefore gives (eq:specifiedError).

    The replacement term's Bell overlap is , proving (eq:BellFid). For any purified input, the target overlap of (eq:decoded) is at least , because the replacement contribution is nonnegative. Input gives zero replacement contribution and attains , proving (eq:WorstFid).

    For concurrence, use Wootters' definition Wootters: the concurrence is the positive part of the largest square-root eigenvalue of minus the other three, where

    In the ordered basis , (eq:decodedBell) is

    The square-root eigenvalues are

    Their difference is .

  • propositionProposition: No exact intermediate recovery and endpoint optimaA complete specified decoder and optimal-recovery boundaries › What can be said about all decoders · Em05-A@1#prop:optimal, Em05-A@1#eq:elementaryLower, Em05-A@1#eq:endpointOptimal · proof attached · lines 778–835
    Open as its own page

    For ,

    For all ,

    At the endpoints,

    In particular, the specified decoder's error one at is not the optimal error.

    Proof. Let . These states are diagonal and

    For any decoder with error , its decoded basis inputs are within of their respective orthogonal targets. The triangle inequality and contraction imply

    Thus .

    The specified decoder gives the upper bound . Another decoder ignores its input and returns . For Pauli matrices ,

    The triangle inequality gives its distance to the identity at most .

    At , every decoded channel is a replacement . Its Bell output is , whose overlap with is , independently of . The Bell-projector effect and Lemma lem:contraction give distance at least . The maximally mixed replacement attains the preceding upper bound. At , , and the specified decoder is its left inverse.

  • remarkRemark: Purity endpointsA complete specified decoder and optimal-recovery boundaries › What can be said about all decoders · lines 837–846
    Open as its own page

    At , the accessible subsystem is pure vacuum for every message, but the optimal recovery error is . At , a Bell input produces an accessible marginal of purity , but recovery is exact.

    At full transfer the residual subsystem is pure vacuum. That purity certifies neither residual recovery nor global loss: the message has moved to .

Population-preserving dephasing with its complete environment

  • sectionPopulation-preserving dephasing with its complete environmentPopulation-preserving dephasing with its complete environment · lines 849–854
    Open as its own page

    The original extractor is now followed by a separately specified noise channel. It is a different experiment, not a hidden property of Definition def:extractor.

  • sectionPhysical output operation and dilationPopulation-preserving dephasing with its complete environment › Physical output operation and dilation · Em05-A@1#eq:dephaser, Em05-A@1#eq:dephasingDilation · lines 855–897
    Open as its own page

    On the entire accessible space define

    It is Hermitian, unitary, parity preserving, and commutes with every occupation projector and with .

    For , put

    and define

    Let be an additional environmental register. The isometry

    is a dilation of .

    Define

    with the fixed output reordering . The new accessible channel is

    Its complete environment is , not merely .

  • propositionProposition: Complete noisy channel and unchanged populationsPopulation-preserving dephasing with its complete environment › Physical output operation and dilation · Em05-A@1#prop:noisy · proof attached · lines 898–929
    Open as its own page

    A Kraus family for is

    Its complete complement is

    The marginal is (eq:rhoR) with replaced by , and its adjoint entry replaced accordingly. All occupation probabilities and are unchanged for every input.

    Proof. Since and , the Kraus effects sum to . Taking both partial traces of gives the channels and complement. Conjugation by leaves diagonal entries unchanged and negates the coherence. The weighted sum multiplies that coherence by .

  • sectionPhysical output operation and dilationPopulation-preserving dephasing with its complete environment › Physical output operation and dilation · lines 929–944
    Open as its own page

    At , the noisy accessible channel has no dependence on :

    It is a measure-and-prepare channel. Its referenced output is separable, because it is a sum of positive reference operators tensored with prepared output states. Complete dephasing therefore destroys accessible reference entanglement for every .

  • sectionFull-transfer noise: exact optimal recoveryPopulation-preserving dephasing with its complete environment › Full-transfer noise: exact optimal recovery · Em05-A@1#eq:fullNoisy · lines 945–965
    Open as its own page

    At , set

    Their overlap is .

    The full-transfer noisy isometry is

  • theoremTheorem: Exact noisy full-transfer comparisonPopulation-preserving dephasing with its complete environment › Full-transfer noise: exact optimal recovery · Em05-A@1#thm:fullNoise, Em05-A@1#eq:noiseOptimal, Em05-A@1#eq:identicalMarginal, Em05-A@1#eq:noiseMIr, Em05-A@1#eq:noiseMIe · proof attached · lines 966–1052
    Open as its own page

    For the full-transfer dephasing experiment,

    The specified decoder attains this optimum. For its Bell-input decoded output,

    The Bell-input accessible marginal is independent of :

    Writing

    with its continuous endpoint values, the mutual informations are

    At complete dephasing, , occupation delivery is perfect, decoded concurrence is zero, and the optimal recovery error is .

    Proof. On the logical qubit, the specified decoded channel is

    The channels and have half-diamond distance one: input gives orthogonal outputs. Hence

    For the lower bound valid for every decoder, use logical inputs and . Their noisy accessible outputs have trace distance , whereas their ideal targets have distance one. A decoder of error must therefore satisfy

    Thus , proving optimality.

    The decoded Bell state is

    Its overlap with is . Its spin-flip square-root eigenvalues are , so its concurrence is .

    Tracing the reference in (eq:fullNoisy) gives (eq:identicalMarginal). The marginal is

    Thus , while . The joint state is pure, so the same pure-state entropy argument as in Theorem thm:information gives (eq:noiseMIr) and (eq:noiseMIe).

  • corollaryCorollary: Identical marginal diagnostics do not certify recoveryPopulation-preserving dephasing with its complete environment › Full-transfer noise: exact optimal recovery · Em05-A@1#cor:separation · proof attached · lines 1054–1070
    Open as its own page

    For the Bell input, the noiseless full-transfer experiment and the completely dephased experiment have identical accessible density matrices. They therefore have identical accessible occupation probabilities, purity, and every other observable depending only on that marginal.

    Nevertheless their optimal recovery errors are respectively and , their decoded reference concurrences are and , and their reference–accessible mutual informations are and .

    Proof. Apply Theorem thm:fullNoise at its two endpoints.

  • remarkRemark: The information is not deleted from the full dilationPopulation-preserving dephasing with its complete environment › Full-transfer noise: exact optimal recovery · lines 1072–1085
    Open as its own page

    At , and are orthogonal. For the Bell input, the complete output has the form

    The accessible reference state is only classically correlated. The retained isometry still preserves the input qubit. Discarding creates the accessible dephasing channel. Keeping only the original vacuum residual would incorrectly hide the environmental information.

Certified approximation interfaces

  • sectionCertified approximation interfacesCertified approximation interfaces · lines 1088–1093
    Open as its own page

    The preceding formulas are exact identities for declared channels. They do not assert a validated amplitude for a particular numerical or continuum experiment.

  • propositionProposition: Transmission intervalsCertified approximation interfaces · Em05-A@1#prop:interval · proof attached · lines 1094–1123
    Open as its own page

    If a validated calculation establishes

    then the ideal-phase specified decoder satisfies

    For a fixed known ,

    Purity can be enclosed by outward evaluation of (eq:purity), but it must not be presumed monotone in .

    Proof. The first four quantities are affine in with the displayed monotonicity. The purity is an explicit polynomial in , so inclusion-preserving interval evaluation encloses its value.

  • propositionProposition: Channel-model error and recovery stabilityCertified approximation interfaces · Em05-A@1#prop:stability · proof attached · lines 1125–1189
    Open as its own page

    Suppose two accessible channels with the same types obey

    For any fixed CPTP decoder ,

    Their optimal recovery errors also satisfy

    For every common referenced input, their output states have trace distance at most . For the corresponding accessible marginals,

    and

    For a fixed decoder, the Bell fidelities differ by at most .

    Proof. Postprocessing contraction and the reverse triangle inequality prove the fixed-decoder statement. Apply it for every decoder and take infima in both directions to obtain optimal-error stability. The referenced state bound is the definition of channel distance.

    For purity,

    Since the state difference has trace zero, center the occupation operator:

    because . For distinct basis vectors and Hermitian ,

    This follows by testing against a phase-aligned Hermitian off-diagonal operator of norm one. It gives the coherence-entry estimate. The Bell-projector effect bound gives the fidelity estimate.

  • remarkRemark: What must be certified separatelyCertified approximation interfaces · lines 1191–1224
    Open as its own page

    A transmission interval does not automatically certify:

    • a physical gravitational identification;

    • the implementation of the decoder;

    • the accuracy of a phase correction;

    • a common identification of residual wavefunctions across different experiments;

    • a comparison of their physical complementary channels.

    State residual bounds of the kind developed in Em04-A are useful interfaces, but a single-state bound is not automatically a referenced channel bound. A channel certificate must control the specified channel on arbitrary referenced inputs.

    For an implemented phase error , the noiseless decoded channel instead has the form

    Its half-diamond error is at most

    Indeed the relevant unitary channel has distance from the identity: its numerical range has minimal modulus , and the pure referenced output distance is the square root of one minus the squared overlap. This phase allowance and any additional implementation error must be charged rather than absorbed into an unverified ideal-phase statement.

Interpretation and mathematical conclusion

  • sectionInterpretation and mathematical conclusionInterpretation and mathematical conclusion · lines 1227–1256
    Open as its own page

    {}1.15

    DiagnosticQuestion answered
    Transferred occupationHow much excitation reaches the accessible modes?
    Occupation-basis coherenceWhich off-diagonal entry survives in the declared basis?
    Accessible or residual purityHow mixed is that marginal for the chosen input?
    Reference–accessible negativityIs the chosen referenced output entangled across ?
    Decoded concurrenceHow much two-qubit reference entanglement remains after the specified decoder?
    Mutual informationHow much total correlation is present for the chosen input?
    Specified half-diamond errorHow well does this complete decoder work on all referenced inputs?
    Optimal recovery errorHow well can any deterministic CPTP decoder work?
  • theoremTheorem: Diagnostic separationInterpretation and mathematical conclusion · Em05-A@1#thm:release · proof attached · lines 1257–1298
    Open as its own page

    For the declared extraction and output-noise experiments:

    1. The signed extraction map and its complete complement are physical for every .

    2. Occupation, coherence, purity, Bell-input spectra, reference mutual information, and reference negativity obey the proved identities.

    3. The specified decoder has error , Bell fidelity , worst-case target overlap , and decoded concurrence .

    4. Exact recovery is impossible at , but the specified decoder is not presumed optimal there. Optimal recovery errors at are .

    5. Population-preserving dephasing retains an additional complete environment. At full transfer its optimal recovery error is , although the Bell-input accessible marginal is independent of .

    6. Accessible marginal purity, occupation delivery, and even knowledge of the complete accessible marginal for a single Bell-input experiment do not replace a referenced channel-recovery criterion.

    These are finite-channel information-flow results. They do not establish black-hole evaporation, a gravitational Page curve, or a solution to the black-hole information paradox.

    Proof. Theorem thm:channels proves (i). Theorem thm:marginals, Theorem thm:information, and Proposition prop:rawneg prove (ii). Theorem thm:specified proves (iii). Proposition prop:optimal proves (iv). Proposition prop:noisy and Theorem thm:fullNoise prove (v). The purity endpoints and Corollary cor:separation prove (vi). None of the hypotheses specifies a gravitational identification.

  • sectionInterpretation and mathematical conclusionInterpretation and mathematical conclusion · lines 1298–1308
    Open as its own page

    The natural application is an exactly solvable benchmark for information-flow diagnostics and recovery certification. A sequential evaporation-like model would require newly specified fresh output registers, an access schedule, internal dynamics, and a complete environment at every step. Such a construction is not obtained by relabeling as time.

Continuum interpretation and endpoint attainability

  • sectionContinuum interpretation and endpoint attainabilityContinuum interpretation and endpoint attainability · lines 1310–1355
    Open as its own page

    The finite family includes as an exact mathematical endpoint. It does not imply that the retained-storage continuum experiment of Em03-H attains that endpoint.

    For clarity, the obstruction can be restated independently. Let

    Take , a initially vacant bath level, and the initial one-species state

    For finite extraction time , use bounded piecewise continuous real controls and the generator

    on .

    Relative to , the perturbation is bounded, self-adjoint, and finite rank. Its interaction-picture Dyson series gives a unitary propagator. Put

    Variation of constants gives

  • propositionProposition: No exact finite-time continuum transferContinuum interpretation and endpoint attainability · Em05-A@1#prop:noexact · proof attached · lines 1356–1383
    Open as its own page

    In this declared continuum model, for finite .

    Proof. If , unitarity forces . Since , the packet formula implies

    for almost every positive . The function is bounded and integrable. Both sides extend to entire functions. Their equality on a full-measure subset of a real interval gives equality everywhere by continuity and the identity theorem.

    At , , the left side is , whereas

    The right side tends to zero and the left side is at least one, a contradiction.

  • sectionContinuum interpretation and endpoint attainabilityContinuum interpretation and endpoint attainability · lines 1383–1390
    Open as its own page

    This proposition supplies neither a uniform positive numerical error floor nor a quarter-error exclusion. It distinguishes physical endpoint attainability in this model from endpoint identities of the abstract channel family. No numerical value of is asserted here.

Analytical corrections and submission checks

  • sectionAnalytical corrections and submission checksAnalytical corrections and submission checks · lines 1392–1432
    Open as its own page

    The construction incorporates the following corrections to the motivating proposal:

    1. The transfer family is stated independently of its continuum realization. Full transfer is not falsely reported as a finite-time continuum result.

    2. The specified decoder's zero-transfer error is one, whereas the optimal deterministic error is .

    3. The Bell-input spectra and mutual-information values are labeled as input-specific.

    4. The complete noisy complement includes the dephasing register .

    5. At full transfer, complete dephasing has optimal recovery error , proved for all deterministic decoders.

    6. Reference concurrence is calculated using the spin-flip spectrum, not identified with a bath-mode entanglement measure.

    7. The extraction parameter is not assumed monotone along a physical time trajectory.

    8. The Knill–Laflamme journal citation uses the publisher's Physical Review A article, rather than the conflicting journal metadata displayed on the supplied arXiv landing page.

    Before claiming an executed verification package, independently:

    • compile until all references stabilize and inspect the PDF;

    • construct the isometry matrices directly and check ;

    • trace the full referenced states independently of the displayed marginal formulas;

    • compare spin-flip and partial-transpose spectra with the analytical expressions, including ;

    • verify the noisy isometry with all registers retained;

    • retain input data, package versions, tolerances, raw outputs, and failures for every executed numerical test.

    These are proposed checks, not execution claims. Floating-point agreement is not a rigorous certificate.

Declarations

  • sectionDeclarationsDeclarations · lines 1433–1454
    Open as its own page

    . This single source contains the model, proofs, and internal bibliography. No external data are required for typesetting.

    . No compilation, numerical calculation, independent symbolic execution, or formal proof checking is claimed.

    interpretation. The work is a finite-channel benchmark motivated by information-flow questions. It does not identify the residual subsystem with a black-hole interior, the accessible bath with Hawking radiation, or either parameter with gravitational evolution.

    . Quantum recovery, complementary channels, entropy identities, concurrence, negativity, and dephasing are established frameworks. The model-specific calculations are proved here without claiming a new general foundation or exhaustive novelty verification.

  • bibliographyReferencesDeclarations · lines 1455–1526
    Open as its own page

    Avery

    S. G. Avery, “Qubit Models of Black Hole Evaporation,” arXiv:1109.2911v2 [hep-th] (2012). Used as context for finite-dimensional evaporation models, not as a derivation of the present extractor.

    HaydenPreskill

    P. Hayden and J. Preskill, “Black holes as mirrors: quantum information in random subsystems,” Journal of High Energy Physics 09 (2007), 120. DOI: 10.1088/1126-6708/2007/09/120. arXiv:0708.4025. Used as recovery-task precedent under its own dynamical and access assumptions.

    KnillLaflamme

    E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Physical Review A 55, 900–911 (1997). DOI: 10.1103/PhysRevA.55.900. Preprint title: “A Theory of Quantum Error-Correcting Codes,” arXiv:quant-ph/9604034. Used for the established reference-based exact-recovery framework.

    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, 1708–1717 (2008). DOI: 10.1109/TIT.2008.917696. arXiv:quant-ph/0605009. Used as information–disturbance and channel-continuity background.

    BenyOreshkov

    C. Bény and O. Oreshkov, “General conditions for approximate quantum error correction and near-optimal recovery channels,” Physical Review Letters 104, 120501 (2010). DOI: 10.1103/PhysRevLett.104.120501. arXiv:0907.5391. Used as approximate-recovery background; its fidelity metric is not silently identified with the half-diamond metric used here.

    Watrous

    J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018). Used for finite channels, referenced channel norms, and entropy conventions.

    Wootters

    W. K. Wootters, “Entanglement of formation of an arbitrary state of two qubits,” Physical Review Letters 80, 2245–2248 (1998). DOI: 10.1103/PhysRevLett.80.2245. arXiv:quant-ph/9709029. Used for the concurrence definition.

    VidalWerner

    G. Vidal and R. F. Werner, “Computable measure of entanglement,” Physical Review A 65, 032314 (2002). DOI: 10.1103/PhysRevA.65.032314. arXiv:quant-ph/0102117. Used for the negativity definition.