DOCSLIB.ORG

Ranks and Determinants of the Sum of Matrices from Unitary Orbits

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Ranks and Determinants of the Sum of Matrices from Unitary Orbits Linear and Multilinear Algebra, Vol. 56, Nos. 1–2, Jan.–Mar. 2008, 105–130 Ranks and determinants of the sum of matrices from unitary orbits CHI-KWONG LI*y, YIU-TUNG POONz and NUNG-SING SZEx yDepartment of Mathematics, College of William & Mary, Williamsburg, VA 23185, USA zDepartment of Mathematics, Iowa State University, Ames, IA 50011, USA xDepartment of Mathematics, University of Connecticut, Storrs, CT 06269, USA Communicated by C. Tretter (Received 30 January 2007; in final form 27 March 2007) The unitary orbit UðAÞ of an nÂn complex matrix A is the set consisting of matrices unitarily similar to A. Given two nÂn complex matrices A and B, ranks and determinants of matrices of the form X þ Y with ðX, Y Þ2UðAÞUðBÞ are studied. In particular, a lower bound and the best upper bound of the set RðA, BÞ¼frankðX þ YÞ : X2UðAÞ, Y2UðBÞg are determined. It is shown that ÁðA, BÞ¼fdetðX þ YÞ : X2UðAÞ, Y2UðBÞg has empty interior if and only if the set is a line segment or a point; the algebraic structure of matrix pairs (A, B) with such properties are described. Other properties of the sets R(A, B) and ÁðA, BÞ are obtained. The results generalize those of other authors, and answer some open problems. Extensions of the results to the sum of three or more matrices from given unitary orbits are also considered. Downloaded By: [Li, Chi-Kwong] At: 00:07 20 March 2009 Keywords: Rank; Determinant; Matrices; Unitary orbit 2000 Mathematics Subject Classifications: 15A03; 15A15 1. Introduction Let A2Mn. The unitary orbit of A is denoted by à à UðAÞ¼fgUAU : U U ¼ In : Evidently, if A is regarded as a linear operator acting on Cn, then UðAÞ consists of the matrix representations of the same linear operator under different *Corresponding author. Email: [email protected] Dedicated to Professor Yik-Hoi Au-Yeung on the occasion of his 70th birthday. Linear and Multilinear Algebra ISSN 0308-1087 print/ISSN 1563-5139 online ß 2008 Taylor & Francis http://www.tandf.co.uk/journals DOI: 10.1080/03081080701369306 106 C.-K. Li et al. orthonormal bases. Naturally, UðAÞ captures many important features of the operator A. For instance, A is normal if and only if UðAÞ has a diagonal matrix; A is Hermitian (positive semi-definite) if and only if UðAÞ contains a (nonnegative) real diag- onal matrix; A is unitary if and only if UðAÞ has a diagonal matrix with unimodular diagonal entries. There are also results on the characterization of diagonal entries and submatrices of matrices in UðAÞ; see [14,20,23,30] and their references. In addition, the unitary orbit of A has a lot of interesting geometrical and algebraic properties, see [11]. Motivated by theory as well as applied problems, there has been a great deal of interest in studying the sum of two matrices from specific unitary orbits. For example, eigenvalues of UAUà þ VBVà for Hermitian matrices A and B were completely determined in terms of those of A and B (see [16] and its references); the optimal norm estimate of UAUà þ VBVà was obtained (see [10] and its references); à à the range of values of detðUAU þ VBV Þ for Hermitian matrices A, B2Mn was described, see [15]. Later, Marcus and Oliveira [26,29] conjectured that if A, B2Mn are normal matrices with eigenvalues a1, ..., an and b1, ..., bn, respectively, then for à à any unitary U, V2Mn, detðUAU þ VBV Þ always lies in the convex hull of () Yn ÀÁ PðA, BÞ¼ aj þ bðjÞ : is a permutation of f1, ..., ng : ð1:1Þ j¼1 In connection to this conjecture, researchers [2–5,7,8,12,13] considered the deter- minantal range of A, B2Mn defined by ÁðA, BÞ¼fdetðA þ UBUÃÞ: U is unitaryg: This can be viewed as an analog of the generalized numerical range of A and B defined by WðA, BÞ¼ftrðAUBUÃÞ: U is unitaryg, Downloaded By: [Li, Chi-Kwong] At: 00:07 20 March 2009 which is a useful concept in pure and applied areas; see [18,21,25] and their references. In this article, we study some basic properties of the matrices in UðAÞþUðBÞ¼fX þ Y: ðX, Y Þ2UðAÞUðBÞg: The focus will be on the rank and the determinant of these matrices. Our article is organized as follows. In section 2, we obtain a lower bound and the best upper bound for the set RðA, BÞ¼frankðX þ Y Þ: X 2UðAÞ, Y 2UðBÞg; moreover, we characterize those matrix pairs (A, B) such that R(A, B) is a singleton, and show that the set R(A, B) has the form fk, k þ 1, ..., ng if A and ÀB have no common eigenvalues. On the contrary if A and ÀB are orthogonal projections, then the rank values of matrices in UðAÞþUðBÞ will either be all even or all odd. In section 3, we characterize matrix pairs ðA, BÞ such that ÁðA, BÞ has empty interior, which is Ranks and determinants of the sum of matrices 107 possible only when ÁðA, BÞ is a singleton or a nondegenerate line segment. This extends the results of other researchers who treated the case when A and B are normal [2–4,9]. In particular, our result shows that it is possible to have normal matrices A and B such that ÁðA, BÞ is a subset of a line, which does not pass through the origin. This disproves a conjecture in [9]. In [3], the authors showed that if A, B2Mn are normal matrices such that the union of the spectra of A and ÀB consists of 2n distinct elements, then every nonzero sharp point of ÁðA, BÞ is an element in P(A, B). (See the definition of sharp point in section 3.) We showed that every (zero or nonzero) sharp point of ÁðA, BÞ belongs to P(A, B) for arbitrary matrices A, B2Mn. In section 4, we consider the sum of three or more matrices from given unitary orbits, and matrix orbits corresponding to other equivalence relations. In the literature, some authors considered the set DðA, BÞ¼fdetðX À YÞ: X 2UðAÞ, Y 2UðBÞg instead of ÁðA, BÞ. Evidently, we have DðA, BÞ¼ÁðA, ÀBÞ. It is easy to translate results on D(A, B) to those on ÁðA, BÞ, and vice versa. Indeed, for certain results and proofs, it is more convenient to use the formulation of D(A, B). We will do that in section 3. On the other hand, it is more natural to use the summation formulation to discuss the extension of the results to matrices from three or more unitary orbits. 2. Ranks 2.1. Maximum and minimum rank In [10], the authors obtained optimal norm bounds for matrices in UðAÞþUðBÞ for two given matrices A, B2Mn. By the triangle inequality, we have à à maxfkUA U þ VBV k: U, V unitarygminfkA À InkþkB þ Ink: 2 Cg: Downloaded By: [Li, Chi-Kwong] At: 00:07 20 March 2009 It was shown in [10] that the inequality is actually an equality. For the rank functions, we have à à maxfrankðUAU þ VBV Þ: U,V unitarygminfrankðA À InÞþrankðB þ InÞ: 2 Cg: Of course, the right side may be strictly larger than n, and thus equality may not hold in general. It turns out that this obstacle can be overcome easily as shown in the following. THEOREM 2.1 Let A, B2Mn and m ¼ minfrankðA À InÞþrankðB þ InÞ: 2 Cg ¼ minfrankðA À InÞþrankðB þ InÞ: is an eigenvalue of A ÈÀBg: Then maxfrankðUAUà þ VBVÃÞ : U, V unitaryg¼minfm, ng: 108 C.-K. Li et al. Proof If is an eigenvalue of A ÈÀB, then rankðA À InÞþrankðB þ InÞ2n À 1; if is not an eigenvalue of A ÈÀB, then rankðA À InÞþrankðB þ InÞ¼2n: As a result, rankðA À InÞþrankðB þ InÞ will attain its minimum at an eigenvalue of the matrix A ÈÀB. It is clear that maxfrankðUA U à þ VBVÃÞ: U, V unitarygminfm, ng: It remains to show that there are U, V such that UAUà þ VBVà has rank equal to minfm, ng. Suppose mn and there is such that rankðA À InÞ¼k and rankðB þ InÞ¼m À k. We may replace (A, B)byðA À In, B þ InÞ and assume that ¼ 0. Furthermore, we may assume that km À k; otherwise, interchange A and B. Let A ¼ XDY be such that X, Y2Mn are unitary, and D ¼ D1 È 0nÀk with invertible diagonal D1. Replace A by YAY*, we may assume that U11 U12 D1 0 A ¼ UD ¼ U21 U22 00nÀk with U ¼ YX. Similarly, we may assume that V11 V12 0k 0 B ¼ VE ¼ , V21 V22 0 E2 where V is a unitary matrix and E2 is a diagonal matrix with rank m À k. Let W be a unitary matrix such that the first k columns of WU together with the last n À k columns of V are linearly independent. That is, if W11 W12 W ¼ , Downloaded By: [Li, Chi-Kwong] At: 00:07 20 March 2009 W21 W22 the matrix W11U11 þ W12U21 V12 W21U11 þ W22U21 V22 à is invertible. If W11 is invertible, then D1W11 has rank k and so à à W11U11 þ W12U21 V12 D1W D1W WAWà þ B ¼ 11 21 W21U11 þ W22U21 V22 0 E2 has rank m.IfW11 is not invertible, we will replace W by W~ obtained as follows. By the CS decomposition, there are unitary matrices P1, Q1 2Mk and P2, Q2 2MnÀk such that CS ðP1 È P2ÞWðQ1 È Q2Þ¼ È InÀ2k, ÀSC Ranks and determinants of the sum of matrices 109 qffiffiffiffiffiffiffiffiffiffiffiffiffi qffiffiffiffiffiffiffiffiffiffiffiffiffi 2 2 where C ¼ diagðc1, ..., ckÞ with 1 c1 ÁÁÁck 0 and S ¼ diagð 1 À c1, ..., 1 À ck Þ.
Load more

Recommended publications
  • Lecture Notes: Qubit Representations and Rotations
    Phys 711 Topics in Particles & Fields | Spring 2013 | Lecture 1 | v0.3 Lecture notes: Qubit representations and rotations Jeffrey Yepez Department of Physics and Astronomy University of Hawai`i at Manoa Watanabe Hall, 2505 Correa Road Honolulu, Hawai`i 96822 E-mail: [email protected] www.phys.hawaii.edu/∼yepez (Dated: January 9, 2013) Contents mathematical object (an abstraction of a two-state quan- tum object) with a \one" state and a \zero" state: I. What is a qubit? 1 1 0 II. Time-dependent qubits states 2 jqi = αj0i + βj1i = α + β ; (1) 0 1 III. Qubit representations 2 A. Hilbert space representation 2 where α and β are complex numbers. These complex B. SU(2) and O(3) representations 2 numbers are called amplitudes. The basis states are or- IV. Rotation by similarity transformation 3 thonormal V. Rotation transformation in exponential form 5 h0j0i = h1j1i = 1 (2a) VI. Composition of qubit rotations 7 h0j1i = h1j0i = 0: (2b) A. Special case of equal angles 7 In general, the qubit jqi in (1) is said to be in a superpo- VII. Example composite rotation 7 sition state of the two logical basis states j0i and j1i. If References 9 α and β are complex, it would seem that a qubit should have four free real-valued parameters (two magnitudes and two phases): I. WHAT IS A QUBIT? iθ0 α φ0 e jqi = = iθ1 : (3) Let us begin by introducing some notation: β φ1 e 1 state (called \minus" on the Bloch sphere) Yet, for a qubit to contain only one classical bit of infor- 0 mation, the qubit need only be unimodular (normalized j1i = the alternate symbol is |−i 1 to unity) α∗α + β∗β = 1: (4) 0 state (called \plus" on the Bloch sphere) 1 Hence it lives on the complex unit circle, depicted on the j0i = the alternate symbol is j+i: 0 top of Figure 1.
    [Show full text]
  • Parametrization of 3×3 Unitary Matrices Based on Polarization
    Parametrization of 33 unitary matrices based on polarization algebra (May, 2018) José J. Gil Parametrization of 33 unitary matrices based on polarization algebra José J. Gil Universidad de Zaragoza. Pedro Cerbuna 12, 50009 Zaragoza Spain [email protected] Abstract A parametrization of 33 unitary matrices is presented. This mathematical approach is inspired by polarization algebra and is formulated through the identification of a set of three orthonormal three-dimensional Jones vectors representing respective pure polarization states. This approach leads to the representation of a 33 unitary matrix as an orthogonal similarity transformation of a particular type of unitary matrix that depends on six independent parameters, while the remaining three parameters correspond to the orthogonal matrix of the said transformation. The results obtained are applied to determine the structure of the second component of the characteristic decomposition of a 33 positive semidefinite Hermitian matrix. 1 Introduction In many branches of Mathematics, Physics and Engineering, 33 unitary matrices appear as key elements for solving a great variety of problems, and therefore, appropriate parameterizations in terms of minimum sets of nine independent parameters are required for the corresponding mathematical treatment. In this way, some interesting parametrizations have been obtained [1-8]. In particular, the Cabibbo-Kobayashi-Maskawa matrix (CKM matrix) [6,7], which represents information on the strength of flavour-changing weak decays and depends on four parameters, constitutes the core of a family of parametrizations of a 33 unitary matrix [8]. In this paper, a new general parametrization is presented, which is inspired by polarization algebra [9] through the structure of orthonormal sets of three-dimensional Jones vectors [10].
    [Show full text]
  • Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 2 Unitary
    Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 2 Unitary similarity and normal matrices n ∗ Definition A set of vector fx1; : : : ; xkg in C is orthogonal if xi xj = 0 for i 6= j. If, in addition, ∗ that xj xj = 1 for each j, then the set is orthonormal. Theorem An orthonormal set of vectors in Cn is linearly independent. n Definition An orthonormal set fx1; : : : ; xng in C is an orthonormal basis. A matrix U 2 Mn ∗ is unitary if it has orthonormal columns, i.e., U U = In. Theorem Let U 2 Mn. The following are equivalent. (a) U is unitary. (b) U is invertible and U ∗ = U −1. ∗ ∗ (c) UU = In, i.e., U is unitary. (d) kUxk = kxk for all x 2 Cn, where kxk = (x∗x)1=2. Remarks (1) Real unitary matrices are orthogonal matrices. (2) Unitary (real orthogonal) matrices form a group in the set of complex (real) matrices and is a subgroup of the group of invertible matrices. ∗ Definition Two matrices A; B 2 Mn are unitarily similar if A = U BU for some unitary U. Theorem If A; B 2 Mn are unitarily similar, then X 2 ∗ ∗ X 2 jaijj = tr (A A) = tr (B B) = jbijj : i;j i;j Specht's Theorem Two matrices A and B are similar if and only if tr W (A; A∗) = tr W (B; B∗) for all words of length of degree at most 2n2. Schur's Theorem Every A 2 Mn is unitarily similar to a upper triangular matrix. Theorem Every A 2 Mn(R) is orthogonally similar to a matrix in upper triangular block form so that the diagonal blocks have size at most 2.
    [Show full text]
  • Matrices That Commute with a Permutation Matrix
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Matrices That Commute With a Permutation Matrix Jeffrey L. Stuart Department of Mathematics University of Southern Mississippi Hattiesburg, Mississippi 39406-5045 and James R. Weaver Department of Mathematics and Statistics University of West Florida Pensacola. Florida 32514 Submitted by Donald W. Robinson ABSTRACT Let P be an n X n permutation matrix, and let p be the corresponding permuta- tion. Let A be a matrix such that AP = PA. It is well known that when p is an n-cycle, A is permutation similar to a circulant matrix. We present results for the band patterns in A and for the eigenstructure of A when p consists of several disjoint cycles. These results depend on the greatest common divisors of pairs of cycle lengths. 1. INTRODUCTION A central theme in matrix theory concerns what can be said about a matrix if it commutes with a given matrix of some special type. In this paper, we investigate the combinatorial structure and the eigenstructure of a matrix that commutes with a permutation matrix. In doing so, we follow a long tradition of work on classes of matrices that commute with a permutation matrix of a specified type. In particular, our work is related both to work on the circulant matrices, the results for which can be found in Davis’s compre- hensive book [5], and to work on the centrosymmetric matrices, which can be found in the book by Aitken [l] and in the papers by Andrew [2], Bamett, LZNEAR ALGEBRA AND ITS APPLICATIONS 150:255-265 (1991) 255 Q Elsevier Science Publishing Co., Inc., 1991 655 Avenue of the Americas, New York, NY 10010 0024-3795/91/$3.50 256 JEFFREY L.
    [Show full text]
  • MATRICES WHOSE HERMITIAN PART IS POSITIVE DEFINITE Thesis by Charles Royal Johnson in Partial Fulfillment of the Requirements Fo
    MATRICES WHOSE HERMITIAN PART IS POSITIVE DEFINITE Thesis by Charles Royal Johnson In Partial Fulfillment of the Requirements For the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 1972 (Submitted March 31, 1972) ii ACKNOWLEDGMENTS I am most thankful to my adviser Professor Olga Taus sky Todd for the inspiration she gave me during my graduate career as well as the painstaking time and effort she lent to this thesis. I am also particularly grateful to Professor Charles De Prima and Professor Ky Fan for the helpful discussions of my work which I had with them at various times. For their financial support of my graduate tenure I wish to thank the National Science Foundation and Ford Foundation as well as the California Institute of Technology. It has been important to me that Caltech has been a most pleasant place to work. I have enjoyed living with the men of Fleming House for two years, and in the Department of Mathematics the faculty members have always been generous with their time and the secretaries pleasant to work around. iii ABSTRACT We are concerned with the class Iln of n><n complex matrices A for which the Hermitian part H(A) = A2A * is positive definite. Various connections are established with other classes such as the stable, D-stable and dominant diagonal matrices. For instance it is proved that if there exist positive diagonal matrices D, E such that DAE is either row dominant or column dominant and has positive diag­ onal entries, then there is a positive diagonal F such that FA E Iln.
    [Show full text]
  • Matrix Theory
    Matrix Theory Xingzhi Zhan +VEHYEXI7XYHMIW MR1EXLIQEXMGW :SPYQI %QIVMGER1EXLIQEXMGEP7SGMIX] Matrix Theory https://doi.org/10.1090//gsm/147 Matrix Theory Xingzhi Zhan Graduate Studies in Mathematics Volume 147 American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE David Cox (Chair) Daniel S. Freed Rafe Mazzeo Gigliola Staffilani 2010 Mathematics Subject Classification. Primary 15-01, 15A18, 15A21, 15A60, 15A83, 15A99, 15B35, 05B20, 47A63. For additional information and updates on this book, visit www.ams.org/bookpages/gsm-147 Library of Congress Cataloging-in-Publication Data Zhan, Xingzhi, 1965– Matrix theory / Xingzhi Zhan. pages cm — (Graduate studies in mathematics ; volume 147) Includes bibliographical references and index. ISBN 978-0-8218-9491-0 (alk. paper) 1. Matrices. 2. Algebras, Linear. I. Title. QA188.Z43 2013 512.9434—dc23 2013001353 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294 USA. Requests can also be made by e-mail to [email protected]. c 2013 by the American Mathematical Society. All rights reserved. The American Mathematical Society retains all rights except those granted to the United States Government.
    [Show full text]
  • Unitary-And-Hermitian-Matrices.Pdf
    11-24-2014 Unitary Matrices and Hermitian Matrices Recall that the conjugate of a complex number a + bi is a bi. The conjugate of a + bi is denoted a + bi or (a + bi)∗. − In this section, I’ll use ( ) for complex conjugation of numbers of matrices. I want to use ( )∗ to denote an operation on matrices, the conjugate transpose. Thus, 3 + 4i = 3 4i, 5 6i =5+6i, 7i = 7i, 10 = 10. − − − Complex conjugation satisfies the following properties: (a) If z C, then z = z if and only if z is a real number. ∈ (b) If z1, z2 C, then ∈ z1 + z2 = z1 + z2. (c) If z1, z2 C, then ∈ z1 z2 = z1 z2. · · The proofs are easy; just write out the complex numbers (e.g. z1 = a+bi and z2 = c+di) and compute. The conjugate of a matrix A is the matrix A obtained by conjugating each element: That is, (A)ij = Aij. You can check that if A and B are matrices and k C, then ∈ kA + B = k A + B and AB = A B. · · You can prove these results by looking at individual elements of the matrices and using the properties of conjugation of numbers given above. Definition. If A is a complex matrix, A∗ is the conjugate transpose of A: ∗ A = AT . Note that the conjugation and transposition can be done in either order: That is, AT = (A)T . To see this, consider the (i, j)th element of the matrices: T T T [(A )]ij = (A )ij = Aji =(A)ji = [(A) ]ij. Example. If 1 2i 4 1 + 2i 2 i 3i ∗ − A = − , then A = 2 + i 2 7i .
    [Show full text]
  • Path Connectedness and Invertible Matrices
    PATH CONNECTEDNESS AND INVERTIBLE MATRICES JOSEPH BREEN 1. Path Connectedness Given a space,1 it is often of interest to know whether or not it is path-connected. Informally, a space X is path-connected if, given any two points in X, we can draw a path between the points which stays inside X. For example, a disc is path-connected, because any two points inside a disc can be connected with a straight line. The space which is the disjoint union of two discs is not path-connected, because it is impossible to draw a path from a point in one disc to a point in the other disc. Any attempt to do so would result in a path that is not entirely contained in the space: Though path-connectedness is a very geometric and visual property, math lets us formalize it and use it to gain geometric insight into spaces that we cannot visualize. In these notes, we will consider spaces of matrices, which (in general) we cannot draw as regions in R2 or R3. To begin studying these spaces, we first explicitly define the concept of a path. Definition 1.1. A path in X is a continuous function ' : [0; 1] ! X. In other words, to get a path in a space X, we take an interval and stick it inside X in a continuous way: X '(1) 0 1 '(0) 1Formally, a topological space. 1 2 JOSEPH BREEN Note that we don't actually have to use the interval [0; 1]; we could continuously map [1; 2], [0; 2], or any closed interval, and the result would be a path in X.
    [Show full text]
  • Positive Semidefinite Quadratic Forms on Unitary Matrices
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Linear Algebra and its Applications 433 (2010) 164–171 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Positive semidefinite quadratic forms on unitary matrices Stanislav Popovych Faculty of Mechanics and Mathematics, Kyiv Taras Schevchenko University, Ukraine ARTICLE INFO ABSTRACT Article history: Let Received 3 November 2009 n Accepted 28 January 2010 f (x , ...,x ) = α x x ,a= a ∈ R Available online 6 March 2010 1 n ij i j ij ji i,j=1 Submitted by V. Sergeichuk be a real quadratic form such that the trace of the Hermitian matrix n AMS classification: ( ... ) := α ∗ 15A63 f V1, ,Vn ijVi Vj = 15B48 i,j 1 15B10 is nonnegative for all unitary 2n × 2n matrices V , ...,V .We 90C22 1 n prove that f (U1, ...,Un) is positive semidefinite for all unitary matrices U , ...,U of arbitrary size m × m. Keywords: 1 n Unitary matrix © 2010 Elsevier Inc. All rights reserved. Positive semidefinite matrix Quadratic form Trace 1. Introduction and preliminary For each real quadratic form n f (x1, ...,xn) = αijxixj, αij = αji ∈ R, i,j=1 and for unitary matrices U1, ...,Un ∈ Mm(C), we define the Hermitian matrix n ( ... ) := α ∗ . f U1, ,Un ijUi Uj i,j=1 E-mail address: [email protected] 0024-3795/$ - see front matter © 2010 Elsevier Inc. All rights reserved. doi:10.1016/j.laa.2010.01.041 S. Popovych / Linear Algebra and its Applications 433 (2010) 164–171 165 We say that f is unitary trace nonnegative if Tr f (U1, ...,Un) 0 for all unitary matrices U1, ...,Un.We say that f is unitary positive semidefinite if f (U1, ...,Un) 0 for all unitary matrices U1, ...,Un.
    [Show full text]
  • Non-Completely Positive Maps: Properties and Applications
    Non-Completely Positive Maps: Properties and Applications By Christopher Wood A thesis submitted to Macquarie University in partial fulfilment of the degree of Bachelor of Science with Honours Department of Physics November 2009 ii c Christopher Wood, 2009. Typeset in LATEX 2". iii Except where acknowledged in the customary manner, the material presented in this thesis is, to the best of my knowledge, original and has not been submitted in whole or part for a degree in any university. Christopher Wood iv Acknowledgements I begin with the obvious and offer tremendous thanks to my supervisors Alexei Gilchrist and Daniel Terno. They managed to kept me on track throughout the year, whether with the stick or the carrot will not be mentioned, and without their support and guidance this thesis would not exist. I would also like to thank Ian Benn and John Holdsworth from the University of New- castle. The former who's often shambolic but always interesting undergraduate courses cultivated my interest in theoretical physics, and the latter who told me to follow my heart and suggested the idea of completing my Honours year at a different university. Special mention also goes to Mark Butler who's excellent teaching in high school physics derailed me from a planned career in graphic design and set me on the path of science. Through happenstance he also introduced me to members of the quantum information group at Macquarie University where I ended up enrolling for my Honours year. I also thank my family whose constant love and support is greatly appreciated. Also free food and accommodation is always welcome to a financially challenged university student.
    [Show full text]
  • Unitary Matrices
    Chapter 4 Unitary Matrices 4.1 Basics This chapter considers a very important class of matrices that are quite use- ful in proving a number of structure theorems about all matrices. Called unitary matrices, they comprise a class of matrices that have the remarkable properties that as transformations they preserve length, and preserve the an- gle between vectors. This is of course true for the identity transformation. Therefore it is helpful to regard unitary matrices as “generalized identities,” though we will see that they form quite a large class. An important exam- ple of these matrices, the rotations, have already been considered. In this chapter, the underlying field is usually C, the underlying vector space is Cn, and almost without exception the underlying norm is 2.Webeginby recalling a few important facts. k·k Recall that a set of vectors x1,...,xk Cn is called orthogonal if ∈ x xm = xm,xj =0for1 j = m k.Thesetisorthonormal if j∗ h i ≤ 6 ≤ 1 j = m x x = δ = j∗ m mj 0 j = m. ½ 6 An orthogonal set of vectors can be made orthonormal by scaling: 1 x x . j 1/2 j −→ (xj∗xj) Theorem 4.1.1. Every set of orthonormal vectors is linearly independent. Proof. The proof is routine, using a common technique. Suppose S = k xj is orthonormal and linearly dependent. Then, without loss of gen- { }j=1 157 158 CHAPTER 4. UNITARY MATRICES erality (by relabeling if needed), we can assume k 1 − uk = cjuj. j=1 X Compute uk∗uk as k 1 − 1=u∗uk = u∗ cjuj k k j=1 X k 1 − = cjuk∗uj =0.
    [Show full text]
  • On Unitary Equivalence of Arbitrary Matrices^)
    ON UNITARY EQUIVALENCE OF ARBITRARY MATRICES^) BY HEYDAR RADJAVI 1. Introduction. The problem we wish to study is that of deciding whether two given square matrices A and 73 over the field of complex numbers are unitarily equivalent, i.e., whether there exists a unitary matrix U such that 73 = U~lA U. This decision can be made easily if a computable set of canonical forms for all matrices is obtained, that is, if there exists an algorithm which associates with any given matrix A another matrix C(A) such that if A and 73 are two matrices and C(A) and C(73) their respective forms obtained by the algorithm, then C(^4) is equal to C(73) if and only if A and 73 are unitarily equivalent. The solution of this problem for the set of normal matrices is well known; the canonical set consists of all diagonal matrices with complex entries arranged in some order agreed on. We shall make use of facts concern- ing the diagonalization of normal matrices. The analog of the present problem, where similarity is considered instead of unitary equivalence is much simpler (Jordan canonical forms). We cannot expect as simple a canonical set in the case of unitary equivalence. The fol- lowing example shows how much vaster the set of canonical forms in this case can be as compared to the set of Jordan canonical forms: Let re>2. Take all reXre matrices of the form au au lis • «In 1 au au • a2n 3 1 035 • ain A = 0 4 1 ■ 04n .0 0 0 0 0 • • • re where the a¿y are complex numbers.
    [Show full text]