Multiplicativity of Completely Bounded p-Norms Implies a New Additivity Result
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
AbstractWe prove additivity of the minimal conditional entropy associated with a quantum channel Φ, represented by a completely positive (CP), trace-preserving map, when the infimum of S(γ12) − S(γ1) is restricted to states of the form $$(\mathcal{I} \otimes \Phi)\left( | \psi \rangle \langle \psi | \right)$$. We show that this follows from multiplicativity of the completely bounded norm of Φ considered as a map from L1 → Lp for Lp spaces defined by the Schatten p-norm on matrices, and give another proof based on entropy inequalities. Several related multiplicativity results are discussed and proved. In particular, we show that both the usual L1 → Lp norm of a CP map and the corresponding completely bounded norm are achieved for positive semi-definite matrices. Physical interpretations are considered, and a new proof of strong subadditivity is presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Completely positive linear maps on complex matrices
Choi, M.-D. (1975) · Linear Algebra and its Applications · doi:10.1016/0024-3795(75)90075-0 · Cited by 2,659
States, Effects, and Operations Fundamental Notions of Quantum Theory
(1983) · Lecture Notes in Physics · doi:10.1007/3-540-12732-1 · Cited by 1,928
Proof of the strong subadditivity of quantum-mechanical entropy
Lieb, E. H., & Ruskai, M. B. (1973) · Journal of Mathematical Physics · doi:10.1063/1.1666274 · Cited by 831
Self-citationThe Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
Self-citationPositive Functions on C ∗ -Algebras
Stinespring, W. F. (1955) · Proceedings of the American Mathematical Society · doi:10.2307/2032342 · Cited by 714
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802612 · Cited by 698
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Random Quantum Circuits are Approximate 2-designs
Harrow, A. W., & Low, R. A. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0873-6 · Cited by 324
“The diamond norm is closely related to completely bounded norms (cb-norms), in that ||T ||⋄ is the cb-norm of T † and can also be interpreted as the L1 → L1 cb-norm of T itself [11, 27].”
BackgroundQuantum error correction of observables
Bény, C., Kempf, A., & Kribs, D. W. (2007) · Physical Review A · doi:10.1103/physreva.76.042303 · Cited by 67
Quantum-Proof Randomness Extractors via Operator Space Theory
Berta, M., Fawzi, O., & Scholz, V. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2627531 · Cited by 12
Metadata
- Authors
- Devetak, I., Junge, M., King, C., & Ruskai, M. B.
- Venue
- Communications in Mathematical Physics
- Published
- 2006-05-09
- Volume
- 266
- Issue
- 1
- Pages
- 37-63
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2006835764
- Cited by
- 82
- References
- 6
- FWCI
- 4.21
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multiplicativity of Completely Bounded p-Norms Implies a New Additivity Result. https://app.cochat.ai/papers/10.1007/s00220-006-0034-0
- The paper
- Devetak, I., Junge, M., King, C., & Ruskai, M. B. (2006). Multiplicativity of Completely Bounded p-Norms Implies a New Additivity Result. Communications in Mathematical Physics. https://doi.org/10.1007/s00220-006-0034-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.