{"id":"d78e3a36-81c4-42b9-bf2d-94709fd06dc4","arxiv_id":"2411.10259","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":5,"one_line_summary":"The paper proposes a latency-data rate trade-off model for pure-loss bosonic optical wireless channels, but the key estimation construction and the compound-code rate assumption are not mathematically supported.","lead":"This paper analyzes the trade-off between latency and data rate in optical wireless communication, comparing compound codes that avoid channel estimation with a pilot-based estimation and feedback scheme. It claims that quantum-optimal receivers can reach operating points unavailable to classical receivers, and illustrates the curves in an indoor robot factory scenario.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The feedback scheme's estimator is defined by an integral over a measure-zero set, so the estimation success probability in Eq. (19) is zero and the data-rate curves in Fig. 2 are unsupported.","rationale":"Good-faith reading: the paper's goal is a latency-data-rate tradeoff where a feedback link first estimates the loss \\tau by homodyning pilots and then transmits with a compound code over an interval centered on the estimate. For this to work, the estimator must produce a positive-probability interval around the true \\tau. The construction in Section IV-D instead integrates homodyne densities over an exact equality constraint. Since homodyne outcomes are continuous, the set has measure zero; the POVM element is null and Eq. (19) is false. This is not a matter of numerical precision or an asymptotic correction: it makes the estimated interval empty in the only defined estimator. A fix is in principle available (integrate over a slab), but it is not in the manuscript. The \\delta scaling in Eq. (16) is an additional independent defect: Eq. (15) gives \\delta \\sim n1^{-1/2}, not n1^{-1}, so the claimed interval width and the resulting rates are wrong even after replacing the hyperplane by a slab. I therefore agree with the reader's rejection, though my primary concern is the estimator, not the unproved compound second-order rate (which the authors themselves flag in Section VI). No formal verification or reproducible code is provided; cited prior results do not cover this construction. The concern is internal inconsistency, not disagreement with consensus.","tokens_in":7822,"tokens_out":4645,"duration_ms":45156,"concrete_test":"Compute the integral in Eq. (19) for the estimator defined by Eq. (18). Because S_{\\hat\\tau} is a codimension-one set in the continuous homodyne outcome space, the n1-fold outcome density integrates to zero on it; if the claimed lower bound 1-\\epsilon cannot be reproduced, the estimator and every subsequent rate/latency curve in Figure 2 fail. Optionally repeat the check after replacing S_{\\hat\\tau} with a positive-width slab {|\\sum q_i - n1\\sqrt{2E}\\hat\\tau| \\le \\Delta} to verify whether a corrected estimator can support the same curves.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section IV-D defines the estimator POVM element D_{n1}^{\\hat\\tau} by integrating homodyne outcome densities over S_{\\hat\\tau} = {q^{n1} : \\sum q_i = n1\\sqrt{2E}\\hat\\tau}. For continuous homodyne outcomes this is a codimension-one set of Lebesgue measure zero, so D_{n1}^{\\hat\\tau} is the zero operator and tr(D_{n1}^{\\hat\\tau} |\\sqrt{\\tau}E\\rangle\\langle\\sqrt{\\tau}E|^{\\otimes n1}) = 0 for every state. Therefore Eq. (19) cannot hold with positive probability: the claimed lower bound 1-\\epsilon is false, and the concatenated-code inequality chain (20)-(23), the data rate (24), and the latency curves in Figure 2 have no valid estimation step. The subsequent compound-code issue (Section VI concedes that the second-order compound-code rate is unproved) is real but secondary; even if the compound rate were known, the feedback operating points would still fail because the estimator never produces the interval [\\hat\\tau-6\\delta', \\hat\\tau]. A fix would need to integrate over a positive-width slab, e.g. {|\\sum q_i - n1\\sqrt{2E}\\hat\\tau| \\le \\Delta}, and then re-derive Eq. (19) with the correct confidence interval. The current text does not do this. Independently, Eq. (16) uses \\delta \\sim 1/n1 instead of the \\delta \\sim 1/\\sqrt{n1} required by Eq. (15), so the interval width and the resulting rates are wrong even after replacing the hyperplane by a slab.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript studies the latency-data-rate trade-off in optical wireless communication under channel uncertainty. Two system models are proposed: a latency-optimized scheme based on compound codes that avoids pilot transmission, and a data-rate-optimized scheme that estimates the channel transmissivity via homodyne detection of pilot pulses and then uses error-free feedback to select a code for the remaining data block. The paper claims to identify operating points that are reachable only when the receiver uses optimal quantum measurement strategies, and it presents numerical latency-data-rate curves in Fig. 2. The central derivation is a concatenated estimation-and-coding argument: an estimator produces an interval of possible transmissivity values, and a compound code is then used over that interval at a second-order coding rate. The paper also discusses an IoT application in a robot factory.","tokens_in":8154,"tokens_out":6074,"duration_ms":58234,"significance":"If the derivation were sound, the paper would be a useful step toward finite-blocklength, latency-aware design of quantum optical links. It correctly identifies compound coding and channel-estimation-with-feedback as two natural extremes, and it draws on established second-order coding-rate results for pure-loss bosonic channels and AWGN channels. The explicit comparison between classical homodyne-based estimation and quantum-optimal receivers is a relevant direction. However, the mathematical core of the estimation step is invalid: the estimator POVM is defined by an integral over a measure-zero set, so the key lower bound in Eq. (19) cannot hold. In addition, the scaling of the confidence interval in Eq. (16) is wrong by a factor of sqrt(n1), and the compound-channel second-order coding rate is assumed rather than proved, a limitation the authors themselves concede in Section VI. These are load-bearing errors, not presentation issues, and they invalidate the quantitative claims in Eqs. (20)-(24) and Fig. 2.","major_comments":[{"comment":"The estimator POVM element D_{n1}^{\\hat\\tau} is defined as an integral over the set S_{\\hat\\tau} = { q^{n1} : \\sum_i q_i = n1 \\sqrt{2E}\\,\\hat\\tau }. For continuous homodyne outcomes, this is a codimension-one set of Lebesgue measure zero in R^{n1}. Therefore the integral defines the zero operator, and tr(D_{n1}^{\\hat\\tau} |\\sqrt{\\tau}E\\rangle\\langle\\sqrt{\\tau}E|^{\\otimes n1}) = 0 for every state. Consequently Eq. (19) cannot hold with any positive probability, and the chain of inequalities (20)-(23), the data rate in Eq. (24), and the latency-data-rate curves in Fig. 2 have no valid estimation step. A repair would require integrating over a positive-width slab, e.g., { |\\sum_i q_i - n1\\sqrt{2E}\\,\\hat\\tau| \\le \\Delta }, followed by a full re-derivation of Eq. (19).","section":"Section IV-D, Eq. (18)"},{"comment":"Given n1 independent Gaussian samples with variance 1/2, the confidence interval in Eq. (15) has half-width \\delta = (1/\\sqrt{2}) \\Phi^{-1}(1-\\epsilon/2) / \\sqrt{n1}, which scales as n1^{-1/2}. Equation (16) instead states \\delta = n1^{-1} \\sqrt{1/2}\\,\\phi^{-1}(1-\\epsilon/2), which is smaller by a factor of \\sqrt{n1}. This incorrect scaling understates the estimation error and therefore the width of the subsequent interval [\\hat\\tau - 6\\delta', \\hat\\tau]; the numerical rates in Fig. 2 inherit this error.","section":"Section IV-C, Eq. (16)"},{"comment":"The compound-code rates used in Eq. (24) and in the latency-optimal curve rest on the unproved assertion that 'the second-order coding rate of the compound channel is given by the worst-case second-order coding rate of the channels making up the compound channel.' No proof or supporting reference is given, and Section VI explicitly states that 'a proof of second-order coding rate for compound codes is imperative.' References [13]-[15] address capacities or sequential decoding, not finite-blocklength second-order rates for compound classical-quantum channels. Thus the reported rates are not established even when the estimation step is repaired.","section":"Sections IV-A, IV-E, and VI"},{"comment":"Equation (5) defines the data rate d(\\tau) as an average over estimation outcomes weighted by the estimator probability p_{D,\\hat\\tau,\\tau} = tr(D_{n1}^{\\hat\\tau} \\hat\\sigma). Equation (24), however, omits this weight and integrates only p_{E,\\hat\\tau,\\tau} over \\hat\\tau. Even putting aside the zero-operator issue, Eq. (24) does not follow from Eq. (5), and it overcounts estimates that occur with negligible probability.","section":"Section IV-E, Eq. (24)"}],"minor_comments":[{"comment":"The expression tr(F^{n2}(\\hat\\tau)_{m,\\hat\\tau} N_\\tau(\\rho_{\\hat\\tau,m}) is missing a closing parenthesis; it should read tr(F^{n2}_{m,\\hat\\tau} N_\\tau(\\rho_{\\hat\\tau,m})).","section":"Eq. (3)"},{"comment":"The POVM definition states completeness as \\sum_j \\Lambda_j = 1, but the estimator in Section IV-D uses a continuous outcome set; the completeness relation should be stated as an integral for continuous POVMs.","section":"Definition 3"},{"comment":"The notation 'n_p = \\alpha_1, ..., \\alpha_n' is confusing: the number of pilot symbols is elsewhere called n1, and the set-like notation with alpha symbols is not defined.","section":"Section IV-B"},{"comment":"Equation (16) uses \\phi^{-1} where Eq. (15) uses \\Phi^{-1}; the inverse Gaussian CDF and the inverse Gaussian density are different functions, and the text does not clarify which is intended.","section":"Section IV-C, Eq. (16)"},{"comment":"The phrase 'finally \\epsilon^2 > 0' appears to be a fragment; the preceding inequality uses the fact that (1-\\epsilon)^2 \\ge 1 - 2\\epsilon for \\epsilon \\in (0,1/2), but the sentence is incomplete.","section":"Section IV-E"}],"recommendation":"reject","confidential_remarks":"The topic is within the scope of the journal, and the authors address a genuine question, but the central estimator construction is mathematically invalid and the compound-rate assumption is unproved. The errors are load-bearing and would require a substantial rewrite of the technical core rather than local corrections, so I recommend rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Hi [Name],\n\nShort version: this preprint puts two known second-order coding-rate formulas into an estimation-then-transmit scheme for OWC and plots latency vs datarate. The framing is sensible and the figures make the qualitative tradeoff easy to see. But the math under the main curves is broken, and the authors themselves flag the missing piece.\n\nWhat's new: not much conceptually—the latency-datarate tradeoff is familiar from classical wireless, and the quantum advantage reduces to the known capacity gap. Still, the paper is one of the first to spell this out for a bosonic pure-loss channel with low-latency IoT in mind, so the problem statement is worth having.\n\nWhere it falls apart:\n\n- The estimator POVM in Eq (18) integrates over a single hyperplane S_hattau, which has Lebesgue measure zero. That makes D a zero operator, so the success probability in Eq (19) is zero, and the inequality chain (20)-(23), the datarate (24), and Fig. 2 lose their foundation. You'd need to integrate over a slab of positive width and redo the confidence interval.\n\n- Eq (16) uses n1^{-1} where Eq (15) requires n1^{-1/2}. That understates the estimation error by a factor of sqrt(n1), so the interval widths and the resulting rates are wrong even after fixing the measure-zero issue.\n\n- The interval [tau_hat-6delta', tau_hat] is one-sided. For the true tau to be inside, you need tau_hat >= tau. A symmetric estimator will be low about half the time, so this is not a valid confidence interval. The text appears to confuse an estimate of sqrt(tau) with an estimate of tau.\n\n- The compound-channel second-order rate is assumed to be the worst-case rate. Section VI concedes a proof is missing. That's an honest admission, but it means the compound-code curves are also unsupported.\n\nThe citation pattern is fine: the external second-order formulas are standard and correctly attributed. The authors' own previous work on compound codes is cited appropriately, not as a loop.\n\nWho gets value: readers interested in finite-blocklength quantum communication or OWC might find the model setup suggestive, but only as a starting point. The paper needs major revision: replace the estimator with a proper positive-width region, fix the scaling, correct the confidence interval, and prove or properly cite the compound-code second-order rate. As it stands, the central claims don't follow. I'd send it to review—it's a legitimate topic and the flaws are identifiable and fixable—but I would not accept it in this form.\n\nBest.","headline":"Well-motivated latency/datarate framing undercut by a defective estimator: the central equations don't hold, so the quantum advantage curves are unsupported.","tokens_in":8689,"tokens_out":5422,"would_cite":false,"duration_ms":50729,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["81P45","94A40","94A15"],"pacs":["03.67.Hk"],"model":"deepseek-v4-flash","headline":"Quantum-optimal receivers reach latency–data-rate operating points that classical receivers cannot.","keywords":["quantum communication","optical wireless communication","pure-loss bosonic channel","compound codes","channel estimation","homodyne detection","latency","data rate"],"falsifier":"Directly compute or bound the second-order coding rate of the compound pure-loss bosonic channel over an interval such as $[0.001, 1]$ and compare it with the worst-case rate used in Eq. (24). A finite-blocklength search at, say, $n_2 = 2500$ that fails to reproduce the claimed rate with a $\\tau$-independent code, or finds a $\\tau$-independent code exceeding it, would settle whether the plotted curves and the quantum-only operating points stand.","tokens_in":7586,"feed_emoji":"📡","tokens_out":12642,"duration_ms":110534,"temperature":0.7,"pith_summary":"The paper aims to establish a concrete trade-off between latency and data rate for free-space optical links modeled as pure-loss bosonic channels. One corner of the trade-off is a latency-optimized scheme that sends data immediately with compound codes, which are robust to unknown channel loss but accept a lower data rate. The other corner is a data-rate-optimized scheme that spends $n_1$ channel uses on pilot signals and feedback to estimate the channel, then transmits for $n_2$ channel uses; the paper reports that a homodyne estimator followed by a compound code for the interval $[\\hat{\\tau}-6\\delta', \\hat{\\tau}]$ keeps the error below $2\\epsilon$ and achieves the data rate $d(\\tau)$ of Eq. (24). The key claim is that some latency–data-rate operating points are reachable only when the receiver uses optimal quantum measurement strategies rather than classical ones, which matters because it puts a quantum receiver technology choice at the center of a systems-level engineering trade-off.","feed_headline":"Quantum links reach latency–data-rate points classical links cannot","feed_subtitle":"Classical schemes top out near 1,000 channel uses, while the quantum receiver's data rate keeps climbing.","key_machinery":"The machinery that carries the argument is a concatenation of a channel estimator and a compound code. The estimator is a positive operator-valued measure (POVM) built from homodyne measurements on $n_1$ copies of a pilot coherent state; because homodyne outcomes on a coherent state are Gaussian, estimating the transmissivity becomes a classical hypothesis test on a Gaussian mean, and the uncertainty interval translates to $[\\hat{\\tau}-6\\delta', \\hat{\\tau}]$ through $\\delta' = \\delta/\\sqrt{2E}$. The compound code is a family of codes that works for every channel in an interval, here analyzed at the second-order coding rate of the worst channel in the interval, so the data rate is computed as $\\log M^{*}(\\mathcal{N}_{\\hat{\\tau}-6\\delta'}^{\\otimes n_2}, E, \\epsilon)$. The second-order coding rate formula for pure-loss bosonic channels, with entropy $g(x)$ and entropy variance $v(x)$, is what turns the narrowed interval into a concrete number of bits at latency $n_1 + n_2$.","core_discovery":"The central discovery is that two elementary tasks—channel estimation and compound coding—can be concatenated into a single one-round-feedback code for the pure-loss bosonic channel, and that the quantum version of the code reaches latency–data-rate points the classical version cannot. The construction is explicit: the sender transmits $n_1$ pilot pulses, the receiver performs a homodyne measurement and forms an interval estimate for the transmissivity, and then a compound code tailored to the worst-case interval $[\\hat{\\tau}-6\\delta', \\hat{\\tau}]$ carries messages for $n_2$ channel uses, with total error at most $2\\epsilon$. The data rate is $d(\\tau)$ from Eq. (24), evaluated with the second-order coding rate of the channel with transmissivity $\\hat{\\tau}-6\\delta'$. Numerical results with energy $E = 10^4/2$, transmissivity $\\tau = 0.01$, and interval $[0.001, 1]$ show compound coding winning at short block lengths, classical estimation and feedback saturating around 1000 channel uses, and the quantum receiver's data rate still climbing beyond 2500 channel uses. The claimed consequence is that a region of the latency–data-rate plane is only accessible with optimal quantum measurement strategies.","pith_inferences":["If the unproved worst-case compound-rate assumption is later replaced by a proven formula, the numerical curves will move, but the qualitative shape—compound codes for latency, estimation for rate—would likely survive.","A direct finite-blocklength simulation of $\\tau$-independent codes on the interval $[0.001,1]$ would test whether the predicted inflection point near 1000 channel uses is real or an artifact of the worst-case rate bound.","The same estimator-plus-compound-code structure could be extended to channels with thermal or phase noise, replacing homodyne detection with a joint quantum measurement; the paper itself flags this as future work."],"forward_implications":["If the construction is correct, a link designer can pick an operating point on the trade-off curve: compound coding alone for minimum latency, pilot-and-feedback for maximum data rate at increased latency.","Some latency–data-rate points are physically reachable only with an optimal quantum receiver; classical homodyne receivers cannot reach them.","The quantum receiver's data rate keeps increasing beyond roughly 2500 channel uses, while the classical and compound schemes saturate near 1000 channel uses, so the gap widens with block length.","The concatenated scheme splits its total error budget into estimation error and decoding error, each kept below $\\epsilon$ so the total stays below $2\\epsilon$; this gives two independent design margins."],"supporting_citations":[{"why":"Supplies the quantum second-order coding rate formula used in Eq. (6) to convert a channel interval into a bit count.","marker":"[8]"},{"why":"Supplies the classical finite-blocklength rate formula used for the classical comparison.","marker":"[9]"},{"why":"Provides the compound-channel coding result that lets a single code serve every channel in an interval.","marker":"[13]"},{"why":"Establishes compound channel capacities under energy constraints, the basis for the latency-optimal model.","marker":"[14]"},{"why":"Grounds the compound classical-quantum channel formulation used for the compound-code corner case.","marker":"[15]"},{"why":"Supplies the free-space path-loss formula used in the IoT application.","marker":"[16]"}],"fun_headline_variants":["Quantum receiver reaches latency-data-rate points classical cannot","Quantum code beats classical in latency-data-rate plane","Beyond classical saturation: quantum measurement wins tradeoff","Quantum link sustains data rate past 2500 channel uses","Latency-data-rate tradeoff: quantum strategy breaks classical ceiling"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole rate calculation depends on the unproved assumption that a single code that works for every channel in an interval achieves the same second-order data rate as the worst channel in that interval does on its own; the paper's own Discussion section concedes that a proof of this is imperative.","fun_headline_variants_meta":{"raw":{"variants":["Quantum receiver reaches latency-data-rate points classical cannot","Quantum code beats classical in latency-data-rate plane","Beyond classical saturation: quantum measurement wins tradeoff","Quantum link sustains data rate past 2500 channel uses","Latency-data-rate tradeoff: quantum strategy breaks classical ceiling"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000216,"raw_usage":{"total_tokens":1428,"prompt_tokens":934,"completion_tokens":494,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":550,"completion_tokens_details":{"reasoning_tokens":417}},"tokens_in":550,"tokens_out":494,"duration_ms":5780,"temperature":1.0,"reasoning_tokens":417,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T19:47:54.181062+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Directly compute or bound the second-order coding rate of the compound pure-loss bosonic channel over an interval such as $[0.001, 1]$ and compare it with the worst-case rate used in Eq. (24). A finite-blocklength search at, say, $n_2 = 2500$ that fails to reproduce the claimed rate with a $\\tau$-independent code, or finds a $\\tau$-independent code exceeding it, would settle whether the plotted curves and the quantum-only operating points stand.","supporting_citations":[{"cited_title":"Optimality of sequential decoding for the bosonic compound channel,","cited_arxiv_id":null,"evidence_quote":"Provides the compound-channel coding result that lets a single code serve every channel in an interval."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the free-space path-loss formula used in the IoT application."}],"review_version":1}