Matching upper and lower bounds characterize the sample complexity of symmetric composite binary quantum hypothesis testing up to universal constants for both finite and infinite uncertainty sets.
Comparisons between quantum state distinguisha- bility measures
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sample Complexity of Composite Quantum Hypothesis Testing
Matching upper and lower bounds characterize the sample complexity of symmetric composite binary quantum hypothesis testing up to universal constants for both finite and infinite uncertainty sets.