{"id":"546c1d96-9cbf-4c45-bcd5-023c74a6fa4e","arxiv_id":"2608.07207","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"An iterative algorithm builds Kraus operators for completely positive maps on separable Hilbert spaces, with strong-operator convergence of the sum.","lead":"This paper gives an explicit, step-by-step algorithm that constructs a Kraus decomposition of any completely positive quantum map on separable infinite-dimensional Hilbert spaces, and proves that the resulting infinite sum converges. It turns a standard nonconstructive existence theorem into a construction that can be connected to practical quantum process tomography.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Eq. (7c) is false; reduction can force extra zeros beyond the S-closure, so the stated kernel-relation identity cannot support the proof, though a containment version suffices.","rationale":"The reader's weakest assumption correctly flagged the false implication in the proof of Lemma 1, but the more load-bearing defect is that even a corrected Lemma 1 does not imply Eq. (7c): the stated identity is false. The counterexample is finite-dimensional and explicit, so it does not depend on infinite-dimensional subtleties. However, the overall algorithm appears salvageable: Lemma 3 only needs each processed pair to stay zero, i.e., the containment K_{Λ'}⊇KΛ∨S(k,h), which follows from the true kernel statement of Lemma 1 together with complete positivity. Extra zeros created by a reduction step are harmless for convergence and for the restriction formula (23). Thus the central claim is not disproven, but the written proof needs a corrected Proposition 1 and a weakened kernel-relation statement. This leaves the reader's CONDITIONAL verdict unchanged.","tokens_in":7601,"tokens_out":38384,"duration_ms":336323,"concrete_test":"Run the finite-dimensional check above: with H=K=C^2, A1=(|e1><e1|−|e2><e2|)/√2, A2=|e1><e2|, A3=|e2><e1|, Λ=Θ(A1)+Θ(A2)+Θ(A3), reduce at (e1,e1) using formula (6). Verify that (e2,e2) belongs to K_{Λ'} while (e2,e2) is not in the minimal S-relation generated by KΛ∪{(e1,e1)}. If both hold, Eq. (7c) is refuted and the manuscript must replace the equality by the containment K_{Λ'}⊇KΛ∨S(k,h).","verdict_should_be":"UNCHANGED","load_bearing_attack":"Proposition 1's Eq. (7c) is false as stated, already in finite dimension, and this identity underpins the iteration and the §3.4 convergence argument. Counterexample: take H=K=C^2 with ONB {e1,e2} and Λ=Θ(A1)+Θ(A2)+Θ(A3), where A1=(|e1><e1|-|e2><e2|)/√2, A2=|e1><e2|, A3=|e2><e1|. JΛ is positive with kernel spanned by |e1><e1|+|e2><e2|, so KΛ contains no nonzero pair. Reducing at (e1,e1) gives A=A1 (up to phase), Λ'=Λ−Θ(A)=Θ(A2)+Θ(A3), and (e2,e2)∈KΛ' because both Kraus operators have zero matrix element there. But the smallest S-relation containing KΛ and (e1,e1) is, up to zero pairs, {(αe1,βe1)}, which does not contain (e2,e2). Hence KΛ'≠KΛ∨S(k,h). The convergence proof only needs the containment KΛ'⊇KΛ∨S(k,h), which follows from the true kernel statement in Lemma 1 and complete positivity, so the theorem is repairable; but Eq. (7c) and the §2.4/§3.4 reasoning that relies on it must be corrected.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper proposes a constructive algorithm for Kraus decompositions of completely positive maps Λ: B_1(H) → B_1(K) on separable Hilbert spaces. Starting from ground-matrix elements of Λ, the algorithm repeatedly extracts one Kraus operator A_m via Eq. (6), zeroing one ground-matrix element of the remainder at each step. The paper claims that the partial sums converge strongly (in trace norm on every input state) to Λ, and that finite-dimensional projections of Λ are exactly represented by finite initial segments of the generated operators, Eq. (23). The proofs are organized around a J-transform reduction to Lemma 1, a statement about positive operators, from which Proposition 1 derives kernel-relation identities.","tokens_in":7827,"tokens_out":26583,"duration_ms":233138,"significance":"An elementary, algorithmic proof of the infinite-dimensional Kraus decomposition theorem would be a genuinely useful contribution, both as a foundationally transparent alternative to the standard C*-algebraic existence proof and as a practical process-tomography scheme. The paper is commendably free of fitted parameters, does not assume the target decomposition, and the finite-dimensional compatibility statement in Eq. (23) is valuable. However, the two technical issues detailed below concern exactly the mechanism that guarantees persistence of zeroed matrix elements and hence drives the convergence argument; until they are repaired, the central claim is not rigorously established as written. The errors appear repairable: the stated kernel-relation equality can be weakened to a containment that still suffices for the convergence proof.","major_comments":[{"comment":"The proof of the reverse inclusion in Eq. (18) uses the implication 'ψ⊥kerT+Cφ ⇒ <η|ψ>∝<φ|Tψ>=0', which is false. For T=diag(4,1,0), φ=(1,2,1)/√6 and ψ=(2,-1,0), one has ψ⊥φ and ψ⊥kerT, yet <φ|Tψ>=√6≠0. The lemma itself is nevertheless true: from T'ψ=0 one obtains Tψ=(<η|ψ>/<η|φ>)Tφ and hence T(ψ-cφ)=0 with c=<η|ψ>/<η|φ>, so ψ∈kerT+Cφ. The proof should be rewritten accordingly, since Eq. (18) is the basis for the kernel-relation translation in Proposition 1.","section":"Section 3.2, Lemma 1"},{"comment":"The identity K_{Λ'}=K_Λ∨_S(k,h) is false as stated, already in finite dimension. Let H=K=C^2 with ONB {e1,e2}, and take Λ=Θ(A1)+Θ(A2)+Θ(A3) with A1=(|e1><e1|-|e2><e2|)/√2, A2=|e1><e2|, A3=|e2><e1|. Here K_Λ contains no nonzero pair; reducing at (e1,e1) returns A=A1, so Λ'=Θ(A2)+Θ(A3) and (e2,e2)∈K_{Λ'}. However the smallest S-relation containing K_Λ and (e1,e1) is, up to zero pairs, {(αe1,βe1)}, which does not contain (e2,e2). Thus Eq. (7c) fails. The convergence argument in Section 3.4 needs only the containment K_{Λ'}⊇K_Λ∨_S(k,h), which follows from the corrected Lemma 1 and complete positivity; Proposition 1 and the zero-pattern statements in Sections 2.3–2.4 and 3.4 should be revised to use this weaker statement.","section":"Section 3.3.1, Eq. (7c)"}],"minor_comments":[{"comment":"The sentence 'The (k(m),h(m)) entries of A_n ... are guaranteed zero as soon as m≤n' is incorrect at m=n: A_n is chosen so that its matrix element at (k(n),h(n)) is nonzero unless that element was already zero in Λ_{n-1}. The statement should say m<n for A_n and m≤n for Λ_n.","section":"Section 2.4"},{"comment":"In the bound '∥A∥≤√(∥Λ_n∥_{1,1})', the index n is undefined at that point of the proof; it should refer to the input map of the reduction step, i.e., ∥Λ∥_{1,1} or ∥Λ_{m-1}∥_{1,1} in the iteration.","section":"Section 3.3.2"},{"comment":"The proof says 'dPa,sΛ=0 for large enough m'; this should read '\\widehat{P}_{a,s}Λ_m=0' (the remainder, not the original map), since the original map is never zero.","section":"Section 3.4, Lemma 3"},{"comment":"The phrase 'the generated sum convergences' should be 'the generated sum converges'.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":"The two errors identified above are in the central proof chain, so the revision must be substantive rather than cosmetic. I do not see grounds for rejection: the weaker containment version of Eq. (7c) appears sufficient for the convergence theorem, and the infinite-dimensional lifting strategy in Section 3.3.2 is otherwise sound. The author should be asked to state explicitly which claims in Section 2.4 depend on equality versus containment and to supply the corrected Lemma 1 proof."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe paper's core idea is genuine: an iterative algorithm that produces Kraus operators one at a time for a CP map on separable Hilbert spaces, with the remainder tending to zero in strong-operator topology. That is a real improvement over the nonconstructive Kraus existence proof, and it connects directly to practical process tomography. The exposition of the matrix picture and the uniform bounds is clear, and the infinite-dimensional lifting arguments look careful. No free parameters, no invented entities, no circularity; the one self-citation to earlier notes supplies standard finite-dimensional J-transform machinery.\n\nThe proof has a real gap. Proposition 1's identity (7c) is false as stated, even in finite dimension. The stress-test counterexample works: with H=K=C^2 and Λ=Θ(A1)+Θ(A2)+Θ(A3) for the three operators given, reduction at (e1,e1) yields Λ'=Θ(A2)+Θ(A3), which has (e2,e2) in its kernel relation, while the S-closure of the original kernel relation with (e1,e1) does not contain (e2,e2). The underlying kernel statement in Lemma 1 appears true, though its proof contains a false implication about ψ⊥kerT+Cϕ; but even with a corrected Lemma 1, translating kernel equality to equality of S-closed kernel relations is not valid. What the convergence proof actually requires is only the containment K_{Λ'} ⊇ K_Λ ∨_S (k,h), and that does follow from the true kernel statement plus complete positivity. So the theorem is very likely correct, but the written proof is not.\n\nThe rest of the infinite-dimensional argument—the quasi-Cauchy-Schwarz bound, the projection-lifting lemma, the SOT convergence proof—reads as sound. Once the authors replace (7c) with the containment version and fix the Lemma 1 proof, this is a solid contribution. As it stands, it deserves a serious referee but not acceptance without revision. I would send it out, and I would cite the algorithm once the proof is repaired; the gap is instructive enough that I would also bring it to a reading group. The intended reader is someone doing process tomography in infinite dimensions or large finite systems, or anyone teaching Kraus decomposition from a constructive angle.\n\nRecommendation: revise.\n\nBest","headline":"Genuinely constructive Kraus algorithm with a repairable but real proof gap: Eq. (7c) is false, though a containment version suffices.","tokens_in":8373,"tokens_out":12695,"would_cite":true,"duration_ms":107076,"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":"For every completely positive map between separable Hilbert spaces, an iterative reduction algorithm produces a Kraus decomposition whose partial sums converge in strong-operator topology.","keywords":["Kraus decomposition","completely positive maps","separable Hilbert spaces","strong operator topology","process tomography","operator-sum representation","kernel relations","constructive proof"],"falsifier":"Run the algorithm on a concrete CP map and a fixed enumeration of basis pairs, checking after each step whether any matrix element previously forced to zero has become nonzero; if such a re-population occurs, the identity $K_{\\Lambda'} = K_\\Lambda \\vee_S (k,h)$ fails and the convergence proof collapses.","tokens_in":7342,"feed_emoji":"⚛️","tokens_out":12672,"duration_ms":99011,"temperature":0.7,"pith_summary":"This paper shows that a Kraus decomposition, the operator-sum representation of a completely positive (CP) map, exists constructively for every CP map from trace-class operators on one separable Hilbert space to those on another. Instead of relying on nonconstructive representation theory, it gives an iterative algorithm that subtracts one rank-one pure operation at a time, each step forcing a chosen matrix element of the remainder to zero. The accompanying proof establishes that the partial sums converge to the original map in strong-operator topology, so the infinite sum is a genuine Kraus decomposition. This fuses the existence question with practical process tomography, since the only inputs are the ground matrix elements of the map. If correct, it turns a deep existence theorem into a directly usable computational scheme.","feed_headline":"A direct algorithm builds Kraus decompositions in infinite dimensions","feed_subtitle":"The iterative reduction proves existence while producing usable Kraus operators one by one.","key_machinery":"The argument is carried by two devices. The kernel relation $K_\\Lambda = \\{(k,h) : \\langle \\Pi(k) | \\Lambda \\cdot \\Pi(h)\\rangle = 0\\}$ records which ground matrix elements of a CP map vanish, and the $J$-transform, a basis-free variant of channel-state duality, turns $\\Lambda$ into a positive operator $J\\Lambda$ on the Hilbert–Schmidt space $\\mathcal{B}_2(\\mathcal{H},\\mathcal{K})$. The reduction step invokes Lemma 1: for a positive operator $T$ with $T\\phi\\neq 0$, subtracting the rank-one projector $\\Pi(\\eta)$ with $\\eta = T\\phi/\\sqrt{\\langle \\phi|T\\phi\\rangle}$ forces $T'\\phi = 0$ and gives $\\ker T' = \\ker T + \\mathbb{C}\\phi$. Translating this through the $J$-transform produces the kernel-relation identity $K_{\\Lambda'} = K_\\Lambda \\vee_S (k,h)$, which guarantees that an entry zeroed in one step is never undone. That permanence is what makes the remainders converge strongly to zero.","core_discovery":"The paper claims that for every completely positive map $\\Lambda \\in \\mathcal{B}(\\mathcal{B}_1(\\mathcal{H}), \\mathcal{B}_1(\\mathcal{K}))$ with $\\mathcal{H}$ and $\\mathcal{K}$ separable Hilbert spaces, the iterative reduction algorithm produces bounded operators $A_1, A_2, \\ldots$ in $\\mathcal{B}(\\mathcal{H},\\mathcal{K})$ such that $\\Lambda = \\sum_{i=1}^\\infty \\Theta(A_i)$ with $\\Theta(A)\\rho = A\\rho A^\\dagger$, and the partial sums converge to $\\Lambda$ in the strong operator topology. Equivalently, the remainder $\\Lambda_n := \\Lambda - \\sum_{i=1}^n \\Theta(A_i)$ tends to zero in trace norm on every input state $\\rho$. Each reduction step forces one ground matrix element $\\langle \\Pi(k) | \\Lambda_n \\cdot \\Pi(h) \\rangle$ to zero for a chosen basis pair $(k,h)$, and the proof shows that this zero is permanent. The algorithm therefore outputs a coherent family of exact Kraus decompositions of the restrictions of $\\Lambda$ to ever-larger finite-dimensional subspaces.","pith_inferences":["If the permanence identity holds, a natural numerical stopping rule becomes certified: stop when the trace norm of the remainder drops below tolerance, and the truncated sum is a guaranteed approximation.","The same reduction strategy might extend to maps on non-separable spaces by transfinite iteration, or to generating Kraus decompositions adapted to an arbitrary net of subspaces, though the paper does not address these.","The kernel-relation view suggests a structural characterization of CP maps through their zero patterns, possibly linking to matrix-completion problems in quantum tomography."],"forward_implications":["Every CP map on separable spaces acquires an explicit, ordered Kraus list, so existence is established constructively without representation theory.","Each new Kraus operator $A_n$ carries one more guaranteed zero matrix entry, so truncating after $N$ steps yields an exact decomposition of the map restricted to an $N$-dimensional subspace, with a uniform bound on the remainder.","The remainders are always CP, uniformly bounded by $\\|\\Lambda\\|$, and converge strongly to zero, so the infinite sum converges without auxiliary Hilbert-space extensions.","Because the inputs are only ground matrix elements, the algorithm is directly executable as a process tomography scheme for channels on infinite-dimensional systems."],"supporting_citations":[{"why":"Supplies the classic nonconstructive existence proof that the new algorithm makes constructive.","marker":"[10]"},{"why":"Provides the standard operator-sum representation that the paper derives by an elementary route.","marker":"[11]"},{"why":"Defines direct process tomography, the operational setting the algorithm implements.","marker":"[12]"},{"why":"Introduces the basis-free J-transform and the CP-map geometry used in the reduction step.","marker":"[13]"},{"why":"Establishes channel-state duality in infinite dimensions, used to translate Lemma 1 into the CP-map setting.","marker":"[16]"}],"fun_headline_variants":["Infinite-dim Kraus decomposition built by direct algorithm","Strong convergence proves Kraus decomposition algorithm","One-by-one Kraus operators built with strong convergence","Direct process tomography gives infinite-dim Kraus decomposition","Kraus operators with guaranteed zeros, built one-by-one"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The convergence proof hinges on the permanence of forced zeros: once a ground matrix element of the remainder is set to zero, later reduction steps must leave it zero.","fun_headline_variants_meta":{"raw":{"variants":["Infinite-dim Kraus decomposition built by direct algorithm","Strong convergence proves Kraus decomposition algorithm","One-by-one Kraus operators built with strong convergence","Direct process tomography gives infinite-dim Kraus decomposition","Kraus operators with guaranteed zeros, built one-by-one"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000632,"raw_usage":{"total_tokens":2879,"prompt_tokens":870,"completion_tokens":2009,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":486,"completion_tokens_details":{"reasoning_tokens":1935}},"tokens_in":486,"tokens_out":2009,"duration_ms":16572,"temperature":1.0,"reasoning_tokens":1935,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T12:50:28.740553+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the algorithm on a concrete CP map and a fixed enumeration of basis pairs, checking after each step whether any matrix element previously forced to zero has become nonzero; if such a re-population occurs, the identity $K_{\\Lambda'} = K_\\Lambda \\vee_S (k,h)$ fails and the convergence proof collapses.","supporting_citations":[{"cited_title":"Notes on completely positive maps and continuous-time Markovian CP evolution. A geometry-flavored perspective","cited_arxiv_id":"2507.11766","evidence_quote":"Introduces the basis-free J-transform and the CP-map geometry used in the reduction step."},{"cited_title":"Grabowski, M","cited_arxiv_id":null,"evidence_quote":"Establishes channel-state duality in infinite dimensions, used to translate Lemma 1 into the CP-map setting."}],"review_version":1}