DOCSLIB.ORG

Diagonal Unitary Entangling Gates and Contradiagonal Quantum States

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Diagonal Unitary Entangling Gates and Contradiagonal Quantum States PHYSICAL REVIEW A 90, 032303 (2014) Diagonal unitary entangling gates and contradiagonal quantum states Arul Lakshminarayan* Department of Physics, Indian Institute of Technology Madras, Chennai 600036, India Zbigniew Puchała† Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Bałtycka 5, 44-100 Gliwice, Poland and Institute of Physics, Jagiellonian University, ul. Reymonta 4, 30-059 Krakow,´ Poland Karol Zyczkowski˙ ‡ Institute of Physics, Jagiellonian University, ul. Reymonta 4, 30-059 Krakow,´ Poland and Center for Theoretical Physics, Polish Academy of Sciences, Warsaw, Poland (Received 10 July 2014; published 2 September 2014) Nonlocal properties of an ensemble of diagonal random unitary matrices of order N 2 are investigated. The average Schmidt strength of such a bipartite diagonal quantum gate is shown to scale as ln N, in contrast to the ln N 2 behavior characteristic of random unitary gates. Entangling power of a diagonal gate U is related to the von Neumann entropy of an auxiliary quantum state ρ = AA†/N 2, where the square matrix A is obtained by reshaping the vector of diagonal elements of U of length N 2 into a square matrix of order N. This fact provides a motivation to study the ensemble of non-Hermitian unimodular matrices A, with all entries of the same modulus and random phases and the ensemble of quantum states ρ, such that all their diagonal entries are equal to 1/N. Such a state is contradiagonal with respect to the computational basis, in the sense that among all unitary equivalent states it maximizes the entropy copied to the environment due to the coarse-graining process. The first four moments of the squared singular values of the unimodular ensemble are derived, based on which we conjecture a connection to a recently studied combinatorial object called the “Borel triangle.” This allows us to find exactly the mean von Neumann entropy for random phase density matrices and the average entanglement for the corresponding ensemble of bipartite pure states. DOI: 10.1103/PhysRevA.90.032303 PACS number(s): 03.67.Bg, 03.67.−a, 03.65.Ud, 05.30.Ch I. INTRODUCTION ρA and ρB will be typically negative under partial transpose and therefore A and B are entangled [8]. Entanglement has been at the focus of recent researches Ways to generate entangled states from initially unentan- in quantum information—for a review see [1]—as it enables gled ones via unitary operators are of natural interest, and in a range of uniquely quantum tasks such as teleportation, the context of quantum computation imply the construction quite apart from being a singular nonclassical phenomenon of appropriate gates. Investigations of entangling power of and therefore of fundamental interest. It is well appreciated a unitary quantum gate were initiated by Zanardi and co- now that many-particle pure states are typically highly en- workers [9,10], while some measures of nonlocality were tangled [2–5], and share entanglement in a manner that is analyzed in [11–16]. A typical quantum gate acting on a almost wholly of a multipartite nature. Here typicality refers composed system consisting of two N-level systems can to ensembles of pure states selected according to the uniform be represented by a random unitary matrix of order N 2. (Haar) measure. If two distinct subsystems of a pure state Nonlocal properties of such random gates were investigated are such that together they make up the entire system in a in [17]. typical pure state, then the two subsystems will be largely In this work we shall analyze a simpler ensemble of diago- entangled. In early works, Page and others [3,6] had found the nal unitary random matrices and will characterize nonlocality average entanglement, which in this case is simply the mean of the corresponding quantum gates. It is also naturally related von Neumann entropy of the reduced state, and showed that it to an ensemble of pure bipartite states in N 2-dimensional is nearly the maximum possible. space whose components in some fixed basis are of the form More recent studies have explored the distribution of iφj 2 e /N , and φi are uniformly distributed random numbers. entanglement in such complete bipartite partitions of random Such an ensemble has been recently studied as phase-random states [7]. If the two subsystems do not comprise the entire states [18], and in fact connections to diagonal quantum systems, for example two particles in a three-particle state, the circuits has been pointed out [19]. Part of the motivation for average entanglement depends on the dimensionality of the the study of diagonal quantum gates is that many Hamiltonians subsystems. Roughly speaking if the complementary space of have the structure that the basis in which the interaction is the subsystems (say A and B) is smaller, the density matrices diagonal can be chosen to be unentangled. Time evolution is then governed by unitary operators whose entangling parts are diagonal. Recently studies of measurement-based *[email protected] quantum computation have also used diagonal unitary gates †[email protected] and shown that it can still remain superior to classical ‡[email protected] computation [20,21]. 1050-2947/2014/90(3)/032303(13) 032303-1 ©2014 American Physical Society LAKSHMINARAYAN, PUCHAŁA, AND ZYCZKOWSKI˙ PHYSICAL REVIEW A 90, 032303 (2014) Also explicitly, unitary operators such as (UA ⊗ UB )UAB equivalently of the von Neumann entropy of the random occur in the study of coupled systems including kicked phase states. The procedure of contradiagonalization of a quantum tops; see the book of Haake [22]. The coupling could Hermitian matrix, which makes all diagonal elements equal, is z z A,B be of the form JAJB , where Jz are spin operators. Thus the introduced in Sec. V. In this section we study in particular the nonlocal part of the evolution is diagonal again. It is found cognate ensemble of random contradiagonal states and show numerically that the eigenstates of such operators as well as their particular properties concerning the transfer of quantum the time evolution engendered by repeated applications of such information. The paper is concluded in Sec. VI, and appendices operators can create large entanglement well approximated by review the operator Schmidt decomposition and entangling that of random states [23]. However such operators have a entropy. much smaller number of possible independent elements than HN ⊗ HN Haar distributed unitaries on . Thus it is of interest II. DIAGONAL BIPARTITE QUANTUM GATES to study the origin of such large entanglement. 2 Furthermore, we are going to study the related ensemble of Consider a diagonal unitary matrix U of order N . Each = “unimodular random matrices,” comprising complex matrices entry is assumed to be random, so that Uμν δμν exp(iφν ), whose entries all have the same modulus and randomly chosen where φν are independent random phases distributed uniformly phases. Such matrices arise from reshaping a pure phase in [0,2π). Such a matrix represents a diagonal unitary gate N N random state as defined in [18]. Note that the usage of the acting on a bipartite quantum system, a state in H ⊗ H . H ⊗ term “unimodular” concerns all the entries of a matrix, so Any matrix U acting on the composed Hilbert space N H such a matrix is not unimodular in the sense of being integer N can be represented in its operator Schmidt form, ± matrices with determinants 1. K Although the unimodular ensemble differs from the Gini- = ⊗ U k Bk Bk , (1) bre ensemble of complex, non-Hermitian matrices, with k=1 independent, normally distributed elements, it displays the 2 where the Schmidt rank K N . Note that the matrices Bk same asymptotic behavior of the level density, which covers uniformly the unit disk. On the other hand the squared singular and Bk of order N in general are nonunitary. values of unimodular matrices coincide with eigenvalues of It can be shown [24] that the Schmidt coefficients k, = certain specific quantum states of size N, the diagonal entries k 1,...,K, can be obtained as squared singular values R which are equal to 1/N. As the notion of an “antidiagonal of the reshuffled matrix U . This fact is briefly recalled matrix” has entirely different meaning, the density matrices in Appendix A, where the notation is explained. A generic with all diagonal elements equal will be called contradiagonal. diagonal matrix of size four after reshuffling forms a non- Observe that reduced density matrices of random phase Hermitian matrix of rank two, ⎡ ⎤ pure states are thus contradiagonal. We investigate properties U11 000 of such an ensemble of quantum states and discuss the ⎢ 0 U 00⎥ U = ⎣ 22 ⎦ , contradiagonalization procedure, which brings any Hermitian 00U33 0 matrix to such a basis, that all their diagonal elements do 000U44 coincide. ⎡ ⎤ One may expect that random contradiagonal states cor- U11 00U22 ⎢ 0000⎥ respond to the large entanglement of the pure bipartite U R = ⎣ ⎦ . (2) states and we show that indeed these states have larger 0000 von Neumann entropy than those sampled according to the U33 00U44 Ginibre ensemble. The unimodular ensemble, while having no For a diagonal matrix U of order N 2 the reshuffled matrix obvious invariance properties, seems to also have remarkable U R contains N(N − 1) columns and rows with all entries underlying mathematical structure. For example, the average equal to zero. Hence the nonzero singular values of U R are of the moments of the matrices in the ensemble are connected equal to the singular values of a square matrix A of size N, to polynomials with combinatorial interpretations. We evaluate obtained by reshaping the diagonal of the unitary gate, Ajk = the first four moments and use this to conjecture an exact exp(iφν ), where ν = (j − 1)N + k.
Load more

Recommended publications
  • A Finiteness Result for Circulant Core Complex Hadamard Matrices
    A FINITENESS RESULT FOR CIRCULANT CORE COMPLEX HADAMARD MATRICES REMUS NICOARA AND CHASE WORLEY UNIVERSITY OF TENNESSEE, KNOXVILLE Abstract. We show that for every prime number p there exist finitely many circulant core complex Hadamard matrices of size p ` 1. The proof uses a 'derivative at infinity' argument to reduce the problem to Tao's uncertainty principle for cyclic groups of prime order (see [Tao]). 1. Introduction A complex Hadamard matrix is a matrix H P MnpCq having all entries of absolute value 1 and all rows ?1 mutually orthogonal. Equivalently, n H is a unitary matrix with all entries of the same absolute value. For ij 2πi{n example, the Fourier matrix Fn “ p! q1¤i;j¤n, ! “ e , is a Hadamard matrix. In the recent years, complex Hadamard matrices have found applications in various topics of mathematics and physics, such as quantum information theory, error correcting codes, cyclic n-roots, spectral sets and Fuglede's conjecture. A general classification of real or complex Hadamard matrices is not available. A catalogue of most known complex Hadamard matrices can be found in [TaZy]. The complete classification is known for n ¤ 5 ([Ha1]) and for self-adjoint matrices of order 6 ([BeN]). Hadamard matrices arise in operator algebras as construction data for hyperfinite subfactors. A unitary ?1 matrix U is of the form n H, H Hadamard matrix, if and only if the algebra of n ˆ n diagonal matrices Dn ˚ is orthogonal onto UDnU , with respect to the inner product given by the trace on MnpCq. Equivalently, the square of inclusions: Dn Ă MnpCq CpHq “ ¨ YY ; τ˛ ˚ ˚ ‹ ˚ C Ă UDnU ‹ ˚ ‹ ˝ ‚ is a commuting square, in the sense of [Po1],[Po2], [JS].
    [Show full text]
  • Hadamard Equiangular Tight Frames
    Air Force Institute of Technology AFIT Scholar Faculty Publications 8-8-2019 Hadamard Equiangular Tight Frames Matthew C. Fickus Air Force Institute of Technology John Jasper University of Cincinnati Dustin G. Mixon Air Force Institute of Technology Jesse D. Peterson Air Force Institute of Technology Follow this and additional works at: https://scholar.afit.edu/facpub Part of the Discrete Mathematics and Combinatorics Commons Recommended Citation Fickus, M., Jasper, J., Mixon, D. G., & Peterson, J. D. (2021). Hadamard Equiangular Tight Frames. Applied and Computational Harmonic Analysis, 50, 281–302. https://doi.org/10.1016/j.acha.2019.08.003 This Article is brought to you for free and open access by AFIT Scholar. It has been accepted for inclusion in Faculty Publications by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. Hadamard Equiangular Tight Frames Matthew Fickusa, John Jasperb, Dustin G. Mixona, Jesse D. Petersona aDepartment of Mathematics and Statistics, Air Force Institute of Technology, Wright-Patterson AFB, OH 45433 bDepartment of Mathematical Sciences, University of Cincinnati, Cincinnati, OH 45221 Abstract An equiangular tight frame (ETF) is a type of optimal packing of lines in Euclidean space. They are often represented as the columns of a short, fat matrix. In certain applications we want this matrix to be flat, that is, have the property that all of its entries have modulus one. In particular, real flat ETFs are equivalent to self-complementary binary codes that achieve the Grey-Rankin bound. Some flat ETFs are (complex) Hadamard ETFs, meaning they arise by extracting rows from a (complex) Hadamard matrix.
    [Show full text]
  • The Early View of “Global Journal of Computer Science And
    The Early View of “Global Journal of Computer Science and Technology” In case of any minor updation/modification/correction, kindly inform within 3 working days after you have received this. Kindly note, the Research papers may be removed, added, or altered according to the final status. Global Journal of Computer Science and Technology View Early Global Journal of Computer Science and Technology Volume 10 Issue 12 (Ver. 1.0) View Early Global Academy of Research and Development © Global Journal of Computer Global Journals Inc. Science and Technology. (A Delaware USA Incorporation with “Good Standing”; Reg. Number: 0423089) Sponsors: Global Association of Research 2010. Open Scientific Standards All rights reserved. Publisher’s Headquarters office This is a special issue published in version 1.0 of “Global Journal of Medical Research.” By Global Journals Inc. Global Journals Inc., Headquarters Corporate Office, All articles are open access articles distributed Cambridge Office Center, II Canal Park, Floor No. under “Global Journal of Medical Research” 5th, Cambridge (Massachusetts), Pin: MA 02141 Reading License, which permits restricted use. Entire contents are copyright by of “Global United States Journal of Medical Research” unless USA Toll Free: +001-888-839-7392 otherwise noted on specific articles. USA Toll Free Fax: +001-888-839-7392 No part of this publication may be reproduced Offset Typesetting or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information Global Journals Inc., City Center Office, 25200 storage and retrieval system, without written permission. Carlos Bee Blvd. #495, Hayward Pin: CA 94542 The opinions and statements made in this United States book are those of the authors concerned.
    [Show full text]
  • Asymptotic Existence of Hadamard Matrices
    ASYMPTOTIC EXISTENCE OF HADAMARD MATRICES by Ivan Livinskyi A Thesis submitted to the Faculty of Graduate Studies of The University of Manitoba in partial fulfilment of the requirements of the degree of MASTER OF SCIENCE Department of Mathematics University of Manitoba Winnipeg Copyright ⃝c 2012 by Ivan Livinskyi Abstract We make use of a structure known as signed groups, and known sequences with zero autocorrelation to derive new results on the asymptotic existence of Hadamard matrices. For any positive odd integer p it is obtained that a Hadamard matrix of order 2tp exists for all ( ) 1 p − 1 t ≥ log + 13: 5 2 2 i Contents 1 Introduction. Hadamard matrices 2 2 Signed groups and remreps 10 3 Construction of signed group Hadamard matrices from sequences 18 4 Some classes of sequences with zero autocorrelation 28 4.1 Golay sequences .............................. 30 4.2 Base sequences .............................. 31 4.3 Complex Golay sequences ........................ 33 4.4 Normal sequences ............................. 35 4.5 Turyn sequences .............................. 36 4.6 Other sequences .............................. 37 5 Asymptotic Existence results 40 5.1 Asymptotic formulas based on Golay sequences . 40 5.2 Hadamard matrices from complex Golay sequences . 43 5.3 Hadamard matrices from all complementary sequences considered . 44 6 Thoughts about further development 48 Bibliography 51 1 Chapter 1 Introduction. Hadamard matrices A Hadamard matrix H is a square (±1)-matrix such that any two of its rows are orthogonal. In other words, a square (±1)-matrix H is Hadamard if and only if HH> = nI; where n is the order of H and I is the identity matrix of order n.
    [Show full text]
  • One Method for Construction of Inverse Orthogonal Matrices
    ONE METHOD FOR CONSTRUCTION OF INVERSE ORTHOGONAL MATRICES, P. DIÞÃ National Institute of Physics and Nuclear Engineering, P.O. Box MG6, Bucharest, Romania E-mail: [email protected] Received September 16, 2008 An analytical procedure to obtain parametrisation of complex inverse orthogonal matrices starting from complex inverse orthogonal conference matrices is provided. These matrices, which depend on nonzero complex parameters, generalize the complex Hadamard matrices and have applications in spin models and digital signal processing. When the free complex parameters take values on the unit circle they transform into complex Hadamard matrices. 1. INTRODUCTION In a seminal paper [1] Sylvester defined a general class of orthogonal matrices named inverse orthogonal matrices and provided the first examples of what are nowadays called (complex) Hadamard matrices. A particular class of inverse orthogonal matrices Aa()ij are those matrices whose inverse is given 1 t by Aa(1ij ) (1 a ji ) , where t means transpose, and their entries aij satisfy the relation 1 AA nIn (1) where In is the n-dimensional unit matrix. When the entries aij take values on the unit circle A–1 coincides with the Hermitian conjugate A* of A, and in this case (1) is the definition of complex Hadamard matrices. Complex Hadamard matrices have applications in quantum information theory, several branches of combinatorics, digital signal processing, etc. Complex orthogonal matrices unexpectedly appeared in the description of topological invariants of knots and links, see e.g. Ref. [2]. They were called two- weight spin models being related to symmetric statistical Potts models. These matrices have been generalized to two-weight spin models, also called , Paper presented at the National Conference of Physics, September 10–13, 2008, Bucharest-Mãgurele, Romania.
    [Show full text]
  • Introduction to Linear Algebra
    Introduction to linear algebra Teo Banica Real matrices, The determinant, Complex matrices, Calculus and applications, Infinite matrices, Special matrices 08/20 Foreword These are slides written in the Fall 2020, on linear algebra. Presentations available at my Youtube channel. 1. Real matrices and their properties ... 3 2. The determinant of real matrices ... 19 3. Complex matrices and diagonalization ... 35 4. Linear algebra and calculus questions ... 51 5. Infinite matrices and spectral theory ... 67 6. Special matrices and matrix tricks ... 83 Real matrices and their properties Teo Banica "Introduction to linear algebra", 1/6 08/20 Rotations 1/3 Problem: what’s the formula of the rotation of angle t? Rotations 2/3 2 x The points in the plane R can be represented as vectors y . The 2 × 2 matrices “act” on such vectors, as follows: a b x ax + by = c d y cx + dy Many simple transformations (symmetries, projections..) can be written in this form. What about the rotation of angle t? Rotations 3/3 A quick picture shows that we must have: ∗ ∗ 1 cos t = ∗ ∗ 0 sin t Also, by paying attention to positives and negatives: ∗ ∗ 0 − sin t = ∗ ∗ 1 cos t Thus, the matrix of our rotation can only be: cos t − sin t R = t sin t cos t By "linear algebra”, this is the correct answer. Linear maps 1/4 2 2 Theorem. The maps f : R ! R which are linear, in the sense that they map lines through 0 to lines through 0, are: x ax + by f = y cx + dy Remark. If we make the multiplication convention a b x ax + by = c d y cx + dy the theorem says f (v) = Av, with A being a 2 × 2 matrix.
    [Show full text]
  • The 2-Transitive Complex Hadamard Matrices
    undergoing revision for Designs, Codes and Cryptography 1 January, 2001 The 2-Transitive Complex Hadamard Matrices G. Eric Moorhouse Dept. of Mathematics, University of Wyoming, Laramie WY, U.S.A. Abstract. We determine all possibilities for a complex Hadamard ma- trix H admitting an automorphism group which permutes 2-transitively the rows of H. Our proof of this result relies on the classification theo- rem for finite 2-transitive permutation groups, and thereby also on the classification of finite simple groups. Keywords. complex Hadamard matrix, 2-transitive, distance regular graph, cover of complete bipartite graph 1. Introduction Let H be a complex Hadamard matrix of order v, i.e. a v × v matrix whose entries are com- plex roots of unity, satisfying HH∗ = vI,where∗ denotes conjugate-transpose. Butson’s original definition in [3] considered as entries only p-th roots of unity for some prime p, while others [42], [32], [8] have considered ±1, ±i as entries. These are generalisations of the (ordinary) Hadamard matrices (having entries ±1); other generalisations with group entries are described in Section 2. 1.1 Example. The complex Hadamard matrix ⎡ ⎤ 111111 ⎢ 2 2 ⎥ ⎢ 11 ωω ω ω ⎥ ⎢ 2 2 ⎥ ⎢ 1 ω 1 ωω ω ⎥ 2πi/3 H6 = ⎢ 2 2 ⎥ ,ω= e ⎣ 1 ω ω 1 ωω⎦ 1 ω2 ω2 ω 1 ω 1 ωω2 ω2 ω 1 of order 6 corresponds (as in Section 2) to the distance transitive triple cover of the complete bipartite graph K6,6 which appears in [2, Thm. 13.2.2]. ∗ An automorphism of H is a pair (M1 ,M2) of monomial matrices such that M1HM2 = H.
    [Show full text]
  • LOGIC JOURNAL of the IGPL
    LOGIC JOURNAL LOGIC ISSN PRINT 1367-0751 LOGIC JOURNAL ISSN ONLINE 1368-9894 of the IGPL LOGIC JOURNAL Volume 22 • Issue 1 • February 2014 of the of the Contents IGPL Original Articles A Routley–Meyer semantics for truth-preserving and well-determined Łukasiewicz 3-valued logics 1 IGPL Gemma Robles and José M. Méndez Tarski’s theorem and liar-like paradoxes 24 Ming Hsiung Verifying the bridge between simplicial topology and algebra: the Eilenberg–Zilber algorithm 39 L. Lambán, J. Rubio, F. J. Martín-Mateos and J. L. Ruiz-Reina INTEREST GROUP IN PURE AND APPLIED LOGICS Reasoning about constitutive norms in BDI agents 66 N. Criado, E. Argente, P. Noriega and V. Botti 22 Volume An introduction to partition logic 94 EDITORS-IN-CHIEF David Ellerman On the interrelation between systems of spheres and epistemic A. Amir entrenchment relations 126 • D. M. Gabbay Maurício D. L. Reis 1 Issue G. Gottlob On an inferential semantics for classical logic 147 David Makinson R. de Queiroz • First-order hybrid logic: introduction and survey 155 2014 February J. Siekmann Torben Braüner Applications of ultraproducts: from compactness to fuzzy elementary classes 166 EXECUTIVE EDITORS Pilar Dellunde M. J. Gabbay O. Rodrigues J. Spurr www.oup.co.uk/igpl JIGPAL-22(1)Cover.indd 1 16-01-2014 19:02:05 Logical Information Theory: New Logical Foundations for Information Theory [Forthcoming in: Logic Journal of the IGPL] David Ellerman Philosophy Department, University of California at Riverside June 7, 2017 Abstract There is a new theory of information based on logic. The definition of Shannon entropy as well as the notions on joint, conditional, and mutual entropy as defined by Shannon can all be derived by a uniform transformation from the corresponding formulas of logical information theory.
    [Show full text]
  • What Can Logic Contribute to Information Theory?
    What can logic contribute to information theory? David Ellerman University of California at Riverside September 10, 2016 Abstract Logical probability theory was developed as a quantitative measure based on Boole’s logic of subsets. But information theory was developed into a mature theory by Claude Shannon with no such connection to logic. But a recent development in logic changes this situation. In category theory, the notion of a subset is dual to the notion of a quotient set or partition, and recently the logic of partitions has been developed in a parallel relationship to the Boolean logic of subsets (subset logic is usually mis-specified as the special case of propositional logic). What then is the quantitative measure based on partition logic in the same sense that logical probability theory is based on subset logic? It is a measure of information that is named "logical entropy" in view of that logical basis. This paper develops the notion of logical entropy and the basic notions of the resulting logical information theory. Then an extensive comparison is made with the corresponding notions based on Shannon entropy. Contents 1 Introduction 2 2 Duality of subsets and partitions 3 3 Classical subset logic and partition logic 4 4 Classical probability and classical logical entropy 5 5 History of logical entropy formula 7 6 Comparison as a measure of information 8 7 The dit-bit transform 9 8 Conditional entropies 10 8.1 Logical conditional entropy . 10 8.2 Shannon conditional entropy . 13 9 Mutual information 15 9.1 Logical mutual information for partitions . 15 9.2 Logical mutual information for joint distributions .
    [Show full text]
  • On Quaternary Complex Hadamard Matrices of Small Orders
    Advances in Mathematics of Communications doi:10.3934/amc.2011.5.309 Volume 5, No. 2, 2011, 309{315 ON QUATERNARY COMPLEX HADAMARD MATRICES OF SMALL ORDERS Ferenc Szoll¨ osi} Department of Mathematics and its Applications Central European University H-1051, N´adoru. 9, Budapest, Hungary (Communicated by Gilles Z´emor) Abstract. One of the main goals of design theory is to classify, character- ize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete enumeration of the objects is possible, there is no ap- parent way how to study them in details, store them efficiently, or generate a particular one rapidly. In this paper we propose a novel method to deal with these difficulties, and illustrate it by presenting the classification of quaternary complex Hadamard matrices up to order 8. The obtained matrices are mem- bers of only a handful of parametric families, and each inequivalent matrix, up to transposition, can be identified through its fingerprint. 1. Introduction A complex Hadamard matrix H of order n is an n × n matrix with unimodular entries satisfying HH∗ = nI where ∗ is the conjugate transpose and I is the iden- tity matrix of order n. In other words, any two distinct rows (or columns) of H are complex orthogonal. Complex Hadamard matrices have important applications in quantum optics, high-energy physics [1], operator theory [16] and in harmonic analysis [12], [20]. They also play a crucial r^olein quantum information theory, for construction of teleportation and dense coding schemes [21], and they are strongly related to mutually unbiased bases (MUBs) [8].
    [Show full text]
  • Almost Hadamard Matrices with Complex Entries
    Adv. Oper. Theory 3 (2018), no. 1, 137–177 http://doi.org/10.22034/aot.1702-1114 ISSN: 2538-225X (electronic) http://aot-math.org ALMOST HADAMARD MATRICES WITH COMPLEX ENTRIES TEODOR BANICA,1∗ and ION NECHITA2 Dedicated to the memory of Uffe Haagerup Communicated by N. Spronk Abstract. We discuss an extension of the almost Hadamard matrix formal- ism, 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. Introduction An Hadamard matrix is a square matrix H ∈ MN (±1), whose rows are pairwise orthogonal. Here is a basic example, which appears as a version of the 4×4 Walsh matrix, and is also well-known for its use in the Grover algorithm: −1 1 1 1 1 −1 1 1 K4 = 1 1 −1 1 1 1 1 −1 Assuming that the matrix has N ≥ 3 rows, the orthogonality conditions be- tween the rows give N ∈ 4N. A similar analysis with four or more rows, or any Copyright 2016 by the Tusi Mathematical Research Group. Date: Received: Feb. 9, 2017; Accepted: May 12, 2017. ∗Corresponding author. 2010 Mathematics Subject Classification. Primary 15B10; Secondary 05B20, 14P05.
    [Show full text]
  • The Quaternary Complex Hadamard Matrices of Orders 10, 12, and 14
    Discrete Mathematics 313 (2013) 189–206 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The quaternary complex Hadamard matrices of orders 10, 12, and 14 Pekka H.J. Lampio a,∗, Ferenc Szöllősi b, Patric R.J. Östergård a a Department of Communications and Networking, Aalto University School of Electrical Engineering, P.O. Box 13000, 00076 Aalto, Finland b Department of Mathematics and its Applications, Central European University, H-1051, Nádor u. 9, Budapest, Hungary article info a b s t r a c t Article history: A complete classification of quaternary complex Hadamard matrices of orders 10, 12 and Received 4 March 2012 14 is given, and a new parametrization scheme for obtaining new examples of affine Received in revised form 29 September parametric families of complex Hadamard matrices is provided. On the one hand, it is 2012 proven that all 10 × 10 and 12 × 12 quaternary complex Hadamard matrices belong to Accepted 1 October 2012 some parametric family, but on the other hand, it is shown by exhibiting an isolated 14×14 Available online 31 October 2012 matrix that there cannot be a general method for introducing parameters into these types of matrices. Keywords: Butson-type Hadamard matrix ' 2012 Elsevier B.V. All rights reserved. Classification Complex Hadamard matrix 1. Introduction A complex Hadamard matrix H of order n is an n × n matrix with unimodular entries satisfying HH∗ D nI where ∗ is the conjugate transpose, I is the identity matrix of order n, and where unimodular means that the entries are complex numbers that lie on the unit circle.
    [Show full text]