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.
Computational Entanglement Theory
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Authors introduce quantum computational min- and max-entropies with properties including data processing and chain rules, plus an operational link to bounded-circuit entanglement distillation.
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.
-
Fully Quantum Computational Entropies
Authors introduce quantum computational min- and max-entropies with properties including data processing and chain rules, plus an operational link to bounded-circuit entanglement distillation.