Search

There are none., Comment: 9 pages, no figures

In this work we analyze properties of generic quantum channels in the case of large system size. We use random matrix theory and free probability to show that the distance between two independent random channels converges to a constant value as the dimension of the system grows larger. As a measure of the distance we use the diamond norm. In the case of a flat Hilbert-Schmidt distribution on quantum channels, we obtain that the distance converges to $\frac12 + \frac{2}{\pi}$, giving also an estimate for the maximum success probability for distinguishing the channels. We also consider the problem of distinguishing two random unitary rotations., Comment: 30 pages, commets are welcome

Inspired by some problems in Quantum Information Theory, we present some results concerning decompositions of positive operators acting on finite dimensional Hilbert spaces. We focus on decompositions by families having geometrical symmetry with respect to the Euclidean scalar product and we characterize all such decompositions, comparing our results with the case of SIC--POVMs from Quantum Information Theory. We also generalize some Welch--type inequalities from the literature.

We investigate meandric systems with a large number of loops using tools inspired by free probability. For any fixed integer $r$, we express the generating function of meandric systems on $2n$ points with $n-r$ loops in terms of a finite (the size depends on $r$) subclass of irreducible meandric systems, via the moment-cumulant formula from free probability theory. We show that the generating function, after an appropriate change of variable, is a rational function, and we bound its degree. Exact expressions for the generating functions are obtained for $r \leq 6$, as well as the asymptotic behavior of the meandric numbers for general $r$., Comment: Minor revision. 22 pages. To view supplementary material, please download and extract the file listed under "Other formats"

We study the structure of bipartite unitary operators which generate via the Stinespring dilation theorem, quantum operations preserving some given matrix algebra, independently of the ancilla state. We characterize completely the unitary operators preserving diagonal, block-diagonal, and tensor product algebras. Some unexpected connections with the theory of quantum Latin squares are explored, and we introduce and study a Sinkhorn-like algorithm used to randomly generate quantum Latin squares., Comment: a new reference added and minor modifications

We study the matrix models $\pi:C(S_N^+)\to M_N(C(X))$ which are flat, in the sense that the standard generators of $C(S_N^+)$ are mapped to rank 1 projections. Our first result is a generalization of the Pauli matrix construction at $N=4$, using finite groups and 2-cocycles. Our second result is the construction of a universal representation of $C(S_N^+)$, inspired from the Sinkhorn algorithm, that we conjecture to be inner faithful., Comment: 22 pages

We investigate unitary operators acting on a tensor product space, with the property that the quantum channels they generate, via the Stinespring dilation theorem, are of a particular type, independently of the state of the ancilla system in the Stinespring relation. The types of quantum channels we consider are those of interest in quantum information theory: unitary conjugations, constant channels, unital channels, mixed unitary channels, PPT channels, and entanglement breaking channels. For some of the classes of bipartite unitary operators corresponding to the above types of channels, we provide explicit characterizations, necessary and/or sufficient conditions for membership, and we compute the dimension of the corresponding algebraic variety. Inclusions between these classes are considered, and we show that for small dimensions, many of these sets are identical., Comment: v2: references [14,15] added, as well as various comments and clarifications

The purpose of this review article 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, combined with more detailed examples -- coming 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.

We study random matrices acting on tensor product spaces which have been transformed by a linear block operation. Using operator-valued free probability theory, under some mild assumptions on the linear map acting on the blocks, we compute the asymptotic eigenvalue distribution of the modified matrices in terms of the initial asymptotic distribution. Moreover, using recent results on operator-valued subordination, we present an algorithm that computes, numerically but in full generality, the limiting eigenvalue distribution of the modified matrices. Our analytical results cover many cases of interest in quantum information theory: we unify some known results and we obtain new distributions and various generalizations.

We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in more general maps, asking only for $k$-positivity instead of the complete positivity required of quantum channels. Unlike the theory of completely positive maps, the theory of $k$-positive maps is far from being completely understood, and our techniques give many new parametrized families of such maps. We also establish a conceptual link with free probability theory, and show that our constructions can be obtained to some extent without random techniques in the setup of free products of von Neumann algebras. Finally, we study the properties of our examples and show that for some parameters, they are indecomposable. In particular, they can be used to detect the presence of entanglement missed by the partial transposition test, that is, PPT entanglement. As an application, we considerably refine our understanding of PPT states in the case where one of the spaces is large whereas the other one remains small.

We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the resulting bipartite quantum state satisfies the reduction criterion in different asymptotic regimes. We consider as well the basis-independent version of the reduction criterion (the absolute reduction criterion), computing thresholds for the corresponding eigenvalue sets. We do the same for other sets relevant in the study of absolute separability, using techniques from random matrix theory. Finally, we gather and compare the known values for the thresholds corresponding to different entanglement criteria, and conclude with a list of open questions.

Inspired by Montanaro's work, we introduce the concept of additivity rates of a quantum channel $L$, which give the first order (linear) term of the minimum output $p$-R\'enyi entropies of $L^{\otimes r}$ as functions of $r$. We lower bound the additivity rates of arbitrary quantum channels using the operator norms of several interesting matrices including partially transposed Choi matrices. As a direct consequence, we obtain upper bounds for the classical capacity of the channels. We study these matrices for random quantum channels defined by random subspaces of a bipartite tensor product space. A detailed spectral analysis of the relevant random matrix models is performed, and strong convergence towards free probabilistic limits is showed. As a corollary, we compute the threshold for random quantum channels to have the positive partial transpose (PPT) property. We then show that a class of random PPT channels violate generically additivity of the $p$-R\'enyi entropy for all $p\geq30.95$., Comment: minor changes; a typo in the statement of Proposition 4.8 was corrected

We study quantum channels with respect to their image, i.e., the image of the set of density operators under the action of the channel. We first characterize the set of quantum channels having polytopic images and show that additivity of the minimal output entropy can be violated in this class. We then provide a complete characterization of quantum channels $T$ that are universally image additive in the sense that for any quantum channel $S$, the image of $T \otimes S$ is the convex hull of the tensor product of the images of $T$ and $S$. These channels turn out to form a strict subset of entanglement breaking channels with polytopic images and a strict superset of classical-quantum channels.

We study the problem of whether all bipartite quantum states having a prescribed spectrum remain positive under the reduction map applied to one subsystem. We provide necessary and sufficient conditions, in the form of a family of linear inequalities, which the spectrum has to verify. Our conditions become explicit when one of the two subsystems is a qubit, as well as for further sets of states. Finally, we introduce a family of simple entanglement criteria for spectra, closely related to the reduction and positive partial transpose criteria, which also provide new insight into the set of spectra that guarantee separability or positivity of the partial transpose., Comment: Linear Algebra and its Applications (2015)

In this paper we study the reduction criterion for detecting entanglement of large dimensional bipartite quantum systems. We first obtain an explicit formula for the moments of a random quantum state to which the reduction criterion has been applied. We show that the empirical eigenvalue distribution of this random matrix converges strongly to a limit that we compute, in three different asymptotic regimes. We then employ tools from free probability to study the asymptotic positivity of the reduction operators. Finally, we compare the reduction criterion with other entanglement criteria, via thresholds.

We study the asymptotic behavior of the output states of sequences of quantum channels. Under a natural assumption, we show that the output set converges to a compact convex set, clarifying and substantially generalizing results in [BCN13]. Random mixed unitary channels satisfy the assumption; we give a formula for the asymptotic maximum output infinity norm and we show that the minimum output entropy and the Holevo capacity have a simple relation for the complementary channels. We also give non-trivial examples of sequences $\Phi_n$ such that along with any other quantum channel $\Xi$, we have convergence of the output set of $\Phi_n$ and $\Phi_n\otimes \Xi$ simultaneously; the case when $\Xi$ is entanglement breaking is investigated in details.

Two submatrices $A,D$ of a Hadamard matrix $H$ are called complementary if, up to a permutation of rows and columns, $H=[^A_C{\ }^B_D]$. We find here an explicit formula for the polar decomposition of $D$. As an application, we show that under suitable smallness assumptions on the size of $A$, the complementary matrix $D$ is an almost Hadamard sign pattern, i.e. its rescaled polar part is an almost Hadamard matrix.

We investigate the set of quantum channels acting on a single qubit. We provide an alternative, compact generalization of the Fujiwara-Algoet conditions for complete positivity to non-unital qubit channels, which we then use to characterize the possible geometric forms of the pure output of the channel. We provide universal sets of quantum channels for all unital qubit channels as well as for all extremal (not necessarily unital) qubit channels, in the sense that all qubit channels in these sets can be obtained by concatenation of channels in the corresponding universal set. We also show that our universal sets are essentially minimal., Comment: 34 pages of revtex, 3 figures. v2: minor typos corrected

In a previous paper, we proved that the limit of the collection of possible eigenvalues of output states of a random quantum channel is a deterministic, compact set K_{k,t}. We also showed that the set K_{k,t} is obtained, up to an intersection, as the unit ball of the dual of a free compression norm. In this paper, we identify the maximum of l^p norms on the set K_{k,t} and prove that the maximum is attained on a vector of shape (a,b,...,b) where a > b. In particular, we compute the precise limit value of the minimum output entropy of a single random quantum channel. As a corollary, we show that for any eps > 0, it is possible to obtain a violation for the additivity of the minimum output entropy for an output dimension as low as 183, and that for appropriate choice of parameters, the violation can be as large as log 2 - eps. Conversely, our result implies that, with probability one, one does not obtain a violation of additivity using conjugate random quantum channels and the Bell state, in dimension 182 and less., Comment: v3: appendix replaced by Lemma 3.8

Random pure states of multi-partite quantum systems, associated with arbitrary graphs, are investigated. Each vertex of the graph represents a generic interaction between subsystems, described by a random unitary matrix distributed according to the Haar measure, while each edge of the graph represents a bi-partite, maximally entangled state. For any splitting of the graph into two parts we consider the corresponding partition of the quantum system and compute the average entropy of entanglement. First, in the special case where the partition does not "cross" any vertex of the graph, we show that the area law is satisfied exactly. In the general case, we show that the entropy of entanglement obeys an area law on average, this time with a correction term that depends on the topologies of the graph and of the partition. The results obtained are applied to the problem of distribution of quantum entanglement in a quantum network with prescribed topology., Comment: v2: minor typos corrected

We investigate the problem of counting the real or complex Hadamard matrices which are circulant, by using analytic methods. Our main observation is the fact that for $|q_0|=...=|q_{N-1}|=1$ the quantity $\Phi=\sum_{i+k=j+l}\frac{q_iq_k}{q_jq_l}$ satisfies $\Phi\geq N^2$, with equality if and only if $q=(q_i)$ is the eigenvalue vector of a rescaled circulant complex Hadamard matrix. This suggests three analytic problems, namely: (1) the brute-force minimization of $\Phi$, (2) the study of the critical points of $\Phi$, and (3) the computation of the moments of $\Phi$. We explore here these questions, with some results and conjectures., Comment: 26 pages

It is now well-known that, with high probability, the additivity of minimum output entropy does not hold for a pair of a random quantum channel and its complex conjugate. We investigate asymptotic behavior of output states of $r$-tensor powers of such pairs, as the dimension of inputs grows. We compute the limit output states for any sequence of well-behaved inputs, which consist of a large class of input states having a nice set of parameters. Then, we show that among these input states tensor products of Bell states give asymptotically the least output entropy, giving positive mathematical evidence towards additivity of above pairs of channels.

In our previous work, we introduced the following relaxation of the Hadamard property: a square matrix $H\in M_N(\mathbb R)$ is called "almost Hadamard" if $U=H/\sqrt{N}$ is orthogonal, and locally maximizes the 1-norm on O(N). We review our previous results, notably with the formulation of a new question, regarding the circulant and symmetric case. We discuss then an extension of the almost Hadamard matrix formalism, by making use of the p-norm on O(N), with $p\in[1,\infty]-{2}$, with a number of theoretical results on the subject, and the formulation of some open problems., Comment: 20 pages

In this paper, we study the behaviour of the output of pure entangled states after being transformed by a product of conjugate random unitary channels. This study is motivated by the counterexamples by Hastings and Hayden-Winter to the additivity problems. In particular, we study in depth the difference of behaviour between random unitary channels and generic random channels. In the case where the number of unitary operators is fixed, we compute the limiting eigenvalues of the output states. In the case where the number of unitary operators grows linearly with the dimension of the input space, we show that the eigenvalue distribution converges to a limiting shape that we characterize with free probability tools. In order to perform the required computations, we need a systematic way of dealing with moment problems for random matrices whose blocks are i.i.d. Haar distributed unitary operators. This is achieved by extending the graphical Weingarten calculus introduced in Collins and Nechita (2010).

We study how the realignment criterion (also called computable cross-norm criterion) succeeds asymptotically in detecting whether random states are separable or entangled. We consider random states on $\C^d \otimes \C^d$ obtained by partial tracing a Haar-distributed random pure state on $\C^d \otimes \C^d \otimes \C^s$ over an ancilla space $\C^s$. We show that, for large $d$, the realignment criterion typically detects entanglement if and only if $s \leq (8/3\pi)^2 d^2$. In this sense, the realignment criterion is asymptotically weaker than the partial transposition criterion.

We develop a general theory of "almost Hadamard matrices". These are by definition the matrices $H\in M_N(\mathbb R)$ having the property that $U=H/\sqrt{N}$ is orthogonal, and is a local maximum of the 1-norm on O(N). Our study includes a detailed discussion of the circulant case ($H_{ij}=\gamma_{j-i}$) and of the two-entry case ($H_{ij}\in{x,y}$), with the construction of several families of examples, and some 1-norm computations., Comment: 24 pages

We introduce a new family of probability distributions on the set of pure states of a finite dimensional quantum system. Without any a priori assumptions, the most natural measure on the set of pure state is the uniform (or Haar) measure. Our family of measures is indexed by a time parameter $t$ and interpolates between a deterministic measure ($t=0$) and the uniform measure ($t=\infty$). The measures are constructed using a Brownian motion on the unitary group $\mathcal U_N$. Remarkably, these measures have a $\mathcal U_{N-1}$ invariance, whereas the usual uniform measure has a $\mathcal U_N$ invariance. We compute several averages with respect to these measures using as a tool the Laplace transform of the coordinates.

We study the random matrices of type $\tilde{W}=(id\otimes\varphi)W$, where $W$ is a complex Wishart matrix of parameters $(dn,dm)$, and $\varphi:M_n(\mathbb C)\to M_n(\mathbb C)$ is a self-adjoint linear map. We prove that, under suitable assumptions, we have the $d\to\infty$ eigenvalue distribution formula $\delta m\tilde{W}\sim\pi_{mn\rho}\boxtimes\nu$, where $\rho$ is the law of $\varphi$, viewed as a square matrix, $\pi$ is the free Poisson law, $\nu$ is the law of $D=\varphi(1)$, and $\delta=tr(D)$., Comment: 18 pages

We consider the image of some classes of bipartite quantum states under a tensor product of random quantum channels. Depending on natural assumptions that we make on the states, the eigenvalues of their outputs have new properties which we describe. Our motivation is provided by the additivity questions in quantum information theory, and we build on the idea that a Bell state sent through a product of conjugated random channels has at least one large eigenvalue. We generalize this setting in two directions. First, we investigate general entangled pure inputs and show that that Bell states give the least entropy among those inputs in the asymptotic limit. We then study mixed input states, and obtain new multi-scale random matrix models that allow to quantify the difference of the outputs' eigenvalues between a quantum channel and its complementary version in the case of a non-pure input., Comment: 21 pages, 9 figures

In this paper, we first obtain an algebraic formula for the moments of a centered Wishart matrix, and apply it to obtain new convergence results in the large dimension limit when both parameters of the distribution tend to infinity at different speeds. We use this result to investigate APPT (absolute positive partial transpose) quantum states. We show that the threshold for a bipartite random induced state on $\C^d=\C^{d_1} \otimes \C^{d_2}$, obtained by partial tracing a random pure state on $\C^d \otimes \C^s$, being APPT occurs if the environmental dimension $s$ is of order $s_0=\min(d_1, d_2)^3 \max(d_1, d_2)$. That is, when $s \geq Cs_0$, such a random induced state is APPT with large probability, while such a random states is not APPT with large probability when $s \leq cs_0 $. Besides, we compute effectively $C$ and $c$ and show that it is possible to replace them by the same sharp transition constant when $\min(d_1, d_2)^{2}\ll d$., Comment: 22 pages, 1 figure

We study the partial transposition ${W}^\Gamma=(\mathrm{id}\otimes \mathrm{t})W\in M_{dn}(\mathbb C)$ of a Wishart matrix $W\in M_{dn}(\mathbb C)$ of parameters $(dn,dm)$. Our main result is that, with $d\to\infty$, the law of $m{W}^\Gamma$ is a free difference of free Poisson laws of parameters $m(n\pm 1)/2$. Motivated by questions in quantum information theory, we also derive necessary and sufficient conditions for these measures to be supported on the positive half line.

We show that $\ell_p$ norms are characterized as the unique norms which are both invariant under coordinate permutation and multiplicative with respect to tensor products. Similarly, the $L_p$ norms are the unique rearrangement-invariant norms on a probability space such that $\|X Y\|=\|X\|\cdot\|Y\|$ for every pair $X,Y$ of independent random variables. Our proof relies on Cram\'er's large deviation theorem., Comment: 8 pages, 1 figure

We study various methods to generate ensembles of random density matrices of a fixed size N, obtained by partial trace of pure states on composite systems. Structured ensembles of random pure states, invariant with respect to local unitary transformations are introduced. To analyze statistical properties of quantum entanglement in bi-partite systems we analyze the distribution of Schmidt coefficients of random pure states. Such a distribution is derived in the case of a superposition of k random maximally entangled states. For another ensemble, obtained by performing selective measurements in a maximally entangled basis on a multi--partite system, we show that this distribution is given by the Fuss-Catalan law and find the average entanglement entropy. A more general class of structured ensembles proposed, containing also the case of Bures, forms an extension of the standard ensemble of structureless random pure states, described asymptotically, as N \to \infty, by the Marchenko-Pastur distribution., Comment: 13 pages in latex with 8 figures included

Using the graphical calculus and integration techniques introduced by the authors, we study the statistical properties of outputs of products of random quantum channels for entangled inputs. In particular, we revisit and generalize models of relevance for the recent counterexamples to the minimum output entropy additivity problems. Our main result is a classification of regimes for which the von Neumann entropy is lower on average than the elementary bounds that can be obtained with linear algebra techniques.

For any graph consisting of $k$ vertices and $m$ edges we construct an ensemble of random pure quantum states which describe a system composed of $2m$ subsystems. Each edge of the graph represents a bi-partite, maximally entangled state. Each vertex represents a random unitary matrix generated according to the Haar measure, which describes the coupling between subsystems. Dividing all subsystems into two parts, one may study entanglement with respect to this partition. A general technique to derive an expression for the average entanglement entropy of random pure states associated to a given graph is presented. Our technique relies on Weingarten calculus and flow problems. We analyze statistical properties of spectra of such random density matrices and show for which cases they are described by the free Poissonian (Marchenko-Pastur) distribution. We derive a discrete family of generalized, Fuss-Catalan distributions and explicitly construct graphs which lead to ensembles of random states characterized by these novel distributions of eigenvalues., Comment: 37 pages, 24 figures

In this paper, we present applications of the calculus developed in Collins and Nechita [Comm. Math. Phys. 297 (2010) 345-370] and obtain an exact formula for the moments of random quantum channels whose input is a pure state thanks to Gaussianization methods. Our main application is an in-depth study of the random matrix model introduced by Hayden and Winter [Comm. Math. Phys. 284 (2008) 263-280] and used recently by Brandao and Horodecki [Open Syst. Inf. Dyn. 17 (2010) 31-52] and Fukuda and King [J. Math. Phys. 51 (2010) 042201] to refine the Hastings counterexample to the additivity conjecture in quantum information theory. This model is exotic from the point of view of random matrix theory as its eigenvalues obey two different scalings simultaneously. We study its asymptotic behavior and obtain an asymptotic expansion for its von Neumann entropy., Comment: Published in at http://dx.doi.org/10.1214/10-AAP722 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

In this article, we derive the stochastic master equations corresponding to the statistical model of a heat bath. These stochastic differential equations are obtained as continuous time limits of discrete models of quantum repeated measurements. Physically, they describe the evolution of a small system in contact with a heat bath undergoing continuous measurement. The equations obtained in the present work are qualitatively different from the ones derived in \cite{A1P1}, where the Gibbs model of heat bath has been studied. It is shown that the statistical model of a heat bath provides clear physical interpretation in terms of emissions and absorptions of photons. Our approach yields models of random environment and unravelings of stochastic master equations. The equations are rigorously obtained as solutions of martingale problems using the convergence of Markov generators.

In this paper we obtain new bounds for the minimum output entropies of random quantum channels. These bounds rely on random matrix techniques arising from free probability theory. We then revisit the counterexamples developed by Hayden and Winter to get violations of the additivity equalities for minimum output R\'enyi entropies. We show that random channels obtained by randomly coupling the input to a qubit violate the additivity of the $p$-R\'enyi entropy. For some sequences of random quantum channels, we compute almost surely the limit of their Schatten $S_1 \to S_p$ norms., Comment: 3 figures added, minor typos corrected

This paper is the first of a series where we study quantum channels from the random matrix point of view. We develop a graphical tool that allows us to compute the expected moments of the output of a random quantum channel. As an application, we study variations of random matrix models introduced by Hayden \cite{hayden}, and show that their eigenvalues converge almost surely. In particular we obtain for some models sharp improvements on the value of the largest eigenvalue, and this is shown in a further work to have new applications to minimal output entropy inequalities., Comment: Several typos were corrected

We consider a generalized model of repeated quantum interactions, where a system $\mathcal{H}$ is interacting in a random way with a sequence of independent quantum systems $\mathcal{K}_n, n \geq 1$. Two types of randomness are studied in detail. One is provided by considering Haar-distributed unitaries to describe each interaction between $\mathcal{H}$ and $\mathcal{K}_n$. The other involves random quantum states describing each copy $\mathcal{K}_n$. In the limit of a large number of interactions, we present convergence results for the asymptotic state of $\mathcal{H}$. This is achieved by studying spectral properties of (random) quantum channels which guarantee the existence of unique invariant states. Finally this allows to introduce a new physically motivated ensemble of random density matrices called the \emph{asymptotic induced ensemble}.

We prove that the free Fock space ${\F}(\R^+;\C)$, which is very commonly used in Free Probability Theory, is the continuous free product of copies of the space $\C^2$. We describe an explicit embedding and approximation of this continuous free product structure by means of a discrete-time approximation: the free toy Fock space, a countable free product of copies of $\C^2$. We show that the basic creation, annihilation and gauge operators of the free Fock space are also limits of elementary operators on the free toy Fock space. When applying these constructions and results to the probabilistic interpretations of these spaces, we recover some discrete approximations of the semi-circular Brownian motion and of the free Poisson process. All these results are also extended to the higher multiplicity case, that is, ${\F}(\R^+;\C^N)$ is the continuous free product of copies of the space $\C^{N+1}$.

In this paper, we generalize a permutation model for free random variables which was first proposed by Biane in \cite{biane}. We also construct its classical probability analogue, by replacing the group of permutations with the group of subsets of a finite set endowed with the symmetric difference operation. These constructions provide new discrete approximations of the respective free and classical Wiener chaos. As a consequence, we obtain explicit examples of non random matrices which are asymptotically free or independent. The moments and the free (resp. classical) cumulants of the limiting distributions are expressed in terms of a special subset of (noncrossing) pairings. At the end of the paper we present some combinatorial applications of our results., Comment: 13 pages, to appear in Pacific Journal of Mathematics

We study how iterated convolutions of probability measures compare under stochastic domination. We give necessary and sufficient conditions for the existence of an integer $n$ such that $\mu^{*n}$ is stochastically dominated by $\nu^{*n}$ for two given probability measures $\mu$ and $\nu$. As a consequence we obtain a similar theorem on the majorization order for vectors in $\R^d$. In particular we prove results about catalysis in quantum information theory.

We investigate random density matrices obtained by partial tracing larger random pure states. We show that there is a strong connection between these random density matrices and the Wishart ensemble of random matrix theory. We provide asymptotic results on the behavior of the eigenvalues of random density matrices, including convergence of the empirical spectral measure. We also study the largest eigenvalue (almost sure convergence and fluctuations).

An important problem in quantum information theory is the mathematical characterization of the phenomenon of quantum catalysis: when can the surrounding entanglement be used to perform transformations of a jointly held quantum state under LOCC (local operations and classical communication) ? Mathematically, the question amounts to describe, for a fixed vector $y$, the set $T(y)$ of vectors $x$ such that we have $x \otimes z \prec y \otimes z$ for some $z$, where $\prec$ denotes the standard majorization relation. Our main result is that the closure of $T(y)$ in the $\ell_1$ norm can be fully described by inequalities on the $\ell_p$ norms: $\|x\|_p \leq \|y\|_p$ for all $p \geq 1$. This is a first step towards a complete description of $T(y)$ itself. It can also be seen as a $\ell_p$-norm analogue of Ky Fan dominance theorem about unitarily invariant norms. The proofs exploits links with another quantum phenomenon: the possibiliy of multiple-copy transformations ($x^{\otimes n} \prec y^{\otimes n}$ for given $n$). The main new tool is a variant of Cram\'er$ theorem on large deviations for sums of i.i.d. random variables.