Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of the Society Conference of IEICE

AP-1-1 ADDITIVITY PROBLEMS IN QUANTUM INFORMATION THEORY

Masahito Hayashi

Published Sep 7, 2005• 0 citations
OpenAlex

Related papers

Additivity conjectures in quantum information theory

Motohisa Fukuda

•Jul 10, 2007•0 citations

TWO MATHEMATICAL PROBLEMS IN QUANTUM INFORMATION THEORY

Alexander Semenovich Holevo

We survey the modern status of two major analytical problems in quantum information theory. One is the famous additivity conjecture for information quantities related to the classical capacity of quantum channel. Another is less familiar and less studied problem of optimizers of the information quantities characterizing Bosonic Gaussian channels. We show that for gauge-invariant channels, the validity of the Gaussian minimizer conjecture for the output entropy implies Gaussianity of the ensemble maximizing the χ-capacity.

Lecture notes series, Institute For Mathematical Sciences•Jun 1, 2010•1 citation

Simplification of Additivity Conjecture in Quantum Information Theory

Motohisa Fukuda

arXiv:quant-ph/0608010•Quantum Information Processing•Mar 14, 2007•23 citations

APPLICATIONS OF FREE PROBABILITY TO QUANTUM INFORMATION THEORY (Mathematical Studies on Independence and Dependence Structure : Algebra meets Probability)

Benoît Collins

We show how Free Probability Theory-and in particular, recent results regarding the norm convergence of random matrices-help to better understand im- portant problems in Quantum Information Theory, such as the problem of Minimum Output Entropy additivity.This is a report on joint papers and projects with Ion Nechita, Serban Belinschi, Camille Male and Motohisa Fukuda 1. ENTANGLEMENT AND ADDITIVITY 1.1.Entanglement and entropy.In Quantum Information Theory, a vector subspace $C$ of a tensor product $A\otimes B$ of two Hilbert spaces is said to be entangled iff $0$ is the only vector of $C$ that can be written as $a\otimes b$ with $a\in A,$ $b\in B$ .The problems of quantifying entanglement, and of finding 'highly' entangled spaces are very important in quantum information theory.For $x\in A\otimes B$ , its singular values -also known as Schmidt coefficients in Quantum Information Theory-are non-negative numbers $\lambda_{1}(x)\geq\ldots\geq\lambda_{k}(x)\geq 0$ such that $x= \sum_{i=1}^{k}\sqrt{\lambda_{i}}e_{i}(x)\otimes f_{i}(x)$ Here, $k=min($dim(A), $dim(B));e_{i}(x),$ $f_{i}(x)$ are orthonormal vectors.The sequence $\lambda(x)=(\lambda_{1}(x), \ldots)\in \mathbb{R}^{k}$ is uniquely defined.Let $K_{C}=\{\lambda(x), x\in C, ||x||=1\}\subset \mathbb{R}^{k}$ .This compact set is a subset of the set $\triangle_{k}^{+}=\{y\in \mathbb{R}_{+}^{k}:y_{1}\geq y_{2}\geq\cdots\geq y_{k}\geq 0, \sum_{i=1}^{k}y_{i}=1\}.$ Besides, we have $\Delta_{k}^{+}\subset\Delta_{k}$ , where $\Delta_{k}=\{x\in \mathbb{R}_{+}^{k}|\sum_{i=1}^{k}x_{i}=1\}$ is the $(k-1)-$ dimensional probability simplex.We will also make an abuse of notation and also denote by $K_{C}$ the subset of $\triangle_{k}$ that is obtained by symmetrizing $K_{C}$ under permuting the coordinates.For a positive real number $p>0$, we recall that the R\'enyi entropy of order $p$ of a probability vector $x\in\Delta_{k}$ to be $H^{p}(x):= \frac{1}{1-p}\log\sum_{i=1}^{k}x_{i}^{p}.$2010 Mathematics Subject Cassification.$46L65(46L37,46L54,.46L87)$ .

数理解析研究所講究録•Dec 1, 2012•0 citations

FUNDAMENTAL PROBLEMS IN QUANTUM THEORY

John Rarity

•Jan 1, 1995•12 citations

Equivalence of Additivity Questions in Quantum Information Theory

Peter W. Shor

arXiv:quant-ph/0305035•Communications in Mathematical Physics•Apr 1, 2004•107 citations
We survey the modern status of two major analytical problems in quantum information theory. One is the famous additivity conjecture for information quantities related to the classical capacity of quantum channel. Another is less familiar and less studied problem of optimizers of the information quantities characterizing Bosonic Gaussian channels. We show that for gauge-invariant channels, the validity of the Gaussian minimizer conjecture for the output entropy implies Gaussianity of the ensemble maximizing the χ-capacity.
We show how Free Probability Theory-and in particular, recent results regarding the norm convergence of random matrices-help to better understand im- portant problems in Quantum Information Theory, such as the problem of Minimum Output Entropy additivity.This is a report on joint papers and projects with Ion Nechita, Serban Belinschi, Camille Male and Motohisa Fukuda 1. ENTANGLEMENT AND ADDITIVITY 1.1.Entanglement and entropy.In Quantum Information Theory, a vector subspace CCC of a tensor product A⊗BA\otimes BA⊗B of two Hilbert spaces is said to be entangled iff 000 is the only vector of CCC that can be written as a⊗ba\otimes ba⊗b with a∈A,a\in A,a∈A, b∈Bb\in Bb∈B .The problems of quantifying entanglement, and of finding 'highly' entangled spaces are very important in quantum information theory.For x∈A⊗Bx\in A\otimes Bx∈A⊗B , its singular values -also known as Schmidt coefficients in Quantum Information Theory-are non-negative numbers λ1(x)≥…≥λk(x)≥0\lambda_{1}(x)\geq\ldots\geq\lambda_{k}(x)\geq 0λ1​(x)≥…≥λk​(x)≥0 such that x=∑i=1kλiei(x)⊗fi(x)x= \sum_{i=1}^{k}\sqrt{\lambda_{i}}e_{i}(x)\otimes f_{i}(x)x=∑i=1k​λi​​ei​(x)⊗fi​(x) Here, k=min(k=min(k=min(dim(A), dim(B));ei(x),dim(B));e_{i}(x),dim(B));ei​(x), fi(x)f_{i}(x)fi​(x) are orthonormal vectors.The sequence λ(x)=(λ1(x),…)∈Rk\lambda(x)=(\lambda_{1}(x), \ldots)\in \mathbb{R}^{k}λ(x)=(λ1​(x),…)∈Rk is uniquely defined.Let KC={λ(x),x∈C,∣∣x∣∣=1}⊂RkK_{C}=\{\lambda(x), x\in C, ||x||=1\}\subset \mathbb{R}^{k}KC​={λ(x),x∈C,∣∣x∣∣=1}⊂Rk .This compact set is a subset of the set △k+={y∈R+k:y1≥y2≥⋯≥yk≥0,∑i=1kyi=1}.\triangle_{k}^{+}=\{y\in \mathbb{R}_{+}^{k}:y_{1}\geq y_{2}\geq\cdots\geq y_{k}\geq 0, \sum_{i=1}^{k}y_{i}=1\}.△k+​={y∈R+k​:y1​≥y2​≥⋯≥yk​≥0,∑i=1k​yi​=1}. Besides, we have Δk+⊂Δk\Delta_{k}^{+}\subset\Delta_{k}Δk+​⊂Δk​ , where Δk={x∈R+k∣∑i=1kxi=1}\Delta_{k}=\{x\in \mathbb{R}_{+}^{k}|\sum_{i=1}^{k}x_{i}=1\}Δk​={x∈R+k​∣∑i=1k​xi​=1} is the (k−1)−(k-1)-(k−1)− dimensional probability simplex.We will also make an abuse of notation and also denote by KCK_{C}KC​ the subset of △k\triangle_{k}△k​ that is obtained by symmetrizing KCK_{C}KC​ under permuting the coordinates.For a positive real number p>0p>0p>0, we recall that the R\'enyi entropy of order ppp of a probability vector x∈Δkx\in\Delta_{k}x∈Δk​ to be $H^{p}(x):= \frac{1}{1-p}\log\sum_{i=1}^{k}x_{i}^{p}.$2010 Mathematics Subject Cassification.46L65(46L37,46L54,.46L87)46L65(46L37,46L54,.46L87)46L65(46L37,46L54,.46L87) .