{"id":"05a643c7-3a89-4809-a164-4e69c5701560","arxiv_id":"2606.05412","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":7.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Quantum entanglement assistance yields exponential multiplicative Shannon capacity gains for classical K-user MACs with causal CSIT and unbounded gains as state alphabet size increases, even with noisy entanglement.","lead":"The paper shows that quantum entanglement assistance can create exponentially growing multiplicative gains in the Shannon capacity of certain classical multi-user channels when transmitters have causal channel state information. A smart generalist might read it to see whether quantum resources could produce dramatically larger improvements in classical network capacities than the modest gains found so far.","discovery_kind":"new_application","skeptic_critique":{"model":"grok-4.3","headline":"Existence of binary-alphabet K-user MACs where causal-CSIT unassisted capacity is small enough for entanglement to yield exp(K) multiplicative gain","rationale":"The reader's weakest_assumption is exactly the load-bearing point. The full text (once read) would need to supply the channel definitions and capacity proofs; the proposed numerical check directly tests whether those proofs deliver the stated factors without relying on external consensus.","tokens_in":1782,"tokens_out":322,"duration_ms":31028,"concrete_test":"For the K=5 binary example, recompute both the unassisted capacity under causal CSIT (via the appropriate multi-letter expression or convex optimization) and the entanglement-assisted capacity; if the ratio falls below 21 the exponential-gain claim for that channel fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim requires explicit construction of classical K-user MACs (binary alphabets for X,Y,S) such that, under causal CSIT, the unassisted Shannon capacity C_unassisted satisfies C_assisted / C_unassisted \to \\infty exponentially in K while the assisted capacity grows faster. Any gap in the lower bound on assisted capacity or upper bound on unassisted capacity (e.g., via incorrect handling of the state-dependent MAC or the entanglement-assisted coding scheme) would collapse the claimed scaling. The abstract states such channels exist and gives numerical factors (>21 for K=5, >88 for K=7), so the load-bearing step is the correctness of those capacity calculations.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript claims that quantum entanglement assistance provided only to the transmitters yields multiplicative Shannon capacity gains that grow exponentially with the number of users K for certain classical K-user multiple access channels (MACs) with fixed binary alphabets on inputs, outputs, and states, when causal channel state information is available at the transmitters. It further claims unbounded multiplicative gains as the state alphabet size grows (with K=3 and binary input/output alphabets fixed), reports explicit numerical factors exceeding 21 (K=5) and 88 (K=7), and asserts that the exponential advantage persists even under independent depolarization noise on each entangled qubit with probability approximately 30%.","tokens_in":1915,"tokens_out":576,"duration_ms":33985,"significance":"If the explicit channel constructions and capacity bounds are correct, the result would establish that entanglement assistance can produce exponentially large, robust multiplicative advantages in classical multi-user networks under causal CSIT, substantially exceeding the modest (<6%) gains reported in prior literature. The fixed small alphabets and noise robustness would make the finding particularly noteworthy for both theory and potential implementation.","major_comments":[{"comment":"The central claim rests on the existence of specific binary-alphabet K-user state-dependent MACs for which the unassisted capacity under causal CSIT is small enough that the assisted capacity produces an exponential (in K) multiplicative ratio. The manuscript must supply the explicit channel transition probabilities P(y|x1,...,xK,s) together with the derivations or bounds establishing both the unassisted capacity upper bound and the entanglement-assisted lower bound; without these, the reported factors (>21 for K=5, >88 for K=7) cannot be verified.","section":"Main results and capacity calculations"},{"comment":"The handling of causal CSIT in the entanglement-assisted coding scheme must be shown to be free of circularity or self-referential definitions. In particular, any capacity expression that reduces by construction to a fitted parameter (rather than being derived from the channel law) would collapse the claimed scaling; the paper should isolate the precise role of the shared entanglement in the achievable rate region.","section":"Entanglement-assisted coding scheme"}],"minor_comments":[{"comment":"Clarify the precise definition of 'causal CSIT' (whether the state at time t is known before or after the input at time t) and ensure it is used consistently in all capacity expressions.","section":"Channel model"},{"comment":"Add a table or figure summarizing the unassisted vs. assisted capacities for each K, including the explicit channel parameters used to obtain the numerical factors.","section":"Numerical results"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the thorough review and for highlighting the need for explicit verifiability. We address each major comment below and will revise the manuscript accordingly to strengthen the presentation.","responses":[{"response":"We agree that explicit channel specifications and derivations are required for independent verification. The revised manuscript will include the complete transition probability tables P(y|x1,...,xK,s) for the binary-alphabet constructions, together with the full derivations of the unassisted capacity upper bounds (via standard single-letter converses under causal CSIT) and the entanglement-assisted achievable rates (via the induced joint distributions over the entangled state). These additions will directly confirm the reported multiplicative factors.","revision_made":"yes","referee_comment":"The central claim rests on the existence of specific binary-alphabet K-user state-dependent MACs for which the unassisted capacity under causal CSIT is small enough that the assisted capacity produces an exponential (in K) multiplicative ratio. The manuscript must supply the explicit channel transition probabilities P(y|x1,...,xK,s) together with the derivations or bounds establishing both the unassisted capacity upper bound and the entanglement-assisted lower bound; without these, the reported factors (>21 for K=5, >88 for K=7) cannot be verified."},{"response":"The scheme is free of circularity: each transmitter uses its local causal CSIT to select a classical input symbol that is correlated through the pre-shared entangled state according to a fixed, channel-independent encoding map. The achievable rate region is obtained from the resulting single-letter mutual information expressions evaluated on the joint distribution induced by the entangled resource, the channel law, and the causal state realizations; no parameter is fitted to the capacity value itself. The revision will add an expanded section that explicitly separates the entanglement's role (creating input correlations across users) from the causal CSIT usage (local adaptation to the realized state) and provides the precise rate expressions.","revision_made":"yes","referee_comment":"The handling of causal CSIT in the entanglement-assisted coding scheme must be shown to be free of circularity or self-referential definitions. In particular, any capacity expression that reduces by construction to a fitted parameter (rather than being derived from the channel law) would collapse the claimed scaling; the paper should isolate the precise role of the shared entanglement in the achievable rate region."}],"tokens_in":1502,"tokens_out":511,"duration_ms":23089,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main point is that this work finds classical K-user MACs with fixed binary alphabets where entanglement assistance at the transmitters, combined with causal CSIT, produces a capacity ratio that scales exponentially in K. They also show the ratio can grow without bound as the state alphabet size increases for K=3 while keeping inputs and outputs binary. Concrete numbers appear for small K, and the advantage survives independent depolarization of each entangled qubit with probability around 30%.\n\nThe paper does a solid job identifying example channels where the unassisted capacity stays limited while the assisted scheme exploits the shared entanglement and state information to achieve much higher rates. This is a clear step beyond the small percentage gains in earlier entanglement-assisted network results. The noise robustness check is useful because it shows the effect does not require ideal entanglement.\n\nThe soft spot is the dependence on precise capacity calculations for both the assisted and unassisted cases. Exponential scaling in the ratio requires the unassisted capacity to remain small enough relative to the assisted one; any looseness in the upper bound on the unassisted rate or the lower bound on the assisted rate would weaken the claimed growth. These are specific constructed channels rather than a general statement about all MACs, so the result is narrow but sharp if the derivations hold.\n\nThis is for researchers working on quantum-assisted classical networks and multi-user information theory. A reader who wants to see whether entanglement can produce large rather than incremental effects in state-dependent settings will find the examples worth examining. It deserves peer review so the capacity derivations and channel constructions can be checked directly.","headline":"The paper constructs specific binary-alphabet K-user MACs where causal CSIT plus transmitter entanglement yields exponentially growing multiplicative capacity gains over the unassisted case, with reported factors >21 for K=5 and >88 for K=7.","tokens_in":2377,"tokens_out":412,"would_cite":false,"duration_ms":41298,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"Quantum entanglement assistance at transmitters multiplies Shannon capacity exponentially with user count for certain classical MACs under causal CSIT.","keywords":["quantum entanglement assistance","multiple access channel","causal CSIT","Shannon capacity","multiplicative gain","exponential scaling","binary alphabet"],"falsifier":"Explicit evaluation of the entanglement-assisted and unassisted capacities for the paper's constructed channels that shows the ratio remains bounded as K increases.","tokens_in":2676,"feed_emoji":"","tokens_out":674,"duration_ms":33712,"temperature":0.7,"pith_summary":"The paper shows that for certain classical K-user multiple access channels with binary alphabets, providing quantum entanglement only to the transmitters yields a capacity that is larger by a factor growing exponentially in K when transmitters know the channel state causally. The same setup produces capacity gains that become arbitrarily large as the state alphabet size increases while keeping K fixed at 3 and inputs/outputs binary. These multiplicative advantages remain substantial even for small K and persist when the shared entanglement is noisy. The result identifies a setting where entanglement assistance transforms capacity scaling in classical networks rather than producing only incremental improvements.","feed_headline":"Entanglement multiplies MAC capacity exponentially with user count","feed_subtitle":"Causal transmitter state info enables unbounded multiplicative gains for certain binary-alphabet classical channels.","key_machinery":"Transmitter-only quantum entanglement assistance used together with causal channel state information to coordinate inputs on specially constructed binary-alphabet multiple access channels.","core_discovery":"In the presence of causal channel state information at the transmitters, quantum entanglement assistance provides a multiplicative capacity advantage that grows exponentially with the number of users K for certain classical K-user multiple access channels with fixed size (binary) alphabet for inputs, outputs and states. Similarly, in the presence of causal channel state information at the transmitters, quantum entanglement assistance is shown to provide a multiplicative capacity advantage that is unbounded as the size of the state alphabet grows, while the number of users (K=3) and the input and output alphabet (binary) are held fixed.","pith_inferences":["Network designs that supply pre-shared entanglement to transmitters could achieve scaling benefits in state-dependent multi-user settings that are unavailable with classical resources alone.","The noise robustness suggests that imperfect entanglement distribution may still suffice for large gains in practice.","Analogous exponential separations might be sought in other topologies such as broadcast channels or interference channels that also admit causal state information."],"forward_implications":["Multiplicative capacity gains exceed a factor of 21 for K=5 users with binary alphabets.","Multiplicative capacity gains exceed a factor of 88 for K=7 users with binary alphabets.","An exponential (in K) capacity advantage survives even when each entangled qubit depolarizes independently with probability around 30%.","For K=3 the multiplicative advantage grows without bound as the state alphabet size increases while inputs and outputs remain binary."],"fun_headline_variants":["Entanglement enables exponential MAC capacity growth with user number","Multiplicative capacity gains exponential in K for entangled MAC channels","Unbounded MAC capacity gains from entanglement as state alphabet expands","Robust exponential gains in MAC capacity persist with noisy entanglement"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"There exist specific classical K-user multiple access channels with binary alphabets for which the capacity under causal CSIT admits an exponential multiplicative advantage from transmitter-side entanglement assistance.","fun_headline_variants_meta":{"raw":{"variants":["Entanglement enables exponential MAC capacity growth with user number","Multiplicative capacity gains exponential in K for entangled MAC channels","Unbounded MAC capacity gains from entanglement as state alphabet expands","Robust exponential gains in MAC capacity persist with noisy entanglement"]},"model":"grok-4.3","cost_usd":0.00783,"raw_usage":{"total_tokens":3530,"prompt_tokens":742,"num_sources_used":0,"completion_tokens":63,"cost_in_usd_ticks":78303000,"prompt_tokens_details":{"text_tokens":742,"audio_tokens":0,"image_tokens":0,"cached_tokens":64},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2725,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":742,"tokens_out":63,"duration_ms":33033,"temperature":1.0,"reasoning_tokens":2725,"cache_read_input_tokens":64,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-28T03:47:40.678217+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Explicit evaluation of the entanglement-assisted and unassisted capacities for the paper's constructed channels that shows the ratio remains bounded as K increases.","supporting_citations":[],"review_version":1}