DOCSLIB.ORG

3×3-Kronecker Pauli Matrices (Kpms)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
3×3-Kronecker Pauli Matrices (Kpms) 3 3-Kronecker Pauli Matrices × Christian Rakotonirina Civil Engineering Department, Institut Supérieur de Technologie d'Antananarivo, IST-T, Madagascar [email protected] Simon Rasamizafy Department of Physics University of Toliara, Madagascar [email protected] Abstract : The properties of what we call inverse-symmetric matrices have helped us for ## constructing a basis of ℂ which satisfy four properties of the $ronecker generalize Pauli matrices. The Pauli group of this basis has been efine . In using some properties (( )) of the $ronecker commutation matrices, bases of " an " which share the same properties have also been constructe . $eywor s: $ronecker pro uct, Pauli matrices, $ronecker commutation matrices, $ronecker generalize Pauli matrices. 1 Intro uction This paper tries to solve a problem pose in [1,, of searching a set -# . /01, 02, 3 , 045 of nine 33-matrices satisfy the following relation with the 373-$ronecker commutation matri8 9$CM), 4 1 =#7# . > 0? A 0? 91) 3 ?@1 The usefulness of the $ronecker permutation matrices, particularly the $ronecker commutation matrices 9$CMs) in mathematical physics can be seen in [2,, [3,, [C,, [5,. In these papers, the 272- $CM is written in terms of the Pauli matrices, which are 22 matrices, by the following way # 1 =2A2 . > E? AE? 2 ?@F The generalization of this formula in terms of generalize Gell-Mann matrices, which are a generalization of the Pauli matrices, is the topic of [6,. Iut there are other generalization of the Pauli matrices in other sense than the generalize Gell-Mann matrices, among others the $ibler matrices [7,, the $ronecker generalize Pauli matrices, see for e8ample [8,. These last are obtaine by $ronecker pro uct of the Pauli k k matrices. The more general relation giving the 2 72 -$CM in terms of the $ronecker generalize Pauli matrices may be seen in [1,. That makes us search for other generalization of the Pauli matrices in this sense, like the generalization of the Gell-Mann matrices to what we call rectangle Gell-Mann matrices in [9,. That is, we search for set of 33 matrices which have got some properties of the $ronecker generalize Pauli k k matrices, which are 2 2 matrices. Me will call these matrices 33-$ronecker Pauli matrices 9$PMs). These properties of the $ronecker generalize Pauli matrices or N N-$PMs S U 9OP)FQ?QR T1, with N . 2 an O? .E?V7E?S7 3 7E?W, are S RR P i. 9O )FQ?QR T1 is a basis of " ii. S R T1 1 =R7R . > O? 7 OP N ?@F X iii. O? .O? 9hermiticity) 2 iv. O? .YZ 9Square root of unit) X v. ]^_O` Oab . Nc`U 9drthogonality) vi. ]^_O`b . e 9Tracelessness) fowever, there is no 33 matri8, forme by zeros in the iagonal which satisfies both the relations iii. an iv. [1,. Thus, at a first time, for the 33-$PMs we o not eman tracelessness. Me will call 33-$PMs a set of 33 matrices which satisfy, not only the formula 91), but the five properties above, tracelessness vi. move apart. Thus, in this paper we will talk at first about $CMs. In the ne8t section, we will talk about what we call inverse-symmetric matrices. These matrices have got interesting properties for constructing the 33-$PMs. After, we will give the set of 33-$PMs, which are inverse-symmetric matrices. ginally, some way to the generalization will be iscusse . k k Me know that the set of 2 2 -$PMs, up to multiplicative phases: 1, h1, i an hi, is the Pauli group for the usual matri8 pro uct. Thus, we will try to efine the Pauli group of the 33-$PMs. Some calculations such as the e8pression of 373-$CMs request calculations with software. Me have use SCILAI for those calculations. 2 $ronecker Commutation matrices The $ronecker pro uct of matrices is not commutative, but there is a permutation matri8 which, in multiplying to the pro uct, commutes the pro uct. Me call such matri8 $ronecker commutation matri8. ZlZl Z1 Defi nition 1 The permutation matri8 =Z7l m " , such that for any matrices n m " , l1 o m " =Z7l9n7o) . o7n is calle p7q-$ronecker commutation matri8, p7q-$CM. 1 e e e e e e e e e e e 1 e e e e e ve e e e e e 1 e ey 1 e e e ue 1 e e e e e e ex u x =2 7 2 . re e 1 es, =#7# . e 1 e e e e e 1 e e ue e e x ue e e e e e e 1 ex e e e 1 ue e 1 e e e e e ex e e e e e 1 e e e te e e e e e e e 1w gor constructing p7q z$CM, we can use the following rule [13,. Rule 2 Let us start in putting 1 at first row, first column, then let us pass into the secon column in going own at the rate of n rows an put 1 at this place, then pass into the thir column in going own at the rate of n rows an put 1, an so on until there is only for us n-1 rows for going own 9then we have obtaine as number of 1 : p). Then pass into the ne8t column which is the 9p + 1)-th column, put 1 at the secon row of this column an repeat the process until we have only n-2 rows for going own 9then we have obtaine as number of 1 : 2p). After that pass into the ne8t column which is the 92p + 2)-th column,- put 1 at the thir row of this column an repeat the process until we have only n 3 rows for going own 9then we have obtaine as number of 1 : 3p). Continuing in this way we will have that the element at np-th row, np-th column is 1. Proposition 3 Suppose ~ =Z7| . > }? 7•` ?,`@1 an =l7€ . > •U 7 U,@1 |Z Z| with the }?’s are elements of " , the •`’s are elements of " , the •U’s are elements €l l€ of " an the ’s are elements of " . Then, ~ =Zl7|€ . > > }?7•U7•`7 ?,`@1 U,@1 Proof Z1 l1 |1 €1 Let 9n), 9), 9o) an 9) be, respectively, bases of " , " , " an " . Then, Zl|€1 _n77o7b is a basis of " . It is enough to prove that ~ > > }?7•U7•`7 _n77o7b . o77n7 ?,`@1 U,@1 Me use the proposition 11. grom ~ > }? 7•`_n7ob . o7n ?,`@1 we have ~ > > }?n7•U7•`o7 . > o7•U 7n7 ?,`@1 U,@1 U,@1 . o7 > •U 7n7 U,@1 Moreover > •U 7n7 . 7n7 U,@1 an that en s the proof. 3 Inverse -symmetric matrices In this section, we intro uce what we call inverse-symmetric matrices. Me think that this term will be useful for the continuation. ? Defi nition C Let us call inverse-symmetric matri8 an invertible comple8 matri8 } . _}`b ` 1 ? ` such that }? . • if } e. Unlike an antisymmetric matri8, for the non-zero element of the matri8, its symmetric with respect to the iagonal is its inverse. 1 e e 1 E8ample 5 The 22 unit matri8 Y2 .’ “ an the Pauli matrices E1 .’ “, e 1 1 e e hi 1 e E2 .’ “ an E# .’ “ are inverse-symmetric matrices. i e e h1 ? ? Proposition 6 Let } . _}`b an • . _•` b be inverse-symmetric matrices. Then, }7• is an inverse-symmetric matri8. ?U ? U Proof . }7• is an invertible matri8. If 9}7•)` e if, only if }` e an • e. Its ` ` 1 1 1 U W W symmetric with respect to the iagonal is 9}7•)?U .}? • . • ”• . 97”)•• . Proposition 7 gor any p p inverse-symmetric matri8 }, with only n non zero elements, 2 } .YZ. ? 2 Z ? U Proof . Let } . _}`b1Q?,`QZan then } ._?@1 }U}` b1Q?,`QZ. In or er that } is invertible, ? there must be only a non zero element in each row an in each column. Let }| be the l 2 ? non zero element in the row i an }` the non zero element in the column —. 9} )` . ? | ? l }|}` + }l}` . | 1 l | ` 2 ? If i —, }? . e an }` e, thus }` . e an }l . e. fence, 9} )` . e. 2 ? Z ? U ? | If i . —, 9} )` . ?@1 }U}` .}|}` . 1. Therefore, let us take some inverse-symmetric matrices forme by only three non zero elements for the nine 33 matrices we woul like to search for, in or er that iv. is satisfie . C $ronecker generalization of the Pauli ma trices The $ronecker generalize Pauli matrices are the matrices _E?7E`bFQ?,`Q#[1e,, [11,, V S ™ _E?7E`7EUbFQ?,`,UQ#, _E? 7E? 7 3 7E? bFQ?V,?S,3,?™Q# [8, obtaine by $ronecker pro uct of the Pauli matrices an the 22 unit matri8. Accor ing to the propositions above, they are inverse-symmetric matrices an share many of the properties of the Pauli matrices: ™ ™ 2 2 basis of " , ii., iii., iv., v. an vi. in the intro uction, for [8,. ™ V S ™ Denote the set of _E? 7E? 7 3 7E? bFQ?V,?S,3,?™Q# by -2 . ™ 7Z -2 . /EF,E1,E2,E#5 . E?V7E?S7 3 7E?™/e ≤ i1, i2, 3 , iZ ≤ 3• The set ™ ™ 2 .-2 7/1, h1, i, hi5 V S ™ is a group calle the Pauli group of _E? 7E? 7 3 7E? bFQ?V,?S,3,?™Q# [8,. # Me can check easily, in using the relation E`EU . c`U EF + i ?@1 `U E, for —, m /1, 2, 35 ™ ™ that 2 is equal to the set of the pro ucts of two elements of -2 , up to multiplicative phases, which are elements of /1, h1, i, hi5.
Load more

Recommended publications
  • Quantum Information
    Quantum Information J. A. Jones Michaelmas Term 2010 Contents 1 Dirac Notation 3 1.1 Hilbert Space . 3 1.2 Dirac notation . 4 1.3 Operators . 5 1.4 Vectors and matrices . 6 1.5 Eigenvalues and eigenvectors . 8 1.6 Hermitian operators . 9 1.7 Commutators . 10 1.8 Unitary operators . 11 1.9 Operator exponentials . 11 1.10 Physical systems . 12 1.11 Time-dependent Hamiltonians . 13 1.12 Global phases . 13 2 Quantum bits and quantum gates 15 2.1 The Bloch sphere . 16 2.2 Density matrices . 16 2.3 Propagators and Pauli matrices . 18 2.4 Quantum logic gates . 18 2.5 Gate notation . 21 2.6 Quantum networks . 21 2.7 Initialization and measurement . 23 2.8 Experimental methods . 24 3 An atom in a laser field 25 3.1 Time-dependent systems . 25 3.2 Sudden jumps . 26 3.3 Oscillating fields . 27 3.4 Time-dependent perturbation theory . 29 3.5 Rabi flopping and Fermi's Golden Rule . 30 3.6 Raman transitions . 32 3.7 Rabi flopping as a quantum gate . 32 3.8 Ramsey fringes . 33 3.9 Measurement and initialisation . 34 1 CONTENTS 2 4 Spins in magnetic fields 35 4.1 The nuclear spin Hamiltonian . 35 4.2 The rotating frame . 36 4.3 On-resonance excitation . 38 4.4 Excitation phases . 38 4.5 Off-resonance excitation . 39 4.6 Practicalities . 40 4.7 The vector model . 40 4.8 Spin echoes . 41 4.9 Measurement and initialisation . 42 5 Photon techniques 43 5.1 Spatial encoding .
    [Show full text]
  • 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]
  • Math 511 Advanced Linear Algebra Spring 2006
    MATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006 Sherod Eubanks HOMEWORK 2 x2:1 : 2; 5; 9; 12 x2:3 : 3; 6 x2:4 : 2; 4; 5; 9; 11 Section 2:1: Unitary Matrices Problem 2 If ¸ 2 σ(U) and U 2 Mn is unitary, show that j¸j = 1. Solution. If ¸ 2 σ(U), U 2 Mn is unitary, and Ux = ¸x for x 6= 0, then by Theorem 2:1:4(g), we have kxkCn = kUxkCn = k¸xkCn = j¸jkxkCn , hence j¸j = 1, as desired. Problem 5 Show that the permutation matrices in Mn are orthogonal and that the permutation matrices form a sub- group of the group of real orthogonal matrices. How many different permutation matrices are there in Mn? Solution. By definition, a matrix P 2 Mn is called a permutation matrix if exactly one entry in each row n and column is equal to 1, and all other entries are 0. That is, letting ei 2 C denote the standard basis n th element of C that has a 1 in the i row and zeros elsewhere, and Sn be the set of all permutations on n th elements, then P = [eσ(1) j ¢ ¢ ¢ j eσ(n)] = Pσ for some permutation σ 2 Sn such that σ(k) denotes the k member of σ. Observe that for any σ 2 Sn, and as ½ 1 if i = j eT e = σ(i) σ(j) 0 otherwise for 1 · i · j · n by the definition of ei, we have that 2 3 T T eσ(1)eσ(1) ¢ ¢ ¢ eσ(1)eσ(n) T 6 .
    [Show full text]
  • Block Kronecker Products and the Vecb Operator* CORE View
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Block Kronecker Products and the vecb Operator* Ruud H. Koning Department of Economics University of Groningen P.O. Box 800 9700 AV, Groningen, The Netherlands Heinz Neudecker+ Department of Actuarial Sciences and Econometrics University of Amsterdam Jodenbreestraat 23 1011 NH, Amsterdam, The Netherlands and Tom Wansbeek Department of Economics University of Groningen P.O. Box 800 9700 AV, Groningen, The Netherlands Submitted hv Richard Rrualdi ABSTRACT This paper is concerned with two generalizations of the Kronecker product and two related generalizations of the vet operator. It is demonstrated that they pairwise match two different kinds of matrix partition, viz. the balanced and unbalanced ones. Relevant properties are supplied and proved. A related concept, the so-called tilde transform of a balanced block matrix, is also studied. The results are illustrated with various statistical applications of the five concepts studied. *Comments of an anonymous referee are gratefully acknowledged. ‘This work was started while the second author was at the Indian Statistiral Institute, New Delhi. LINEAR ALGEBRA AND ITS APPLICATIONS 149:165-184 (1991) 165 0 Elsevier Science Publishing Co., Inc., 1991 655 Avenue of the Americas, New York, NY 10010 0024-3795/91/$3.50 166 R. H. KONING, H. NEUDECKER, AND T. WANSBEEK INTRODUCTION Almost twenty years ago Singh [7] and Tracy and Singh [9] introduced a generalization of the Kronecker product A@B. They used varying notation for this new product, viz. A @ B and A &3B. Recently, Hyland and Collins [l] studied the-same product under rather restrictive order conditions.
    [Show full text]
  • Chapter Four Determinants
    Chapter Four Determinants In the first chapter of this book we considered linear systems and we picked out the special case of systems with the same number of equations as unknowns, those of the form T~x = ~b where T is a square matrix. We noted a distinction between two classes of T ’s. While such systems may have a unique solution or no solutions or infinitely many solutions, if a particular T is associated with a unique solution in any system, such as the homogeneous system ~b = ~0, then T is associated with a unique solution for every ~b. We call such a matrix of coefficients ‘nonsingular’. The other kind of T , where every linear system for which it is the matrix of coefficients has either no solution or infinitely many solutions, we call ‘singular’. Through the second and third chapters the value of this distinction has been a theme. For instance, we now know that nonsingularity of an n£n matrix T is equivalent to each of these: ² a system T~x = ~b has a solution, and that solution is unique; ² Gauss-Jordan reduction of T yields an identity matrix; ² the rows of T form a linearly independent set; ² the columns of T form a basis for Rn; ² any map that T represents is an isomorphism; ² an inverse matrix T ¡1 exists. So when we look at a particular square matrix, the question of whether it is nonsingular is one of the first things that we ask. This chapter develops a formula to determine this. (Since we will restrict the discussion to square matrices, in this chapter we will usually simply say ‘matrix’ in place of ‘square matrix’.) More precisely, we will develop infinitely many formulas, one for 1£1 ma- trices, one for 2£2 matrices, etc.
    [Show full text]
  • A Representations of SU(2)
    A Representations of SU(2) In this appendix we provide details of the parameterization of the group SU(2) and differential forms on the group space. An arbitrary representation of the group SU(2) is given by the set of three generators Tk, which satisfy the Lie algebra [Ti,Tj ]=iεijkTk, with ε123 =1. The element of the group is given by the matrix U =exp{iT · ω} , (A.1) 1 where in the fundamental representation Tk = 2 σk, k =1, 2, 3, with 01 0 −i 10 σ = ,σ= ,σ= , 1 10 2 i 0 3 0 −1 standard Pauli matrices, which satisfy the relation σiσj = δij + iεijkσk . The vector ω has components ωk in a given coordinate frame. Geometrically, the matrices U are generators of spinor rotations in three- 3 dimensional space R and the parameters ωk are the corresponding angles of rotation. The Euler parameterization of an arbitrary matrix of SU(2) transformation is defined in terms of three angles θ, ϕ and ψ,as ϕ θ ψ iσ3 iσ2 iσ3 U(ϕ, θ, ψ)=Uz(ϕ)Uy(θ)Uz(ψ)=e 2 e 2 e 2 ϕ ψ ei 2 0 cos θ sin θ ei 2 0 = 2 2 −i ϕ θ θ − ψ 0 e 2 − sin cos 0 e i 2 2 2 i i θ 2 (ψ+ϕ) θ − 2 (ψ−ϕ) cos 2 e sin 2 e = i − − i . (A.2) − θ 2 (ψ ϕ) θ 2 (ψ+ϕ) sin 2 e cos 2 e Thus, the SU(2) group manifold is isomorphic to three-sphere S3.
    [Show full text]
  • Genius Manual I
    Genius Manual i Genius Manual Genius Manual ii Copyright © 1997-2016 Jiríˇ (George) Lebl Copyright © 2004 Kai Willadsen Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License (GFDL), Version 1.1 or any later version published by the Free Software Foundation with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. You can find a copy of the GFDL at this link or in the file COPYING-DOCS distributed with this manual. This manual is part of a collection of GNOME manuals distributed under the GFDL. If you want to distribute this manual separately from the collection, you can do so by adding a copy of the license to the manual, as described in section 6 of the license. Many of the names used by companies to distinguish their products and services are claimed as trademarks. Where those names appear in any GNOME documentation, and the members of the GNOME Documentation Project are made aware of those trademarks, then the names are in capital letters or initial capital letters. DOCUMENT AND MODIFIED VERSIONS OF THE DOCUMENT ARE PROVIDED UNDER THE TERMS OF THE GNU FREE DOCUMENTATION LICENSE WITH THE FURTHER UNDERSTANDING THAT: 1. DOCUMENT IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES THAT THE DOCUMENT OR MODIFIED VERSION OF THE DOCUMENT IS FREE OF DEFECTS MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE OR NON-INFRINGING. THE ENTIRE RISK AS TO THE QUALITY, ACCURACY, AND PERFORMANCE OF THE DOCUMENT OR MODIFIED VERSION OF THE DOCUMENT IS WITH YOU.
    [Show full text]
  • Multipartite Quantum States and Their Marginals
    Diss. ETH No. 22051 Multipartite Quantum States and their Marginals A dissertation submitted to ETH ZURICH for the degree of Doctor of Sciences presented by Michael Walter Diplom-Mathematiker arXiv:1410.6820v1 [quant-ph] 24 Oct 2014 Georg-August-Universität Göttingen born May 3, 1985 citizen of Germany accepted on the recommendation of Prof. Dr. Matthias Christandl, examiner Prof. Dr. Gian Michele Graf, co-examiner Prof. Dr. Aram Harrow, co-examiner 2014 Abstract Subsystems of composite quantum systems are described by reduced density matrices, or quantum marginals. Important physical properties often do not depend on the whole wave function but rather only on the marginals. Not every collection of reduced density matrices can arise as the marginals of a quantum state. Instead, there are profound compatibility conditions – such as Pauli’s exclusion principle or the monogamy of quantum entanglement – which fundamentally influence the physics of many-body quantum systems and the structure of quantum information. The aim of this thesis is a systematic and rigorous study of the general relation between multipartite quantum states, i.e., states of quantum systems that are composed of several subsystems, and their marginals. In the first part of this thesis (Chapters 2–6) we focus on the one-body marginals of multipartite quantum states. Starting from a novel ge- ometric solution of the compatibility problem, we then turn towards the phenomenon of quantum entanglement. We find that the one-body marginals through their local eigenvalues can characterize the entan- glement of multipartite quantum states, and we propose the notion of an entanglement polytope for its systematic study.
    [Show full text]
  • Theory of Angular Momentum and Spin
    Chapter 5 Theory of Angular Momentum and Spin Rotational symmetry transformations, the group SO(3) of the associated rotation matrices and the 1 corresponding transformation matrices of spin{ 2 states forming the group SU(2) occupy a very important position in physics. The reason is that these transformations and groups are closely tied to the properties of elementary particles, the building blocks of matter, but also to the properties of composite systems. Examples of the latter with particularly simple transformation properties are closed shell atoms, e.g., helium, neon, argon, the magic number nuclei like carbon, or the proton and the neutron made up of three quarks, all composite systems which appear spherical as far as their charge distribution is concerned. In this section we want to investigate how elementary and composite systems are described. To develop a systematic description of rotational properties of composite quantum systems the consideration of rotational transformations is the best starting point. As an illustration we will consider first rotational transformations acting on vectors ~r in 3-dimensional space, i.e., ~r R3, 2 we will then consider transformations of wavefunctions (~r) of single particles in R3, and finally N transformations of products of wavefunctions like j(~rj) which represent a system of N (spin- Qj=1 zero) particles in R3. We will also review below the well-known fact that spin states under rotations behave essentially identical to angular momentum states, i.e., we will find that the algebraic properties of operators governing spatial and spin rotation are identical and that the results derived for products of angular momentum states can be applied to products of spin states or a combination of angular momentum and spin states.
    [Show full text]
  • Two-State Systems
    1 TWO-STATE SYSTEMS Introduction. Relative to some/any discretely indexed orthonormal basis |n) | ∂ | the abstract Schr¨odinger equation H ψ)=i ∂t ψ) can be represented | | | ∂ | (m H n)(n ψ)=i ∂t(m ψ) n ∂ which can be notated Hmnψn = i ∂tψm n H | ∂ | or again ψ = i ∂t ψ We found it to be the fundamental commutation relation [x, p]=i I which forced the matrices/vectors thus encountered to be ∞-dimensional. If we are willing • to live without continuous spectra (therefore without x) • to live without analogs/implications of the fundamental commutator then it becomes possible to contemplate “toy quantum theories” in which all matrices/vectors are finite-dimensional. One loses some physics, it need hardly be said, but surprisingly much of genuine physical interest does survive. And one gains the advantage of sharpened analytical power: “finite-dimensional quantum mechanics” provides a methodological laboratory in which, not infrequently, the essentials of complicated computational procedures can be exposed with closed-form transparency. Finally, the toy theory serves to identify some unanticipated formal links—permitting ideas to flow back and forth— between quantum mechanics and other branches of physics. Here we will carry the technique to the limit: we will look to “2-dimensional quantum mechanics.” The theory preserves the linearity that dominates the full-blown theory, and is of the least-possible size in which it is possible for the effects of non-commutivity to become manifest. 2 Quantum theory of 2-state systems We have seen that quantum mechanics can be portrayed as a theory in which • states are represented by self-adjoint linear operators ρ ; • motion is generated by self-adjoint linear operators H; • measurement devices are represented by self-adjoint linear operators A.
    [Show full text]
  • 10 Group Theory
    10 Group theory 10.1 What is a group? A group G is a set of elements f, g, h, ... and an operation called multipli- cation such that for all elements f,g, and h in the group G: 1. The product fg is in the group G (closure); 2. f(gh)=(fg)h (associativity); 3. there is an identity element e in the group G such that ge = eg = g; 1 1 1 4. every g in G has an inverse g− in G such that gg− = g− g = e. Physical transformations naturally form groups. The elements of a group might be all physical transformations on a given set of objects that leave invariant a chosen property of the set of objects. For instance, the objects might be the points (x, y) in a plane. The chosen property could be their distances x2 + y2 from the origin. The physical transformations that leave unchanged these distances are the rotations about the origin p x cos ✓ sin ✓ x 0 = . (10.1) y sin ✓ cos ✓ y ✓ 0◆ ✓− ◆✓ ◆ These rotations form the special orthogonal group in 2 dimensions, SO(2). More generally, suppose the transformations T,T0,T00,... change a set of objects in ways that leave invariant a chosen property property of the objects. Suppose the product T 0 T of the transformations T and T 0 represents the action of T followed by the action of T 0 on the objects. Since both T and T 0 leave the chosen property unchanged, so will their product T 0 T . Thus the closure condition is satisfied.
    [Show full text]
  • Package 'Fastmatrix'
    Package ‘fastmatrix’ May 8, 2021 Type Package Title Fast Computation of some Matrices Useful in Statistics Version 0.3-819 Date 2021-05-07 Author Felipe Osorio [aut, cre] (<https://orcid.org/0000-0002-4675-5201>), Alonso Ogueda [aut] Maintainer Felipe Osorio <[email protected]> Description Small set of functions to fast computation of some matrices and operations useful in statistics and econometrics. Currently, there are functions for efficient computation of duplication, commutation and symmetrizer matrices with minimal storage requirements. Some commonly used matrix decompositions (LU and LDL), basic matrix operations (for instance, Hadamard, Kronecker products and the Sherman-Morrison formula) and iterative solvers for linear systems are also available. In addition, the package includes a number of common statistical procedures such as the sweep operator, weighted mean and covariance matrix using an online algorithm, linear regression (using Cholesky, QR, SVD, sweep operator and conjugate gradients methods), ridge regression (with optimal selection of the ridge parameter considering the GCV procedure), functions to compute the multivariate skewness, kurtosis, Mahalanobis distance (checking the positive defineteness) and the Wilson-Hilferty transformation of chi squared variables. Furthermore, the package provides interfaces to C code callable by another C code from other R packages. Depends R(>= 3.5.0) License GPL-3 URL https://faosorios.github.io/fastmatrix/ NeedsCompilation yes LazyLoad yes Repository CRAN Date/Publication 2021-05-08 08:10:06 UTC R topics documented: array.mult . .3 1 2 R topics documented: asSymmetric . .4 bracket.prod . .5 cg ..............................................6 comm.info . .7 comm.prod . .8 commutation . .9 cov.MSSD . 10 cov.weighted .
    [Show full text]