Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
The operational meaning of min- and max- entropy
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Extends Fano bounds to sufficiency of low conditional entropy and defines a quantum entanglement task for infinite-dimensional systems with bounds via maximal singlet fraction of finite-dimensional approximations.
citing papers explorer
-
Accessible Quantum Correlations Under Complexity Constraints
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
-
On the coherent extension of some Fano-type learning bounds
Extends Fano bounds to sufficiency of low conditional entropy and defines a quantum entanglement task for infinite-dimensional systems with bounds via maximal singlet fraction of finite-dimensional approximations.