Static classical-quantum-entanglement trade-offs: an entropic converse and single-letter characterizations

Abstract:The direct static capacity region of a bipartite quantum state describes its asymptotic conversion into classical communication, quantum communication, and entanglement, with all communication directed from Alice to Bob. This paper gives a unified entropic converse for this region. The proof treats generated and consumed resources simultaneously and derives all three information inequalities for one local instrument. Its main ingredients are no-signalling, the chain rule, strong subadditivity, and continuity of conditional entropy. A supporting-hyperplane characterization leads to the static capacity formula, which is helpful in determining single-letterization of the capacity region. For a pure state of entanglement entropy $h$ subjected to erasure with probability $p$, the complete region is the convex hull of $0$ and $(0,-ph,(1-p)h)$, plus the unit-resource cone. This statement holds for arbitrary collective instruments by using subset-entropy inequalities related to earlier methods used for the dynamic capacity region of the erasure channel. Complete characterizations also hold for symmetrically extendible states and locally flagged pure-state mixtures. For maximally correlated states, the optimization over local instruments admits an exact matrix formulation and an additive outer bound. An explicit qubit example shows that a nonorthogonal discarded quantum memory can outperform every efficient instrument and every instrument with conditionally commuting discarded states. For states obtained by qubit dephasing of Schmidt-aligned pure states, an exact threshold characterizes when the static capacity formula vanishes, at every blocklength and after regularization. Full single-letter characterizations for general Hadamard states and for the remaining trade-offs for dephased states remain open, with sufficient additivity conditions identified.

Quantum Physics (quant-ph); Information Theory (cs.IT)

arXiv:2609.23298 [quant-ph]

(or arXiv:2609.23298v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.23298 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

data/dephasing_hull_primitives.csv

data/dephasing_refinement_candidates.csv

data/dephasing_refinement_comparison.csv

data/dephasing_state_plot_data.csv

data/erased_state_plot_data.csv

data/numerical_exploration/continuous_support_comparison.csv

data/numerical_exploration/numerical_results.json

data/numerical_exploration/plot_refinement_comparison.csv

data/numerical_exploration/refined_hull_primitives.csv

data/numerical_exploration/two_outcome_search.csv

editable/erased_region_3d_concept.svg

erased_region_subtitle.tex

explore_two_outcome_dephasing.py

inputs/erased_state_plot_data.csv

make_capacity_figures.py

make_erased_3d.py

reproduce_all.py

requirements.txt

tikz/auxiliary_instrument.tex

tikz/auxiliary_instrument.tikz

tikz/static_protocol.tex

tikz/static_protocol.tikz

verification/build_manifest.json

verification/figure_verification.json

verification/geometry_check.json

verification/independent_checks.json

verify_figures.py

(23 additional files not shown) You must enabled JavaScript to view entire file list.

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.