Search

Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and quantum side-information produced from the ciphertext. Since its initial proposal and scheme in the random oracle model by Broadbent and Lord [TQC 2020], uncloneable encryption has developed into an important primitive at the foundation of quantum uncloneability for cryptographic primitives. Despite sustained efforts, however, the question of unconditional uncloneable encryption (and in particular of the simplest case, called an uncloneable bit) has remained elusive. Here, we propose a candidate for the unconditional uncloneable bit problem, and provide strong evidence that the adversary's success probability in the related security game converges quadratically as ${1}/{2}+{1}/{(2\sqrt{K})}$, where $K$ represents the number of keys and ${1}/{2}$ is trivially achievable. We prove this bound's validity for $K$ ranging from $2$ to $7$ and demonstrate the validity up to $K = 17$ using computations based on the NPA hierarchy. We furthemore provide compelling heuristic evidence towards the general case. In addition, we prove an asymptotic upper bound of ${5}/{8}$ and give a numerical upper bound of $\sim 0.5980$, which to our knowledge is the best-known value in the unconditional model.

We study the entanglement entropy of a random tensor network (RTN) using tools from free probability theory. Random tensor networks are simple toy models that help the understanding of the entanglement behavior of a boundary region in the ADS/CFT context. One can think of random tensor networks are specific probabilistic models for tensors having some particular geometry dictated by a graph (or network) structure. We first introduce our model of RTN, obtained by contracting maximally entangled states (corresponding to the edges of the graph) on the tensor product of Gaussian tensors (corresponding to the vertices of the graph). We study the entanglement spectrum of the resulting random spectrum along a given bipartition of the local Hilbert spaces. We provide the limiting eigenvalue distribution of the reduced density operator of the RTN state, in the limit of large local dimension. The limit value is described via a maximum flow optimization problem in a new graph corresponding to the geometry of the RTN and the given bipartition. In the case of series-parallel graphs, we provide an explicit formula for the limiting eigenvalue distribution using classical and free multiplicative convolutions. We discuss the physical implications of our results, allowing us to go beyond the semiclassical regime without any cut assumption, specifically in terms of finite corrections to the average entanglement entropy of the RTN.

In this paper, we study random instances of the classical marginal problem. We encode the problem in a graph, where the vertices have assigned fixed binary probability distributions, and edges have assigned random bivariate distributions having the incident vertex distributions as marginals. We provide estimates on the probability that a joint distribution on the graph exists, having the bivariate edge distributions as marginals. Our study is motivated by Fine's theorem in quantum mechanics. We study in great detail the graphs corresponding to CHSH and Bell-Wigner scenarios providing rations of volumes between the local and non-signaling polytopes.

The group symmetries inherent in quantum channels often make them tractable and applicable to various problems in quantum information theory. In this paper, we introduce natural probability distributions for covariant quantum channels. Specifically, this is achieved through the application of ``twirling operations'' on random quantum channels derived from the Stinespring representation that use Haar-distributed random isometries. We explore various types of group symmetries, including unitary and orthogonal covariance, hyperoctahedral covariance, diagonal orthogonal covariance (DOC), and analyze their properties related to quantum entanglement based on the model parameters. In particular, we discuss the threshold phenomenon for positive partial transpose and entanglement breaking properties, comparing thresholds among different classes of random covariant channels. Finally, we contribute to the PPT$^2$ conjecture by showing that the composition between two random DOC channels is generically entanglement breaking., Comment: minor modifications

In the quest for robust and universal quantum devices, the notion of simulation plays a crucial role, both from a theoretical and from an applied perspective. In this work, we go beyond the simulation of quantum channels and quantum measurements, studying what it means to simulate a collection of measurements, which we call a multimeter. To this end, we first explicitly characterize the completely positive transformations between multimeters. However, not all of these transformations correspond to valid simulations, as evidenced by the existence of maps that always prepare the same multimeter regardless of the input, which we call trash-and-prepare. We give a new definition of multimeter simulations as transformations that are triviality-preserving, i.e., when given a multimeter consisting of trivial measurements they can only produce another trivial multimeter. In the absence of a quantum ancilla, we then characterize the transformations that are triviality-preserving and the transformations that are trash-and-prepare. Finally, we use these characterizations to compare our new definition of multimeter simulation to three existing ones: classical simulations, compression of multimeters, and compatibility-preserving simulations.

We develop a method for the random sampling of (multimode) Gaussian states in terms of their covariance matrix, which we refer to as a random quantum covariance matrix (RQCM). We analyze the distribution of marginals and demonstrate that the eigenvalues of an RQCM converge to a shifted semicircular distribution in the limit of a large number of modes. We provide insights into the entanglement of such states based on the positive partial transpose (PPT) criteria. Additionally, we show that the symplectic eigenvalues of an RQCM converge to a probability distribution that can be characterized using free probability. We present numerical estimates for the probability of a RQCM being separable and, if not, its extendibility degree, for various parameter values and mode bipartitions.

Communication complexity quantifies how difficult it is for two distant computers to evaluate a function f(X,Y), where the strings X and Y are distributed to the first and second computer respectively, under the constraint of exchanging as few bits as possible. Surprisingly, some nonlocal boxes, which are resources shared by the two computers, are so powerful that they allow to collapse communication complexity, in the sense that any Boolean function f can be correctly estimated with the exchange of only one bit of communication. The Popescu-Rohrlich (PR) box is an example of such a collapsing resource, but a comprehensive description of the set of collapsing nonlocal boxes remains elusive. In this work, we carry out an algebraic study of the structure of wirings connecting nonlocal boxes, thus defining the notion of the "product of boxes" $P\boxtimes Q$, and we show related associativity and commutativity results. This gives rise to the notion of the "orbit of a box", unveiling surprising geometrical properties about the alignment and parallelism of distilled boxes. The power of this new framework is that it allows us to prove previously-reported numerical observations concerning the best way to wire consecutive boxes, and to numerically and analytically recover recently-identified noisy PR boxes that collapse communication complexity for different types of noise models., Comment: 32 + 3 pages, 13 figures

We study a class of bistochastic matrices generalizing unistochastic matrices. Given a complex bipartite unitary operator, we construct a bistochastic matrix having as entries the normalized squares of Frobenius norm of the blocks. We show that the closure of the set of generalized unistochastic matrices is the whole Birkhoff polytope. We characterize the points on the edges of the Birkhoff polytope that belong to a given level of our family of sets, proving that the different (non-convex) levels have a rich inclusion structure. We also study the corresponding generalization of orthostochastic matrices. Finally, we introduce and study the natural probability measures induced on our sets by the Haar measure of the unitary group. These probability measures interpolate between the natural measure on the set of unistochastic matrices and the Dirac measure supported on the van der Waerden matrix., Comment: 20 pages, 4 figures

We investigate the extent to which two particles can be maximally entangled when they are also similarly entangled with other particles on a complete graph, focusing on Werner, isotropic, and Brauer states. To address this, we formulate and solve optimization problems that draw on concepts from many-body physics, computational complexity, and quantum cryptography. We approach the problem by formalizing it as a semi-definite program (SDP), which we solve analytically using tools from representation theory. Notably, we determine the exact maximum values for the projection onto the maximally entangled state and the antisymmetric Werner state, thereby resolving long-standing open problems in the field of quantum extendibility. Our results are achieved by leveraging SDP duality, the representation theory of symmetric, unitary and orthogonal groups, and the Brauer algebra., Comment: 33 pages

The tensor flattenings appear naturally in quantum information when one produces a density matrix by partially tracing the degrees of freedom of a pure quantum state. In this paper, we study the joint $^*$-distribution of the flattenings of large random tensors under mild assumptions, in the sense of free probability theory. We show the convergence toward an operator-valued circular system with amalgamation on permutation group algebras for which we describe the covariance structure. As an application we describe the law of large random density matrix of bosonic quantum states.

In this paper we introduce a novel noise model for quantum measurements motivated by an indirect measurement scheme with faulty preparation. Averaging over random dynamics governing the interaction between the quantum system and a probe, a natural, physical noise model emerges. We compare it to existing noise models (uniform and depolarizing) in the framework of incompatibility robustness. We observe that our model allows for larger compatibility regions for specific classes of measurements.

Several central problems in quantum information theory (such as measurement compatibility and quantum steering) can be rephrased as membership in the minimal matrix convex set corresponding to special polytopes (such as the hypercube or its dual). In this article, we generalize this idea and introduce the notion of polytope compatibility, by considering arbitrary polytopes. We find that semiclassical magic squares correspond to Birkhoff polytope compatibility. In general, we prove that polytope compatibility is in one-to-one correspondence with measurement compatibility, when the measurements have some elements in common and the post-processing of the joint measurement is restricted. Finally, we consider how much tuples of operators with appropriate joint numerical range have to be scaled in the worst case in order to become polytope compatible and give both analytical sufficient conditions and numerical ones based on linear programming., Comment: minor changes

Quantum cloning is a fundamental protocol of quantum information theory. Perfect universal quantum cloning is prohibited by the laws of quantum mechanics, only imperfect copies being reachable. Symmetric quantum cloning is concerned with case when the quality of the clones is identical. In this work, we study the general case of $1 \to N$ asymmetric cloning, where one asks for arbitrary qualities of the clones. We characterize, for all Hilbert space dimensions and number of clones, the set of all possible clone qualities. This set is realized as the nonnegative part of the unit ball of a newly introduced norm, which we call the $\mathcal{Q}$-norm. We also provide a closed form expression for the quantum cloner achieving a given clone quality vector. Our analysis relies on the Schur-Weyl duality and on the study of the spectral properties of partially transposed permutation operators.

Genuine multipartite entanglement of a given multipartite pure quantum state can be quantified through its geometric measure of entanglement, which, up to logarithms, is simply the maximum overlap of the corresponding unit tensor with product unit tensors, a quantity that is also known as the injective norm of the tensor. Our general goal in this work is to estimate this injective norm of randomly sampled tensors. To this end, we study and compare various algorithms, based either on the widely used alternating least squares method or on a novel normalized gradient descent approach, and suited to either symmetrized or non-symmetrized random tensors. We first benchmark their respective performances on the case of symmetrized real Gaussian tensors, whose asymptotic average injective norm is known analytically. Having established that our proposed normalized gradient descent algorithm generally performs best, we then use it to obtain numerical estimates for the average injective norm of complex Gaussian tensors (i.e. up to normalization uniformly distributed multipartite pure quantum states), with or without permutation-invariance. Finally, we also estimate the average injective norm of random matrix product states constructed from Gaussian local tensors, with or without translation-invariance. All these results constitute the first numerical estimates on the amount of genuinely multipartite entanglement typically present in various models of random multipartite pure states.

We analyze the ergodic properties of quantum channels that are covariant with respect to diagonal orthogonal transformations. We prove that the ergodic behaviour of a channel in this class is essentially governed by a classical stochastic matrix. This allows us to exploit tools from classical ergodic theory to study quantum ergodicity of such channels. As an application of our analysis, we study dual unitary brickwork circuits which have recently been proposed as minimal models of quantum chaos in many-body systems. Upon imposing a local diagonal orthogonal invariance symmetry on these circuits, the long-term behaviour of spatio-temporal correlations between local observables in such circuits is completely determined by the ergodic properties of a channel that is covariant under diagonal orthogonal transformations. We utilize this fact to show that such symmetric dual unitary circuits exhibit a rich variety of ergodic behaviours, thus emphasizing their importance.

Measurement incompatibility and quantum non-locality are two key features of quantum theory. Violations of Bell inequalities require quantum entanglement and incompatibility of the measurements used by the two parties involved in the protocol. We analyze the converse question: for which Bell inequalities is the incompatibility of measurements enough to ensure a quantum violation? We relate the two questions by comparing two tensor norms on the space of dichotomic quantum measurements: one characterizing measurement compatibility and the second one characterizing violations of a given Bell inequality. We provide sufficient conditions for the equivalence of the two notions in terms of the matrix describing the correlation Bell inequality. We show that the CHSH inequality and its variants are the only ones satisfying it., Comment: new applications and results about the optimality of the CHSH game

We introduce a new incompatibility criterion for quantum channels, based on the notion of (quantum) Fisher information. Our construction is based on a similar criterion for quantum measurements put forward by H.~Zhu. We then study the power of the incompatibility criterion in different scenarios. Firstly, we prove the first analytical conditions for the incompatibility of two Schur channels. Then, we study the incompatibility structure of a tuple of depolarizing channels, comparing the newly introduced criterion with the known results from asymmetric quantum cloning., Comment: 16 pages, 2 figures

Measurement incompatibility is one of the most striking examples of how quantum physics is different from classical physics. Two measurements are incompatible if they cannot arise via classical post-processing from a third one. A natural way to quantify incompatibility is in terms of noise robustness. In the present article, we review recent results on the maximal noise robustness of incompatible measurements, which have been obtained by the present authors using free spectrahedra, and rederive them using tensor norms. In this way, we make them accessible to a broader audience from quantum information theory and mathematical physics and contribute to the fruitful interactions between Banach space theory and quantum information theory. We also describe incompatibility witnesses using tensor norm and matrix convex set duality, emphasizing the relation between the different notions of witnesses., Comment: 18 pages, 1 figure

We study the partially ordered set of equivalence classes of quantum measurements endowed with the post-processing partial order. The post-processing order is fundamental as it enables to compare measurements by their intrinsic noise and it gives grounds to define the important concept of quantum incompatibility. Our approach is based on mapping this set into a simpler partially ordered set using an order preserving map and investigating the resulting image. The aim is to ignore unnecessary details while keeping the essential structure, thereby simplifying e.g. detection of incompatibility. One possible choice is the map based on Fisher information introduced by Huangjun Zhu, known to be an order morphism taking values in the cone of positive semidefinite matrices. We explore the properties of that construction and improve Zhu's incompatibility criterion by adding a constraint depending on the number of measurement outcomes. We generalize this type of construction to other ordered vector spaces and we show that this map is optimal among all quadratic maps.

We study bipartite unitary operators which stay invariant under the local actions of diagonal unitary and orthogonal groups. We investigate structural properties of these operators, arguing that the diagonal symmetry makes them suitable for analytical study. As a first application, we construct large new families of dual unitary gates in arbitrary finite dimensions, which are important toy models for entanglement spreading in quantum circuits. We then analyze the non-local nature of these invariant operators, both in discrete (operator Schmidt rank) and continuous (entangling power) settings. Our scrutiny reveals that these operators can be used to simulate any bipartite unitary gate via stochastic local operations and classical communication. Furthermore, we establish a one-to-one connection between the set of local diagonal unitary invariant dual unitary operators with maximum entangling power and the set of complex Hadamard matrices. Finally, we discuss distinguishability of unitary operators in the setting of the stated diagonal symmetry.

We introduce the bosonic and fermionic ensembles of density matrices and study their entanglement. In the fermionic case, we show that random bipartite fermionic density matrices have non-positive partial transposition, hence they are typically entangled. The similar analysis in the bosonic case is more delicate, due to a large positive outlier eigenvalue. We compute the asymptotic ratio between the size of the environment and the size of the system Hilbert space for which random bipartite bosonic density matrices fail the PPT criterion, being thus entangled. We also relate moment computations for tensor-symmetric random matrices to evaluations of the circuit-counting and interlace graph polynomials for directed graphs., Comment: 37 pages, numerous figures and diagrammatics equations

We consider the problem of determining the achievable region of parameters for universal $1 \to 2$ asymmetric quantum cloning. Measuring the cloning performance with the figure of merit of singlet fraction, we show that the physical region is a union of ellipses in the plane. Equivalently, we characterize the parameter region of quantum state compatibility of two possibly different isotropic states, considering, for the first time, negative singlet fractions.

In this work, we characterize the amount of steerability present in quantum theory by connecting the maximal violation of a steering inequality to an inclusion problem of free spectrahedra. In particular, we show that the maximal violation of an arbitrary unbiased dichotomic steering inequality is given by the inclusion constants of the matrix cube, which is a well-studied object in convex optimization theory. This allows us to find new upper bounds on the maximal violation of steering inequalities and to show that previously obtained violations are optimal. In order to do this, we prove lower bounds on the inclusion constants of the complex matrix cube, which might be of independent interest. Finally, we show that the inclusion constants of the matrix cube and the matrix diamond are the same. This allows us to derive new bounds on the amount of incompatibility available in dichotomic quantum measurements in fixed dimension., Comment: Final version: 30 pages, 2 figures

In this article, we investigate meandric systems having one shallow side: the arch configuration on that side has depth at most two. This class of meandric systems was introduced and extensively examined by I. P. Goulden, A. Nica, and D. Puder in 2020. Shallow arch configurations are in bijection with the set of interval partitions. We study meandric systems by using moment-cumulant transforms for non-crossing and interval partitions, corresponding to the notions of free and boolean independence, respectively, in non-commutative probability. We obtain formulas for the generating series of different classes of meandric systems with one shallow side, by explicitly enumerating the simpler, irreducible objects. In addition, we propose random matrix models for the corresponding meandric polynomials, which can be described in the language of quantum information theory, in particular that of quantum channels., Comment: 22 pages

In this work, we investigate measurement incompatibility in general probabilistic theories (GPTs). We show several equivalent characterizations of compatible measurements. The first is in terms of the positivity of associated maps. The second relates compatibility to the inclusion of certain generalized spectrahedra. For this, we extend the theory of free spectrahedra to ordered vector spaces. The third characterization connects the compatibility of dichotomic measurements to the ratio of tensor crossnorms of Banach spaces. We use these characterizations to study the amount of incompatibility present in different GPTs, i.e. their compatibility regions. For centrally symmetric GPTs, we show that the compatibility degree is given as the ratio of the injective and the projective norm of the tensor product of associated Banach spaces. This allows us to completely characterize the compatibility regions of several GPTs, and to obtain optimal universal bounds on the compatibility degree in terms of the 1-summing constants of the associated Banach spaces. Moreover, we find new bounds on the maximal incompatibility present in more than three qubit measurements., Comment: 60 pages, 4 figures. Changed the notation of the norm characterizing compatibility from rho-norm to c-norm

We prove that the PPT$^2$ conjecture holds for linear maps between matrix algebras which are covariant under the action of the diagonal unitary group. Many salient examples, like the Choi-type maps, depolarizing maps, dephasing maps, amplitude damping maps, and mixtures thereof, lie in this class. Our proof relies on a generalization of the matrix-theoretic notion of factor width for pairwise completely positive matrices, and a complete characterization in the case of factor width two.

Several techniques of generating random quantum channels, which act on the set of $d$-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show under which conditions they become mathematically equivalent, and lead to the uniform, Lebesgue measure on the convex set of quantum operations. We compare their advantages and computational complexity and demonstrate which of them is particularly suitable for numerical investigations. Additional results focus on the spectral gap and other spectral properties of random quantum channels and their invariant states. We compute mean values of several quantities characterizing a given quantum channel, including its unitarity, the average output purity and the $2$-norm coherence of a channel, averaged over the entire set of the quantum channels with respect to the uniform measure. An ensemble of classical stochastic matrices obtained due to super-decoherence of random quantum stochastic maps is analyzed and their spectral properties are studied using the Bloch representation of a classical probability vector., Comment: 29 pages, 7 figures

We analyze bipartite matrices and linear maps between matrix algebras, which are respectively, invariant and covariant, under the diagonal unitary and orthogonal groups' actions. By presenting an expansive list of examples from the literature, which includes notable entries like the Diagonal Symmetric states and the Choi-type maps, we show that this class of matrices (and maps) encompasses a wide variety of scenarios, thereby unifying their study. We examine their linear algebraic structure and investigate different notions of positivity through their convex conic manifestations. In particular, we generalize the well-known cone of completely positive matrices to that of triplewise completely positive matrices and connect it to the separability of the relevant invariant states (or the entanglement breaking property of the corresponding quantum channels). For linear maps, we provide explicit characterizations of the stated covariance in terms of their Kraus, Stinespring, and Choi representations, and systematically analyze the usual properties of positivity, decomposability, complete positivity, and the like. We also describe the invariant subspaces of these maps and use their structure to provide necessary and sufficient conditions for separability of the associated invariant bipartite states.

We introduce and study a class of entanglement criteria based on the idea of applying local contractions to an input multipartite state, and then computing the projective tensor norm of the output. More precisely, we apply to a mixed quantum state a tensor product of contractions from the Schatten class $S_1$ to the Euclidean space $\ell_2$, which we call entanglement testers. We analyze the performance of this type of criteria on bipartite and multipartite systems, for general pure and mixed quantum states, as well as on some important classes of symmetric quantum states. We also show that previously studied entanglement criteria, such as the realignment and the SIC POVM criteria, can be viewed inside this framework. This allows us to answer in the positive two conjectures of Shang, Asadian, Zhu, and G\"uhne by deriving systematic relations between the performance of these two criteria.

We introduce the notion of compatibility dimension for a set of quantum measurements: it is the largest dimension of a Hilbert space on which the given measurements are compatible. In the Schr\"odinger picture, this notion corresponds to testing compatibility with ensembles of quantum states supported on a subspace, using the incompatibility witnesses of Carmeli, Heinosaari, and Toigo. We provide several bounds for the compatibility dimension, using approximate quantum cloning or algebraic techniques inspired by quantum error correction. We analyze in detail the case of two orthonormal bases, and, in particular, that of mutually unbiased bases., Comment: several minor changes and typos fixed

We provide a graphical calculus for computing averages of tensor network diagrams with respect to the distribution of random vectors containing independent uniform complex phases. Our method exploits the order structure of the partially ordered set of uniform block permutations. A similar calculus is developed for random vectors consisting of independent uniform signs, based on the combinatorics of the partially ordered set of even partitions. We employ our method to extend some of the results by Johnston and MacLean on the family of local diagonal unitary invariant matrices. Furthermore, our graphical approach applies just as well to the real (orthogonal) case, where we introduce the notion of triplewise complete positivity to study the condition for separability of the relevant bipartite matrices. Finally, we analyze the twirling of linear maps between matrix algebras by independent diagonal unitary matrices, showcasing another application of our method., Comment: Minor modifications with updated references

We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical (commutative) setting. We introduce and analyze a randomized algorithm for computing solutions of SudoQ puzzles. Finally, we state two important conjectures relating the quantum and the classical solutions of SudoQ puzzles, corroborated by analytical and numerical evidence., Comment: Python code and examples available at https://github.com/inechita/SudoQ

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a set of linear relations. We use it for experiments on the representation theory of the quantum permutation group and quantum subgroups of it. We apply it to the question whether a given finite graph (without multiple edges) has quantum symmetries in the sense of Banica. In order to do so, we run our Sinkhorn algorithm and check whether or not the resulting projections commute. We discuss the produced data and some questions for future research arising from it., Comment: Matlab/Octave code available in Ancillary files

In his solution of Hilbert's 17th problem Artin showed that any positive definite polynomial in several variables can be written as the quotient of two sums of squares. Later Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables and gave explicit bounds on $N$. By using concepts from quantum information theory (such as partial traces, optimal cloning maps, and an identity due to Chiribella) we give simpler proofs and minor improvements of both real and complex versions of this result. Moreover, we discuss constructions of Hilbert identities using Gaussian integrals and we review an elementary method to construct complex spherical designs. Finally, we apply our results to give improved bounds for exponential quantum de Finetti theorems in the real and in the complex setting.

We provide a computer algebra package called Random Tensor Network Integrator (RTNI). It allows to compute averages of tensor networks containing multiple Haar-distributed random unitary matrices and deterministic symbolic tensors. Such tensor networks are represented as multigraphs, with vertices corresponding to tensors or random unitaries and edges corresponding to tensor contractions. Input and output spaces of random unitaries may be subdivided into arbitrary tensor factors, with dimensions treated symbolically. The algorithm implements the graphical Weingarten calculus and produces a weighted sum of tensor networks representing the average over the unitary group. We illustrate the use of this algorithmic tool on some examples from quantum information theory, including entropy calculations for random tensor network states as considered in toy models for holographic duality. Mathematica and Python implementations are supplied., Comment: Code available (for Mathematica and python) at https://github.com/MotohisaFukuda/RTNI

We introduce several notions of random positive operator valued measures (POVMs), and we prove that some of them are equivalent. We then study statistical properties of the effect operators for the canonical examples, obtaining limiting eigenvalue distributions with the help of free probability theory. Similarly, we obtain the large system limit for several quantities of interest in quantum information theory, such as the sharpness, the noise content, and the probability range. Finally, we study different compatibility criteria, and we compare them for generic POVMs., Comment: 33 pages. v3: small modifications

In this work, we prove a lower bound on the difference between the first and second singular values of quantum channels induced by random isometries, that is tight in the scaling of the number of Kraus operators. This allows us to give an upper bound on the difference between the first and second largest (in modulus) eigenvalues of random channels with same large input and output dimensions for finite number of Kraus operators $k\geq 169$. Moreover, we show that these random quantum channels are quantum expanders, answering a question posed by Hastings. As an application, we show that ground states of infinite 1D spin chains, which are well-approximated by matrix product states, fulfill a principle of maximum entropy., Comment: 19 pages, 6 figures

In this work, we establish the connection between the study of free spectrahedra and the compatibility of quantum measurements with an arbitrary number of outcomes. This generalizes previous results by the authors for measurements with two outcomes. Free spectrahedra arise from matricial relaxations of linear matrix inequalities. A particular free spectrahedron which we define in this work is the matrix jewel. We find that the compatibility of arbitrary measurements corresponds to the inclusion of the matrix jewel into a free spectrahedron defined by the effect operators of the measurements under study. We subsequently use this connection to bound the set of (asymmetric) inclusion constants for the matrix jewel using results from quantum information theory and symmetrization. The latter translate to new lower bounds on the compatibility of quantum measurements. Among the techniques we employ are approximate quantum cloning and mutually unbiased bases., Comment: v5: section 3.3 has been expanded significantly to incorporate the generalization of the Cartesian product and the direct sum to matrix convex sets. Many other minor modifications. Closed to the published version

We study the joint distribution of the set of all marginals of a random Wishart matrix acting on a tensor product Hilbert space. We compute the limiting free mixed cumulants of the marginals, and we show that in the balanced asymptotical regime, the marginals are asymptotically free. We connect the matrix integrals relevant to the study of operators on tensor product spaces with the corresponding classes of combinatorial maps, for which we develop the combinatorial machinery necessary for the asymptotic study. Finally, we present some applications to the theory of random quantum states in quantum information theory., Comment: 53 pages, 25 figures, v2 reviewed for publication

In this work, we investigate the joint measurability of quantum effects and connect it to the study of free spectrahedra. Free spectrahedra typically arise as matricial relaxations of linear matrix inequalities. An example of a free spectrahedron is the matrix diamond, which is a matricial relaxation of the $\ell_1$-ball. We find that joint measurability of binary POVMs is equivalent to the inclusion of the matrix diamond into the free spectrahedron defined by the effects under study. This connection allows us to use results about inclusion constants from free spectrahedra to quantify the degree of incompatibility of quantum measurements. In particular, we completely characterize the case in which the dimension is exponential in the number of measurements. Conversely, we use techniques from quantum information theory to obtain new results on spectrahedral inclusion for the matrix diamond., Comment: 28 pages, 4 figures. v3: minor revisions

We study entanglement-related properties of random quantum states which are unitarily invariant, in the sense that their distribution is left unchanged by conjugation with arbitrary unitary operators. In the large matrix size limit, the distribution of these random quantum states is characterized by their limiting spectrum, a compactly supported probability distribution. We prove several results characterizing entanglement and the PPT property of random bipartite unitarily invariant quantum states in terms of the limiting spectral distribution, in the unbalanced asymptotical regime where one of the two subsystems is fixed, while the other one grows in size., Comment: New section on PPT matrices with large Schmidt number

We introduce a general framework for de Finetti reduction results, applicable to various notions of partially exchangeable probability distributions. Explicit statements are derived for the cases of exchangeability, Markov exchangeability, and some generalizations of these. Our techniques are combinatorial and rely on the "BEST" theorem, enumerating the Eulerian cycles of a multigraph., Comment: 22 pages, 1 figure

We consider sequences of random quantum channels defined using the Stinespring formula with Haar-distributed random orthogonal matrices. For any fixed sequence of input states, we study the asymptotic eigenvalue distribution of the outputs through tensor powers of random channels. We show that the input states achieving minimum output entropy are tensor products of maximally entangled states (Bell states) when the tensor power is even. This phenomenon is completely different from the one for random quantum channels constructed from Haar-distributed random unitary matrices, which leads us to formulate some conjectures about the regularized minimum output entropy., Comment: minor modifications

We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be no such matrices, besides the usual Hadamard ones. We verify this conjecture in a number of situations, and notably for most of the known examples of real almost Hadamard matrices, and for some of their complex extensions. We discuss as well some potential applications of our conjecture, to the general study of complex Hadamard matrices., Comment: 42 pages