{"id":"dc70bdab-64c0-4a32-840e-88799f960a6e","arxiv_id":"2504.12565","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":3,"one_line_summary":"The paper proposes a non-discarding, entropy-guided global purification for superdense coding but provides no simulation or derivation showing the protocol works.","lead":"Quantum communication paper proposes an adaptive purification step, driven by two entropy metrics, to protect superdense coding from noise without discarding entangled pairs. The enhancement is asserted but never simulated; the only numerical result is a regression between fidelity and the two metrics.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central enhancement claim rests on Eq. 25's asserted existence of an inverse purification unitary, which the paper never constructs or simulates; Section VIII explicitly defers it to future work.","rationale":"The concern is not that the idea is impossible; a full numerical search might find a useful purification unitary. The concern is that the article's central claim is exactly the assertion that this unitary works, and that assertion is unsupported by any demonstration. The paper itself states that the complete simulation is future work, which is an internal admission that the abstract overstates the results. I agree with the reader's weakest_assumption: Eq. 25 and the missing QD/EoF-to-parameter mapping are the load-bearing elements. A regression showing QD/EoF correlate with fidelity is real evidence only for the monitoring step, not for the purification step. The proposed concrete test would settle feasibility: if the two-parameter unitary cannot beat baseline on a coarse grid, the protocol's main mechanism fails; if it can, the paper must still be revised to include the actual simulation and the mapping. Since the reader already rejected the central claim as stated, my read does not change the verdict.","tokens_in":9201,"tokens_out":4791,"duration_ms":51752,"concrete_test":"Pick a representative grid of (p,q) values, e.g., p,q ∈ {0.05, 0.1, 0.2, 0.4}. For each point, construct the state after the composite channel in Eq. 14, then numerically search over θ1,θ2 (and, if the two-parameter ansatz is too constrained, over a more general ancilla-assisted unitary) for the U(θ1,θ2) in Fig. 4 that maximizes post-purification fidelity or dense-coding capacity against the ideal Bell state. Compare with the no-purification baseline. If no U improves fidelity for the two-parameter family, Eq. 25 is false as stated; even if a U succeeds, the paper still owes the pilot-pair-to-angle mapping before the abstract's claim can stand.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing step is Eq. 25: the paper asserts that a global ancilla-assisted unitary U(θ1,θ2) exists whose induced CPTP map ζ approximately inverts E⊗I. This inversion is the entire mechanism by which the protocol is claimed to enhance superdense coding robustness while preserving throughput. No construction, existence proof, or simulation of this step is provided. The only simulation in the paper is the Section IV regression of fidelity on QD and EoF (R²≈0.98); that correlation is a legitimate numerical observation, but it does not show that any unitary can undo the composite AD/PD channel. Section VIII explicitly lists 'numerically simulating the complete protocol to explicitly develop the mapping function from measured correlations to the optimal purification parameters' as immediate future work, and lists expressivity limits as future analysis. Moreover, U(θ1,θ2) has only two real parameters while the composite channel has two noise parameters; no argument shows this parameter count is sufficient, and the Fig. 4 circuit acts on four data qubits plus ancillas, whereas Eqs. 23–24 describe a two-qubit state. The pilot-pair assumption (Section VI.3) is also untested but secondary. Because the central enhancement is asserted rather than demonstrated, the abstract's claim is not supported by the paper's own evidence.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an adaptive superdense-coding protocol that combines the five-qubit perfect code with a global, non-discarding purification step. The purification is to be tuned by monitoring quantum discord (QD) and entanglement of formation (EoF) on auxiliary 'pilot pairs' that experience the same noise as the data pairs. The main claimed result is that this integrated strategy significantly enhances the robustness and throughput of superdense coding under combined amplitude and phase damping. The numerical evidence presented in the paper, however, consists only of a regression of fidelity against QD and EoF (Section IV, Table I); the complete protocol is not simulated, and the key inversion step is deferred to future work in Section VIII.","tokens_in":9515,"tokens_out":3416,"duration_ms":38624,"significance":"If the central mechanism were demonstrated, the paper would offer a potentially valuable alternative to discard-based entanglement purification for dense coding, with the attractive feature of preserving all entangled pairs. The paper also gives explicit algorithms for computing QD and EoF (Algorithms 1-3) and reports a regression with R2 = 0.97787 and MSE = 5.74e-4, which is a legitimate numerical observation about these metrics on the studied noisy states. These strengths are outweighed, however, by the fact that the paper's main enhancement claim rests on an unproven existence assertion for an inverse noise map, and the provided numerical work does not test the adaptive protocol itself. The paper therefore does not currently support its abstract-level claims.","major_comments":[{"comment":"The central claim of the paper is that a global ancilla-assisted unitary U(θ1,θ2) can be chosen so that the induced CPTP map ζ approximately inverts the composite noise channel, i.e., ζ∘(E⊗I)≈1. No construction, existence argument, or simulation is provided for this inversion. Section VIII explicitly states that deriving the mapping from measured correlations to optimal purification parameters is immediate future work, and that the expressivity limits of the unitary for inverting diverse channels remain to be analyzed. Consequently, the abstract's statement that 'our simulations ... indicate that this integrated strategy could significantly enhance superdense coding robustness' is not supported by any simulation of the complete protocol. Furthermore, Fig. 4 shows a circuit acting on four data qubits plus ancillas, whereas Eqs. (23)-(24) describe a two-qubit state; the relationship between the two is not explained.","section":"Section V, Eq. (25)"},{"comment":"Algorithm 1 contains a sign and optimization error in its computation of classical mutual information. Lines 17-20 maximize C = S(ρA) - H over the measurement angles, but line 21 then seeks the argument that minimizes f(θ,ϕ), and line 22 returns J = -f(θ*,ϕ*). Since f is positive for any non-product state, J would be negative, which contradicts the definition J(A:B) = S(ρB) - min Σ pk S(ρB|k) given in Eq. (19) and the requirement that classical mutual information be non-negative. This error means the reported QD values are not the quantities defined in Section III-B, and the regression in Section IV is therefore based on incorrectly computed inputs.","section":"Section III-B, Algorithm 1"},{"comment":"The protocol's noise estimation relies on the assumption that pilot pairs experience exactly the same channel as the data-carrying pairs. This assumption is stated but not justified or tested. In a dynamically varying noise environment, the channel acting on pilot pairs at one time may differ from the channel acting on data pairs at another time, and no analysis is given of how the pilot-pair overhead or measurement timing affects the estimate. Because the adaptive unitary is chosen entirely from the pilot-pair metrics, this untested assumption is load-bearing for the claimed robustness to time-varying noise.","section":"Section VI, item 3"},{"comment":"The linear regression model Fidelity = α + βQD·QD + βEoF·EoF is fitted and evaluated on the same set of noisy states from which QD and EoF are computed. No held-out data, cross-validation, or out-of-sample test is presented. The paper therefore does not demonstrate that the fitted model generalizes to unseen noise regimes, which is a prerequisite for using it as a real-time noise indicator. Moreover, the subsequent claims about channel capacity and throughput are not backed by any calculation of capacity from Eq. (3) for the protocol after purification.","section":"Section IV, Eq. (22), Table I"}],"minor_comments":[{"comment":"The abstract and Section VII refer to 'our simulations' in the plural and state that the protocol has been simulated, but the only presented numerical simulation is the fidelity-versus-(QD, EoF) regression in Section IV; the adaptive purification circuit in Fig. 4 is never simulated. Please calibrate the wording to match the actual evidence.","section":"Abstract and Section IV"},{"comment":"The fidelity formula in Eq. (7) is typeset incorrectly: the expression Tr(√(√ρ σ √ρ))² should be written with the square root and trace placed unambiguously. This is a presentation issue, but it obscures a definition used later in the paper.","section":"Section II-B, Eq. (7)"},{"comment":"Eq. (13) gives the DEJMPS fidelity recurrence without defining the intermediate quantities in terms of the rotation angle θ; the caption of Fig. 2 mentions θ = π/2, but no derivation or reference for the displayed recurrence is provided.","section":"Section II-E, Eq. (13)"},{"comment":"The loops in Algorithm 1 range over continuous intervals θ∈[0,π] and ϕ∈[0,2π], but no discretization is described. To be reproducible, the paper should either specify the grid used in the optimization or state that a continuous optimizer was employed.","section":"Section III-B, Algorithm 1"},{"comment":"The notation in Eq. (23) is ambiguous: E is described as 'not the quantum channel alone' but includes the whole effect up to the decoding process. Since Eq. (14) defined E(ρ) as a concrete channel acting on Alice's qubit, using the same symbol E with a different meaning is confusing and should be clarified.","section":"Section V, Eq. (23)"}],"recommendation":"reject","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"What you should know first: the new idea is real, but the central claim is not demonstrated. The combination of pilot pairs feeding QD/EoF into a global non-discarding purification for superdense coding is genuinely absent from the adaptive-QEC papers they cite, and the Section IV regression (R^2 ≈ 0.98) is a legitimate numerical observation. But the abstract's claim that simulations show enhanced robustness is not backed by anything in the paper. The load-bearing step, Eq. (25), simply asserts that some unitary U(θ1,θ2) induces a map ζ that approximately inverts the composite noise channel. No construction, no existence argument, no simulation. Section VIII admits the mapping from metrics to optimal parameters is future work, which directly contradicts the abstract.\n\nOther soft spots are real but secondary. Algorithm 1 has a clear bug: it tracks the maximum of C, then takes arg min over f and negates it, which would give a negative classical mutual information. The circuit in Fig. 4 has four data qubits plus ancillas, while Eqs. (23)–(24) are written for a two-qubit state; the mismatch is never explained. The pilot-pair assumption (Section VI.3) that pilot pairs see the same channel as data pairs looks questionable once QEC encoding/decoding is in the path, and the paper does not address it. The parameter count worry — two rotation angles vs two noise parameters — is not fatal by itself, but without any construction it is just a hope.\n\nWhat is good: the prose is clear, the motivation for avoiding pair loss is sound, and the moderate novelty is real. The QD/EoF correlation with fidelity is worth a footnote. But the paper is a research proposal, not a completed result. I would not cite it in the next year, and I would not send it to a serious referee as is. If a venue tolerates speculative architectures, it could go to review with the expectation that the authors actually simulate the full protocol; otherwise desk reject with a clear pointer to what is missing.\n\nFor your use: a good example of the gap between a plausible idea and a demonstration.","headline":"Plausible new architecture, but the central enhancement claim rests on an asserted inverse that the paper never constructs or simulates.","tokens_in":9972,"tokens_out":4388,"would_cite":false,"duration_ms":45624,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P40","81P70"],"pacs":["03.67.Hk","03.67.Mn"],"model":"deepseek-v4-flash","headline":"By monitoring quantum discord and entanglement of formation on pilot pairs, an adaptive global unitary can keep superdense coding robust under amplitude and phase damping without discarding entangled pairs.","keywords":["superdense coding","quantum discord","entanglement of formation","adaptive purification","pilot pairs","amplitude damping","phase damping","five-qubit code"],"falsifier":"A direct simulation of the full circuit should settle it: prepare $|\\Phi^+\\rangle$ pairs, send them through the composite channel $\\mathcal{E}$, apply the five-qubit code correction and the proposed $U(\\theta_1,\\theta_2)$ with angles set from pilot-pair QD and EoF, and compare the output fidelity with the five-qubit code alone; if no $(\\theta_1,\\theta_2)$ yields $\\zeta\\circ(\\mathcal{E}\\otimes\\mathbb{1})\\approx\\mathbb{1}$ for moderate damping, the central claim fails.","tokens_in":8999,"feed_emoji":"🔗","tokens_out":8578,"duration_ms":78404,"temperature":0.7,"pith_summary":"Superdense coding sends two classical bits in one qubit, but amplitude and phase damping degrade the shared entanglement that makes this possible. The paper proposes protecting it by combining the five-qubit perfect code with an adaptive global purification step: pilot pairs that carry no data are measured for quantum discord and entanglement of formation, and those values tune a global unitary meant to invert the noise channel. Because the correction acts on all qubits together through an ancilla rather than distilling and discarding pairs, the protocol aims to recover high-fidelity Bell states while keeping the full two-bit-per-qubit capacity. The paper reports that QD and EoF predict fidelity with $R^2\\approx0.98$, and argues that this makes them workable real-time noise indicators. The complete protocol simulation and the explicit mapping from metrics to unitary angles are deferred to future work.","feed_headline":"Adaptive purification may preserve two-bit-per-qubit coding under noise","feed_subtitle":"Pilot-pair discord and entanglement metrics tune a global unitary, so no entangled pairs are discarded.","key_machinery":"The carrying mechanism is the pilot-pair monitoring loop feeding a global adaptive purification circuit. Quantum discord—the gap between total and classical mutual information—and entanglement of formation—the minimum entanglement cost to prepare the state—are computed from noise-only pilot pairs; their values select the rotation angles $\\theta_1,\\theta_2$ of an ancilla-assisted unitary $U(\\theta_1,\\theta_2)$. That unitary, after tracing out ancillas, induces a CPTP map $\\zeta$ intended to satisfy $\\zeta\\circ(\\mathcal{E}\\otimes\\mathbb{1})\\approx\\mathbb{1}$ on the noisy Bell state. The five-qubit perfect code sits before this in the pipeline, absorbing single-qubit errors so the global map only needs to handle residual multi-qubit noise.","core_discovery":"The central claim is that the degradation of superdense coding under combined amplitude and phase damping can be substantially reversed by a two-layer strategy. The five-qubit perfect code handles single-qubit errors, while a novel global purification step—an ancilla-assisted unitary $U(\\theta_1,\\theta_2)$ acting on the decoded data qubits and ancillas—is tuned so that its induced completely positive map $\\zeta$ approximately inverts the composite noise channel, $\\zeta\\circ(\\mathcal{E}\\otimes\\mathbb{1})\\approx\\mathbb{1}$. The tuning signal comes from pilot pairs that undergo the same channel: Bob computes quantum discord and entanglement of formation from them and uses these to set $\\theta_1,\\theta_2$. The paper's own simulations support the intermediate claim that QD and EoF are strong linear predictors of fidelity, and the intended consequence is that no entangled pairs are discarded, so channel capacity stays at two bits per qubit.","pith_inferences":["Inference: the same pilot-pair monitoring loop should transfer to other channel families, such as depolarizing or correlated errors, because quantum discord and entanglement of formation are channel-agnostic measures.","Inference: since no end-to-end simulation is reported, the decisive comparison is against DEJMPS at equal pair consumption; a non-discarding scheme should win in delivered bits per sent qubit if the central claim holds.","Inference: a learned control law from QD and EoF to $\\theta_1,\\theta_2$ would make the protocol fully adaptive, and a natural test is to optimize those angles against worst-case fidelity over all $(p,q)$ pairs."],"forward_implications":["Superdense coding can keep its two-bit-per-qubit advantage over a range of damping strengths without sacrificing any entangled pairs, because purification no longer consumes one pair to clean another.","Pilot pairs provide a real-time noise estimate in dynamically varying channels, so the protocol can adapt as the environment changes rather than relying on fixed correction parameters.","Quantum discord and entanglement of formation become usable control signals for quantum communication, complementing fidelity, which misses some noise effects.","Combining a stabilizer code with non-local global purification extends the reach of the five-qubit code: the code handles local single-qubit errors, while the global map addresses residual collective noise."],"supporting_citations":[{"why":"Defines superdense coding as the protocol this work aims to protect.","marker":"[1]"},{"why":"Quantifies the classical information capacity of superdense coding, giving the two-bit-per-qubit target.","marker":"[2]"},{"why":"Provides the original BBPSSW entanglement purification protocol whose pair-sacrificing structure the proposed method aims to avoid.","marker":"[8]"},{"why":"Provides the DEJMPS purification protocol whose fixed rotations the adaptive $U(\\theta_1,\\theta_2)$ generalizes.","marker":"[9]"},{"why":"Supplies the channel-capacity expression used to evaluate superdense coding under noise.","marker":"[16]"},{"why":"Supplies the CPTP-map and stabilizer formalism used to model noise channels and the five-qubit code.","marker":"[17]"},{"why":"Gives the unified-purification machinery used to define and compute quantum discord and entanglement of formation.","marker":"[20]"},{"why":"Provides the five-qubit perfect code that forms the first error-correction layer of the architecture.","marker":"[23]"}],"fun_headline_variants":["Entropy metrics guide adaptive purification for robust superdense coding","Quantum discord tunes purification to keep two bits per qubit","Adaptive purification with entropy metrics boosts dense coding","No pair left behind: entropy-guided purification for dense coding","Entanglement metrics steer purification, preserving coding capacity"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The protocol assumes that a single global operation with two tunable rotation angles can nearly undo the combined amplitude- and phase-damping damage to the entangled pairs, and that the right angle settings can be inferred from pilot-pair discord and entanglement measurements; the paper does not derive or numerically demonstrate that inversion.","fun_headline_variants_meta":{"raw":{"variants":["Entropy metrics guide adaptive purification for robust superdense coding","Quantum discord tunes purification to keep two bits per qubit","Adaptive purification with entropy metrics boosts dense coding","No pair left behind: entropy-guided purification for dense coding","Entanglement metrics steer purification, preserving coding capacity"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000771,"raw_usage":{"total_tokens":3387,"prompt_tokens":894,"completion_tokens":2493,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":510,"completion_tokens_details":{"reasoning_tokens":2415}},"tokens_in":510,"tokens_out":2493,"duration_ms":19252,"temperature":1.0,"reasoning_tokens":2415,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T12:28:12.596391+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct simulation of the full circuit should settle it: prepare $|\\Phi^+\\rangle$ pairs, send them through the composite channel $\\mathcal{E}$, apply the five-qubit code correction and the proposed $U(\\theta_1,\\theta_2)$ with angles set from pilot-pair QD and EoF, and compare the output fidelity with the five-qubit code alone; if no $(\\theta_1,\\theta_2)$ yields $\\zeta\\circ(\\mathcal{E}\\otimes\\mathbb{1})\\approx\\mathbb{1}$ for moderate damping, the central claim fails.","supporting_citations":[{"cited_title":"Communication via one-and two- particle operators on einstein-podolsky-rosen states,","cited_arxiv_id":null,"evidence_quote":"Defines superdense coding as the protocol this work aims to protect."},{"cited_title":"Classical information capacity of superdense coding,","cited_arxiv_id":null,"evidence_quote":"Quantifies the classical information capacity of superdense coding, giving the two-bit-per-qubit target."},{"cited_title":"Quantum privacy amplification and the security of quantum cryptography over noisy channels,","cited_arxiv_id":null,"evidence_quote":"Provides the DEJMPS purification protocol whose fixed rotations the adaptive $U(\\theta_1,\\theta_2)$ generalizes."},{"cited_title":"Distributed quantum dense coding,","cited_arxiv_id":null,"evidence_quote":"Supplies the channel-capacity expression used to evaluate superdense coding under noise."},{"cited_title":"Quantifying quantum dis- cord and entanglement of formation via unified purifications,","cited_arxiv_id":null,"evidence_quote":"Gives the unified-purification machinery used to define and compute quantum discord and entanglement of formation."},{"cited_title":"Benchmark- ing quantum computers: the five-qubit error correcting code,","cited_arxiv_id":null,"evidence_quote":"Provides the five-qubit perfect code that forms the first error-correction layer of the architecture."}],"review_version":1}