{"id":"7ef6fd8d-06f6-45dd-8476-7b7fe252176f","arxiv_id":"2510.25915","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper unifies circuit, MBQC, magic-state, and Pauli measurement models as double categories, with quantum information horizontal and classical control vertical, and recasts the contextual-fraction bound on computing non-affine Boolean functions in that language.","lead":"A category-theory paper builds a single \"double diagram\" language for quantum circuit models, measurement-based computing, and magic-state computing, with quantum operations along one axis and classical control along the other. It shows how model conversions become structure-preserving maps and links non-classical computational power to quantum contextuality.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 74's face-map proof uses an unstated and undefined relation Ψ_{i,r}=Ψ_{i',r'} for i+r=i'+r'; if it fails, p_ρ(Φ) is not a simplicial distribution and Theorem 77's NCF bound does not apply.","rationale":"The reader identified the same load-bearing assumption: Lemma 74, which makes p_ρ(Φ) a simplicial distribution. The paper's main quantitative result, Theorem 77, depends on applying NCF to p_ρ(Φ); if the face-map consistency fails, the bound cannot be used. The displayed proof of Lemma 74 contains an unstated relation and an undefined symbol Ψ_{i,r}, and the relation is not an immediate consequence of the Bell-instrument conditions in Definition 44. This is not a known falsehood — the relation may be derivable from the XOR/copy gadget — but the derivation is absent, and the central claim rests on it. The rest of the paper is substantial: the double-category framework is developed in detail, the rewrite rules in Appendix B are checked, and Theorem 40's universality is reasonable. No independent fatal flaw is apparent. The correct disposition is to keep the verdict CONDITIONAL, pending a verification of Lemma 74's missing step.","tokens_in":29951,"tokens_out":18632,"duration_ms":183551,"concrete_test":"Take the m=2 case: build a 2-qubit Bell instrument by vertically composing two eΦ gadgets of Definition 44 with a 0-state and a delete as in Example 45. Write the explicit CP map for eΦ from the diagram 'Φ XOR c Tr=' (using Definition 55's Φ_MX/Y and Definition 33's Boolean instruments). Verify directly that the two non-degenerate 2-simplices σ_{0,1} and σ_{1,0} satisfy d_0 and d_1 face equalities; equivalently, prove from the eΦ formula that Σ_b eΦ^{s,b}_{i,r} depends only on i⊕r. If this identity fails, Construction 73 is not a simplicial set map and Theorem 77 is unsupported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 6.2's Lemma 74 is the hinge that lets Construction 73 produce a simplicial instrument. The displayed proof of the d_m face equality in Lemma 74 contains the line 'where we used Ψ_{i,r} = Ψ_{i',r'} when i+r=i'+r' mod 2.' No definition of Ψ_{i,r} appears anywhere in the manuscript, and the role of r_m in the induction (an auxiliary output of Φ_bar feeding the m-th gadget) is never formalized. The relation is not obviously forced by Definition 44's Bell-instrument conditions; those conditions constrain which wires connect to outer inputs/outputs, not the functional form of the CP maps. If the relation fails, d_m(Φ_{...0}) ≠ d_m(Φ_{...1}), the map hat(Φ) is not simplicial, p_ρ(Φ) is not a well-defined simplicial distribution, and Theorem 77's NCF bound cannot be applied to m-Bell instruments; Corollary 79 collapses. The proof also relies on acyclicity to select Φ_m, which is reasonable, but the unstated relation is the load-bearing gap.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a double-categorical syntax and semantics for adaptive quantum computation. It introduces labeled double port graphs, whose horizontal and vertical wires are intended to carry quantum and classical information respectively, and assembles them into double categories. Semantics is given by a one-object double category Inst of adaptive instruments; its horizontal and vertical monoidal categories are claimed to recover quantum channels and stochastic (Kleisli) maps. Circuit model, MBQC, QCM, and MBPC are represented as double categories of labeled double port graphs, with gadget constructions implemented as pasting operations and therefore as double functors. In the second half, the paper defines simplicial instruments, simplicial Bell scenarios, and Bell instruments, and proves a quantitative contextuality bound (Theorem 77): for an m-qubit state, m-Bell instrument, and affine Boolean h, the average success probability of computing f is at most 1 - NCF(p_rho(Phi)) nu(f). Corollary 79 asserts that deterministic computation of a non-affine f forces strong contextuality. The central framework is categorical, and the main theorem generalizes known contextuality-based restrictions on measurement-based computation.","tokens_in":30280,"tokens_out":16143,"duration_ms":170530,"significance":"If the technical gaps are repaired, this would be a genuinely useful unifying framework: it makes precise the interaction of quantum channels and classical control in a single double category, gives explicit double functors for the standard adaptive models and their conversions, and extends simplicial contextuality to an adaptive/instrument setting. The paper contains several explicit constructions and proofs (e.g., the interchange law in Lemma 26 and simpliciality of compositions in Lemma 64), and the main inequality is a quantitative and falsifiable statement. The relationship to prior work on contextuality and MBQC is clearly acknowledged. However, the current manuscript has load-bearing gaps in the proof that Bell instruments define simplicial distributions and in the basic horizontal/vertical conventions; these must be fixed before the main claims can be verified.","major_comments":[{"comment":"The convention for which axis is quantum and which is classical is inconsistent. Figure 1 and the abstract state that horizontal/solid wires carry quantum information and vertical/dashed wires carry classical information/control. Definition 24, however, makes the vertical morphisms of Inst the Hilbert spaces and the horizontal morphisms the sets. Propositions 27 and 29 then identify H(Inst) with Chan and V(Inst) with Set_D. As written, a square in Inst has sets on the top/bottom edges and Hilbert spaces on the left/right edges, so the reader cannot tell which direction the diagrams in Diagrams (1) and (2) treat as quantum. This is not purely terminological: the source and target data of every double functor depend on the convention. Please fix the terminology and re-check the composition formulas in Section 3.2 accordingly.","section":"Sections 2.2, 3.2, 3.3; Figure 1"},{"comment":"This lemma is the hinge connecting Construction 73 to Theorem 77: it is exactly what makes p_rho(Phi) a simplicial distribution. The proof of the d_m face equality invokes the relation 'Psi_{i,r} = Psi_{i',r'} when i+r = i'+r' mod 2', but Psi_{i,r} is never defined in the manuscript and the relation is not shown to follow from Definition 44 or from acyclicity. In the induction, the role of r_m as an auxiliary output of \\bar{Phi} feeding the m-th gadget is also not formalized. If this relation fails, d_m(Phi_{...0}) != d_m(Phi_{...1}), \\hat{Phi} is not simplicial, and the NCF bound of Theorem 77 does not apply to m-Bell instruments; Corollary 79 would not follow. Please give a formal definition of Psi_{i,r} and prove the relation from the Bell-instrument conditions, or state it as an explicit additional hypothesis and explain its operational meaning.","section":"Section 6.2, Lemma 74"},{"comment":"The pasting operation is used to construct every model-conversion double functor kappa in Equations (13), (15), (18), and (19), so its correctness is load-bearing. Proposition 19 proves bijectivity of the horizontal iota_h and sketches acyclicity, but delegates 'the remaining checks', including the vertical version of the bijection and the total acyclicity of the pasted graph. The quotient argument in Diagram (3) is also terse. Please either complete the proof or provide an explicit symmetry argument showing that the vertical structure follows from the horizontal one, and verify that the total internal flow graph remains acyclic.","section":"Section 2.4, Proposition 19"}],"minor_comments":[{"comment":"The definition of CP_{V,W} has a typo: the codomain should be CP(V,W), not CP(X,Y), and the bound variable should be the output set Y rather than X. This makes Definition 63 harder to read.","section":"Definition 61"},{"comment":"In the join formula, the middle summand should be X_p x Y_q, not X_p x X_q. As printed, the definition is not the usual join of simplicial sets.","section":"Definition 69"},{"comment":"In the first displayed computation, the proof starts with (theta*(Psi composed Phi)) but then expands it as a sum over Phi composed Psi. The notation should be aligned to avoid confusion about which composition is being checked.","section":"Lemma 64"},{"comment":"The codomain of the vertical composition (Psi bullet Phi) is written as X x Y, but for squares bounded by X,Y and Y,Z it should be X x Z. This typo obscures the composition rule.","section":"Section 3.2, vertical composition"},{"comment":"The text says 'Further conversions are possible ... left to the reader', which makes Diagram 17 partially conditional. Also, Proposition 84 is asserted to be 'the same as [27, Theorem 3]' without translating the rewrite system to the quotient double category. Please either supply the argument or mark the statement as an adaptation to be proved elsewhere.","section":"Section 5.2 and Proposition 84"}],"recommendation":"major_revision","confidential_remarks":"The paper is a synthesis of the authors' earlier simplicial-contextuality program with a double-categorical formalism for adaptive quantum computation; the reliance on prior published work is not circular. The main issue is not novelty but verification: Lemma 74 is the load-bearing step for the main theorem, and the undefined Psi_{i,r} relation is a genuine gap. I also found the horizontal/vertical convention in Inst contradictory with the figures and with Propositions 27/29. Both issues seem fixable by rewriting the relevant definitions and giving a complete proof of Lemma 74, but as submitted the central claims cannot be checked."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Worth a look, but read Lemma 74 carefully before citing the main theorem. The paper sets out a double-categorical language for adaptive quantum computation—double port graphs for syntax, a one-object double category Inst for adaptive instruments, simplicial instruments for contextuality—and it genuinely does unify the circuit model, MBQC, QCM, and MBPC into commutative diagrams of double functors. That packaging is new and mostly well executed. The treatment of model conversions as pasting operations is clean, and the authors are honest that Theorem 77 generalizes [16,17] rather than pretending those results are new.\n\nThe soft spot is exactly where the reader put it. Lemma 74 is the hinge: it claims the assignment σ_{i1...im} ↦ Φ_{i1...im} is simplicial, so that p_ρ(Φ) is a well-defined simplicial distribution and the NCF bound applies to m-Bell instruments. The proof of the d_m face equality uses 'Ψ_{i,r} = Ψ_{i',r'} when i+r=i'+r' mod 2'—but Ψ_{i,r} is never defined in the manuscript, and the relation is not derived from Definition 44. It may be true for Bell instruments built from a single-qubit instrument (the parity dependence is plausible), but the paper has to state and prove it. If it fails, d_m(Φ_{...0}) ≠ d_m(Φ_{...1}), Construction 73 doesn't give a simplicial instrument, and Theorem 77's bound cannot be applied to the adaptive case; Corollary 79 would not follow. This is a genuine gap, not a nitpick.\n\nThe other issues are smaller. Proposition 19 leaves checks to the reader; Proposition 84 is delegated to [27, Theorem 3]; Definition 24 and Figure 1 disagree on which direction is quantum. These are fixable in revision. The self-citation pattern is fine: [12,14,22,30] are prior published work, and the generalization of [16,17] is acknowledged, so circularity is not a concern.\n\nBottom line: the framework is a real contribution for categorical quantum mechanics and quantum foundations, but the main quantitative result is not yet supported as written. I'd send it to peer review with a request to fix Lemma 74, and I'd want to re-check the theorem after the fix. For my own work, I wouldn't cite Theorem 77 in its current form. But it deserves a serious referee.","headline":"A substantial double-categorical framework with a real hole: Lemma 74's undefined Ψ_{i,r} relation is load-bearing for Theorem 77.","tokens_in":30717,"tokens_out":3166,"would_cite":false,"duration_ms":31825,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper establishes a single double-categorical framework for all leading adaptive quantum computational models and proves that the average success probability of computing any Boolean function is bounded by the non-contextual fraction of","keywords":["double categories","adaptive instruments","measurement-based quantum computation","magic states","contextuality","simplicial distributions","Boolean functions","quantum channels"],"falsifier":"Compute the non-contextual fraction NCF(p_ρ(Φ)) for a family of m-Bell instruments with non-trivial adaptive wiring (e.g., m=2) via linear programming, evaluate their actual success probability of computing a non-affine Boolean function f, and check whether p_succ exceeds 1 − NCF(p_ρ(Φ))·ν(f); any violation would refute Theorem 77. Alternatively, exhibit an m-Bell instrument that violates the face-map identity in Lemma 74 yet still yields a valid simplicial distribution, which would expose the hidden assumption on which the theorem rests.","tokens_in":29853,"feed_emoji":"⚛️","tokens_out":6979,"duration_ms":59854,"temperature":0.7,"pith_summary":"The paper is trying to establish that adaptive quantum computational models—circuit, measurement-based, magic-state, and measurement-based Pauli computation—are manifestations of a single double categorical structure in which quantum information flows horizontally and classical control flows vertically. It constructs a one-object double category of adaptive instruments whose horizontal and vertical restrictions recover quantum channels and stochastic maps, and shows that model conversions like the gadget translations are double functors. Its central quantitative result, Theorem 77, says that if such an instrument computes a Boolean function f with an affine post-processing, the average success probability is at most 1 − NCF(p_ρ(Φ))·ν(f), where NCF is the non-contextual fraction of the associated simplicial distribution and ν(f) measures how far f is from affine. A direct corollary is that deterministic computation of any non-affine Boolean function forces strong contextuality. Sympathetically read, this gives a unified, model-independent account of why contextuality underpins adaptive quantum computational power.","feed_headline":"Contextuality budget caps adaptive quantum computation","feed_subtitle":"All adaptive quantum models share one double category; non-contextual resources compute only affine functions.","key_machinery":"The central object is the one-object double category Inst of adaptive instruments: a square is a finitely supported map Φ: X×Y → CP(V,W) such that for each input a, the sum over outcomes b of Φ^b_a is a quantum channel. Its horizontal monoidal category is the category of quantum channels; its vertical monoidal category is the Kleisli category of the distribution monad, i.e., stochastic maps. The framework then upgrades to simplicial instruments sInst, where input and output sets become simplicial sets, enabling the definition of simplicial distributions and the contextual fraction NCF. The load-bearing construction is the assignment of an m-Bell instrument to a simplicial map from the m-sphe","core_discovery":"The paper's central claim is that the language of double categories is the right organizing principle for adaptive quantum computation. The authors define double port graphs—wired diagrams with solid horizontal wires carrying qubits and dashed vertical wires carrying classical bits—and assemble them into double categories parameterized by label sets. On the semantics side, they define adaptive instruments as square maps from an input set to an output set of completely positive maps, satisfying a channel condition, and show these form a one-object double category Inst. Restricting Inst horizontally reproduces the category of quantum channels; restricting vertically reproduces the Kleisli cate","pith_inferences":["If the framework is accepted, one could systematically compare the computational power of different adaptive models by computing the non-contextual fractions of their canonical resources; the paper constructs the bounds but leaves such a resource comparison implicit.","The double-categorical presentation should make it possible to import tools from double category theory—lax functors, transformations, and pasting schemes—to study finer properties of measurement-based computations, such as depth or width, which the paper does not address.","A testable extension would be to compute NCF explicitly for the OR-gadget's simplicial distribution and check whether Theorem 77's bound is tight, or to design new gadgets that minimize contextual fraction for a target non-affine function; the paper does not optimize this quantity.","The simplicial Bell scenario construction suggests a transfer principle: any Bell inequality bounding the non-contextual fraction automatically translates into an upper bound on the success probability of computing non-affine functions, a consequence the paper formulates but does not fully exploit."],"forward_implications":["All major adaptive quantum computational models—circuit, MBQC, QCM, MBPC—share a single double-categorical semantics, so any theorem proved about the double category of instruments applies uniformly to all four models.","Gadget-based conversions between models are double functors, so a computation and its translated version produce the same adaptive instrument, making model equivalence a formal categorical statement.","The non-contextual fraction NCF(p_ρ(Φ)) is a quantitative resource directly tied to classical computational power: the closer a target Boolean function is to affine, the more contextuality is required to achieve a given success probability.","Deterministic computation of any non-affine Boolean function, such as OR, implies strong contextuality of the underlying state-instrument pair, giving a resource-theoretic explanation of why non-affine classical control cannot be simulated classically.","The framework provides a concrete method to certify classical simulability: if the associated simplicial distribution has NCF = 1, then the adaptive computation cannot beat the affine barrier."],"fun_headline_variants":["Double categories unify adaptive quantum models","Non-contextual resources compute only affine functions","Double port graphs: a unified language for quantum control","One double category for all adaptive quantum models"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The bound in Theorem 77 only applies if every m-Bell instrument satisfies the face-map consistency condition of Lemma 74—that the assignment σ_{i_1...i_m} ↦ Φ_{i_1...i_m} is a well-defined simplicial map; the proof invokes an unstated identity about the final instrument's input-output relation and relies on acyclicity to choose a last instrument whose outcome is unused in control. If that face-map consistency fails, p_ρ(Φ) is not a well-defined simplicial distribution, so the","fun_headline_variants_meta":{"raw":{"variants":["Double categories unify adaptive quantum models","Non-contextual resources compute only affine functions","Double port graphs: a unified language for quantum control","One double category for all adaptive quantum models"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000335,"raw_usage":{"total_tokens":1676,"prompt_tokens":709,"completion_tokens":967,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":453,"completion_tokens_details":{"reasoning_tokens":910}},"tokens_in":453,"tokens_out":967,"duration_ms":8564,"temperature":1.0,"reasoning_tokens":910,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-04T07:22:04.050592+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the non-contextual fraction NCF(p_ρ(Φ)) for a family of m-Bell instruments with non-trivial adaptive wiring (e.g., m=2) via linear programming, evaluate their actual success probability of computing a non-affine Boolean function f, and check whether p_succ exceeds 1 − NCF(p_ρ(Φ))·ν(f); any violation would refute Theorem 77. Alternatively, exhibit an m-Bell instrument that violates the face-map identity in Lemma 74 yet still yields a valid simplicial distribution, which would expose the hidden assumption on which the theorem rests.","supporting_citations":[],"review_version":1}