{"id":"4195f0d3-c525-4799-b7a5-1a6f7becabba","arxiv_id":"1908.01882","paper_version":2,"verdict":"REJECT","confidence":"MODERATE","novelty_score":3.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper asserts that Kraus operators of Block, Strictly Block, and Physically Block Incoherent Operations have restricted block-matrix forms, but the derivations are sketchy and the main characterizations were already stated in an earlier preprint.","lead":"This paper defines three families of free operations for a POVM-based coherence resource theory and claims structural forms for their Kraus operators. It matters because knowing the free operations is the first step toward characterizing state transformations in any quantum resource theory, but the proofs here are incomplete and partly duplicate prior work.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The proof of the central Kraus characterization is incomplete: Theorem 1 reduces to a finite 5D example, and the missing induction leaves the main claim unestablished.","rationale":"Agreement with reader: the weakest assumption identified by the reader is the reliance on a finite set of test states and the asserted 5D-to-general step; my review shares this as the primary load-bearing gap. I do not find a counterexample to the block-column characterization itself; a rank-one-state argument within each block can likely prove it, but that argument is absent from the manuscript. The submitted proof is therefore incomplete even if the theorem is true. The counting error in Sections VII and VIII is concrete and internal: the number of possible non-zero values of entries is continuous, so expressions like (2^{d_i d_j}-1) cannot count Kraus operators. The abstract also promises a dilation theorem for SBIO and state-transformation results that are not present in the body. These are additional grounds for rejection, but the proof gap is the most load-bearing because the central characterization rests on it. Since the reader's verdict is REJECT and my analysis does not rehabilitate the paper, the verdict is unchanged. I have no basis to question the authors' intent; the issue is evidentiary support for the central derivation.","tokens_in":12209,"tokens_out":15769,"duration_ms":205370,"concrete_test":"Run a symbolic computation for a d=6 system with three blocks of size 2,2,2 under the fixed 3-block dephasing map. Impose Eq. (2) for B_l chosen from a Hermitian basis of each block and for every pair of output blocks in different blocks, and solve for the 6x6 Kraus matrix K. If a solution has two or more non-zero blocks in some column partition, Theorem 1 is false. If no such solution exists, the finite-state reduction is adequate for this case; then attempt to write the missing induction over block counts. If the induction cannot be completed, the theorems remain unproven.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central result is the Kraus characterization of BIO and SBIO (Theorems 1 and 2). The proof of Theorem 1 derives Eq. (2) from the defining condition, then asserts without justification that one may work with a two-block dephasing map and with test states of the form (|x>+|y>)/sqrt(2). Appendix A treats only five-dimensional examples with partitions (2,3), (1,4), and (1,2,2), and the text concludes that 'repeating this process for finite number of times' gives the block-column property. That is not a proof for arbitrary dimension and arbitrary POVM partition. Eq. (2) must hold for all block-diagonal states; the finite state set only tests selected linear combinations of the coefficients c_ix, and the step from those equations to 'at most one non-zero block per column partition' is asserted rather than derived. No induction over the number of blocks is supplied. Theorem 2 inherits this gap and adds a second finite-state reduction in Appendix B. Because the paper's stated contribution is to supply these proofs (prior work [26] states the forms without proof), the central claim is unsupported as written. A secondary issue is that Section VII's upper-bound count treats continuous complex matrix entries as binary choices (2^{d_i d_j}-1), which cannot bound a number of Kraus operators; this error independently weakens the advertised bounds.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces three classes of free operations in the POVM-based resource theory of block coherence: Block Incoherent Operations (BIO), Strictly Block Incoherent Operations (SBIO), and Physically Block Incoherent Operations (PBIO). Its main claimed contributions are Kraus characterizations (Theorems 1 and 2), a structural form for PBIO (Theorem 3), and upper bounds on the number of Kraus operators needed for BIO and SBIO. The theorem statements would extend the standard IO/SIO lemmas to block coherence, but the proofs are incomplete: the arguments reduce to finite five-dimensional examples and an asserted but unjustified iterative step, and the counting in Sections VII and VIII treats continuous matrix entries as discrete binary choices.","tokens_in":12449,"tokens_out":5344,"duration_ms":57646,"significance":"If the Kraus characterizations were rigorously established, they would be a useful generalization of the standard coherence-theory lemmas to POVM-based block coherence, and the paper correctly identifies that the earlier work [26] states these forms without proof. The PBIO construction is also a natural extension of PIO. However, the advertised proofs and bounds are not currently reliable: the main theorems are not proven for arbitrary dimension and partition, and the counting arguments are invalid. The paper therefore does not yet deliver its stated contribution.","major_comments":[{"comment":"The proof of Theorem 1 reduces the condition Eq. (2) to a finite set of test states of the form (|x>+|y>)/sqrt(2) and to a two-block dephasing map, and then asserts that 'repeating this process for finite number of times' yields the claimed block-column property. Appendix A only treats five-dimensional cases with partitions (2,3), (1,4), and (1,2,2). No rigorous induction over the number of blocks or over the dimensions is supplied, and the step from the finite set of equations to 'at most one non-zero block in each column partition' is asserted rather than derived. Since Theorem 1 is the central characterization, this gap leaves the main claim unsupported as written.","section":"Section IV, Theorem 1 proof; Appendix A"},{"comment":"Theorem 2 inherits the incomplete proof of Theorem 1 and adds a second finite-state reduction for the stricter condition. Equations (6) and (7) are only checked on a small set of test states in Appendix B; the text again concludes the row/column support property by an asserted iterative process. The row/column structure is precisely what distinguishes SBIO, so this missing justification is load-bearing for the advertised characterization.","section":"Section V, Theorem 2 proof; Appendix B"},{"comment":"The upper-bound counting arguments are invalid. The text states that a d_i x d_j block that is not null contains at least one nonzero element 'which can be chosen in 2^{d_i d_j} - 1 ways.' This is incorrect because complex matrix entries are continuous variables; for any chosen support pattern there are infinitely many matrices. Consequently the sums of (2^{d_i d_j} - 1) terms do not bound the number of Kraus operators in a decomposition, and the advertised bounds on the maximum number of Kraus operators for BIO and SBIO are not established.","section":"Sections VII and VIII"}],"minor_comments":[{"comment":"In Eq. (1), the left-hand side should read Delta(K_n B_l K_n^dagger); the subscript n is missing on the first K_n.","section":"Section IV, Eq. (1)"},{"comment":"In the sentence 'K_n rho K_n^dagger subset I', the symbol should be 'in' rather than 'subset', since K_n rho K_n^dagger is a single state, not a set.","section":"Section IV, definition of BIO"},{"comment":"The phrase 'Kraus operations' should be 'Kraus operators'; also the closing statement of the theorem uses 'operations' inconsistently.","section":"Section V, Theorem 2"},{"comment":"The abbreviation 'BSIO' is used where 'SBIO' is meant.","section":"Section IX, Conclusion"},{"comment":"The text mentions 'Delta_2, Delta_3, Delta_4' but only three dephasing maps Delta_1, Delta_2, Delta_3 are defined in the appendix.","section":"Appendix A, paragraph 2"}],"recommendation":"major_revision","confidential_remarks":"The authors acknowledge overlap with arXiv:1907.08574, so the added value is the purported proofs and bounds. Given that the proofs of Theorems 1 and 2 are not rigorous and the counting in Sections VII and VIII is mathematically incorrect, the paper is not acceptable in its present form. The theorem statements may be correct and could be repaired by a genuine induction or by a rigorous linear-algebra argument, and the counting sections need to be either corrected to count discrete support patterns (if that is the intended claim) or removed. A substantial revision is required before this can be reconsidered."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The core content here is a set of Kraus-operator characterizations for block incoherent operations (BIO), strictly block incoherent operations (SBIO), and physically block incoherent operations (PBIO), in the POVM-based coherence framework. The paper itself is honest about the main limitation: the BIO and SBIO Kraus forms were already stated in the earlier work by Bischof, Kampermann, and Bruß (arXiv:1907.08574), and this paper's contribution is to provide proofs.\n\nWhat the paper does well: the PBIO construction in Section VI is a genuine extension of the physically incoherent operations idea to the block setting, and the derivation of the Kraus form from a Naimark-type ancilla picture is the most original part. The five-dimensional worked examples in the appendices are explicit and could be useful for someone trying to understand the structure concretely. The paper also correctly cites the prior statement of the BIO/SBIO forms and does not hide the overlap.\n\nThe soft spots are real. The proofs of Theorems 1 and 2 are not proofs in the usual sense: they reduce to a five-dimensional example and then assert that the same argument repeats for arbitrary dimension and arbitrary partition. That induction is not supplied, and the step from equations holding on a finite set of test states to a block-support property for all Kraus operators is not rigorously justified. Since the paper's stated added value over the prior work is precisely these proofs, this gap is load-bearing. The counting in Sections VII and VIII is also shaky: it treats the entries of continuous complex matrices as if they were binary choices, so the bounds like 2^{d_i d_j} - 1 are not meaningful upper bounds on the number of Kraus operators. That error independently weakens the advertised results. The abstract also promises a dilation theorem and state transformation results that do not appear in the body.\n\nThat said, the direction is reasonable and the PBIO part may be worth developing. A serious referee could ask for a genuine induction proof and a corrected counting argument; those are plausible repairs. As written, the central characterization theorems are restatements with incomplete proofs, so the paper is not ready for publication in that form.\n\nFor a reader working on block coherence or POVM-based resource theories, the worked examples and the PBIO form are worth a look. It deserves peer review in the sense that a competent referee could move it forward, but my own verdict would be reject-and-revise rather than accept as is.","headline":"Known Kraus forms plus incomplete proofs—useful as a worked five-dimensional derivation, not as a proof of the general characterization.","tokens_in":13012,"tokens_out":624,"would_cite":false,"duration_ms":8463,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":["03.67.Mn","03.65.Ud"],"model":"deepseek-v4-flash","headline":"This paper claims that in block-coherence resource theory, Block Incoherent Operations are exactly one-block-per-column Kraus maps, Strictly Block Incoherent Operations are also one-block-per-row, and Physically Block Incoherent…","keywords":["block coherence","POVM resource theory","block incoherent operations","strictly block incoherent operations","physically block incoherent operations","Kraus operators","Naimark dilation","state transformation"],"falsifier":"A concrete check is to search over CPTP maps in dimension four with a $2+2$ block partition for one that preserves every block-diagonal state under each Kraus operator yet has a Kraus representation with two non-zero blocks in a column partition; such a map would refute the necessity direction of Theorem 1. A weaker check is a map that passes the finite test-state conditions of the proof but fails on some other block-incoherent state, showing the reduction is incomplete.","tokens_in":12018,"feed_emoji":"🔷","tokens_out":16120,"duration_ms":145720,"temperature":0.7,"pith_summary":"This paper aims to give the resource theory of coherence based on general measurements the same structural backbone that standard coherence theory already has: explicit operator forms for the transformations that cost no resource. It introduces three classes of free operations — Block Incoherent Operations, Strictly Block Incoherent Operations, and Physically Block Incoherent Operations — and claims that the first two are characterized by simple block-sparsity conditions on their Kraus operators. Specifically, it aims to prove that a completely positive trace-preserving map is Block Incoherent if and only if every Kraus operator has at most one non-zero block in each column partition, and is Strictly Block Incoherent if and only if the same holds for rows as well as columns. If these characterizations hold, they turn the statement 'this operation creates no block coherence' into a checkable matrix-sparsity condition, and they provide upper bounds on how many Kraus operators are ever needed. The paper also constructs Physically Block Incoherent Operations through a Naimark dilation with a block-incoherent ancilla, giving the resource theory a concrete measurement-based implementation.","feed_headline":"Block-incoherent operations are one-block-per-column Kraus maps","feed_subtitle":"New theorems pin down Kraus forms for POVM-based block coherence and give upper bounds on Kraus counts.","key_machinery":"The load-bearing object is the block dephasing map $\\Delta(\\rho)=\\sum_i P_i \\rho P_i$, defined by a partition into orthogonal projectors $P_i$; block-incoherent states are those fixed by $\\Delta$. The argument pushes the preservation condition $\\Delta(K_n B_l K_n^\\dagger)=K_n B_l K_n^\\dagger$ through the matrix-element expansion $\\sum_{x,y} c_{ix} d^l_{xy} c^*_{i'y}=0$ for off-diagonal blocks, and specializes the arbitrary block-diagonal states $B_l$ to superpositions $(|x\\rangle+|y\\rangle)/\\sqrt{2}$ to force the block sparsity. The same expansion applied to off-diagonal blocks $B'_l$ yields the row restriction for SBIO. For PBIO, the mechanism is Naimark dilation with a block-incoherent ancilla, a joint incoherent unitary built from a permutation, and a block projector on the ancilla, which produces Kraus operators whose blocks are unitary-projector products.","core_discovery":"The central discovery is the block analogue of the standard incoherent-operation lemmas. A completely positive trace-preserving map is a Block Incoherent Operation exactly when it has a Kraus representation in which every $K_n$ has at most one non-zero block in each column partition of the fixed block dephasing map $\\Delta$ (Theorem 1). A Strictly Block Incoherent Operation is exactly one in which every $K_n$ has at most one non-zero block in each row partition as well (Theorem 2). Physically Block Incoherent Operations acquire a Kraus form in which every block is a unitary-projector product (Theorem 3). The paper also supplies upper bounds on the number of Kraus operators needed for BIO and SBIO, and verifies the argument in detail in dimension five; if all projectors are rank one, the results reduce to the standard forms for Incoherent Operations, Strictly Incoherent Operations, and Physically Incoherent Operations.","pith_inferences":["A direct corollary the authors do not spell out is that the block-sparsity form gives a finite enumeration recipe for extremal BIO decompositions: choose one block in each column partition; the paper does not develop this algorithmic view.","The finite test-state reduction can be stress-tested independently: a computer search over the bilinear equations forced by the chosen superpositions would show whether the proof's reduction is complete or only an illustration.","The PBIO construction suggests an experimental implementation using a fixed block-incoherent ancilla and a permutation-controlled unitary; the paper stops at the abstract Kraus form."],"forward_implications":["The membership problem 'is this operation free?' reduces to checking the non-zero block pattern of one Kraus representation, not searching over all states.","The derived upper bounds give explicit finite ceilings for the number of Kraus operators needed to realize a BIO or SBIO for a fixed partition.","At rank-one partitions the block characterizations collapse to the standard lemmas for Incoherent, Strictly Incoherent, and Physically Incoherent Operations, so ordinary coherence theory sits inside the POVM-based theory as a special case.","The SBIO state-transformation conditions provide concrete criteria for converting one block-coherent state into another without cost, a first step toward resource quantification in this setting."],"supporting_citations":[{"why":"Supplies the standard resource theory of coherence whose free states, free operations, and measures provide the baseline that block coherence generalizes.","marker":"[10]"},{"why":"Defines the POVM-based block-coherence framework, including block-incoherent states and the block dephasing map on which this paper builds.","marker":"[15]"},{"why":"Provides the Kraus characterizations of Incoherent Operations, Strictly Incoherent Operations, and Physically Incoherent Operations that Theorems 1-3 generalize.","marker":"[18]"},{"why":"Gives the counting strategy and upper bounds for numbers of Kraus operators that Sections VII and VIII adapt to the block setting.","marker":"[21]"},{"why":"Introduced the same block-incoherent operation classes without proofs; this paper presents itself as supplying the full derivation.","marker":"[26]"}],"fun_headline_variants":["Block coherence: Kraus form for block-incoherent operations revealed","New theorems pin down Kraus operators for POVM-based block coherence","Exact Kraus forms for strict and physical block-incoherent operations","Block coherence resource theory: Kraus characterizations for three operations"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the finite set of test states $(|x\\rangle+|y\\rangle)/\\sqrt{2}$ exhausts all relevant block-diagonal behaviour; the paper asserts this rather than proving it in full generality.","fun_headline_variants_meta":{"raw":{"variants":["Block coherence: Kraus form for block-incoherent operations revealed","New theorems pin down Kraus operators for POVM-based block coherence","Exact Kraus forms for strict and physical block-incoherent operations","Block coherence resource theory: Kraus characterizations for three operations"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000972,"raw_usage":{"total_tokens":4114,"prompt_tokens":910,"completion_tokens":3204,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":526,"completion_tokens_details":{"reasoning_tokens":3128}},"tokens_in":526,"tokens_out":3204,"duration_ms":21782,"temperature":1.0,"reasoning_tokens":3128,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:00:32.920048+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete check is to search over CPTP maps in dimension four with a $2+2$ block partition for one that preserves every block-diagonal state under each Kraus operator yet has a Kraus representation with two non-zero blocks in a column partition; such a map would refute the necessity direction of Theorem 1. A weaker check is a map that passes the finite test-state conditions of the proof but fails on some other block-incoherent state, showing the reduction is incomplete.","supporting_citations":[{"cited_title":"Baumgratz, M","cited_arxiv_id":null,"evidence_quote":"Supplies the standard resource theory of coherence whose free states, free operations, and measures provide the baseline that block coherence generalizes."},{"cited_title":"Resource theory of coherence based on positive-operator-valued measures","cited_arxiv_id":"1812.00018","evidence_quote":"Defines the POVM-based block-coherence framework, including block-incoherent states and the block dephasing map on which this paper builds."},{"cited_title":"Chitambar and G","cited_arxiv_id":null,"evidence_quote":"Provides the Kraus characterizations of Incoherent Operations, Strictly Incoherent Operations, and Physically Incoherent Operations that Theorems 1-3 generalize."},{"cited_title":"Streltsov, S","cited_arxiv_id":null,"evidence_quote":"Gives the counting strategy and upper bounds for numbers of Kraus operators that Sections VII and VIII adapt to the block setting."},{"cited_title":"Quantifying coherence with respect to general quantum measurements","cited_arxiv_id":"1907.08574","evidence_quote":"Introduced the same block-incoherent operation classes without proofs; this paper presents itself as supplying the full derivation."}],"review_version":1}