arXiv:2610.28333
Ensemble basis-free coherence for quantum communication
Aleksei Kodukhov
Abstract
The resource theory of coherence quantifies the quantum properties of states and their role in quantum information processing. Extending coherence theory to ensembles, the natural objects in quantum communication, remains an active research direction, with their operational potential still being explored. In this work, we establish a maximally coherent ensemble in every finite dimension: the continuous ensemble of pure states distributed according to the normalized Haar measure attains the tight upper bound on basis-free relative entropy ensemble coherence. We then prove that ensemble coherence bounds the effective informational advantage of postselective measurements over the Holevo quantity for two equiprobable pure states. Finally, for the qubit B92 QKD protocol, we show that the coherence of Alice's ensemble upper-bounds the secret key rate in the asymptotic regime. These results give ensemble coherence a quantitative operational meaning in quantum communication and cryptography
AI Summary
The paper studies basis-free ensemble coherence, $C(\mathcal E)=\min_T\sum_i p_i[S(\Delta_T\rho_i)-S(\rho_i)]$, asking how large it can be and how it constrains postselected information extraction and quantum key distribution. In dimension $d$, it establishes the tight bound $C(\mathcal E)\leq(H_d-1)/\ln2$, attained by the continuous Haar-uniform ensemble of pure states; for discrete ensembles this value is a supremum. The proof bounds the minimum over bases by the Haar average, using a known averaged-coherence formula. The qubit maximum is approximately $0.7213$ bits. Commutativity-preserving channels are adopted as ensemble-incoherent operations, with monotonicity taken from prior work. Channel examples distinguish these operations from fixed-basis incoherent operations and show that coherence generated during transmission need not imply secrecy. For two equiprobable pure states with overlap $s\in(0,1)$, optimal unambiguous discrimination satisfies $(1-s)[1-h_2((1+s)/2)]<C(\mathcal E)$: coherence bounds the conditional information gain over the pair’s Holevo quantity, weighted by success probability. The proof combines entropy inequalities with the lower bound $C(\mathcal E)\geq s^2(1-s^2)$; no Holevo-bound violation is claimed. For qubit B92 under a specified product-output, beam-splitter-like attack, the asymptotic key rate is bounded by Alice’s initial ensemble coherence when Bob’s output-state overlap is at least $(\sqrt5-1)/2\approx0.618$. This uses a qubit coherence lower bound and the Devetak–Winter expression. The cryptographic result is restricted to the stated protocol and overlap condition; extending the connection to broader QKD settings, or establishing sufficient conditions for secrecy, remains open.
Central claim may not hold: The abstract presents the B92 coherence upper bound without qualification, but the paper establishes it only under specified channel conditions, including Bob's output-state overlap being at least (√5−1)/2.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 10 pages, 1 figure