Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p > 1
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
For all p > 1, we demonstrate the existence of quantum channels with non-multiplicative maximal output p-norms. Equivalently, for all p > 1, the minimum output Rényi entropy of order p of a quantum channel is not additive. The violations found are large; in all cases, the minimum output Rényi entropy of order p for a product channel need not be significantly greater than the minimum output entropy of its individual factors. Since p = 1 corresponds to the von Neumann entropy, these counterexamples demonstrate that if the additivity conjecture of quantum information theory is true, it cannot be proved as a consequence of any channel-independent guarantee of maximal p-norm multiplicativity. We also show that a class of channels previously studied in the context of approximate encryption lead to counterexamples for all p > 2.
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
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
The capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
The Capacity of a Quantum Channel for Simultaneous Transmission of Classical and Quantum Information
Devetak, I., & Shor, P. W. (2005) · Communications in Mathematical Physics · doi:10.1007/s00220-005-1317-6 · Cited by 445 · cited 1×
“In addition, the weak additivity conjecture was confirmed for generalized dephasing channels [28], the conjugates of all these channels [29] and some other special classes of channels [16, 30, 31, 32].”
BackgroundRandomizing Quantum States: Constructions and Applications
Hayden, P., Leung, D., Shor, P. W., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1087-6 · Cited by 345 · cited 1×
“Following [47], we call N ǫ -randomizing if for all ρ , In that paper, it was shown that for 0 < ǫ < 1 , ǫ -randomizing channels exist in all dimensions d > 10 ǫ , with n = 134 ǫ 2 d ln d .”
MethodSelf-citationA New Proof of the Quantum Noiseless Coding Theorem
Jozsa, R., & Schumacher, B. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552191 · Cited by 304 · cited 1×
“The classical capacity problem long predates the invention of quantum source coding [1, 2] and was of concern to the founders of information theory themselves [3].”
Background
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
“49 was proved by Hastings (2009), based in part on Hayden and Winter’s disproof of the so-called maximal p-norm multiplicativity conjecture shortly before (Hayden and Winter, 2008).”
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Superadditivity of communication capacity using entangled inputs
Hastings, M. B. (2009) · Nature Physics · doi:10.1038/nphys1224 · Cited by 594
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Metadata
- Authors
- Hayden, P., & Winter, A.
- Venue
- Communications in Mathematical Physics
- Published
- 2008-09-10
- Volume
- 284
- Issue
- 1
- Pages
- 263-280
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2071160621
- Cited by
- 112
- References
- 5
- FWCI
- 17.49
- 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
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.