{"id":"ed8aaa6d-cb40-40bf-8c4b-94026882d6ab","arxiv_id":"2607.08133","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.5,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Dense network coding computes group operations over multiaccess networks with half the classical communication cost using shared entanglement plus quantum channels, and yields measurement-device-independent quantum key growing.","lead":"Quantum dense network coding lets two or more senders compute certain non-Boolean functions at a receiver using half as many qubits as classical bits, by sharing entanglement and sending only partial information. The same idea yields a new cryptographic protocol that grows secret keys without trusting the measurement device.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The paper’s strongest claim is a clean, fully proved separation between entanglement-assisted quantum multiaccess networks and every weaker resource class for a concrete family of non-Boolean functions. All supporting lemmas (reduction to guessing probability, conditional bijectivity, Frenkel–Weiner application, classical achievability matching the upper bound) are written out in the appendices and close without gaps. The only idealized assumption the reader correctly flags (trusted initial entanglement for MDI-QKG) is confined to the cryptographic application and does not underwrite the communication-advantage theorems. Consequently no load-bearing concern against the central claim arises, and the reader’s ACCEPT / HIGH-confidence verdict stands.","tokens_in":59761,"tokens_out":533,"duration_ms":6107,"concrete_test":"Independently recompute the four-line Born-rule calculation of Protocol 1 (Eqs. 7–10) for n=1 (d=2) by expanding the two-qubit Weyl operators and the Bell projectors in the computational basis; verify that the probability of the correct outcome is identically 1 and that every incorrect outcome has probability 0. If this holds, the core protocol is confirmed.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (Theorem 2 / Theorem 9) is that Protocol 1 (and its TNC-group generalization, Protocol 3) achieves perfect computation of ⊕2_2n (or the corresponding group operation) over QE(2n,2n) while every weaker resource class is bounded by success probability ≤ 1/2n. The protocol correctness follows from the projective representation property of the discrete Weyl operators (Eqs. 6–11 and the analogous calculation in Theorem 6). The matching upper bounds follow from the reduction of success probability to guessing probability (Lemma 28), the equality of guessing probabilities for doubly-conditionally-bijective functions (Lemma 31 / Lemma 32), and the Frenkel–Weiner / non-signaling dimension bounds (Theorems 7–8 / Proposition 44). These steps are fully explicit, self-contained, and tight for even n (Corollary 46). No internal inconsistency or hidden assumption that would invalidate the quadratic signaling-dimension advantage was found. The reader’s flagged source assumption affects only the secondary MDI-QKG application (Appendix I), not the communication-advantage theorems.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper introduces quantum dense network coding (DNC): an entanglement-assisted quantum multiaccess protocol that computes certain non-Boolean functions (ditwise modular addition ⊕²_{2^{n}} and, more generally, the group operation of tightly network-codeable groups) with success probability 1 using signaling dimensions (2^{n},2^{n}). Matching upper bounds show that every weaker resource class—classical, entanglement-assisted classical, nonsignaling-assisted classical, or unassisted quantum—is limited to success probability ≤ 1/2^{n} (Theorem 2 / Theorem 9). The advantage is shown to require both shared entanglement and quantum communication, to be robust to diamond-norm noise (Theorem 3 / Theorem 11), and to amplify exponentially with the number of pairwise-entangled senders (Theorem 4). A secondary application, measurement-device-independent quantum key growing, is derived from the same algebraic structure and given a one-shot and asymptotic security analysis (Appendix I).","tokens_in":60039,"tokens_out":752,"duration_ms":9175,"significance":"If correct, the work supplies a clean, tight quadratic gap in signaling dimension for multiaccess network computation that cannot be obtained from superdense coding alone (the receiver shares no entanglement). The proofs are fully explicit: Protocol 1/3 correctness follows from the projective representation property of discrete Weyl operators; the matching upper bounds rest on a reduction to guessing probability, equality of guessing probabilities for doubly-conditionally-bijective functions, and Frenkel–Weiner / nonsignaling dimension bounds. Noise robustness is controlled by diamond-norm continuity, and the multi-sender amplification is multiplicative. The cryptographic application is secondary but conceptually natural. The combination of matching bounds, noise robustness, and an explicit algebraic characterization of the functions that admit DNC makes the result a solid contribution to quantum network information theory.","major_comments":[],"minor_comments":[{"comment":"Figure 2 caption and surrounding text: the concrete lower bound P^f_S(n,e,p) is written with a factor of 2 that is not immediately transparent from Theorem 3; a one-sentence derivation (or pointer to the corresponding calculation in Appendix G) would help the reader verify the plotted curves.","section":null},{"comment":"Section 2.2.1 / Appendix B: the term “tightly network codeable” is introduced without a short forward reference to the minimality claim (Eq. 42). A parenthetical remark would improve readability.","section":null},{"comment":"Appendix I, Protocol 4 and Lemma 71: the security analysis assumes a known (or testable) initial state. A brief clarifying sentence that online testing would convert the protocol into a full QKD scheme (as already noted in the main text) would prevent misreading of the key-growing claim.","section":null},{"comment":"Notation: the signaling-dimension parameterization switches between (2^{n},2^{n}) in the main text and (d,d) in the appendices; a single consistent convention, or an explicit conversion sentence, would reduce cognitive load.","section":null}],"recommendation":"accept","confidential_remarks":"The central communication-advantage theorems are self-contained and tight; the only non-standard assumption flagged by the reader affects solely the secondary cryptographic application and does not undermine the main claims. The manuscript is ready for acceptance with only light editorial polishing."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This paper turns a numerical observation from Doolittle et al. into a clean algebraic protocol (dense network coding via tightly network-codeable groups) that computes ditwise modular addition (or any group operation from a nice error basis) with perfect success using n qubits per sender plus one ebit, while every weaker resource class is stuck at success probability ≤ 1/2^n. That separation is Theorem 2 / 9, and the proofs are complete: protocol correctness from the projective representation of the Weyl operators, matching upper bounds via reduction to guessing probability, conditional bijectivity, Frenkel–Weiner, and nonsignaling decompositions. The bounds are tight for even n, noise robustness follows from diamond-norm continuity, and the multi-sender product version gives exponential amplification. Code for the figures is public.\n\nWhat is new is the algebraic packaging (TNC groups = nice error bases), the necessity proof that both entanglement and quantum communication are required, and the secondary MDI quantum key-growing protocol whose asymptotic rate is ordinary conditional entropy of the encoded state. The crypto part is a natural distillation-style application rather than a full QKD scheme; the idealized-source assumption is standard for that literature and does not touch the communication theorems.\n\nSoft spots are minor and proportional. The cryptographic security is one-shot + asymptotic under a known (or testable) initial state; if the source is completely untrusted without online testing the rate formula needs extra work, but that is flagged and does not undermine the main claims. The paper is self-contained, citations are appropriate, and there is no circularity or free parameters.\n\nThis is for people working on quantum network information theory, multiparty communication complexity, or MDI-style crypto. It is formally grounded enough that a serious editor should send it to referees. I would bring it to reading group and expect to cite the communication-advantage theorems.","headline":"Clean quadratic signaling-dimension advantage for multiaccess function computation, fully proved and tight, plus a natural MDI key-growing spin-off; solid mid-tier network QI paper that deserves referees.","tokens_in":60601,"tokens_out":482,"would_cite":true,"duration_ms":10001,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"Quantum dense network coding computes modular addition with half the qubits of classical bits and only works when both entanglement and quantum channels are present.","keywords":["quantum dense network coding","multiaccess networks","signaling dimension","tightly network-codeable groups","measurement-device-independent key growing","entanglement-assisted communication","ditwise modular addition"],"falsifier":"Measure the success probability of computing two-pair modular addition with n-qubit channels: if a classical or entanglement-free quantum strategy ever exceeds 1/2^n while the dense-network-coding strategy falls below 1 under controlled noise, the claimed separation is false.","tokens_in":60676,"feed_emoji":"🔗","tokens_out":533,"duration_ms":6068,"temperature":0.7,"pith_summary":"This paper introduces quantum dense network coding: two senders who share an entangled pair can each send n qubits to a receiver so that the receiver obtains the ditwise modular sum of their inputs with certainty. Classically, or with either entanglement or quantum communication alone, the same task succeeds with probability at most 1/2^n. The protocol works because the discrete Weyl operators form a projective representation of the group whose multiplication is being computed; the receiver’s Bell measurement therefore extracts exactly the group product and nothing more. The same algebraic structure yields a noise-robust advantage that grows exponentially with the number of senders and, when the shared entanglement is trusted, yields an information-theoretically secure key-growing protocol that can double the extractable key length relative to ordinary distillation.","feed_headline":"Half the qubits, perfect modular sums: dense network coding","feed_subtitle":"Only both entanglement and quantum channels achieve certainty; weaker resources fail exponentially.","key_machinery":"Tightly network-codeable groups: groups of order d^{2} that admit a projective unitary representation by discrete Weyl operators on C^d; the representation turns the group product into a perfect Bell-state measurement at the receiver.","core_discovery":"An entanglement-assisted quantum multiaccess network with signaling dimensions (2^n, 2^n) implements ditwise addition modulo 2^n with success probability 1, while every weaker resource class—classical, entanglement-assisted classical, nonsignaling-assisted classical, or unassisted quantum—is bounded by success probability at most 1/2^n.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Half qubits suffice for perfect modular sums via dense network coding","Entanglement plus quantum channels yield perfect multi-sender modular addition","Dense network coding transmits modular sums with half the qubits","Quantum multiaccess nets achieve ditwise addition with certainty using half resources","Shared entanglement and quantum comms cut qubit needs in half for modular sums"],"cache_read_input_tokens":46464,"weakest_assumption_plain":"The cryptographic key-growing rate assumes the two parties already share a known entangled state whose purification remains independent of any eavesdropper after the honest encoding maps are applied.","fun_headline_variants_meta":{"raw":{"variants":["Half qubits suffice for perfect modular sums via dense network coding","Entanglement plus quantum channels yield perfect multi-sender modular addition","Dense network coding transmits modular sums with half the qubits","Quantum multiaccess nets achieve ditwise addition with certainty using half resources","Shared entanglement and quantum comms cut qubit needs in half for modular sums"]},"model":"grok-4.5","effort":"low","cost_usd":0.002666,"raw_usage":{"total_tokens":943,"prompt_tokens":652,"num_sources_used":0,"completion_tokens":88,"cost_in_usd_ticks":26660000,"prompt_tokens_details":{"text_tokens":652,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":203,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":652,"tokens_out":88,"duration_ms":3810,"temperature":1.0,"reasoning_tokens":203,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-10T12:32:35.854110+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Measure the success probability of computing two-pair modular addition with n-qubit channels: if a classical or entanglement-free quantum strategy ever exceeds 1/2^n while the dense-network-coding strategy falls below 1 under controlled noise, the claimed separation is false.","supporting_citations":[],"review_version":1}