{"id":"030aaa0f-82bf-499e-bd9b-bbb2f73e3641","arxiv_id":"2610.01932","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"One interaction Hamiltonian combined with reusable one-qubit environment preparation and trace-out achieves universal state preparation and channel universality on n qubits.","lead":"Quantum state preparation normally requires exponentially many control parameters. This paper shows that repeatedly preparing and discarding a single environment qubit lets one fixed interaction Hamiltonian prepare any quantum state on n qubits, and even approximate every quantum channel.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek/deepseek-v4-flash","headline":"The single hinge is Theorem 3.2, the amplitude-damping transitivity criterion quoted from the authors' unpublished [CGJ25]: if it fails, Theorems 5.5 and 7.4 reduce to a handful of reachable channels. The in-paper machinery I spot-checked (Lemma 2.8, Fact 3.6, Prop 9.1) is sound.","rationale":"The reader's weakest-assumption identification is exactly right, and my independent pass confirms it: Theorem 3.2 is the unique external hinge. I verified the in-paper argument chain that sits between the resources and the headline claims. Lemma 2.8 is valid: the proof does not require Phi_t to be a semigroup, only that each Phi_{s/n} lies in C_V(G), so Phi_{s/n}^n lies in C by composition closure, and the telescoping bound drives it to exp(sL). Fact 3.6/Eq. (3.1) I re-derived by hand from the block structure H = [[alpha, gamma*],[gamma,beta]]: expanding e^{itH}(|0><0| rho)e^{-itH} through second order and tracing out E reproduces Ad_{e^{it alpha}} + (t^2/2)L_gamma + O(t^3) exactly (the t^2 alpha rho alpha cross-term is what makes the identity work). Corollary 2.9's zigzagging argument is standard BCH, and the plus/minus signs are available because the one-parameter group {e^{itH}} contains both signs of t. Prop. 9.1's claim that {Z1, X1 + H_XYZ} generates su(2^n) is local controllability of the Heisenberg chain, [BBBG09]. Example 5.4's lie(ip,iq) = su(2^n) is the standard universal-generation fact for a diagonal matrix with distinct spectrum plus the complete-graph adjacency. Theorem 5.5 then genuinely reduces the whole construction to: (i) g({alpha,beta}) = su(A), (ii) gamma non-normal, (iii) the first-order extraction of alpha,beta and second-order extraction of L_gamma, all of which hold, conditional on Theorem 3.2's transitivity assertion. The lower-bound section is sound: Proposition 6.3's covering argument is a textbook net-counting bound and the exponents (4^n - 1)/2 and 2^n - 2 are consistent with dim D(A) and dim CP^{N-1}; the stated constants c(epsilon) absorb the log factors. Because the concern is genuine, already flagged, externally corroborated but provable only in the unpublished [CGJ25], CONDITIONAL remains the correct verdict. The proposed numerical test, if run at n=2,3 on the cooling and mixed-state-generation directions, plus a check of whether published [MvEDSH25] implies Theorem 3.2, would settle the matter.","tokens_in":25186,"tokens_out":30543,"duration_ms":181591,"concrete_test":"Numerically settle whether the transitivity criterion of Theorem 3.2 actually holds. For n = 2 and n = 3 qubits, implement the protocol described in [CGJ25, Example 5.2]: the channel class generated by {Ad_U : U in SU(2^n)} and {e^{t L_a} : t >= 0} with a = |0><1| tensor I, closed under composition. (1) Cooling direction: verify that rho = (|0..0><0..0| + |1..1><1..1|)/2 maps to within epsilon of |0..0><0..0|; (2) mixed-state generation: verify that |0..0><0..0| maps to a target sigma with distinct eigenvalues, e.g. diag(0.5, 0.3, 0.15, 0.05) on n=2, by the diagonal-evolution + unitary-conjugation algorithm; (3) if any (rho, sigma) pair in a random battery is unreachable to diamond distance epsilon=1e-6, the criterion fails and Theorems 5.5 and 7.4 collapse.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Every headline result funnels through one external premise: Theorem 3.2, quoted as [CGJ25, Thm 2.8, Ex 5.2], asserting that SU(2^n) coherent control plus a single non-normal Lindblad generator L_a makes the channel class C_V(G) state-transitive. This is the engine that converts 'a small set of accessible channels' into 'universal density preparation'; it is cited, not proved here, from the authors' own unpublished preprint. It feeds Theorem 3.3 (extension to non-normal jumps on any qubit), Theorem 3.11 (γ-magic), Theorem 5.1 (αβγ-magic), and hence Theorem 5.5 ('one Hamiltonian suffices') and Theorem 7.4 (channel universality). If the criterion were false or carried hidden hypotheses (e.g., a subtle fixed-point or majorization condition on the reachable diagonal set), the one-parameter group G_H of Theorem 5.5 would generate only a few channels, and the paper's central claims would collapse. The external support is real but indirect: [BSH12] predicts the result (unpublished preprint), and [MvEDSH25] (published in SIAM J. Control Optim.) studies fast-unitary-control reachability but is not cited as proving Theorem 3.2 in this exact form. I independently spot-checked the in-paper machinery and found it correct: I re-derived Fact 3.6/Eq. (3.1) directly (the t^2 L_gamma expansion is exact to O(t^3)); Lemma 2.8's completion argument works because each Phi_{s/n} in C_V(G) gives Phi_{s/n}^n in C by composition closure, and the telescoping bound converges to exp(sL); Prop. 9.1's bracket-generation is standard local controllability ([BBBG09]); the su(N)-generation by {p,q} in Examples 5.4/7.6 is the standard distinct-eigenvalue-plus-connected-graph fact; and the Section 6 covering-number lower bounds are robust (the 2^{2n} arises from dim D(A) = 4^n - 1 with the paper's 'n' meaning Hilbert-space dimension). The single unresolved, load-bearing hinge remains Theorem 3.2.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek/deepseek-v4-flash","summary":"The paper proposes open-system state and channel preparation models in which a small unitary group on the joint system-environment Hilbert space, combined with repeated environment state preparation and partial trace, generates classes of channels that are transitive on all n-qubit density matrices and, in a larger Stinespring setting, approximate every channel. The two main constructions are a polynomial-dimensional subgroup built from local Pauli strings (Section 4) and a single interaction Hamiltonian whose one-parameter group is already state-magic when the environment can be prepared in |0> or |1> (Theorem 5.5), together with an analogous channel-magic statement (Theorem 7.4). Section 6 gives exponential lower bounds on the number of rounds required for worst-case pure-state and density preparation. The central technical engine is the amplitude-damping transitivity criterion quoted in Theorem 3.2 from the authors' companion paper [CGJ25], extended in Theorem 3.3 to arbitrary non-normal jump operators and used to derive the gamma-magic and alpha-beta-gamma-magic criteria.","tokens_in":25889,"tokens_out":20836,"duration_ms":223355,"significance":"If the quoted transitivity criterion is sound, the paper's conceptual message is significant: it shows that open-system operations can convert an exponentially small coherent-control resource, even a single one-parameter group, into universal state and channel synthesis, while the lower bounds in Section 6 delimit the cost of doing so. The in-paper machinery that I checked is mostly solid: Lemma 2.8's completion argument is correct, Corollary 2.9 follows from the zigzag formula, Fact 3.6's t^2 L_gamma expansion is right, and Proposition 9.1 gives a genuine bracket-generating proof for the XY-type Hamiltonian. The main unresolved risk is that every headline transitivity and universality result funnels through Theorem 3.2, which is quoted from an unpublished companion preprint rather than proved here. There are also several inconsistencies in the lower-bound statements that need correction before the quantitative claims can be trusted. I therefore view the central framework as defensible but requiring revision.","major_comments":[{"comment":"The paper's main results all pass through the state-transitivity criterion quoted from [CGJ25, Thm 2.8, Ex 5.2], which asserts that SU(2^n) coherent control together with a single non-normal Lindblad generator makes the channel class state-transitive. The authors acknowledge that this is 'taken from [CGJ25]', but [CGJ25] is an unpublished preprint and this theorem is the single step that converts a small channel class into universal state preparation. Because Theorems 3.11, 5.1, 5.5, and 7.4 depend on it, the manuscript should either include a self-contained proof of the criterion, state precisely all of its hypotheses, or cite a published version. The related published work [MvEDSH25] and preprint [BSH12] provide context but do not, as cited here, replace the missing proof.","section":"§3.2, Theorem 3.2; §5, Theorems 5.1, 5.5; §7, Theorem 7.4","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The dimension count in Lemma 6.4 is not correct as printed. The diagonal algebra of EA, where EA has n+1 qubits, has complex dimension 2^{n+1}, not 2n+1; hence a bound by the full diagonal torus should have an exponent exponential in n (real dimension 2^{n+2}, up to constants), not the displayed 2(2n+1). With the printed polynomial exponent, Proposition 6.3 gives a density lower bound of order c(epsilon) 2^{2n}/n^2 for the single Hamiltonian, not the c(epsilon) 2^n/n claimed in Corollary 6.6. This is load-bearing for the single-Hamiltonian lower-bound statement in Theorem 1.1, so the dimension and the resulting exponents need to be corrected.","section":"§6, Lemma 6.4 and Corollary 6.6","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The quantitative lower bounds stated in Theorem 1.1 do not match the bounds proved in Section 6. For model (2), Theorem 1.1 states l(epsilon,G,V) >= c(epsilon) 2^n/n for pure-state preparation, while Theorem 6.7 and Proposition 6.3 yield c(epsilon) 2^n/(n^3 ln(1+n)) when d = O(n^2) for the Spin groups. Similarly, for the single magic Hamiltonian, Theorem 1.1 states c(epsilon) 2^n/(n^3(1+ln n)) for density preparation, whereas Corollary 6.6 states c(epsilon) 2^n/n. The displayed exponents should be reconciled and each should be traceable to Proposition 6.3.","section":"§1, Theorem 1.1 versus §6, Theorem 6.7","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The concrete single-Hamiltonian examples rely on the assertion that lie(ip, iq) = su(2^n) for p = sum_k k|k><k| - (2^n+1)/2 I and q = sum_{j != k} |j><k|, but no proof or reference is given. This is stated as 'Note that p and q are traceless and lie(ip, iq) = su(2^n)' in Example 5.4 and used again in Example 7.6. Since these examples are meant to exhibit explicit open-system magic Hamiltonians, please supply a short proof (for instance, using the distinct eigenvalues of p and the off-diagonal structure of q) or a precise citation.","section":"Examples 5.4 and 7.6","authors_acknowledge":null,"authors_acknowledge_p":null}],"minor_comments":[{"comment":"The proof says the off-diagonal part gamma of h is 'exactly the jump operator for the dephasing channel'; gamma = (X1 + iY1)/2 is the amplitude-damping jump operator |0><1|, not a dephasing jump operator. Please correct the terminology.","section":"§5, Theorem 5.5 proof","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"In the display after the covering-number inequalities, the notation '22n' and '2n' should be written as 2^{2n} and 2^n; as rendered, the expressions are ambiguous and make the derivation hard to follow.","section":"§6, Proposition 6.3 proof","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"Proposition 2.11 refers to 'Theorem 2.8' and Definition 2.7 refers to the 'Lindbladian set of C_V(G)', but the cited object is the lemma labelled Lemma 2.8 and the notation is occasionally inconsistent; please align the cross-references.","section":"§2, Lemma 2.8 and Proposition 2.11","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"Remark 4.3 states that adding Y2Y3Y4Y5 to T2 gives 'a control group of dimension roughly sqrt(4n)', which is not obviously consistent with the stated Spin-group containment; please clarify what is being estimated.","section":"§4, Remark 4.3","authors_acknowledge":null,"authors_acknowledge_p":null}],"recommendation":"major_revision"},"author_rebuttal":null,"desk_editor":{"model":"deepseek/deepseek-v4-flash","letter":"What is actually new here is the resource swap. Instead of asking for the full unitary group, the authors show that a Lie algebra of dimension poly(n), or even a single one-parameter group generated by one fixed Hamiltonian, becomes state-transitive and channel-universal once you allow repeated preparation and trace-out of a one-qubit environment. That alone would be a curiosity; the reason the paper matters is that they then prove honest exponential lower bounds on the number of rounds. Small group, still universal, still expensive in rounds: that combination is the contribution, and it is not in the cited literature.\n\nThe in-paper machinery I checked holds up. Lemma 2.8's completion argument is correct — the telescoping bound converges because each Phi_{s/n} is in the composition-closed class. Fact 3.6's t^2/2 L_gamma expansion is exact to O(t^3), and it is the workhorse behind the gamma-magic theorem, which is clean. Proposition 9.1's bracket generation is standard local controllability, and the Section 6 covering-number lower bounds are robust. The authors are also fair about costs: they state plainly that universality does not make synthesis easy and that their constructions are not optimal.\n\nThe soft spot is exactly where the reader and stress-test put it, and I agree with them. Theorem 3.2, the amplitude-damping transitivity criterion, is quoted from the authors' own unpublished preprint [CGJ25], and every headline result — one-Hamiltonian density magic, channel universality — funnels through it. If it fails, Theorems 5.5 and 7.4 give you a handful of reachable channels. The external corroboration is real but indirect: [BSH12] is a preprint that predicts the result, and [MvEDSH25] is published in SIAM JCO but studies fast-unitary-control reachability, not this exact theorem. This is the load-bearing premise, and it is not resolved in the public literature yet.\n\nSmaller issues: some generation facts are asserted rather than proved — lie(p,q) = su(2^n) in Example 5.4, the su(FA) claim feeding Theorem 7.4, and Lemma 4.1's group containment. They look standard and checkable, but they are asserted. The text is also rough: garbled Figure 1 caption and numerous typos. Cosmetic, but it will cost them referees.\n\nVerdict: this deserves a serious referee, not a desk reject. It is a significant idea with careful in-paper proofs and a single identifiable external hinge. The referee's job is to insist on the proof of Theorem 3.2, or at minimum confirmation that [CGJ25] is posted and independently checked, plus fleshing out those generation facts. If the theorem holds, this is an important resource-reduction result. Conditional accept is the right frame.","headline":"The real contribution is the resource swap — a poly(n)-dimensional or even one-parameter coherent group stays universal for states and channels once you add repeated environment prep and trace-out — and the honest exponential lower bounds; the single thing to check before believing it is their own unpublished transitivity criterion, Theorem 3.2.","tokens_in":26351,"tokens_out":2441,"duration_ms":18430},"pith_extraction":{"msc":["81P45","81P68"],"pacs":["03.67.-a","03.65.Yz"],"model":"deepseek/deepseek-v4-flash","headline":"A single fixed Hamiltonian, plus a repeatedly reset one-qubit environment, suffices to move any n-qubit state to any other — and with a larger ancilla, any quantum channel.","keywords":["open quantum systems","state transitivity","density magic","magic Hamiltonian","channel universality","state preparation","Pauli strings","approximation length"],"falsifier":"For $n=2$ qubits, write the single Hamiltonian $h$ of Theorem 5.5 and compute the two effective data sets the protocol actually uses: the diagonal blocks $\\alpha = \\langle 0|h|0\\rangle$ and $\\beta = \\langle 1|h|1\\rangle$ and the off-diagonal block $\\gamma = \\langle 0|h|1\\rangle$. The claim requires $[\\gamma,\\gamma^*] \\neq 0$ and that $\\{\\alpha,\\beta\\}$ bracket-generate $\\mathfrak{su}(4)$, both directly checkable matrix calculations. The deeper check is numerical: simulate the channel class generated by $\\{e^{ith} : t \\in \\mathbb{R}\\}$ with environment preparations $|0\\rangle, |1\\rangle$ and partial trace, and test whether its reachable set from $|00\\rangle\\langle 00|$ fills the full 15-dimensional density polytope in the closure. A reachable set that provably stays in a lower-dimensional submanifold — for example, one that cannot move the maximally mixed state in some tangent direction — would refute state transitivity, and the same test applies to the amplitude-damping criterion that the construction inherits from [CGJ25].","tokens_in":26790,"feed_emoji":"⚛️","tokens_out":22011,"duration_ms":245184,"temperature":0.7,"pith_summary":"Closed-system quantum control normally demands access to the full unitary group on $n$ qubits, an object whose Lie algebra has dimension $4^n - 1$. This paper claims that universal state preparation survives without that group once open-system operations are allowed: prepare a small environment (one or three qubits) in a fixed state, evolve under a tiny unitary group — polynomial-dimensional, or even the one-parameter group of a single Hamiltonian — and trace the environment out. Repeated, these channel-building blocks move any $n$-qubit state to any other, and with a larger ancilla they approximate every quantum channel. The result replaces the exponentially large coherent control group with a fixed interaction Hamiltonian and a recyclable environment qubit, at the price of exponentially many rounds in the worst case, which the paper proves is unavoidable in these models.","feed_headline":"One Hamiltonian reaches every quantum state","feed_subtitle":"Universal state and channel preparation from tiny unitary groups — worst-case rounds stay exponential.","key_machinery":"The engine is the slicing map $\\omega_v(H) = (\\langle v| \\otimes \\mathrm{id})(H)$: prepare the environment in $|v\\rangle$, evolve under $e^{itH}$ with $H$ in the small available Lie algebra, and trace the environment out. To first order in $t$ this yields the effective system Hamiltonian $\\langle v|H|v\\rangle$; to second order it yields the Lindbladian $L_\\gamma$ whose jump operator is the off-diagonal block $\\gamma = \\langle v|H|v^\\perp\\rangle$. Because slicing is linear but not a Lie algebra homomorphism, one global Hamiltonian can produce many noncommuting system directions, so a one-dimensional group on the combined space can generate full $\\mathfrak{su}(2^n)$ on the system. When $\\gamma$ is non-normal ($[\\gamma,\\gamma^*] \\neq 0$), the second-order term is an amplitude-damping generator, and the transitivity criterion of [CGJ25] — full coherent control plus one non-normal Lindblad generator suffices for state transitivity — makes the channel class transitive. For Theorem 5.5 the single Hamiltonian is the block matrix $h = \\begin{pmatrix} Z_1 & (X_1+iY_1)/2 \\\\ (X_1-iY_1)/2 & X_1 + \\sum_j (X_jX_{j+1}+Y_jY_{j+1}+Z_jZ_{j+1}) \\end{pmatrix}$, whose diagonal blocks $\\{Z_1, X_1 + H\\}$ bracket-generate $\\mathfrak{su}(2^n)$ and whose off-diagonal block equals $|0\\rangle\\langle 1|$ on qubit 1, a non-normal jump operator.","core_discovery":"On its own terms, the paper establishes that 'density magic' — the ability of a channel class to move any density matrix to any other — can be purchased with open-system operations instead of a large unitary group. A first construction uses local Pauli-string generators whose Lie algebra has dimension $O(n^2)$, giving $G \\subset T \\times \\mathrm{Spin}(n+3) \\times \\mathrm{Spin}(n+3)$, and two environment states; slicing these generators against the environment yields full unitary control plus a non-normal dissipative direction, hence transitivity on all densities (Lemma 4.2). A second, more economical construction removes the resource set entirely: a single open-system magic Hamiltonian $h$, with $G = \\{e^{ith} : t \\in \\mathbb{R}\\}$ and the environment prepared in $|0\\rangle$ or $|1\\rangle$, is already state-transitive on all densities of $n$ qubits (Theorem 5.5). The same one-parameter group, with a Stinespring ancilla of dimension $2^{2n}$, approximates every quantum channel on $n$ qubits (Theorem 7.4). Finally the paper proves the universality has a cost: worst-case approximation length is exponential, at least $c(\\varepsilon)\\,2^n/n$ rounds for pure states and $c(\\varepsilon)\\,2^{2n}/n^3$ rounds for densities in the Spin model, and $c(\\varepsilon)\\,2^n/n^3$ rounds for densities with the single Hamiltonian (Theorem 1.1).","pith_inferences":["I read the two constructions as endpoints of a trade-off the paper leaves implicit: coherent control complexity (Lie algebra dimension) can be exchanged for more environment states and more rounds of open-system operations. A natural conjecture going beyond the paper's two examples is that any open-system model whose coherent group has polynomial dimension still needs exponentially many rounds for","A practical reading the authors only sketch: on hardware where one fixed interaction Hamiltonian is always available but arbitrary gates are expensive, the single-Hamiltonian protocol is a candidate universal primitive whose only overhead is re-preparing and discarding one ancilla qubit. Whether finite pulse errors or imperfect reprepation break transitivity is not analysed in the paper and would ","The covering-number argument is metric rather than algebraic — it counts balls in the density space against balls in the coherent group — so it should transfer to platforms without Pauli-string structure, such as bosonic or continuous-variable systems, where the same technique could certify exponential worst-case lengths for any small coherent control group.","The authors' closing suggestion that the $O(n^2)$-dimensional Lie algebra might avoid barren-plateau regimes while retaining expressivity implies a possible separation between synthesis cost and variational trainability in open-system architectures; verifying that separation would require the variance analysis they cite, and is my inference rather than a claim the paper proves."],"forward_implications":["Universal state preparation is reachable without ever implementing the full unitary group: an $O(n^2)$-dimensional Spin group with three environment qubits, or a single one-parameter group with one environment qubit prepared in $|0\\rangle$ or $|1\\rangle$, each acts transitively on all densities of $n$ qubits (Lemma 4.2, Theorem 5.5).","Channel universality follows from the same primitive: with a Stinespring ancilla of $2^{2n}$ dimensions, one fixed Hamiltonian and two environment preparations approximate every quantum channel on $n$ qubits in diamond norm (Theorem 7.4).","Universality does not trivialize synthesis: worst-case approximation length remains exponential, at least $c(\\varepsilon)\\,2^n/n$ rounds for pure states with the Spin model and $c(\\varepsilon)\\,2^{2n}/n^3$ or $c(\\varepsilon)\\,2^n/n^3$ rounds for densities in the Spin and single-Hamiltonian models respectively (Theorem 1.1).","The models define a concrete complexity landscape for open-system synthesis: states, densities, and channels can be cheap or expensive depending on the chosen Hamiltonian, group $G$, and environment set $V$, and the covering-number method supplies a quantitative measure of that cost.","Any platform that can realize the one fixed interaction Hamiltonian $h$ and repeatedly re-prepare an ancilla qubit inherits a universal state-preparation and channel-approximation primitive, because the coherent control group has only one parameter in the most economical model."],"supporting_citations":[{"why":"Supplies the transitivity criterion (Theorem 3.2 here): full coherent control plus one non-normal Lindblad generator yields state transitivity; both main constructions reduce to it.","marker":"[CGJ25]"},{"why":"Predicted arbitrary n-qubit state transfer by coherent control with switchable single-qubit noise; cited as the early evidence behind the transitivity criterion.","marker":"[BSH12]"},{"why":"Studies reachability of open Markovian systems under fast unitary control; cited as a more general recent treatment of the same transitivity phenomenon.","marker":"[MvEDSH25]"},{"why":"Provides the magic-Hamiltonian framework, the Pauli-string Spin-group constructions, the Lie-algebra facts used in Section 4, and the covering-number lemma behind the lower bounds.","marker":"[JPV26]"},{"why":"Local controllability of Heisenberg-type chains; the appendix uses it to prove that {Z_1, X_1+H} bracket-generate su(2^n), fixing the single magic Hamiltonian's diagonal block.","marker":"[BBBG09]"},{"why":"Stinespring dilation converts control of su(FA) into universality over all channels, the mechanism behind Theorem 7.4.","marker":"[Sti55]"},{"why":"Banach-space covering estimates for unit balls, the tool behind the exponential approximation-length lower bounds for states, densities, and channels.","marker":"[Pis89]"}],"fun_headline_variants":["Single Hamiltonian reaches every state, but slowly","Open-system trick shrinks unitary group to poly size","One Hamiltonian spans all densities, rounds stay exponential","Tiny Lie group, universal state prep, worst-case slow","Density magic from one interaction, at exponential cost"],"cache_read_input_tokens":0,"weakest_assumption_plain":"The load-bearing premise is the transitivity criterion that both constructions reduce to: full coherent control of $n$ qubits together with a single non-normal Lindblad generator, such as amplitude damping $L_{|0\\rangle\\langle 1|}$, makes the accessible channel class state-transitive on all density matrices. The paper takes this criterion from its companion work [CGJ25]; if the criterion failed, the small Spin groups and the single Hamiltonian $h$ would reach only a narrow set of states rather than all densities.","fun_headline_variants_meta":{"raw":{"variants":["Single Hamiltonian reaches every state, but slowly","Open-system trick shrinks unitary group to poly size","One Hamiltonian spans all densities, rounds stay exponential","Tiny Lie group, universal state prep, worst-case slow","Density magic from one interaction, at exponential cost"]},"model":"deepseek/deepseek-v4-flash","effort":"low","cost_usd":0.000152,"raw_usage":{"cost":0.000151648,"is_byok":false,"cost_details":{"upstream_inference_cost":0.000151648,"upstream_inference_prompt_cost":0.000113568,"upstream_inference_completions_cost":3.808e-05},"total_tokens":1152,"prompt_tokens":1016,"completion_tokens":136,"prompt_tokens_details":{"audio_tokens":0,"video_tokens":0,"cached_tokens":256,"cache_write_tokens":0},"completion_tokens_details":{"audio_tokens":0,"image_tokens":0,"reasoning_tokens":73}},"tokens_in":1016,"tokens_out":136,"cost_source":"openrouter_usage","duration_ms":2554,"image_pages":[],"temperature":1.0,"billed_attempts":1,"reasoning_tokens":73,"transport_provider":"openrouter","cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-10-02T07:47:58.539362+00:00","model_set":{"reader":"deepseek/deepseek-v4-flash"},"pipeline_version":"pith-pipeline@v1.4.1-daily-deepseek-or-medium","input_kind":null,"input_chars":null,"input_total_chars":null,"passes_missing":null,"published_standing":null,"published_confidence":null,"objection_audit":null,"run_record":null,"basis":{"kind":"not_recorded","source":null,"chars_given":null,"chars_total":null},"receipt":null,"falsifier":"For $n=2$ qubits, write the single Hamiltonian $h$ of Theorem 5.5 and compute the two effective data sets the protocol actually uses: the diagonal blocks $\\alpha = \\langle 0|h|0\\rangle$ and $\\beta = \\langle 1|h|1\\rangle$ and the off-diagonal block $\\gamma = \\langle 0|h|1\\rangle$. The claim requires $[\\gamma,\\gamma^*] \\neq 0$ and that $\\{\\alpha,\\beta\\}$ bracket-generate $\\mathfrak{su}(4)$, both directly checkable matrix calculations. The deeper check is numerical: simulate the channel class generated by $\\{e^{ith} : t \\in \\mathbb{R}\\}$ with environment preparations $|0\\rangle, |1\\rangle$ and partial trace, and test whether its reachable set from $|00\\rangle\\langle 00|$ fills the full 15-dimensional density polytope in the closure. A reachable set that provably stays in a lower-dimensional submanifold — for example, one that cannot move the maximally mixed state in some tangent direction — would refute state transitivity, and the same test applies to the amplitude-damping criterion that the construction inherits from [CGJ25].","supporting_citations":[],"lane_accuracy":{"status":"not yet measured","lane":{"model":"deepseek/deepseek-v4-flash","input_kind":null},"url":"https://pith.science/accuracy"},"review_version":1}