arXiv:2610.34784
Measure of set coherence
Jiabo Panel, Yu Guo, Yuqin Wang
Abstract
Set coherence is a quantum resource for a set of states that characterizes whether a collection of quantum states contains coherence, namely whether these states fail to be simultaneously incoherent in a common basis. In this work, we show that the free operations of set coherence are common commutativity-preserving quantum channels, from which we then establish an axiomatic framework for set-coherence measure (SCM). Within this framework, we investigate the robustness based measures deduced by taking, respectively, the average, maximum, and sum of the single-state robustnesses over a common reference basis, where the first two were previously introduced in the literature and we check here whether they satisfy our SCM axioms. Consequently, we show that the averaged robustness is an SCM but it is neither unified nor complete, the maximal robustness is a unified SCM but is neither complete nor strongly superadditive, whereas the sum robustness is a complete SCM. Furthermore, we propose several classes of SCMs based on pairwise commutators. We show that the Schatten $p$-norm based SCMs are complete and strongly superadditive. We also find that the universal fourth-order Bargmann gap measure proposed in the literature is a complete and strongly superadditive quantifier of set coherence. Finally, we discuss the operational meaning of the SCM in the context of optimal approximate quantum broadcasting, and show that the amount of set coherence can closely reflect the performance of this task.
AI Summary
Set coherence asks whether a finite collection of density operators can be diagonalized in one common basis, equivalently whether all pairs commute. This paper develops axioms for quantifying this basis-independent resource, taking common commutativity-preserving channels as free operations. Beyond faithfulness and channel monotonicity, it considers monotonicity under set inclusion, superadditivity for disjoint unions, and a stronger union–intersection inequality. Three robustness constructions minimize, over a common basis, the mean, maximum, or sum of single-state coherence robustnesses. All satisfy the basic measure axioms; the maximum additionally satisfies inclusion monotonicity, while the sum also satisfies disjoint-union superadditivity. None satisfies the stronger inequality. Counterexamples distinguish these properties. The paper constructs measures $\mathcal C_p=\sum_{i<j}\|[\rho_i,\rho_j]\|_p$ and their $p$th-power variants, proving channel monotonicity using the known classification of commutativity-preserving channels and Bloch-vector geometry for qubits. These measures satisfy all the proposed inequalities, as does the existing Bargmann gap $\mathcal G_B=\frac12\sum_{i<j}\|[\rho_i,\rho_j]\|_2^2$. The sharp pairwise bound is $\|[\rho,\sigma]\|_p\leq2^{1/p-1}$, attained by pure states with squared overlap $1/2$. Operational analysis is restricted to two equally likely pure qubit states. An SDP dual certificate establishes the optimal local broadcasting fidelity, agreeing with a known state-dependent cloning expression. Writing their squared overlap as $q$, $\mathcal G_B=q(1-q)$, whereas the broadcasting deficit peaks at $q=1/4$. Consequently, these measures do not uniquely determine broadcasting performance and are not globally monotonic with its deficit; explicit two-branch relations describe this limitation.
Central claim may not hold: The claim that averaged robustness is an SCM is false for the paper's finite-subset definitions: a free unital qubit channel can merge distinct states, reducing the averaging denominator and increasing averaged robustness, contrary to SC3.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 19 pages, 3 figures. Comments are welcome