Sharp Discrimination Bounds and Optimizer Exchanges for Binary-Qubit Ensembles
Classical preparation records enable conditional control of qubit states but can also make their labels distinguishable. An ideal conditional polarization advantage \( d \) imposes a sharp Helstrom-bias bound \( Q\ge d \); importantly, every source saturating this bound has commuting conditional states. We therefore fix the state-pair commutator norm \( c=\|[\rho_1,\rho_2]\|_1 \) and determine the strictly stronger sharp bound \( Q_{\min}(d,c) \) by optimizing jointly over the prior and both binary-qubit states. Crucially, the same sharp discrimination floor can be attained by distinct global minimizers with different label-blind mean-state purities, measurement decision gains, and Holevo information; at one certified coexistence point, their Holevo quantities differ by about \( 0.0647 \) bit. An analytic canonical reduction and exact computer-assisted comparisons establish a global phase diagram of canonical minimizing representatives, with mixed--pure reentrance and nonlocal exchanges between competing source structures. Thus two constrained source invariants determine an exact minimum-error discrimination floor without uniquely fixing the physical and information resources of its saturating ensembles.
Authors
- HWAN SON (ORCID: https://orcid.org/0009-0009-4089-4567)
Publication Details
- Journal
- Preprints.org
- Published
- 2026-11-18
- DOI
- https://doi.org/10.20944/preprints202611.1774.v1
- Primary Topic
- Quantum Information and Cryptography
- Type
- preprint