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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Sharp Discrimination Bounds and Optimizer Exchanges for Binary-Qubit Ensembles

HWAN SON
Preprints.org
Quantum Information and Cryptography
preprint

Sharp Discrimination Bounds and Optimizer Exchanges for Binary-Qubit Ensembles

HWAN SON
preprint en

Abstract

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.

Preprints.org
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon