{"id":"f5e3f834-0ed0-46a1-ae0c-493aa2eed86c","arxiv_id":"2608.05535","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A new quantum information loss measure, minimized over input ensembles and output measurements, vanishes exactly when a code satisfies the Knill-Laflamme error-correction conditions.","lead":"The paper defines a new measure of how much information a quantum process loses, based on how well Bob can guess which state Alice sent after measuring the channel output. It proves that this loss vanishes exactly when the code satisfies the standard Knill-Laflamme error-correction conditions, and applies the measure to a black hole evaporation model.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The Hayden–Preskill recovery conclusion rests on an unproved quantitative stability statement: small K or small output overlap is asserted to imply near-perfect recovery with fidelity 1−O(g(ϵ)), but no g is supplied and Theorem 4 only provides Haar-averaged bounds.","rationale":"The reader's weakest assumption correctly identifies the approximate quantum error correction continuity step as the load-bearing gap. The exact Theorem 3 is well argued and independently checkable; the proof of (ii)⇒(iii) uses a nondegenerate two-state mixture and contractivity of trace distance to force orthogonality of any zero-loss ensemble, which is sound. No fatal flaw appears in the exact equivalence. The Hayden–Preskill application, however, is not a direct consequence of Theorem 3 because the theorem is exact, whereas the channel only becomes approximately pristine in Haar average. The paper's Section IV contains a qualitative assertion of a stability result but no proof, no explicit function g, and no verification that the hypothesis of that assertion (sup over states of K) follows from the proven Haar-averaged bounds. This is precisely the kind of missing support that justifies a conditional verdict rather than acceptance. A concrete analytical check—proving the stated stability bound and applying it to the HP channel—would settle whether the recovery conclusion holds and at what threshold. The authors' own discussion of the scaling difference shows awareness, but awareness does not substitute for a theorem. Thus the reader's CONDITIONAL verdict is appropriate and should remain unchanged.","tokens_in":14626,"tokens_out":19042,"duration_ms":185191,"concrete_test":"Prove or refute the following stability statement: for every channel E and projector P onto H_code, if sup_{ψ⊥ϕ} Tr[E(ψ)E(ϕ)] ≤ ϵ, then there exists a recovery channel R with min_{|ψ⟩∈H_code} F_r(ψ, (R∘E)(ψ)) ≥ 1 − C ϵ^a for universal constants C,a. If true, instantiate it for the Hayden–Preskill channel with ϵ = 2^{k/2−s} and compute the explicit recovery fidelity as a function of k and s; verify whether this fidelity is near 1 already at s ∼ k or only at parametrically larger s. If the bound fails or gives a slow rate, the paper's recovery conclusion must be weakened to a conjecture.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The exact Theorem 3 equivalence appears sound: universal pristineness, vanishing K on the code, Knill–Laflamme conditions, and perfect recoverability are correctly identified, and the Supplemental proof is plausible. However, the paper's advertised application to Hayden–Preskill evaporation requires an approximate version of Theorem 3 that is never stated or proved. The passage in Section IV beginning 'To rigorously establish the link to approximate quantum error correction' asserts that if sup_ρ K(ρ,E) ≤ ϵ then the Kraus operators approximately satisfy P E_α†E_β P ≈ c_{αβ} P, and that standard continuity bounds [19,20] yield a recovery channel with worst-case root fidelity at least 1 − O(g(ϵ)), with g(ϵ)→0. No explicit g, no derivation, and no precise hypothesis are given. Moreover, Theorem 4 does not supply the needed sup_ρ K(ρ,E) ≤ ϵ bound; it proves only Haar-averaged statements: E_U sup_{ψ⊥φ} Fr(E_{U,s}(ψ), E_{U,s}(φ)) ≤ 2^{k/2−s} and E_U K(ρ_A, E_{U,s}) ≤ f_m(Δ_HP(ρ_A,s)). A conclusion of near-perfect recovery for a typical channel U requires a quantitative continuity theorem whose hypothesis is matched to these averaged bounds, and a guarantee that the resulting recovery fidelity tends to 1 as s→∞ with a controlled rate. Without this step, the sentence 'an unknown quantum state falling into a Hayden–Preskill black hole admits near perfect recovery' is not a consequence of the proven results. The authors honestly disclaim the threshold scaling, but the logical gap remains central to the application's conclusion.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces an operational measure of information loss K(ρ,E) for prepare-evolve-measure scenarios, defined as the minimum, over pure-state decompositions of ρ and output POVMs, of the classical conditional entropy of Alice's preparation given Bob's outcome. The authors prove that a channel is \"pristine\" with respect to an ensemble exactly when the output states have mutually orthogonal supports, and that vanishing K for all states on a code subspace is equivalent to \"universal pristineness,\" to the Knill-Laflamme conditions, and to perfect recoverability of the code. They then apply the framework to the Hayden-Preskill model, showing Haar-averaged bounds on a measure of non-pristineness and on the intrinsic information loss, and conclude that the evaporation channel becomes asymptotically universally pristine and therefore that infalling quantum information admits near-perfect recovery from the radiation.","tokens_in":14905,"tokens_out":4748,"duration_ms":47571,"significance":"The exact equivalence in Theorem 3 is a clean and potentially useful information-theoretic reformulation of quantum error correction: it identifies zero intrinsic information loss on a code with the Knill-Laflamme conditions, without introducing an auxiliary reference system. The proofs in the Supplemental Material are detailed and appear correct; the measure is defined self-containedly, and no parameters are fitted to arrive at the main equivalence. The Hayden-Preskill application is suggestive and the Haar-averaged bounds in Theorem 4 are plausibly derived, but the advertised recovery conclusion is not rigorously supported by the stated results. If the missing approximate stability step can be supplied, the framework would be a valuable diagnostic for information retrieval in black hole evaporation; as it stands, the paper's central rigorous contribution is the exact equivalence, while the application overreaches.","major_comments":[{"comment":"The paper asserts that if sup_ρ K(ρ,E) ≤ ε for states supported on the code, then the Kraus operators approximately satisfy the Knill-Laflamme conditions, and that standard continuity bounds guarantee a recovery map with worst-case root fidelity at least 1 − O(g(ε)) for some monotonically increasing g vanishing at 0. No explicit g, no derivation, and no precise hypotheses are given, and the cited references are only invoked qualitatively. This step is load-bearing: without it, the paper does not establish that small intrinsic information loss implies near-perfect recovery. The statement should be formulated as a theorem with a concrete bound and a proof, or the application should be scaled back.","section":"Section IV, paragraph beginning 'To rigorously establish the link to approximate quantum error correction'"},{"comment":"Theorem 4 supplies only Haar-averaged statements: E_U sup_{ψ⊥φ} Fr(E_{U,s}(ψ), E_{U,s}(φ)) ≤ 2^{k/2−s} and E_U K(ρ_A, E_{U,s}) ≤ f_m(Δ_HP(ρ_A,s)). The approximate error-correction step in Section IV requires a per-channel bound sup_ρ K(ρ,E) ≤ ε, not an average over U. Even with a valid stability theorem, the hypotheses of Theorem 4 do not match: smallness of the Haar mean does not imply smallness for a typical fixed channel unless a concentration argument is supplied. The sentence 'an unknown quantum state falling into a Hayden-Preskill black hole admits near perfect recovery' therefore does not follow from the proven results as they stand.","section":"Section V, Theorem 4 and the paragraph following it"},{"comment":"The term 'asymptotically universally pristine' is used to describe a bound on the Haar average of the root fidelity between outputs of orthogonal inputs, whereas universal pristineness in Theorem 3 is an exact, per-channel condition that E(ψ)E(ϕ)=0 for all orthogonal code states. The paper does not define what an approximate or asymptotic version of universal pristineness means in a way that connects to the exact equivalence. A precise definition of approximate universal pristineness, and a proof that ϵ(s)→0 implies the relevant approximate recovery statement for a typical channel, are needed before the Page-time retrieval claim can be regarded as a consequence of the framework.","section":"Section V, definition of ϵ(s) and Theorem 4(i)"}],"minor_comments":[{"comment":"The word 'pristiness' appears in the first paragraph of the Discussion; it should be 'pristineness'.","section":"Section VI, Discussion"},{"comment":"The sentence contains 'the the intrinsic information loss'; the duplicated article should be removed.","section":"Section II, paragraph following Theorem 1"},{"comment":"The spelling 'probabilisitic' should be corrected to 'probabilistic'.","section":"Section III, first paragraph"},{"comment":"The phrase 'Bob's obtains' should read 'Bob obtains'.","section":"Section II, first paragraph"},{"comment":"The notation for the code subspace is inconsistent: the main text uses both H_code and H code, and the Supplemental uses H_code. One notation should be used consistently.","section":"Throughout"},{"comment":"The sentence 'As the equivalence of conditions iii and iv have been established' should be 'has been established', and it would help to state explicitly that the cited Knill-Laflamme theorem is being invoked rather than proved.","section":"Section IV, statement of Theorem 3"}],"recommendation":"major_revision","confidential_remarks":"The exact-equivalence part of the paper is solid and likely publishable on its own. The Hayden-Preskill application needs substantially more work: the authors must either prove the missing approximate stability theorem with matching hypotheses, or restate the application as a conjecture. The current draft's central advertised claim goes beyond what Theorem 4 proves, and the stress-test concern about the Section IV continuity step is well founded."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The real content here is Theorem 3, and it is good. The intrinsic measure K(ρ,E), minimized over pure-state ensembles and output POVMs, is genuinely new and reference-free. The equivalence of universal pristineness, vanishing K on a code, the Knill-Laflamme conditions, and perfect recoverability is carefully proved in the Supplemental Material and looks correct. That is a useful operational rephrasing of QEC, and the paper earns its keep on that alone.\n\nThe Hayden-Preskill application is where I start to hesitate. Theorem 4 gives Haar-averaged bounds: mean root fidelity between orthogonal outputs ≤ 2^{k/2−s}, and mean K ≤ f_m(Δ_HP(ρ_A,s)). Those derivations are plausible. But the paper then cashes this in for a much stronger claim: that a small sup_ρ K(ρ,E) implies approximate Knill-Laflamme and a recovery channel with fidelity 1 − O(g(ε)). That stability statement is asserted in Section IV with citations to [19,20] and no explicit g, no derivation, and no matching of hypotheses. Theorem 4 does not supply the needed sup bound; it supplies averaged bounds. So the sentence about an unknown quantum state admitting near-perfect recovery after the Page time is not actually a consequence of the proven results as written. The authors are honest about the scaling difference from standard Hayden-Preskill, which I appreciate, but they do not flag this logical gap. Either they should prove the stability step or label the recovery conclusion as conjectural.\n\nMinor issues: a few typos (\"pristiness\", \"the the\"), and the proof of (iii)⇔(iv) in Theorem 3 is deferred to the literature, which is fine. The self-citation to the authors' classical information-loss work is motivational, not load-bearing, so no circularity concern.\n\nOverall: the exact equivalence is solid, the application is suggestive but incomplete. This deserves a serious referee who can push on the approximate-QEC step. I would read a revised version again and would cite Theorem 3 in my own work; the HP part would need the gap closed first.","headline":"A clean new measure of quantum information loss with a solid exact equivalence to quantum error correction, but the Hayden-Preskill application leans on an unproved continuity step.","tokens_in":15495,"tokens_out":963,"would_cite":true,"duration_ms":11006,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that zero intrinsic information loss on a code space is exactly quantum error correctability, and applies the criterion to black-hole evaporation.","keywords":["quantum information loss","prepare-evolve-measure scenario","universal pristineness","Knill-Laflamme conditions","quantum error correction","Hayden-Preskill model","Page time","black hole information"],"falsifier":"Compute, for a family of channels that nearly violate the Knill-Laflamme conditions on a small code space, the exact value of sup_ρ K(ρ,E) and the best achievable recovery fidelity; if arbitrarily small sup_ρ K(ρ,E) can coexist with recovery fidelity bounded away from 1 by a fixed constant, the asserted continuity from small information loss to near-perfect recovery fails.","tokens_in":14356,"feed_emoji":"🕳️","tokens_out":8900,"duration_ms":77775,"temperature":0.7,"pith_summary":"This paper introduces an operational measure of quantum information loss: in a prepare-evolve-measure scenario, it is the minimum conditional entropy of Alice's preparation given Bob's measurement outcome, minimized over all pure-state decompositions of the input state and all output POVMs. The central result is that this intrinsic loss K(ρ,E) vanishes for every state on a code space H_code exactly when the channel is 'universally pristine', meaning orthogonal pure code states map to outputs with orthogonal supports, exactly when the Knill-Laflamme conditions hold, and exactly when a perfect recovery channel exists. The paper therefore establishes that zero information loss on a code space is one and the same thing as quantum error correctability. As an application, the authors show that in the Hayden-Preskill model of black hole evaporation, the channel from Alice's qubits to the collected radiation is asymptotically universally pristine, giving a reference-free channel-theoretic account of Page-time information retrieval.","feed_headline":"Zero information loss equals perfect quantum error correction","feed_subtitle":"One channel-theoretic quantity decides when a code is correctable—and when Hawking radiation reveals the infalling state.","key_machinery":"The central object is the intrinsic information loss K(ρ,E), defined as the infimum, over pure-state decompositions ρ=Σ_i p_i |ψ_i⟩⟨ψ_i| and over POVMs {N_j} on the output, of the conditional entropy H(P)−H(Q) for the joint distribution P(i,j)=p_i Tr[E(|ψ_i⟩⟨ψ_i|)N_j]. The load-bearing equivalence is that K(ρ,E)=0 for all ρ on H_code iff the code satisfies the Knill-Laflamme conditions P E_α^† E_β P = c_αβ P; the proof uses the fact that positive semidefinite operators have orthogonal supports exactly when their trace product vanishes, together with contractivity of trace distance to force the spectral decomposition of a rank-two code state. In the Hayden-Preskill application, the machinery is the second Haar moment of the scrambling unitary, evaluated by the swap trick, which yields the bound on the Haar-averaged root fidelity between outputs for orthogonal inputs.","core_discovery":"The paper's core claim is Theorem 3: for a code space H_code with projector P and a channel E with Kraus operators {E_α}, four statements are equivalent: E is universally pristine on H_code; K(ρ,E)=0 for every state ρ supported on H_code; there exists a positive-semidefinite matrix C=(c_αβ) such that P E_α^† E_β P = c_αβ P for all α,β; and there exists a recovery channel R with (R∘E)(ρ)=ρ on the code. The equivalence of the third and fourth statements is the Knill-Laflamme theorem, so the new content is that universal pristineness and vanishing intrinsic information loss each characterize quantum error correctability. The paper then proves Theorem 4: in the Hayden-Preskill model, the channel E_{U,s} from k injected qubits to the total radiation satisfies ε(s) ≤ $2^{{k/2−s}}$ in Haar average, where ε(s) is the maximal root fidelity between outputs of orthogonal pure inputs, so the intrinsic information loss goes to zero in Haar mean as the emitted radiation size s grows. The paper notes that the resulting s∼k/2 scale for this distinguishability bound is not by itself a sharper recovery threshold than the usual reference-assisted s∼k scale.","pith_inferences":["A testable extension the paper does not pursue is to make the cited continuity step explicit, yielding a quantitative, reference-free version of approximate quantum error correction in which the recovery fidelity is a single function of the intrinsic information loss.","Because K(ρ,E) is defined through prepare-evolve-measure scenarios, it could be measured experimentally without auxiliary reference systems by preparing an ensemble, applying the channel, performing a POVM, and estimating the conditional entropy, offering a direct probe of recoverability in engineered open systems.","The same channel-theoretic criterion could be evaluated in semiclassical models of evaporation beyond Hayden-Preskill, replacing the random-unitary channel with a channel derived from entanglement-island calculations, to see whether the operational retrodiction time coincides with Page time."],"forward_implications":["Quantum error-correcting codes can be characterized without constructing a recovery map: a code is correctable for a channel exactly when the channel's intrinsic information loss vanishes on the code.","An approximate version follows: if sup_ρ K(ρ,E) ≤ ε on the code, the channel's Kraus operators approximately satisfy the Knill-Laflamme conditions and a recovery map exists with worst-case root fidelity at least 1 − O(g(ε)), so near-zero information loss guarantees near-perfect recovery.","In the Hayden-Preskill model, the evaporation channel becomes asymptotically universally pristine as the new radiation size s grows, so an infalling state can be recovered from Hawking radiation by a channel-theoretic criterion, without an external reference system.","The information loss K obeys a data-processing inequality, vanishes for unitary channels, and reaches its upper bound S(ρ) for completely depolarizing channels, so it interpolates between reversible and completely irreversible dynamics."],"supporting_citations":[{"why":"Knill and Laflamme's theorem supplies the equivalence between the code conditions P E_α^† E_β P = c_αβ P and the existence of a perfect recovery channel, which Theorem 3 uses as its (iii)⇔(iv) step.","marker":"[18]"},{"why":"These approximate quantum error correction continuity bounds are the cited basis for the assertion that sup_ρ K(ρ,E) ≤ ε implies near-perfect recovery with fidelity 1 − O(g(ε)).","marker":"[19, 20]"},{"why":"The Hayden-Preskill random-unitary black hole model defines the channel E_{U,s} from Alice's qubits to the total radiation that Theorem 4 analyzes.","marker":"[14]"},{"why":"The Barnum-Knill bound on the pretty-good measurement supplies the discrimination error bound used to convert the root-fidelity estimate into the information-loss bound in Theorem 4.","marker":"[29]"}],"fun_headline_variants":["Info loss vanishes iff code is correctable","New info loss measure equals KL error correction","Black hole channel becomes pristine at Page time","Zero info loss means perfect recovery channel","Quantum info loss ties to error correction"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is the unproved stability step after Theorem 3: if the maximum information loss on a code space is at most ε, then the channel's Kraus operators approximately satisfy the Knill-Laflamme conditions and a recovery channel with fidelity 1 − O(g(ε)) exists; without this step, small information loss alone does not guarantee near-perfect recovery.","fun_headline_variants_meta":{"raw":{"variants":["Info loss vanishes iff code is correctable","New info loss measure equals KL error correction","Black hole channel becomes pristine at Page time","Zero info loss means perfect recovery channel","Quantum info loss ties to error correction"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00061,"raw_usage":{"total_tokens":2914,"prompt_tokens":1091,"completion_tokens":1823,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":707,"completion_tokens_details":{"reasoning_tokens":1759}},"tokens_in":707,"tokens_out":1823,"duration_ms":13096,"temperature":1.0,"reasoning_tokens":1759,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-08T11:21:20.532246+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute, for a family of channels that nearly violate the Knill-Laflamme conditions on a small code space, the exact value of sup_ρ K(ρ,E) and the best achievable recovery fidelity; if arbitrarily small sup_ρ K(ρ,E) can coexist with recovery fidelity bounded away from 1 by a fixed constant, the asserted continuity from small information loss to near-perfect recovery fails.","supporting_citations":[],"review_version":1}