REVIEW 3 major objections 5 minor 26 references
Structure of Resource Theory of Block Coherence
T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read 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…
desk verdict Known Kraus forms plus incomplete proofs—useful as a worked five-dimensional derivation, not as a proof of the general characterization. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
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.
What would settle it
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.
Extended reading notes
Core claim
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.
Load-bearing premise
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.
Editorial extensions
If this is right
- 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.
Reading between the lines
- 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.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
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.
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 (3)
- [Section IV, Theorem 1 proof; Appendix A] 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 V, Theorem 2 proof; Appendix B] 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.
- [Sections VII and VIII] 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.
minor comments (5)
- [Section IV, Eq. (1)] 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 IV, definition of BIO] 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 V, Theorem 2] The phrase 'Kraus operations' should be 'Kraus operators'; also the closing statement of the theorem uses 'operations' inconsistently.
- [Section IX, Conclusion] The abbreviation 'BSIO' is used where 'SBIO' is meant.
- [Appendix A, paragraph 2] 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.
Circularity Check
No circular derivation: the central Kraus characterization is an attempted proof from the defining block-incoherence condition, not an input fitted as an output.
full rationale
The paper's central results, Theorems 1 and 2, aim to derive a block-sparsity condition on Kraus operators from the definition of Block Incoherent Operations and Strictly Block Incoherent Operations. The definition of BIO is given by the requirement that Δ(K_n B_l K_n†) = K_n B_l K_n† for all block-diagonal B_l, which does not already assert the column/row-block structure that Theorem 1 concludes; the theorem is therefore a genuine characterization claim rather than a restatement of the definition. The proof's use of test states of the form (|x>+|y>)/√2 and the five-dimensional appendices is an attempted completeness argument, not an assumption of the desired conclusion. No parameter is fitted to any data, and no prediction is derived from a quantity defined in terms of that prediction. The citations to [15] and [26] supply prior definitions and comparison statements, but the derivation does not reduce to those citations: [26] is explicitly described as presenting the Kraus forms without proof, while this paper attempts to supply the proof. Even if that proof is incomplete—for example, the finite-dimensional checks are asserted to generalize without an explicit induction, and the counting in Section VII treats continuous complex matrix entries as binary choices—incompleteness is a correctness concern, not circularity. No load-bearing circular step is exhibited by quotation and reduction, so the appropriate circularity score is 0.
Assumptions & free parameters
assumptions (3)
- standard math Naimark's dilation theorem: every POVM can be realized as a projective measurement on an enlarged Hilbert space.
- domain assumption The block dephasing map Δ is fixed by a partition {P_i} of the Hilbert space, and block-incoherent states are defined as states satisfying ρ = Δ(ρ).
- domain assumption A CPTP map is called a Block Incoherent Operation if there exists a Kraus representation such that Δ(K_n B_l K_n†) = K_n B_l K_n† for every diagonal block B_l and every Kraus operator K_n.
Cite this review
Pith. "Pith review of Structure of Resource Theory of Block Coherence." pith.science (2026). https://pith.science/paper/F6AFB3UT
@misc{pith2026190801882,
author = {Pith},
title = {Pith review of: Structure of Resource Theory of Block Coherence},
year = {2026},
howpublished = {\url{https://pith.science/paper/F6AFB3UT}},
note = {Machine review of arXiv:1908.01882}
}
read the original abstract
Emerging from the superposition principle, the resource theory of coherence plays a crucial role in many information-processing tasks. Recently, a generalization to this resource theory was investigated with respect to arbitrary positive operator valued measurement (POVM) based on Naimark's dilation theorem. Here, we introduce the notion of Block Incoherent Operations (BIO), Strictly Block Incoherent Operations (SBIO) and Physically Block Incoherent Operations (PBIO) and provide an analytical expression for Kraus operators of these operations to have a better understanding of the resource theory of block coherence which in turn gives a more clear picture of POVM based resource theory of coherence. A dilation theorem corresponding to SBIO has been introduced to enlighten the proper physical interpretation of this operation. These free operations will be helpful in finding out the conditions of state transformations and could be implemented in various protocols. For a transparent view of this resource theory, we have successfully introduced the concept of state transformation under SBIO.
Reference graph
Works this paper leans on
-
[26]
Quantifying coherence with respect to general quantum measurements
F. Bischof, H. Kampermann, D. Bru β , arXiv:1907.08574 (2019) Appendix-A Kraus operator formulation for block incoherent operation for five dimensional case: We follow same procedure as discussed in main ar- ticle. To find Kraus operator representation for block incoherent operation we need to consider ∑ x,y cixdl xyc∗ i′ y = 0 (9) ,which holds for all off d...
work page Pith review arXiv 2019
-
[1]
M. Horodecki and J. Oppenheim, Int. J. Mod. Phys. B 27, 1345019 (2013)
work page 2013
- [2]
-
[3]
R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Rev. Mod. Phys. 81, 865-942 (2009)
work page 2009
-
[4]
B.Coecke, T.Fritz and R. W. Spekkens, Information and computation 250, 59(2016)
work page 2016
-
[5]
Nielsen and I.L
M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, UK, 2000)
2000
-
[6]
Peres, Quantum Theory: Concepts and Methods, vol
A. Peres, Quantum Theory: Concepts and Methods, vol. 57 (Springer Science and Business Media, 2006)
work page 2006
-
[7]
C. H. Bennett and D. P. Divincenzo, Nature (London) 404, 247-255 (2000)
work page 2000
Show all 26 references
-
[8]
Li, G.-L
S.-S. Li, G.-L. Long, F.-S. Bai, S.-L. Feng, and H.- Z. Zheng, Proc. Natl. Acad. Sci. U.S.A. 98(21), 11847 (2001)
2001
-
[9]
Raussendorf and H
R. Raussendorf and H. J. Briegel, Physical Review Let- ters 86, 5188-5191 (2001)
2001
-
[10]
Baumgratz, M
T. Baumgratz, M. Cramer, and M. B. Plenio, Physical Review Letters 113, 140401 (2014)
2014
-
[11]
Winter and D
A. Winter and D. Yang, Physical Review Letters 116,120404 (2016)
2016
-
[12]
Gauger, E
E. Gauger, E. Rieper, J. J. L. Morton, S. C. Benjamin, V. Vedral, Physical Review Letters 106, 040503 (2011)
2011
-
[13]
Cwiklinski, M
P. Cwiklinski, M. Studzinski, M. Horodecki, and J. Op- penheim,arXiv preprint arXiv:1405.5029 (2014)
2014 arXiv
-
[14]
Lostaglio, D
M. Lostaglio, D. Jennings, and T. Rudolph, Nature Com- munications 6, 6383 (2015)
2015
- [15]
-
[16]
Chitambar and M.-H
E. Chitambar and M.-H. Hsieh, Physical Review Letters 117, 020402 (2016)
2016
-
[17]
Streltsov, S
A. Streltsov, S. Rana, M. N. Bera, and M. Lewen- stein,Physical Review X 7, 011024 (2017)
2017
-
[18]
Chitambar and G
E. Chitambar and G. Gour, Physical Review Letters 117,030401 (2016)
2016
-
[19]
J. ˜A. . . berg, arXiv:quant-ph/0612146
-
[20]
Yadin, J
B. Yadin, J. Ma, D. Girolami, M. Gu, and V. Vedral, Physical Review X 6, 041028 (2016)
2016
-
[21]
Streltsov, S
A. Streltsov, S. Rana, P. Boes and J. Eisert, PRL 119, 140402 (2017)
2017
-
[22]
K. Bu, U. Singh, S. Fei, A. Pati, and J. Wu, Physical Review Letters 119 150405(2017)
2017
-
[23]
S. Rana, P. Parashar, A. Winter, and M. Lewenstein, Physical Review A 96, 052336 (2017)
2017
-
[24]
S. Rana, P. Parashar, and M. Lewenstein, Physical Re- view A 93, 012110 (2016)
2016
-
[25]
Napoli, T
C. Napoli, T. R. Bromley, M. Cianciaruso, M. Piani, N. Johnston, and G. Adesso, Physical Review Letters 116, 150502 (2016)
2016
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.