DOCSLIB.ORG

Random Matrix Theory of Resonances: an Overview

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Random Matrix Theory of Resonances: an Overview Random Matrix Theory of Resonances: an Overview Yan V. Fyodorov∗ ∗ King’s College London, Department of Mathematics, London WC2R 2LS, United Kingdom e-mail: [email protected] Abstract—Scattering of electromagnetic waves in billiard-like channels can be taken either as fixed orthogonal vectors systems has become a standard experimental tool of studying PN satisfying i=1 W aiWbi = γaδab; γa > 0 8a = 1;:::;M or properties associated with Quantum Chaos. Random Matrix alternatively the entries are chosen to be independent random Theory (RMT) describing statistics of eigenfrequencies and −1 associated eigenfunctions remains one of the pillars of theoretical Gaussian [18] : W aiWbj = N γaδabδij; i; j = understanding of quantum chaotic systems. In a scattering 1;:::;N, with angular brackets standing for the ensemble av- system coupling to continuum via antennae converts real eigen- eraging. Equivalently, entries Sab(E) of the scattering matrix frequencies into poles of the scattering matrix in the complex can be rewritten as [5] frequency plane and the associated eigenfunctions into decaying X 1 resonance states. Understanding statistics of these poles, as well as S (E) = δ − 2i W ∗ W ; (2) associated non-orthogonal resonance eigenfunctions within RMT ab ab ai jb E − Heff ij approach is still possible, though much more challenging task. ij with an effective non-Hermitian Hamiltonian I. INTRODUCTION AND FORMALISM H = H − iΓ; Γ = WW y ≥ 0 (3) Scattering of electromagnetic waves in billiard-like mi- eff Γn crowave resonators or, in optical range, dielectric microcav- whose N complex eigenvalues zn = En−i 2 provide poles of ities, has become a standard experimental tool of studying the scattering matrix in the complex energy plane, commonly properties associated with Quantum Chaos, see e.g. reviews referred to as the resonances. The goal is to describe the [1]–[4]. Random Matrix Theory (RMT) describing statistics of statistics of positions of these poles in the complex plane, eigenfrequencies (referred to as ”energy levels” in the quantum as well as statistics of the associated residues related to non- mechanical context, the terminology to be used in the rest of orthogonal eigenvectors of non-Hermitian Hamiltonian Heff , the review) and associated eigenfunctions is one of the pillars using the random matrix statistics for H as an input. of theoretical understanding of quantum chaotic systems. II. STATISTICS OF S-MATRIX POLES IN SOME LIMITING Scattering set up drastically changes the system properties by CASES. coupling to the continuum via antennae, thereby converting discrete energy levels into decaying resonance states. Such A. Weak-coupling regime and Porter-Thomas distribution states can be associated with poles of the scattering matrix When W ! 0 the anti-Hermitian part −iW W y can be in the complex energy plane. Understanding statistics of such treated as a perturbation of the Hermitian part H. The latter poles, as well as associated residues related to non-orthogonal matrix is characterized by real eigenvalues En and orthonor- eigenfunctions within RMT approach is still possible, but in mal eigenvectors jni which are random vectors uniformly full generality remains a challenging task for theoreticians. spanning the N−dimensional unit sphere. In this regime one This presentation aims at giving a short overview of present expects the resonances to be largely non-overlapping, that is knowledge in this field. Γn ∆, where ∆ is the mean spacing between neighbouring The starting point is an RMT model introduced in [5] real eigenvalues for H. To the first order and described in detail in [6], and more recently in [7], [8]. Γn y The model deals with the unitary M × M energy-dependent En ! zn = En − i ; with Γn = 2 njWW jn 2 scattering matrix S(E) for quantum-chaotic system with M implying for M equivalent channels with coupling constants open channels 2 γa = γ 1 the χ distribution of scaled resonance widths 1 − iK 1 S(E) = ; where K = W y W (1) yn = πΓn=∆ 1 [9]: arXiv:1606.03124v2 [cond-mat.dis-nn] 8 May 2021 1 + iK E − H Mβ Mβ=2 2 −1 (β) (β=2) y − βy N ×N N 1 4γ with , random Gaussian (real symmetric GOE, PM (y) = e (4) β = 1, Hermitian GUE, β = 2, or real quaternion GSE, β = 4) γΓ(Mβ=2) γ matrix H used to model spectral properties of the Hamiltonian This expression known as the Porter-Thomas distribution of closed system of quantum-chaotic nature. The columns of favourably agrees with a lot of experimental data in billiards, N ×M matrix W of coupling amplitudes to M open scattering from [10] to recent experiments [11] in a stadium billiard embedded into a two dimensional photonic crystal realized and a cloud of N − 1 long lived ones (analogue of Dicke on a silicon-on-insulator substrate. Note however recently superradiance), see recent optical experiments in [19]. reported deviations in high-precision neutron scattering [12], Similar, but somewhat simpler expression can be derived for see also discussion below and references in [13]. β = 2. In that case the limiting distribution of the resonance widths Γ can be derived non-perturbatively for any fixed B. Limiting case of very many open channels n number of channels M N ! 1 [20]. To that end one On the other hand when couplings γ > 0 are fixed and the 1 1 defines ”renormalized coupling strengths” ga = γc + number M of open channels is very large and comparable with 2 γc for all channels a = 1;:::;M. Then the probability density the number N 1 of internal states we expect that typically of the scaled resonance widths yn = πΓn=∆ is given for M resonances overlap strongly: Γn ∆. The mean density of y equivalent channels with g1 = ::: = gM ≡ g by [20] complex eigenvalues of Heff = H − iΓ; Γ = WW for M M many channels 0 < m = M=N < 1 was found analytically (β) (−1) d sinh y P (y) = yM−1 e−yg (6) in [14], [15]. Generically, the density of resonances has the M (M − 1)! dyM y form of a cloud separated by a gap from the real axis. For For weak coupling γ 1 we have g ∼ γ−1 1 hence larger couplings γ second cloud emerges, as depicted in Fig.1 typically y ∼ g−1 1 and we are back to the Porter- taken from [15]. The gap has the physical meaning of a Thomas distribution (4). In contrast, for the perfect coupling (β) 2 case g = 1 the power-law tail emerges PM (y) / 1=y so that some resonances may overlap strongly. This favourably agrees with the numerics for quantum chaotic graphs [21], see Fig.2. In fact not only the mean density of resonances, but also all Fig. 1. The density of resonances in RMT model with many open channels, from [15]. Fig. 2. Top: 5000 resonances for a single realization of β = 2 chaotic scattering in quantum graphs ( taken from T. Kottos and U. Smilansky correlation length in energy-dependent scattering observables, [21]). Bottom: Resonance widths distribution as compared with the see [15] and also matches semiclassical considerations [16] RMT analytical prediction (6). and is observed experimentally in microwave billiards [17]. higher correlation functions can be found explicitly [22] as III. NON-PERTURBATIVE RESULTS FOR STATISTICS OF resonances form for β = 2 a determinantal process in the S-MATRIX POLES complex plane. For β = 1 only the mean density of resonances The first systematic non-perturbative investigation of reso- in the complex plane is known explicitly for 1 ≤ M < 1 [23] nances within RMT was undertaken by Sokolov & Zelevin- and is given by a rather complicated expression. E.g. in the sky [18] for the special case M = 1. They provided an simplest case M = 1 the probability density of the scaled explicit expression for the joint probability density of positions resonance widths yn is given by y z1; : : : ; zN of all N eigenvalues of Heff = H − iW W in 2 Z 1 (β=1) 1 d 2 2λy the complex energy plane assuming random Gaussian coupling PM=1 (y) = 2 (1 − λ )e (g − λ)F(λ, y) dλ (7) γ 4π dy −1 amplitudes hWiWji = N with fixed γ > 0. For β = 1 they found where 1 −yp N Z 1 − Imzk 2 e (β=1) Y e γ Y jzi − zjj F(λ, y) = dp1 (8) P (z ; : : : ; z ) / p 2p 2 M=1 1 N g (λ − p1) (p1 − 1)(p1 − g) γImzk jzi − zjj k=1 i<j Z g e−yp2 − N PN (Rez )2− N PN Imz Imz × dp2(p1 − p2) × e 4 k=1 k 2 k<l k l (5) 2p 2 1 (λ − p2) (p2 − 1)(g − p2) This density was then used to predict that for γ large enough That formula was confirmed in microwave experiments by the resonances ”reorganize” into one short-lived resonances Kuhl et al. [24], see Fig.3. in the weak coupling regime γ 1 of isolated resonances [27]–[29], or in the opposite case of strongly overlapping resonances in extremely open systems with number of open channels M ∼ N [30], [31]. Non-perturbative results for finite M are scarce and available only for β = 2 [27], [32]. A. Resonance widths ”shifts” as a signature of non- orthogonality Fig. 3. Resonance widths distribution for β = 1;M = 1 scattering Suppose we slightly perturb the scattering system: Heff ! in a microwave resonator as compared with the RMT analytical pre- Heff + αV (e.g. by moving scatterers, or billiard walls) diction for perfect coupling, taken from [24]. The inset shows direct y RMT simulations. The characteristic tail 1=Γ2 is well-developed. with a Hermitian V = V and α ! 0.
Load more

Recommended publications
  • Random Matrix Theory and Covariance Estimation
    Introduction Random matrix theory Estimating correlations Comparison with Barra Conclusion Appendix Random Matrix Theory and Covariance Estimation Jim Gatheral New York, October 3, 2008 Introduction Random matrix theory Estimating correlations Comparison with Barra Conclusion Appendix Motivation Sophisticated optimal liquidation portfolio algorithms that balance risk against impact cost involve inverting the covariance matrix. Eigenvalues of the covariance matrix that are small (or even zero) correspond to portfolios of stocks that have nonzero returns but extremely low or vanishing risk; such portfolios are invariably related to estimation errors resulting from insuffient data. One of the approaches used to eliminate the problem of small eigenvalues in the estimated covariance matrix is the so-called random matrix technique. We would like to understand: the basis of random matrix theory. (RMT) how to apply RMT to the estimation of covariance matrices. whether the resulting covariance matrix performs better than (for example) the Barra covariance matrix. Introduction Random matrix theory Estimating correlations Comparison with Barra Conclusion Appendix Outline 1 Random matrix theory Random matrix examples Wigner’s semicircle law The Marˇcenko-Pastur density The Tracy-Widom law Impact of fat tails 2 Estimating correlations Uncertainty in correlation estimates. Example with SPX stocks A recipe for filtering the sample correlation matrix 3 Comparison with Barra Comparison of eigenvectors The minimum variance portfolio Comparison of weights In-sample and out-of-sample performance 4 Conclusions 5 Appendix with a sketch of Wigner’s original proof Introduction Random matrix theory Estimating correlations Comparison with Barra Conclusion Appendix Example 1: Normal random symmetric matrix Generate a 5,000 x 5,000 random symmetric matrix with entries aij N(0, 1).
    [Show full text]
  • Rotation Matrix Sampling Scheme for Multidimensional Probability Distribution Transfer
    ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Volume III-7, 2016 XXIII ISPRS Congress, 12–19 July 2016, Prague, Czech Republic ROTATION MATRIX SAMPLING SCHEME FOR MULTIDIMENSIONAL PROBABILITY DISTRIBUTION TRANSFER P. Srestasathiern ∗, S. Lawawirojwong, R. Suwantong, and P. Phuthong Geo-Informatics and Space Technology Development Agency (GISTDA), Laksi, Bangkok, Thailand (panu,siam,rata,pattrawuth)@gistda.or.th Commission VII,WG VII/4 KEY WORDS: Histogram specification, Distribution transfer, Color transfer, Data Gaussianization ABSTRACT: This paper address the problem of rotation matrix sampling used for multidimensional probability distribution transfer. The distri- bution transfer has many applications in remote sensing and image processing such as color adjustment for image mosaicing, image classification, and change detection. The sampling begins with generating a set of random orthogonal matrix samples by Householder transformation technique. The advantage of using the Householder transformation for generating the set of orthogonal matrices is the uniform distribution of the orthogonal matrix samples. The obtained orthogonal matrices are then converted to proper rotation matrices. The performance of using the proposed rotation matrix sampling scheme was tested against the uniform rotation angle sampling. The applications of the proposed method were also demonstrated using two applications i.e., image to image probability distribution transfer and data Gaussianization. 1. INTRODUCTION is based on the Monge’s transport problem which is to find mini- mal displacement for mass transportation. The solution from this In remote sensing, the analysis of multi-temporal data is widely linear approach can be used as initial solution for non-linear prob- used in many applications such as urban expansion monitoring, ability distribution transfer methods.
    [Show full text]
  • The Distribution of Eigenvalues of Randomized Permutation Matrices Tome 63, No 3 (2013), P
    R AN IE N R A U L E O S F D T E U L T I ’ I T N S ANNALES DE L’INSTITUT FOURIER Joseph NAJNUDEL & Ashkan NIKEGHBALI The distribution of eigenvalues of randomized permutation matrices Tome 63, no 3 (2013), p. 773-838. <http://aif.cedram.org/item?id=AIF_2013__63_3_773_0> © Association des Annales de l’institut Fourier, 2013, tous droits réservés. L’accès aux articles de la revue « Annales de l’institut Fourier » (http://aif.cedram.org/), implique l’accord avec les conditions générales d’utilisation (http://aif.cedram.org/legal/). Toute re- production en tout ou partie de cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation à fin strictement per- sonnelle du copiste est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. cedram Article mis en ligne dans le cadre du Centre de diffusion des revues académiques de mathématiques http://www.cedram.org/ Ann. Inst. Fourier, Grenoble 63, 3 (2013) 773-838 THE DISTRIBUTION OF EIGENVALUES OF RANDOMIZED PERMUTATION MATRICES by Joseph NAJNUDEL & Ashkan NIKEGHBALI Abstract. — In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at ran- dom according to the Ewens measure of parameter θ > 0) by replacing the entries equal to one by more general non-vanishing complex random variables. For these ensembles, in contrast with more classical models as the Gaussian Unitary En- semble, or the Circular Unitary Ensemble, the eigenvalues can be very explicitly computed by using the cycle structure of the permutations.
    [Show full text]
  • New Results on the Spectral Density of Random Matrices
    New Results on the Spectral Density of Random Matrices Timothy Rogers Department of Mathematics, King’s College London, July 2010 A thesis submitted for the degree of Doctor of Philosophy: Applied Mathematics Abstract This thesis presents some new results and novel techniques in the studyof thespectral density of random matrices. Spectral density is a central object of interest in random matrix theory, capturing the large-scale statistical behaviour of eigenvalues of random matrices. For certain ran- dom matrix ensembles the spectral density will converge, as the matrix dimension grows, to a well-known limit. Examples of this include Wigner’s famous semi-circle law and Girko’s elliptic law. Apart from these, and a few other cases, little else is known. Two factors in particular can complicate the analysis enormously - the intro- duction of sparsity (that is, many entries being zero) and the breaking of Hermitian symmetry. The results presented in this thesis extend the class of random matrix en- sembles for which the limiting spectral density can be computed to include various sparse and non-Hermitian ensembles. Sparse random matrices are studied through a mathematical analogy with statistical mechanics. Employing the cavity method, a technique from the field of disordered systems, a system of equations is derived which characterises the spectral density of a given sparse matrix. Analytical and numerical solutions to these equations are ex- plored, as well as the ensemble average for various sparse random matrix ensembles. For the case of non-Hermitian random matrices, a result is presented giving a method 1 for exactly calculating the spectral density of matrices under a particular type of per- turbation.
    [Show full text]
  • Random Rotation Ensembles
    Journal of Machine Learning Research 2 (2015) 1-15 Submitted 03/15; Published ??/15 Random Rotation Ensembles Rico Blaser ([email protected]) Piotr Fryzlewicz ([email protected]) Department of Statistics London School of Economics Houghton Street London, WC2A 2AE, UK Editor: TBD Abstract In machine learning, ensemble methods combine the predictions of multiple base learners to construct more accurate aggregate predictions. Established supervised learning algo- rithms inject randomness into the construction of the individual base learners in an effort to promote diversity within the resulting ensembles. An undesirable side effect of this ap- proach is that it generally also reduces the accuracy of the base learners. In this paper, we introduce a method that is simple to implement yet general and effective in improv- ing ensemble diversity with only modest impact on the accuracy of the individual base learners. By randomly rotating the feature space prior to inducing the base learners, we achieve favorable aggregate predictions on standard data sets compared to state of the art ensemble methods, most notably for tree-based ensembles, which are particularly sensitive to rotation. Keywords: Feature Rotation, Ensemble Diversity, Smooth Decision Boundary 1. Introduction Modern statistical learning algorithms combine the predictions of multiple base learners to form ensembles, which typically achieve better aggregate predictive performance than the individual base learners (Rokach, 2010). This approach has proven to be effective in practice and some ensemble methods rank among the most accurate general-purpose supervised learning algorithms currently available. For example, a large-scale empirical study (Caruana and Niculescu-Mizil, 2006) of supervised learning algorithms found that decision tree ensembles consistently outperformed traditional single-predictor models on a representative set of binary classification tasks.
    [Show full text]
  • Moments of Random Matrices and Hypergeometric Orthogonal Polynomials
    Commun. Math. Phys. 369, 1091–1145 (2019) Communications in Digital Object Identifier (DOI) https://doi.org/10.1007/s00220-019-03323-9 Mathematical Physics Moments of Random Matrices and Hypergeometric Orthogonal Polynomials Fabio Deelan Cunden1,FrancescoMezzadri2,NeilO’Connell1 , Nick Simm3 1 School of Mathematics and Statistics, University College Dublin, Belfield, Dublin 4, Ireland. E-mail: [email protected] 2 School of Mathematics, University of Bristol, University Walk, Bristol, BS8 1TW, UK 3 Mathematics Department, University of Sussex, Brighton, BN1 9RH, UK Received: 9 June 2018 / Accepted: 10 November 2018 Published online: 6 February 2019 – © The Author(s) 2019 Abstract: We establish a new connection between moments of n n random matri- × ces Xn and hypergeometric orthogonal polynomials. Specifically, we consider moments s E Tr Xn− as a function of the complex variable s C, whose analytic structure we describe completely. We discover several remarkable∈ features, including a reflection symmetry (or functional equation), zeros on a critical line in the complex plane, and orthogonality relations. An application of the theory resolves part of an integrality con- jecture of Cunden et al. (J Math Phys 57:111901, 2016)onthetime-delaymatrixof chaotic cavities. In each of the classical ensembles of random matrix theory (Gaus- sian, Laguerre, Jacobi) we characterise the moments in terms of the Askey scheme of hypergeometric orthogonal polynomials. We also calculate the leading order n asymptotics of the moments and discuss their symmetries and zeroes. We discuss aspects→∞ of these phenomena beyond the random matrix setting, including the Mellin transform of products and Wronskians of pairs of classical orthogonal polynomials.
    [Show full text]
  • "Integrable Systems, Random Matrices and Random Processes"
    Contents Integrable Systems, Random Matrices and Random Processes Mark Adler ..................................................... 1 1 Matrix Integrals and Solitons . 4 1.1 Random matrix ensembles . 4 1.2 Large n–limits . 7 1.3 KP hierarchy . 9 1.4 Vertex operators, soliton formulas and Fredholm determinants . 11 1.5 Virasoro relations satisfied by the Fredholm determinant . 14 1.6 Differential equations for the probability in scaling limits . 16 2 Recursion Relations for Unitary Integrals . 21 2.1 Results concerning unitary integrals . 21 2.2 Examples from combinatorics . 25 2.3 Bi-orthogonal polynomials on the circle and the Toeplitz lattice 28 2.4 Virasoro constraints and difference relations . 30 2.5 Singularity confinement of recursion relations . 33 3 Coupled Random Matrices and the 2–Toda Lattice . 37 3.1 Main results for coupled random matrices . 37 3.2 Link with the 2–Toda hierarchy . 39 3.3 L U decomposition of the moment matrix, bi-orthogonal polynomials and 2–Toda wave operators . 41 3.4 Bilinear identities and τ-function PDE’s . 44 3.5 Virasoro constraints for the τ-functions . 47 3.6 Consequences of the Virasoro relations . 49 3.7 Final equations . 51 4 Dyson Brownian Motion and the Airy Process . 53 4.1 Processes . 53 4.2 PDE’s and asymptotics for the processes . 59 4.3 Proof of the results . 62 5 The Pearcey Distribution . 70 5.1 GUE with an external source and Brownian motion . 70 5.2 MOPS and a Riemann–Hilbert problem . 73 VI Contents 5.3 Results concerning universal behavior . 75 5.4 3-KP deformation of the random matrix problem .
    [Show full text]
  • Computing the Jordan Structure of an Eigenvalue∗
    SIAM J. MATRIX ANAL.APPL. c 2017 Society for Industrial and Applied Mathematics Vol. 38, No. 3, pp. 949{966 COMPUTING THE JORDAN STRUCTURE OF AN EIGENVALUE∗ NICOLA MASTRONARDIy AND PAUL VAN DOORENz Abstract. In this paper we revisit the problem of finding an orthogonal similarity transformation that puts an n × n matrix A in a block upper-triangular form that reveals its Jordan structure at a particular eigenvalue λ0. The obtained form in fact reveals the dimensions of the null spaces of i (A − λ0I) at that eigenvalue via the sizes of the leading diagonal blocks, and from this the Jordan structure at λ0 is then easily recovered. The method starts from a Hessenberg form that already reveals several properties of the Jordan structure of A. It then updates the Hessenberg form in an efficient way to transform it to a block-triangular form in O(mn2) floating point operations, where m is the total multiplicity of the eigenvalue. The method only uses orthogonal transformations and is backward stable. We illustrate the method with a number of numerical examples. Key words. Jordan structure, staircase form, Hessenberg form AMS subject classifications. 65F15, 65F25 DOI. 10.1137/16M1083098 1. Introduction. Finding the eigenvalues and their corresponding Jordan struc- ture of a matrix A is one of the most studied problems in numerical linear algebra. This structure plays an important role in the solution of explicit differential equations, which can be modeled as n×n (1.1) λx(t) = Ax(t); x(0) = x0;A 2 R ; where λ stands for the differential operator.
    [Show full text]
  • Cycle Indices for Finite Orthogonal Groups of Even Characteristic
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 364, Number 5, May 2012, Pages 2539–2566 S 0002-9947(2012)05406-7 Article electronically published on January 6, 2012 CYCLE INDICES FOR FINITE ORTHOGONAL GROUPS OF EVEN CHARACTERISTIC JASON FULMAN, JAN SAXL, AND PHAM HUU TIEP Dedicated to Peter M. Neumann on the occasion of his seventieth birthday Abstract. We develop cycle index generating functions for orthogonal groups in even characteristic and give some enumerative applications. A key step is the determination of the values of the complex linear-Weil characters of the finite symplectic group, and their induction to the general linear group, at unipotent elements. We also define and study several natural probability measures on integer partitions. 1. Introduction P´olya [34], in a landmark paper on combinatorics (see [35] for an English trans- lation), introduced the cycle index of the symmetric groups. This can be written z as follows. Let ai(π)bethenumberof i-cycles of π. The Taylor expansion of e ai and the fact that there are n!/ i(ai!i )elementsofSn with ai i-cycles yield the following theorem. Theorem 1.1 (P´olya [34]). ∞ ∞ n m u a (π) xmu 1+ x i = e m . n! i n=1 π∈Sn i m=1 The P´olya cycle index has been a key tool in understanding what a typical per- mutation π ∈ Sn “looks like”. It is useful for studying properties of a permutation which depend only on its cycle structure. Here are a few examples of theorems which can be proved using the cycle index.
    [Show full text]
  • Random Density Matrices Results at fixed Size Asymptotics
    Random density matrices Results at fixed size Asymptotics Random density matrices Ion Nechita1 1Institut Camille Jordan, Universit´eLyon 1 Lyon, 27 October 2006 Ion Nechita Random density matrices Random density matrices Introduction Results at fixed size Pure states and denstiy matrices Asymptotics The induced measure Random density matrices Ion Nechita Random density matrices Random density matrices Introduction Results at fixed size Pure states and denstiy matrices Asymptotics The induced measure Why random density matrices ? Density matrices are central objects in quantum information theory, quantum computing, quantum communication protocols, etc. We would like to characterize the properties of typical density matrices ⇒ we need a probability measure on the set of density matrices Compute averages over the important quantities, such as von Neumann entropy, moments, etc. Random matrix theory: after all, density matrices are positive, trace one complex matrices Ion Nechita Random density matrices Random density matrices Introduction Results at fixed size Pure states and denstiy matrices Asymptotics The induced measure Why random density matrices ? Density matrices are central objects in quantum information theory, quantum computing, quantum communication protocols, etc. We would like to characterize the properties of typical density matrices ⇒ we need a probability measure on the set of density matrices Compute averages over the important quantities, such as von Neumann entropy, moments, etc. Random matrix theory: after all, density matrices are positive, trace one complex matrices Ion Nechita Random density matrices Random density matrices Introduction Results at fixed size Pure states and denstiy matrices Asymptotics The induced measure Why random density matrices ? Density matrices are central objects in quantum information theory, quantum computing, quantum communication protocols, etc.
    [Show full text]
  • Math-Ph/0111005V2 4 Sep 2003 Osbe Hsrsac a Enspotdi Atb H R Gran FRG Stay the My by Making Part for in Conrey Supported NSF
    RANDOM MATRIX ENSEMBLES ASSOCIATED TO COMPACT SYMMETRIC SPACES EDUARDO DUENEZ˜ Abstract. We introduce random matrix ensembles that corre- spond to the infinite families of irreducible Riemannian symmetric spaces of type I. In particular, we recover the Circular Orthogo- nal and Symplectic Ensembles of Dyson, and find other families of (unitary, orthogonal and symplectic) ensembles of Jacobi type. We discuss the universal and weakly universal features of the global and local correlations of the levels in the bulk and at the “hard” edge of the spectrum (i. e., at the “central points” 1 on the unit circle). Previously known results are extended, and± we find new simple formulas for the Bessel Kernels that describe the local cor- relations at a hard edge. 1. Introduction Local correlations between eigenvalues of various ensembles of ran- dom unitary, orthogonal or symplectic matrices, in the limit when their size tends to infinity, are known to exhibit universal behavior in the bulk of the spectrum. Dyson’s “Threefold Way” [14] predicts that this behavior is to be expected universally in the bulk of the spec- trum, depending only on the symmetry type of the ensemble (unitary, orthogonal or symplectic). Unfortunately, for general ensembles this arXiv:math-ph/0111005v2 4 Sep 2003 conjecture remains open, though in the unitary case (modeled after the Gaussian Unitary Ensemble) the universality of the local corre- lations has been proven for some classes of families [9, 7, 3, 2]. In the orthogonal and symplectic cases the extension of results known for Gaussian ensembles is technically more complicated but some more re- cent work deals with families of such ensembles [26].
    [Show full text]
  • Random Matrix Theory and Financial Correlations
    Mathematical Models and Methods in Applied Sciences c❢ World Scientific Publishing Company RANDOM MATRIX THEORY AND FINANCIAL CORRELATIONS LAURENT LALOUX, PIERRE CIZEAU and MARC POTTERS Science & Finance 109-111 rue Victor Hugo, 92532 Levallois Cedex, FRANCE JEAN-PHILIPPE BOUCHAUD Science & Finance , and Service de Physique de l’Etat´ Condens´e, Centre d’´etudes de Saclay Orme des Merisiers, 91191 Gif-sur-Yvette C´edex, FRANCE We show that results from the theory of random matrices are potentially of great interest to understand the statistical structure of the empirical correlation matrices appearing in the study of multivariate financial time series. We find a remarkable agreement be- tween the theoretical prediction (based on the assumption that the correlation matrix is random) and empirical data concerning the density of eigenvalues associated to the time series of the different stocks of the S&P500 (or other major markets). Finally, we give a specific example to show how this idea can be sucessfully implemented for improving risk management. Empirical correlation matrices are of great importance for risk management and asset allocation. The probability of large losses for a certain portfolio or option book is dominated by correlated moves of its different constituents – for example, a position which is simultaneously long in stocks and short in bonds will be risky because stocks and bonds usually move in opposite directions in crisis periods. The study of correlation (or covariance) matrices thus has a long history in finance and is one
    [Show full text]