{"id":"8de3e528-46ff-4328-b0c1-e26b0d733d4a","arxiv_id":"2501.18846","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A QoS-inspired routing framework for aggregated quantum networks is applied to two-path examples, showing that optimal channel assignment depends on quantum memory coherence times and that quantum error correction does not always improve fidelity.","lead":"This paper proposes a Quality of Service (QoS) framework for quantum networks that send encoded quantum information over multiple parallel paths. It shows, through two-path examples, that the best routing choice depends on memory coherence times and that quantum error correction helps only above certain channel-quality thresholds.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central fidelity-vs-T2 results rely on Appendix A formulas that are not derived, contain apparent typos, and never specify the T2-to-pd mapping; until those formulas are verified, the claimed T2-dependent optimal assignments and QEC-detriment conclusion are not reproducible.","rationale":"The reader's weakest_assumption is exactly the one I find most load-bearing. The paper's conceptual contribution—a QoS taxonomy and a three-regime routing protocol for aggregated quantum networks—does not depend on the fidelity formulas, but the paper's advertised findings do. The abstract promises a quantitative interplay between channel assignment, coherence time, and QEC; all of that evidence is read off figures generated by Appendix A formulas. Those formulas are unverified here, visibly typo-ridden, and the T2-to-pd link is absent, so a conscientious reader cannot tell whether the claimed thresholds are physical results or artifacts of a particular depolarization convention. The QEC-does-not-always-help statement is also only demonstrated in one example with Nc=10 and a specific code, so its presentation as a general finding (Abstract, Sec. V) is stronger than the evidence; this strengthens the case for a conditional evaluation. I do not see fraud or circularity; the issue is incomplete support. Independent support is limited: there is no machine-checked proof or released code, so reproducibility is the main safeguard, and it fails on the T2 mapping. A secondary inconsistency: Sec. IV states that the regimes are not affected by finite coherence times while the inset shows a T2-dependent reordering of the 4+1/1+4 fidelities; the intended meaning should be clarified. If the re-derivation in my concrete test reproduces the thresholds, the paper could be accepted; until then, CONDITIONAL is appropriate.","tokens_in":14498,"tokens_out":6112,"duration_ms":64993,"concrete_test":"Independently re-derive the Appendix A fidelities from the quantum Reed-Solomon code and the loss-plus-depolarization model of Ref. [35], correcting the typos and using an explicit memory model such as p_d = 1 - exp(-Δτ/T_2) (or the model actually used in [35]) with Δτ the delay difference between the two paths. Recompute the curves and thresholds in Figs. 4, 6, and 7. If the crossing points, the p2 interval boundaries in Fig. 6, or the T2 thresholds (0.1 ms, 1 ms) shift appreciably or disappear, the quantitative support for the central claim fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"All of the paper's quantitative claims—the crossings that define the restricted regime in Fig. 6, the 5+0 vs 5+2 advantage threshold p2>0.75 in Fig. 7, and the coherence-time thresholds T†2=0.1 ms and T2=1 ms—are computed from the fidelity expressions in Appendix A. These expressions are not derived in this paper; they are imported from Ref. [35]. The printed formulas contain apparent typos: 'p4/74' should presumably be p_d^4/7^4, and 'p/7' in F_{1+4} should be p_d/7. More importantly, no equation relates the depolarizing probability p_d to the quantum-memory coherence time T2 and the storage time caused by the path-delay difference. Without that mapping, the insets plotting fidelity versus T2 and the stated thresholds cannot be reproduced or checked. Because the central claim is precisely that the optimal assignment depends jointly on p and T2, an error or hidden convention in p_d(T2) would change the regime boundaries and could invalidate the headline conclusion that QEC sometimes hurts and that fidelity cannot be optimized independently of memory lifetimes.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This manuscript extends the classical notion of Quality of Service (QoS) to aggregated quantum networks, defining quantum-specific QoS metrics (bandwidth, loss, delay, jitter) and proposing a router protocol that assigns channels to multiple users according to three regimes (greedy, balanced, restricted). The analysis covers both unencoded transmission and quantum Reed-Solomon encoded transmission over two paths of different lengths, with the central claim that optimal channel assignment depends jointly on path transmission probability and quantum memory coherence time, and that quantum error correction does not always improve fidelity. The quantitative results are based on fidelity formulas listed in Appendix A, which are taken from the authors' prior work (Ref. [35]).","tokens_in":14704,"tokens_out":4680,"duration_ms":44225,"significance":"If the central results are sound, the paper makes a useful step toward QoS-aware quantum routing in near-term networks, and the prediction that QEC can be detrimental under short coherence times or unbalanced path lengths is concrete and falsifiable. The paper is clearly written and the example-based development of the three routing regimes is intuitive. Credit is due for the explicit goal of connecting routing decisions to physical memory parameters, a connection often omitted in protocol-level studies. However, the load-bearing quantitative claims are not derived in this manuscript: they reduce to fidelity formulas quoted from the authors' own prior paper, and the relationship between T2 and the depolarization probability p_d is not specified, which limits reproducibility.","major_comments":[{"comment":"The fidelity formulas F_{4+1}, F_{3+2}, F_{2+3}, and F_{1+4} are quoted without derivation, and the printed expressions contain typographical errors: \"p4/74\" in F_{4+1} should presumably be p_d^4/7^4, and \"p/7\" in F_{1+4} should presumably be p_d/7. Since the crossings in Fig. 6, the p2 > 0.75 threshold in Fig. 7, and the coherence-time thresholds T†2 = 0.1 ms and T2 = 1 ms are all computed from these formulas, the manuscript must either derive them in the appendix or state precisely that they are taken from Ref. [35] and provide the corrected expressions verbatim.","section":"Appendix A"},{"comment":"The depolarization probability p_d entering the Appendix A formulas is never related to the memory coherence time T2 and the storage interval induced by the path-delay difference. The insets of Figs. 4, 6, and 7 plot fidelity versus T2 or characterize T2 thresholds, so without an explicit mapping p_d(T2, Δτ) the results cannot be reproduced from this paper alone. Because the central claim is that the optimal channel assignment depends jointly on p2 and T2, this missing mapping is load-bearing and must be supplied.","section":"Secs. IV-V"},{"comment":"The statement \"the regimes defined above are not affected by finite coherence times\" is in tension with the inset of Fig. 4, where all configurations cross the 0+5 curve at T†2 = 0.1 ms, and with the text that for T2 < T†2 \"the aggregation scenario is not convenient.\" Please clarify whether the regime definitions are unaffected or whether the optimal assignment itself changes below T†2.","section":"Sec. IV"}],"minor_comments":[{"comment":"The relationship between Nc = 10, a channel capacity of one qudit of dimension 9 per time unit, the qudit dimensions 7 and 3, and the resulting numbers of qudits per assignment is not derived; a short worked example would improve readability.","section":"Tables I and II"},{"comment":"Equation (A3) uses parentheses inconsistently with (A2); please unify the notation for the binomial-type expansions.","section":"Appendix A"},{"comment":"The radar chart is described in the text as qualitative, but the caption should explicitly state that the normalized values are illustrative only and not drawn from experimental data.","section":"Fig. 2 caption"},{"comment":"The manuscript cites its own Ref. [35] for the aggregation fidelity formulas; the text should make clear at the point of use in Appendix A that the expressions are imported from that work, rather than appearing to be original to this paper.","section":"Appendix A"}],"recommendation":"major_revision","confidential_remarks":"The quantitative core of the paper relies on formulas from the authors' previous publication [35]; given the missing derivation and the uncorrected typos, I recommend requesting an independent derivation or a complete reproduction package as part of the revision. The novelty of the routing scenario and the QoS framing is not in question, but the reproducibility of the headline thresholds is."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a useful conceptual framework for QoS in direct-transmission aggregated quantum networks, with a clean three-regime taxonomy for channel assignment. The quantitative results, however, rest on fidelity formulas imported from your prior paper [35] without derivation, and the paper never specifies how T2 maps to the depolarizing probability pd used in those formulas. That makes the T2-dependent insets and thresholds (0.1 ms, 1 ms) non-reproducible from the paper alone.\n\nWhat's genuinely new: the aggregation framework with greedy/balanced/restricted assignment regimes is a sensible extension of classical QoS thinking to quantum direct transmission, and the observation that QEC can hurt when path asymmetries and finite coherence combine is a useful caution for protocol designers. The paper is also honest about its simplifying assumptions (jitter ignored, no explicit fidelity threshold, topologies chosen for illustration). The qualitative radar chart comparison of application requirements is suggestive, though explicitly not data-driven.\n\nThe soft spots are real. Appendix A lists the fidelity expressions with what look like typographical dropouts (p4/74, p/7) that should be pd^4/7^4 and pd/7 in context. More importantly, there is no equation connecting T2 to pd. The insets in Figs. 4, 6, and 7 all hinge on that relationship, and without it the claimed coherence-time thresholds and the conclusion that QEC advantage appears only above p2>0.75 cannot be checked. The general statements in the abstract—that fidelity cannot be optimized independently of memory lifetimes and that QEC sometimes degrades performance—are demonstrated only for a single two-path, ten-channel example. They may well hold more broadly, but this paper doesn't prove that.\n\nThe right audience is researchers designing near-term quantum routing protocols, especially those interested in direct-transmission (non-repeater) architectures. It's a serious referee candidate: the framework is worth engaging with, and the gaps are fixable rather than fatal. I'd send it to review, but the authors must add the pd(T2) mapping and clean up the typos before the numbers can be trusted.","headline":"A sensible QoS framework for aggregated quantum networks whose quantitative claims are currently non-reproducible because the fidelity formulas are imported and the T2-to-pd mapping is missing.","tokens_in":15241,"tokens_out":2668,"would_cite":false,"duration_ms":27190,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":["03.67.Hk","03.67.Pp"],"model":"deepseek-v4-flash","headline":"This paper claims that in aggregated quantum networks, fidelity cannot be optimized independently of quantum-memory lifetimes, and that quantum error correction can decrease end-to-end fidelity when path losses and coherence times are…","keywords":["quantum networks","quality of service","aggregated quantum networks","routing","quantum error correction","Reed-Solomon code","fidelity","quantum memory coherence"],"falsifier":"Re-derive the fidelity expressions from the companion paper with an explicit T2-to-memory-error model and evaluate the 5+2 versus 5+0 crossover at p1 equals 0.9: the paper predicts 5+2 wins only for p2 above about 0.75 and only for sufficiently large T2. A simulation or experiment that measures end-to-end fidelity for the ten-channel, two-path setup in the T2 interval from 0.1 to 1 ms would confirm or overturn that ordering; if the ordering of configurations varies with the assumed memory model, the central routing rule is not robust.","tokens_in":14280,"feed_emoji":"🔀","tokens_out":8156,"duration_ms":82985,"temperature":0.7,"pith_summary":"This paper introduces a Quality-of-Service (QoS) view of aggregated quantum networks, in which two remote nodes are connected by several parallel paths of different lengths and a router decides how many qudits each user sends along each path. The central claim is that the best channel assignment cannot be decided from path transmission probabilities alone: the coherence time of the receiver's quantum memories must enter the routing decision, because qudits arriving on faster paths wait in memory until the slower paths arrive. The paper also claims that quantum error correction does not always improve fidelity; for a quantum Reed-Solomon code in a two-path example, the higher-dimensional encoding wins only when the longer path's transmission probability is high enough, and below that threshold the redundancy is outweighed by loss and decoherence. These claims matter because routing protocols for near-term quantum repeater networks will need to balance fidelity, throughput, and memory usage, and the paper identifies concrete thresholds in coherence-time versus transmission-probability space where the optimal assignment changes.","feed_headline":"Quantum memory lifetime decides best network path","feed_subtitle":"In multipath quantum networks the optimal assignment flips as coherence time drops; error correction helps only past a threshold.","key_machinery":"The central object is an aggregated path: a set of parallel links of different lengths connecting sender and receiver, with each quantum packet split into qudits distributed over the paths. The argument runs on a family of fidelity formulas F_{i+j}, quoted from the authors' companion paper on quantum aggregation with temporal delay, in which i qudits travel the shorter path and j the longer; these combine per-channel transmission probabilities p1 and p2 with a depolarization probability that represents decoherence in the receiver's quantum memories. The quantum Reed-Solomon code is the error-correcting structure that lets the receiver decode even when some qudits are lost, and the router's time-slotted assignment protocol is the decision mechanism that compares the F_{i+j} values across assignments. What carries the argument is the comparison of these fidelity expressions: crossings between curves, and their dependence on coherence time through the memory-error probability, are what define the greedy, restricted, and balanced routing regimes.","core_discovery":"On its own terms, the paper's discovery is that end-to-end fidelity in an aggregated quantum network is a joint function of per-path transmission probabilities and of how long states wait in imperfect quantum memories. For unencoded transmission, the fidelity of each assignment is computed from expressions such as F_{i+j} in which i qudits travel the shorter path and j the longer, and the paper shows that finite coherence time can reorder which assignment gives the highest fidelity. For encoded transmission, the discovery is sharper: using a quantum Reed-Solomon code of larger dimension can lower fidelity. In the worked example, configuration 5+2 (a seven-dimensional code split across paths) only beats 5+0 (a five-dimensional code entirely on the good path) for transmission probability p2 greater than about 0.75, and this crossover shifts to higher p2 as the memory coherence time T2 decreases; below about 1 ms the coherence time materially changes the optimal choice, and below about 0.2 ms the fair restricted-regime assignment also changes. The authors conclude that a quantum router must know the remote memory coherence time to make correct assignments.","pith_inferences":["Editorial inference: the crossing diagrams in T2-versus-p2 space could be turned into a simple admission-control policy, where the router uses the fidelity formulas to decide whether a requested user count and fidelity target can be met at all.","Editorial inference: the same QoS logic could be tested as a hybrid coding strategy that switches between unencoded, lower-dimensional, and higher-dimensional encodings based on live estimates of path loss and remaining memory coherence time.","Editorial inference: the paper's direct-transmission assumption leaves open whether the qualitative conclusion, that memory lifetime must enter routing decisions, survives in entanglement-based repeater networks, where stored Bell pairs face analogous decoherence but different fidelity formulas."],"forward_implications":["A quantum router that ignores the receiver's memory coherence time will mis-rank assignments whenever T2 is below the crossing time, so QoS routing tables must include memory hardware parameters.","Below a coherence-time threshold the router should send all qudits along the best path instead of aggregating, because waiting for the slower path destroys more fidelity than the extra loss would.","Quantum error correction should be applied conditionally: in the example, the lower-dimensional code over the good path beats the higher-dimensional code split across paths when p2 is low, and only above a threshold does the larger code win.","The optimal assignment for the restricted regime, which minimizes the fidelity difference between users, changes at specific p2 values, and finite coherence time shifts those boundaries.","Current quantum memory technologies with coherence times above the identified thresholds are, according to the paper, adequate to support the proposed QoS-aware assignments."],"supporting_citations":[{"why":"Supplies the analytical fidelity formulas for quantum aggregation with temporal delay that all curves in Sections IV and V are plotted from.","marker":"[35]"},{"why":"Gives the quantum Reed-Solomon code used as the encoding in the encoded scenario; its distance determines how many lost qudits can be tolerated.","marker":"[45]"},{"why":"Establishes the direct-transmission, non-entanglement-based model and the idea that quantum communication can proceed without requiring quantum memories.","marker":"[24]"},{"why":"Shows that multipath transmission can enhance quantum network resource utilization and motivates the aggregated-network QoS analysis.","marker":"[23]"},{"why":"Provides a prior QoS architecture for multi-user quantum networks that this paper extends by coupling path assignment with coherence and error correction.","marker":"[22]"}],"fun_headline_variants":["Quantum memory lifetime flips optimal network path","Fidelity in quantum networks hinges on memory coherence","Error correction in quantum nets only helps past threshold","QoS routing must know remote memory coherence","Aggregated quantum paths: coherence time decides best route"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The numerical thresholds rest on the fidelity formulas from the authors' companion paper, quoted in Appendix A without derivation and with apparent typographical slips, and on a conversion from memory coherence time T2 to the memory error probability that the paper never specifies; if the derivation or the conversion is wrong, the optimal-assignment thresholds shift.","fun_headline_variants_meta":{"raw":{"variants":["Quantum memory lifetime flips optimal network path","Fidelity in quantum networks hinges on memory coherence","Error correction in quantum nets only helps past threshold","QoS routing must know remote memory coherence","Aggregated quantum paths: coherence time decides best route"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000462,"raw_usage":{"total_tokens":2330,"prompt_tokens":983,"completion_tokens":1347,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":599,"completion_tokens_details":{"reasoning_tokens":1276}},"tokens_in":599,"tokens_out":1347,"duration_ms":9013,"temperature":1.0,"reasoning_tokens":1276,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-09T22:13:55.555007+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Re-derive the fidelity expressions from the companion paper with an explicit T2-to-memory-error model and evaluate the 5+2 versus 5+0 crossover at p1 equals 0.9: the paper predicts 5+2 wins only for p2 above about 0.75 and only for sufficiently large T2. A simulation or experiment that measures end-to-end fidelity for the ten-channel, two-path setup in the T2 interval from 0.1 to 1 ms would confirm or overturn that ordering; if the ordering of configurations varies with the assumed memory model, the central routing rule is not robust.","supporting_citations":[{"cited_title":"Azuma, K","cited_arxiv_id":null,"evidence_quote":"Supplies the analytical fidelity formulas for quantum aggregation with temporal delay that all curves in Sections IV and V are plotted from."},{"cited_title":"Korzh, C","cited_arxiv_id":null,"evidence_quote":"Gives the quantum Reed-Solomon code used as the encoding in the encoded scenario; its distance determines how many lost qudits can be tolerated."},{"cited_title":"Quality of Service in aggregated quantum networks","cited_arxiv_id":"2501.18846","evidence_quote":"Shows that multipath transmission can enhance quantum network resource utilization and motivates the aggregated-network QoS analysis."},{"cited_title":"Rosati, A","cited_arxiv_id":null,"evidence_quote":"Provides a prior QoS architecture for multi-user quantum networks that this paper extends by coupling path assignment with coherence and error correction."}],"review_version":1}