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

数理解析研究所講究録

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

Benoît Collins

Published Dec 1, 2012• 0 citations
OpenAlex

Abstract

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)$ .

Related papers

Symmetry and Randomness in Quantum Information Theory: Several Applications

Wei Dong Xie

This thesis studies four topics in quantum information theory using tools from representation theory and (high-dimensional) probability theory. \nFirst, we study the nonadditivity of minimum output von Neumann and Rényi entropy of quantum channels. A sketch of the proof by Aubrun, Szarek and Werner for nonadditivity of minimum output entropy is presented, and a slight simplification is given. We show that asymptotically the minimum output entropy of the random channel Ɛ ⊗ Ɛ ⊗ Ɛ* is achieved not by a tripartite genuinely entangled state, but by a tensor product of two states. We also study another model of random channel, and our estimation of the minimum output Rényi entropies fails to show the usefulness of genuine multipartite entanglement for the multiple nonadditivity. \nSecond, we study the generic entanglement in the random near-invariant tensors under the action of 𝔰𝔲(2), and random symmetric invariant tensors under the action of 𝔰𝔲(𝘥) for any 𝘥, serving as an extension of the random invariant tensors under 𝔰𝔲(2). We show that both the random tensors are asymptotically close to a maximally entangled state with respect to any bipartite cut. \nThird, we study efficient quantum certification for states and unitaries. We present an algorithm that uses 𝑂(ε⁻⁴ ln |𝒫|) copies of an unknown state to distinguish whether the unknown state is contained in or ε-far from a finite set 𝒫 of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. The previous study showed that one can distinguish whether an unknown unitary 𝑈 is equal to or ε-far from a known or unknown unitary 𝘝 in fixed dimension with 𝑂(ε⁻²) uses of the unitary, in which an ancilla system should be used. We give an algorithm that distinguishes the two cases with 𝑂(ε⁻¹) uses of the unitary, without using ancilla system or using ancilla system of much smaller dimension. \nFinally, we study the parallel repetition of extended nonlocal game motivated by its connection with multipartite steering and entanglement detection. We show that the probability of winning an 𝑛-fold parallel repetition of commuting nonsignaling extended nonlocal game 𝐺 decreases exponentially in 𝑛, provided that the game value of 𝐺 is strictly less than 1, following the approach used by Lancien and Winter based on de Finetti reduction.

•Jan 1, 2020•0 citations

QUANTIZATION OF INFORMATION THEORY (Mathematical Studies on Independence and Dependence Structure : Algebra meets Probability : RIMS研究集会報告集)

Ichiro Fujimoto, 英男 宮田

In scope of $CP$ -convexity theory for $C^{*}$ -algebras (quantization of convexity, measure, entropy for completely positive maps), we investigate the operational stmcture of quantum interactions of entangled systems, and propose new information quantities which naturally generalize the classical information theory.

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

Additivity violation of the regularized minimum output entropy

Sang-Gyun Youn, Benoît Collins

The problem of additivity of the Minimum Output Entropy is of fundamental importance in Quantum Information Theory (QIT). It was solved by Matthew B. Hastings [“Superadditivity of communication capacity using entangled inputs”, Nature Physics 5, 255–257 (2009; doi:)] in the one-shot case by exhibiting a pair of random quantum channels. However, the initial motivation was arguably to understand regularized quantities, and there was so far no way to solve additivity questions in the regularized case. The purpose of this paper is to give a solution to this problem. Specifically, we exhibit a pair of quantum channels that unearths additivity violation of the regularized minimum output entropy. Unlike previously known results in the one-shot case, our construction is non-random, infinite-dimensional, and in the commuting-operator setup. The commuting-operator setup is equivalent to the tensor-product setup in the finite-dimensional case for this problem, but their difference in the infinite-dimensional setting has attracted substantial attention and legitimacy recently in QIT with the celebrated resolutions of Tsirelson's and Connes embedding problem [ Z. Ji et al., “ \mathsf{MIP}^*= \mathsf{RE} ”, Preprint, ], Likewise, it is not clear that our approach works in the finite-dimensional setup. Our strategy of proof relies on developing a variant of the Haagerup inequality optimized for a product of free groups.

arXiv:1907.07856•Documenta Mathematica•Jan 1, 2022•6 citations

Quantum Channels and their Minimum Output Entropies

Nathan Mehlhop, William Travis Ogletree

We investigate non-random quantum channels generated from the representation the- ory of orthogonal quantum groups to perform numerical computations for estimates of their minimum output entropies. In doing so, we address the violation of the additiv- ity conjecture for minimum output entropies, previously established through probabilistic proofs. This violation is relevant because given two quantum channels whose minimum output entropies sum to a value greater than the minimum output entropy of their tensor product channel it can be shown that more information can be sent with greater fidelity via the two channels in parallel than by using each separately. This is directly related to the relevance of quantum entanglement in quantum information theory. \nWe numerically compute minimum output entropies for single quantum channels and tensor products of quantum channels with respect to both Von Neumann and Renyi en- tropies. We then proceed to compute entropy estimates for nonplanar channels directly with Temperley-Lieb Category Theory. We conclude by discussing which of our choices for channels are optimal for entangled inputs.

•May 23, 2018•0 citations

Counterexamples to additivity of minimum output $p$-Rényi entropy of quantum channels for all $p\ge 0$

Debbie Leung, Benjamin Lovitz, Ion Nechita +1 more

The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order $p>1$, at the von Neumann point $p=1$, and for sufficiently small positive $p$, while much of the interval $0<p<1$ has remained open. In this work, we prove that for every $p>0$ there exist finite-dimensional quantum channels whose minimum output $p$-Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for $p>3/4$, and antisymmetric postprocessing extends the violation to all positive Rényi orders. Our estimates also improve the output-dimension bound obtained by Belinschi, Collins, and Nechita for additivity violation of minimum output von Neumann entropy.

quant-pharXiv:2607.15210•Jul 17, 2026•8 citations

Random matrix techniques in quantum information theory

Benoît Collins, Ion Nechita

The purpose of this review is to present some of the latest developments using random techniques, and in particular, random matrix techniques in quantum information theory. Our review is a blend of a rather exhaustive review and of more detailed examples—coming mainly from research projects in which the authors were involved. We focus on two main topics, random quantum states and random quantum channels. We present results related to entropic quantities, entanglement of typical states, entanglement thresholds, the output set of quantum channels, and violations of the minimum output entropy of random channels.

arXiv:1509.04689•Journal of Mathematical Physics•Dec 10, 2015•126 citations
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 Hp(x):=11−plog⁡∑i=1kxip.H^{p}(x):= \frac{1}{1-p}\log\sum_{i=1}^{k}x_{i}^{p}.Hp(x):=1−p1​log∑i=1k​xip​.2010 Mathematics Subject Cassification.46L65(46L37,46L54,.46L87)46L65(46L37,46L54,.46L87)46L65(46L37,46L54,.46L87) .
This thesis studies four topics in quantum information theory using tools from representation theory and (high-dimensional) probability theory. \nFirst, we study the nonadditivity of minimum output von Neumann and Rényi entropy of quantum channels. A sketch of the proof by Aubrun, Szarek and Werner for nonadditivity of minimum output entropy is presented, and a slight simplification is given. We show that asymptotically the minimum output entropy of the random channel Ɛ ⊗ Ɛ ⊗ Ɛ* is achieved not by a tripartite genuinely entangled state, but by a tensor product of two states. We also study another model of random channel, and our estimation of the minimum output Rényi entropies fails to show the usefulness of genuine multipartite entanglement for the multiple nonadditivity. \nSecond, we study the generic entanglement in the random near-invariant tensors under the action of 𝔰𝔲(2), and random symmetric invariant tensors under the action of 𝔰𝔲(𝘥) for any 𝘥, serving as an extension of the random invariant tensors under 𝔰𝔲(2). We show that both the random tensors are asymptotically close to a maximally entangled state with respect to any bipartite cut. \nThird, we study efficient quantum certification for states and unitaries. We present an algorithm that uses 𝑂(ε⁻⁴ ln |𝒫|) copies of an unknown state to distinguish whether the unknown state is contained in or ε-far from a finite set 𝒫 of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. The previous study showed that one can distinguish whether an unknown unitary 𝑈 is equal to or ε-far from a known or unknown unitary 𝘝 in fixed dimension with 𝑂(ε⁻²) uses of the unitary, in which an ancilla system should be used. We give an algorithm that distinguishes the two cases with 𝑂(ε⁻¹) uses of the unitary, without using ancilla system or using ancilla system of much smaller dimension. \nFinally, we study the parallel repetition of extended nonlocal game motivated by its connection with multipartite steering and entanglement detection. We show that the probability of winning an 𝑛-fold parallel repetition of commuting nonsignaling extended nonlocal game 𝐺 decreases exponentially in 𝑛, provided that the game value of 𝐺 is strictly less than 1, following the approach used by Lancien and Winter based on de Finetti reduction.
In scope of CPCPCP -convexity theory for C∗C^{*}C∗ -algebras (quantization of convexity, measure, entropy for completely positive maps), we investigate the operational stmcture of quantum interactions of entangled systems, and propose new information quantities which naturally generalize the classical information theory.
The problem of additivity of the Minimum Output Entropy is of fundamental importance in Quantum Information Theory (QIT). It was solved by Matthew B. Hastings [“Superadditivity of communication capacity using entangled inputs”, Nature Physics 5, 255–257 (2009; doi:)] in the one-shot case by exhibiting a pair of random quantum channels. However, the initial motivation was arguably to understand regularized quantities, and there was so far no way to solve additivity questions in the regularized case. The purpose of this paper is to give a solution to this problem. Specifically, we exhibit a pair of quantum channels that unearths additivity violation of the regularized minimum output entropy. Unlike previously known results in the one-shot case, our construction is non-random, infinite-dimensional, and in the commuting-operator setup. The commuting-operator setup is equivalent to the tensor-product setup in the finite-dimensional case for this problem, but their difference in the infinite-dimensional setting has attracted substantial attention and legitimacy recently in QIT with the celebrated resolutions of Tsirelson's and Connes embedding problem [ Z. Ji et al., “ \mathsf{MIP}^*= \mathsf{RE} ”, Preprint, ], Likewise, it is not clear that our approach works in the finite-dimensional setup. Our strategy of proof relies on developing a variant of the Haagerup inequality optimized for a product of free groups.
We investigate non-random quantum channels generated from the representation the- ory of orthogonal quantum groups to perform numerical computations for estimates of their minimum output entropies. In doing so, we address the violation of the additiv- ity conjecture for minimum output entropies, previously established through probabilistic proofs. This violation is relevant because given two quantum channels whose minimum output entropies sum to a value greater than the minimum output entropy of their tensor product channel it can be shown that more information can be sent with greater fidelity via the two channels in parallel than by using each separately. This is directly related to the relevance of quantum entanglement in quantum information theory. \nWe numerically compute minimum output entropies for single quantum channels and tensor products of quantum channels with respect to both Von Neumann and Renyi en- tropies. We then proceed to compute entropy estimates for nonplanar channels directly with Temperley-Lieb Category Theory. We conclude by discussing which of our choices for channels are optimal for entangled inputs.
Counterexamples to additivity of minimum output ppp-Rényi entropy of quantum channels for all p≥0p\ge 0p≥0
The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order p>1p>1p>1, at the von Neumann point p=1p=1p=1, and for sufficiently small positive ppp, while much of the interval 0<p<10<p<10<p<1 has remained open. In this work, we prove that for every p>0p>0p>0 there exist finite-dimensional quantum channels whose minimum output ppp-Rényi entropies violate additivity. Our proof combines two constructions: random projection-induced channels yield nonadditivity for p>3/4p>3/4p>3/4, and antisymmetric postprocessing extends the violation to all positive Rényi orders. Our estimates also improve the output-dimension bound obtained by Belinschi, Collins, and Nechita for additivity violation of minimum output von Neumann entropy.
The purpose of this review is to present some of the latest developments using random techniques, and in particular, random matrix techniques in quantum information theory. Our review is a blend of a rather exhaustive review and of more detailed examples—coming mainly from research projects in which the authors were involved. We focus on two main topics, random quantum states and random quantum channels. We present results related to entropic quantities, entanglement of typical states, entanglement thresholds, the output set of quantum channels, and violations of the minimum output entropy of random channels.