scientific article

zbMath1152.81757arXivquant-ph/0212057MaRDI QIDQ3522432

No author found.

Publication date: 3 September 2008

Full work available at URL: https://arxiv.org/abs/quant-ph/0212057

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Quantum computation (81P68) Channel models (including quantum) in information and communication theory (94A40)

Related Items

Gaussian optimizers and the additivity problem in quantum information theory ⋮ Simplification of additivity conjecture in quantum information theory ⋮ Construction of genuinely entangled multipartite subspaces from bipartite ones by reducing the total number of separated parties ⋮ Multiplicativity of completely bounded \(p\)-norms implies a new additivity result ⋮ The minimum Rényi entropy output of a quantum channel is locally additive ⋮ Additivity violation of quantum channels via strong convergence to semi-circular and circular elements ⋮ Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels ⋮ On a norm compression inequality for \(2\times N\) partitioned block matrices ⋮ Weak locking capacity of quantum channels can be much larger than private capacity ⋮ Positivity of linear maps under tensor powers ⋮ Counterexamples to the maximal \(p\)-norm multiplicativity conjecture for all \(p>1\) ⋮ Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy ⋮ Potential output purity of completely positive maps ⋮ Additivity rates and PPT property for random quantum channels