Searcharxiv⌕ Search

arXiv subjects

Benoît Collins

Publications and source records attributed to Benoît Collins.

At least 37 records · Page 2Linked to original sources

Matrix models for cyclic monotone and monotone independences

Cyclic monotone independence is an algebraic notion of noncommutative independence, introduced in the study of multi-matrix random matrix models with small rank. Its algebraic form turns out to be surprisingly close to monotone independence, which is why it was named cyclic monotone independence. This paper conceptualizes this notion by showing that the same random matrix model is also a model for the monotone convergence with an appropriately chosen state. This observation provides a unified nonrandom matrix model for both types of monotone independences.

math.OA↗

The tensor Harish-Chandra--Itzykson--Zuber integral II: detecting entanglement in large quantum systems

We consider the recently introduced generalization of the Harish-Chandra--Itzykson--Zuber integral to tensors and discuss its asymptotic behavior when the characteristic size N of the tensors is taken to be large. This study requires us to make assumptions on the scaling with N of the external tensors. We analyze a two-parameter class of asymptotic scaling ansätze, uncovering several non-trivial asymptotic regimes. This study is relevant for analyzing the entanglement properties of multipartite quantum systems. We discuss potential applications of our results to this domain, in particular in the context of randomized local measurements.

math-ph↗

The tensor Harish-Chandra-Itzykson-Zuber integral I: Weingarten calculus and a generalization of monotone Hurwitz numbers

We study a generalization of the Harish-Chandra - Itzykson - Zuber integral to tensors and its expansion over trace-invariants of the two external tensors. This gives rise to natural generalizations of monotone double Hurwitz numbers, which count certain families of constellations. We find an expression of these numbers in terms of monotone simple Hurwitz numbers, thereby also providing expressions for monotone double Hurwitz numbers of arbitrary genus in terms of the single ones. We give an interpretation of the different combinatorial quantities at play in terms of enumeration of nodal surfaces. In particular, our generalization of Hurwitz numbers is shown to enumerate certain isomorphism classes of branched coverings of a bouquet of $D$ 2-spheres that touch at one common non-branch node.

math.CO↗

On spectral distribution of sample covariance matrices from large dimensional and large $k$-fold tensor products

We study the eigenvalue distributions for sums of independent rank-one $k$-fold tensor products of large $n$-dimensional vectors. Previous results in the literature assume that $k=o(n)$ and show that the eigenvalue distributions converge to the celebrated Marčenko-Pastur law under appropriate moment conditions on the base vectors. In this paper, motivated by quantum information theory, we study the regime where $k$ grows faster, namely $k=O(n)$. We show that the moment sequences of the eigenvalue distributions have a limit, which is different from the Marčenko-Pastur law. As a byproduct, we show that the Marčenko-Pastur law limit holds if and only if $k=o(n)$ for this tensor model. The approach is based on the method of moments.

math.PR↗

Concentration estimates for random subspaces of a tensor product, and application to Quantum Information Theory

Given a random subspace $H_n$ chosen uniformly in a tensor product of Hilbert spaces $V_n\otimes W$, we consider the collection $K_n$ of all singular values of all norm one elements of $H_n$ with respect to the tensor structure. A law of large numbers has been obtained for this random set in the context of $W$ fixed and the dimension of $H_n$ and $V_n$ tending to infinity at the same speed in a paper of Belinschi, Collins and Nechita. In this paper, we provide measure concentration estimates in this context. The probabilistic study of $K_n$ was motivated by important questions in Quantum Information Theory, and allowed to provide the smallest known dimension (184) for the dimension an an ancilla space allowing Minimum Output Entropy (MOE) violation. With our estimates, we are able, as an application, to provide actual bounds for the dimension of spaces where violation of MOE occurs.

quant-ph↗

Universal consistency of the $k$-NN rule in metric spaces and Nagata dimension

The $k$ nearest neighbour learning rule (under the uniform distance tie breaking) is universally consistent in every metric space $X$ that is sigma-finite dimensional in the sense of Nagata. This was pointed out by Cérou and Guyader (2006) as a consequence of the main result by those authors, combined with a theorem in real analysis sketched by D. Preiss (1971) (and elaborated in detail by Assouad and Quentin de Gromard (2006)). We show that it is possible to give a direct proof along the same lines as the original theorem of Charles J. Stone (1977) about the universal consistency of the $k$-NN classifier in the finite dimensional Euclidean space. The generalization is non-trivial because of the distance ties being more prevalent in the non-euclidean setting, and on the way we investigate the relevant geometric properties of the metrics and the limitations of the Stone argument, by constructing various examples.

math.MG↗

Additivity violation of the regularized Minimum Output Entropy

The problem of additivity of the Minimum Output Entropy is of fundamental importance in Quantum Information Theory (QIT). It was solved by Hastings 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 which 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 infinite dimensional setting has attracted substantial attention and legitimacy recently in QIT with the celebrated resolutions of Tsirelson's and Connes embedding problem. 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.

math.OA↗

On the operator norm of non-commutative polynomials in deterministic matrices and iid GUE matrices

Let $X^N = (X_1^N,\dots, X^N_d)$ be a d-tuple of $N\times N$ independent GUE random matrices and $Z^{NM}$ be any family of deterministic matrices in $\mathbb{M}_N(\mathbb{C})\otimes \mathbb{M}_M(\mathbb{C})$. Let $P$ be a self-adjoint non-commutative polynomial. A seminal work of Voiculescu shows that the empirical measure of the eigenvalues of $P(X^N)$ converges towards a deterministic measure defined thanks to free probability theory. Let now $f$ be a smooth function, the main technical result of this paper is a precise bound of the difference between the expectation of $$\frac{1}{MN}\text{Tr}\left( f(P(X^N\otimes I_M,Z^{NM})) \right)$$ and its limit when $N$ goes to infinity. If $f$ is six times differentiable, we show that it is bounded by $M^2\left\Vert f\right\Vert_{\mathcal{C}^6}N^{-2}$. As a corollary we obtain a new proof of a result of Haagerup and Thorbjørnsen, later developed by Male, which gives sufficient conditions for the operator norm of a polynomial evaluated in $(X^N,Z^{NM},{Z^{NM}}^*)$ to converge almost surely towards its free limit. Restricting ourselves to polynomials in independent GUE matrices, we give concentration estimates on the largest eingenvalue of these polynomials around their free limit. A direct consequence of these inequalities is that there exists some $β>0$ such that for any $\varepsilon_1<3+β)^{-1}$ and $\varepsilon_2<1/4$, almost surely for $N$ large enough, $$-\frac{1}{N^{\varepsilon_1}}\ \leq \| P(X^N)\| - \left\Vert P(x)\right\Vert \leq\ \frac{1}{N^{\varepsilon_2}}.$$ Finally if $X^N$ and $Y^{M_N}$ are independent and $M_N = o(N^{1/3})$, then almost surely, the norm of any polynomial in $(X^N\otimes I_{M_N},I_N\otimes Y^{M_N})$ converges almost surely towards its free limit. This result is an improvement of a Theorem of Pisier, who was himself using estimates from Haagerup and Thorbjørnsen, where $M_N$ had size $o(N^{1/4})$.

math.PR↗

Matrix models for $\varepsilon$-free independence

We investigate tensor products of random matrices, and show that independence of entries leads asymptotically to $\varepsilon$-free independence, a mixture of classical and free independence studied by Młotkowski and by Speicher and Wysoczański. The particular $\varepsilon$ arising is prescribed by the tensor product structure chosen, and conversely, we show that with suitable choices an arbitrary $\varepsilon$ may be realized in this way. As a result we obtain a new proof that $\mathcal{R}^ω$-embeddability is preserved under graph products of von Neumann algebras, along with an explicit recipe for constructing matrix models.

math.OA↗

Characterization of equivariant maps and application to entanglement detection

We study equivariant linear maps between finite-dimensional matrix algebras, as introduced by Bhat. These maps satisfy an algebraic property which makes it easy to study their positivity or k-positivity. They are therefore particularly suitable for applications to entanglement detection in quantum information theory. We characterize their Choi matrices. In particular, we focus on a subfamily that we call (a, b)-unitarily equivariant. They can be seen as both a generalization of maps invariant under unitary conjugation as studied by Bhat and as a generalization of the equivariant maps studied by Collins et al. Using representation theory, we fully compute them and study their graphical representation, and show that they are basically enough to study all equivariant maps. We finally apply them to the problem of entanglement detection and prove that they form a sufficient (infinite) family of positive maps to detect all k-entangled density matrices.

math-ph↗

Automorphism-invariant positive definite functions on free groups

In this article we raise some new questions about positive definite functions on free groups, and explain how these are related to more well-known questions. The article is intended as a survey of known results that also offers some new perspectives and interesting observations; therefore the style is expository.

math.OA↗

Temperley-Lieb quantum channels

We study a class of quantum channels arising from the representation theory of compact quantum groups that we call Temperley-Lieb quantum channels. These channels simultaneously extend those introduced in [BC18], [AN14], and [LS14]. (Quantum) Symmetries in quantum information theory arise naturally from many points of view, providing an important source of new examples of quantum phenomena, and also serve as useful tools to simplify or solve important problems. This work provides new applications of quantum symmetries in quantum information theory. Among others, we study entropies and capacitites of Temperley-Lieb channels, their (anti-)degradability, PPT and entanglement breaking properties, as well as the behaviour of their tensor products with respect to entangled inpurs. Finally we compare the Tempereley-Lieb channels with the (modified) TRO-channels recently introduced in [GJL16].

math-ph↗

The PPT square conjecture holds generically for some classes of independent states

Let $|ψ\rangle\langle ψ|$ be a random pure state on $\mathbb{C}^{d^2}\otimes \mathbb{C}^s$, where $ψ$ is a random unit vector uniformly distributed on the sphere in $\mathbb{C}^{d^2}\otimes \mathbb{C}^s$. Let $ρ_1$ be random induced states $ρ_1=Tr_{\mathbb{C}^s}(|ψ\rangle\langle ψ|)$ whose distribution is $μ_{d^2,s}$; and let $ρ_2$ be random induced states following the same distribution $μ_{d^2,s}$ independent from $ρ_1$. Let $ρ$ be a random state induced by the entanglement swapping of $ρ_1$ and $ρ_2$. We show that the empirical spectrum of $ρ- {1\mkern -4mu{\rm l}}/d^2$ converges almost surely to the Marcenko-Pastur law with parameter $c^2$ as $d\rightarrow \infty$ and $s/d \rightarrow c$. As an application, we prove that the state $ρ$ is separable generically if $ρ_1, ρ_2$ are PPT entangled.

math-ph↗

Semiclassical asymptotics of $\operatorname{GL}_N(\mathbb{C})$ tensor products and quantum random matrices

The Littlewood--Richardson process is a discrete random point process arising from the isotypic decomposition of tensor products of irreducible representations of $\operatorname{GL}_N(\mathbb{C})$. Biane--Perelomov--Popov matrices are quantum random matrices obtained as the geometric quantization of random Hermitian matrices with deterministic eigenvalues and uniformly random eigenvectors. As first observed by Biane, correlation functions of certain global observables of the LR process coincide with correlation functions of linear statistics of sums of classically independent BPP matrices, thereby enabling a random matrix approach to the statistical study of $\operatorname{GL}_N(\mathbb{C})$ tensor products. In this paper, we prove an optimal result: classically independent BPP matrices become freely independent in any semiclassical/large-dimension limit. This proves and generalizes a conjecture of Bufetov and Gorin, and leads to a Law of Large Numbers for the BPP observables of the LR process which holds in any and all semiclassical scalings.

math.RT↗

Weingarten calculus via orthogonality relations: new applications

Weingarten calculus is a completely general and explicit method to compute the moments of the Haar measure on compact subgroups of matrix algebras. Particular cases of this calculus were initiated by theoretical physicists -- including Weingarten, after whom this calculus was coined by the first author, after investigating it systematically. Substantial progress was achieved subsequently by the second author and coworkers, based on representation theoretic and combinatorial techniques. All formulas of `Weingarten calculus' are in the spirit of Weingarten's seminal paper [W78]. However, modern proofs are very different from Weingarten's initial ideas. In this paper, we revisit Weingarten's initial proof and we illustrate its power by uncovering two new important applications: (i) a uniform bound on the Weingarten function, that subsumes existing uniform bounds, and is optimal up to a polynomial factor, and (ii) an extension of Weingarten calculus to symmetric spaces and conceptual proofs of identities established by the second author.

math.CO↗

Convex set of quantum states with positive partial transpose analysed by hit and run algorithm

The convex set of quantum states of a composite $K \times K$ system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an estimation for the convergence speed of the algorithm is derived. For $K\ge 3$ this algorithm works faster than sampling over the entire set of states and verifying whether the partial transpose is positive. The level density of the PPT states is shown to differ from the Marchenko-Pastur distribution, supported in [0,4] and corresponding asymptotically to the entire set of quantum states. Based on the shifted semi--circle law, describing asymptotic level density of partially transposed states, and on the level density for the Gaussian unitary ensemble with constraints for the spectrum we find an explicit form of the probability distribution supported in [0,3], which describes well the level density obtained numerically for PPT states.

quant-ph↗

Estimates for compression norms and additivity violation in quantum information

The free contraction norm (or the (t)-norm) was introduced by Belinschi, Collins and Nechita as a tool to compute the typical location of the collection of singular values associated to a random subspace of the tensor product of two Hilbert spaces. In turn, it was used in by them in order to obtain sharp bounds for the violation of the additivity of the minimum output entropy for random quantum channels with Bell states. This free contraction norm, however, is difficult to compute explicitly. The purpose of this note is to give a good estimate for this norm. Our technique is based on results of super convergence in the context of free probability theory. As an application, we give a new, simple and conceptual proof of the violation of the additivity of the minimum output entropy.

math.OA↗

Numerical range for random matrices

We analyze the numerical range of high-dimensional random matrices, obtaining limit results and corresponding quantitative estimates in the non-limit case. For a large class of random matrices their numerical range is shown to converge to a disc. In particular, numerical range of complex Ginibre matrix almost surely converges to the disk of radius $\sqrt{2}$. Since the spectrum of non-hermitian random matrices from the Ginibre ensemble lives asymptotically in a neighborhood of the unit disk, it follows that the outer belt of width $\sqrt{2}-1$ containing no eigenvalues can be seen as a quantification the non-normality of the complex Ginibre random matrix. We also show that the numerical range of upper triangular Gaussian matrices converges to the same disk of radius $\sqrt{2}$, while all eigenvalues are equal to zero and we prove that the operator norm of such matrices converges to $\sqrt{2e}$.

math.OA↗