An Interpolation Problem by Completely Positive Maps and its. Quantum Cloning
|
|
- Laureen Norris
- 5 years ago
- Views:
Transcription
1 An Interpolation Problem by Completely Positive Maps and its Application in Quantum Cloning College of Mathematics and Information Science, Shaanxi Normal University, Xi an, China, July 20, 2011
2 Introduction The theory of quantum information is a result of the effort to generalize classical information theory to the quantum world. Quantum information theory aims to answer the following question: What happens if information is stored in a state of a quantum system? To characterize the way the information is processed consistent with the laws of quantum mechanics, in mathematics, a quantum operation is a trace preserving completely positive map from the set of density operators into itself. The completely positive maps play an important role in the description of quantum channels and time evolutions and have triggered an increasing interest.
3 Outline 1 Notations 2 An interpolation question 3 Some applications
4 Question Denote by M M,N the set of all M N complex matrices, for brevity, write M N when M = N and let H N be the set of Hermitian matrices in M N. From C. K. Li and Y. T. Poon, Interpolation problems by completely positive maps, arxiv: v1. Question Given {A i } k i=1 M N and {B i } k i=1 M M, determine the necessary and sufficient condition for the existence of a completely positive map φ : M N M M such that φ(a i ) = B i for every 1 i k, and possibly with the additional properties that φ is unital or/and φ is trace preserving.
5 Question Theorem. Let {A i } k i=1 H N and {B i } k i=1 H M be two commuting families. Then there exist unitary matrices U M N and V M M such that U A i U and V B i V are diagonals a i b i a i b i and, a in b im respectively, for i = 1, 2,..., k. Then the following conditions are equivalent. (a) There is a completely positive map φ : M N M M such that φ(a i ) = B i for every 1 i k.
6 (b) There is an N M nonnegative matrix M such that B = AM, where b 11 b b 1M a 11 a a 1N b 21 b b 2M a 21 a a 2N B =, A = b k1 b k2... b km a k1 a k2... a kn Furthermore, (1) φ in (a) is unital if and only if M in (b) can be chosen to be column stochastic; (2) φ in (a) is trace preserving if and only if M in (b) can be chosen to be row stochastic; (3) φ in (a) is unital and trace preserving if and only if M in (b) can be chosen to be doubly stochastic.
7 Notations Consider an N M rectangular matrix A = [a ij ], we define the reshaping of A as res(a) = (a 11,..., a 1M, a 21,..., a 2M,..., a N1,..., a NM ) t, (2.1) where X t denotes the transpose of a matrix X. Clearly, the length of res(a) is NM. Conversely, any vector of length NM may be reshaped into an N M rectangular matrix. For example, ( a1 a 2 ) (a 1, a 2, a 3, a 4 ) a 3 a 4.
8 Notations For arbitrary MN ST matrix C, usually we use both indices to denote C = [a ij ], but more conveniently, we will use the blockform of C as C = [C m,n ] M M,N (M S,T ) and then write as C = [C m,n ] = [cm,µ], (2.2) n,ν where cm,µ n,ν denotes the (µ, ν)-entry of (m, n)-block matrix C m,n.
9 Notations For example, ( C11 C 12 C = C 21 C 22 ) = c c c c c c c c c c c c = [cm,µ n,ν ]. c c c c Especially, when C = A B, A = [a mn ] M M,N, B = [b µν ] M S,T, we have cm,µ n,ν = a mnb µν.
10 Notations For arbitrary MN ST matrix C defined by Eq.(2.2), we define a block-matrix where cm,n µ,ν For instance, if C = C κ = [Cm,µ] κ = [cm,n], (2.3) µ,ν denotes the (n, ν)-entry of (m, µ)-block matrix Cm,µ. κ ( C11 C 12 C 21 C 22 ) = c c c c c c c c c c c c c c c c,
11 Notations then C κ = c c c c c c c c c c c c c c c c.
12 Notations C = z z z 1,3 z z z 2,3 z z z 1,3 z z z 2,3 z1,3 z1,3 z1,3 1,3 z1,3 z1,3 z1,3 2,3 z z z 1,3 z z z 2,3 z z z 1,3 z z z 2,3 z2,3 z2,3 z2,3 1,3 z2,3 z2,3 z2,3 2,3, C κ = z z z 1,3 z z z 1,3 z1,3 z1,3 z1,3 1,3 z z z 2,3 z z z 2,3 z1,3 z1,3 z1,3 2,3 z z z 1,3 z z z 1,3 z2,3 z2,3 z2,3 1,3 z z z 2,3 z z z 2,3 z2,3 z2,3 z2,3 2,3.
13 Notations Let C be as in Eq.(2.2). Then (C κ ) κ = C. Theorem [Choi, 1975] Let φ : M N M M be a linear map. Then φ is completely positive if and only if φ is of the form φ(ρ) = k i=1 V iρv i for all ρ in M N where V i is an M N matrix for each 1 i k. Remark Note that {V i } k i=1 is not uniquely determined by φ. If there exists another family {W i } l i=1 such that φ(ρ) = l i W iρw i for all ρ in M N, then there must be a unitary U = [u ij ] such that W i = k j=1 u ijv j for every 1 i l.
14 Notations For a completely positive map φ : M N represented as M M, let it be φ(ρ) = k i=1 V i ρv i, ρ M N, (2.4) Let the M N matrix V i satisfy Eq.(2.4) be written as V i = [a i mn] for i = 1, 2,..., k. Define a Kraus matrix M of φ as [ k M = a i mn 2]. (2.5) i=1
15 Notations Remark In fact, M = k i=1 [ai mn] [a i mn], where denotes the Hadamard product of V i and V i, a i mn is the conjugate of a i mn. Even though Kraus operators of φ are not unique, by Remark 1 and Eq. (2.5), the Kraus matrix M is unique and written M φ, clearly, it is a nonnegative(its entries 0) matrix.
16 Notations Now we reshape V i into a length MN column vector res(v i ) ( ) following Eq.(2.1). Define V := res(v 1 ), res(v 2 ),..., res(v k ), and put D = VV, namely, a 1 11 a a k a 1 1N a 2 1N... a k 1N V = , a 1 M1 a 2 M1... a k M a 1 MN a2 MN... ak MN which is an MN k matrix, and
17 Notations D = k i=1 ai 11 ai 11 k i=1 ai 11 ai k i=1 ai 11 ai MN k i=1 ai 1N ai 11 k i=1 ai 1N ai k i=1 ai 1N ai MN k i=1 ai M1 ai 11 k i=1 ai M1 ai k i=1 ai M1 ai MN k i=1 ai MN ai 11 k i=1 ai MN ai k i=1 ai MN ai MN, which is an MN MN matrix. (2.6)
18 Notations Let zm,µ n,ν D = = k i=1 ai mna i µν. Then D can be written as follows z... z... z1,m... z1,m 1,N 1,N z... z1,m N,N N, z N,1 zm,1... z1,m N,N... zm,1... zm,m 1,N zm,1 N,1... zm,1 N,N... zm,m N,1... zm,m 1,N... zm,m N,N. (2.7)
19 Notations Also, D can be represented by following formalism D = k i=1 ( )(. res(v i ) res(v i )) (2.8) The following gives a matrix representation of Eq.(2.4). Proposition If φ satisfies Eq.(2.4), then res(φ(ρ)) = D κ φ res(ρ) for each ρ M N.
20 An interpolation question Theorem (1) If φ : M N M M is a completely positive map, then D φ M MN is positive semi-definite. (2) If D M MN is positive semi-definite, then there exists a completely positive map φ : M N M M such that D φ = D. (3) Suppose that φ is a completely positive map, then (i) φ is unital if and only if tr 2 D φ := N µ=1 z m,µ = I n,µ M; (ii) φ is trace preserving if and only if tr 1 D φ := M m=1 z m,ν = I m,µ N.
21 An interpolation question Remark The matrix M in (b) of Theorem in the beginning is just transpose M t φ of the Kraus matrix of the completely positive map φ in (a). The following theorem is an our main result considering the existence of completely positive maps φ sending a general family of matrices in M N to another family in M M.
22 An interpolation question Theorem Let {A i } k i=1 M N and {B i } k i=1 M M. Then the following conditions are equivalent. (a) There exists a completely positive map φ : M N M M such that φ(a i ) = B i for every 1 i k. (b) There exists an MN MN positive semi-definite matrix E such that (res(b 1 ), res(b 2 ),..., res(b k )) = E κ (res(a 1 ), res(a 2 ),..., res(a k )). (3.1)
23 An interpolation question Moreover, if one of (a) and (b) holds, then (1) φ in (a) is unital if and only if E in (b) satisfies tr 2 E = I M ; (2) φ in (a) is trace preserving if and only if E in (b) satisfies tr 1 E = I N. (3) φ in (a) is unital trace preserving if and only if E in (b) satisfies tr 1 E = I N and tr 2 E = I M.
24 An interpolation question Corollary Let {A i } k i=1 M N and {B i } k i=1 M M be two families consisting of diagonal matrices, for every 1 i k, denote a i b i a i b i A i = and B i = a in b im Then the following conditions are equivalent.
25 An interpolation question (a) There is a completely positive map φ : M N M M such that φ(a i ) = B i for every 1 i k. (b) There is an N M nonnegative matrix M such that B = AM, where b 11 b b 1M a 11 a a 1N b 21 b b 2M a 21 a a 2N B =, A = b k1 b k2... b km a k1 a k2... a kn (c) There exists a positive semi-definite matrix E with size MN satisfying Eq.(3.1).
26 Applications Denote by D N the set of all density matrices in M N. Definition Let {ρ i } k i=1 D N. If there exists a quantum operation φ : M N M N M N M N and a standard state Σ D N such that φ(ρ i Σ) = ρ i ρ i, i = 1, 2,..., k, then we call {ρ 1, ρ 2,..., ρ k } is clonable.
27 Applications It was essentially proved in [H. Barnum, C. M. Caves, et al., Noncommuting Mixed States Cannot Be Broadcast] that {ρ 1, ρ 2 } is clonable if and only if ρ 1 and ρ 2 are identical or orthogonal (i.e. ρ 1 ρ 2 = 0). The following theorem generalizes this conclusion, which will be proved with a very simple way that is different from the old approach. Let we see the following properties of fidelity F (ρ 1, ρ 2 ) of two arbitrary density matrices ρ 1, ρ 2 are needed.
28 Applications Lemma For all density matrices ρ i D N (i = 1, 2, 3, 4), the following are valid: (1) 0 F (ρ 1, ρ 2 ) 1; (2) F (ρ 1, ρ 2 ) = 0 if and only if ρ 1 ρ 2 = 0; (3) F (ρ 1, ρ 2 ) = 1 if and only if ρ 1 = ρ 2 ; (4) F (ρ 1 ρ 2, ρ 3 ρ 4 ) = F (ρ 1, ρ 3 )F (ρ 2, ρ 4 ).
29 Applications Theorem Let {ρ i } k i=1 D N and ρ i ρ j if i j. Then {ρ i } k i=1 and only if ρ i ρ j = 0 for 1 i j k. is clonable if
30 Applications Proof. Necessity. Suppose that {ρ i } k i=1 is clonable, then we see that there exists a quantum operation φ : M N M N M N M N and a standard state Σ such that φ(ρ i Σ) = ρ i ρ i, i = 1, 2,..., k. (4.1) Since any quantum operation does not decrease the fidelity between two quantum states, for 1 i j k, we have F (ρ i, ρ j ) = F (ρ i Σ, ρ j Σ) F (ρ i ρ i, ρ j ρ j ) = F (ρ i, ρ j ) 2, so, F (ρ i, ρ j ) = 0 or F (ρ i, ρ j ) = 1. Since ρ i ρ j, F (ρ i, ρ j ) 1. Therefore, F (ρ i, ρ j ) = 0, this shows that ρ i ρ j = 0, for 1 i j k.
31 Applications Sufficiency. Suppose that for 1 i j k, ρ i ρ j = 0, then there exists a unitary matrix U such that ρ i = Uρ iu is diagonal for every 1 i k. Take Σ D N such that Σ = UΣU is diagonal (e.g., Σ = N 1 I N ) and write ρ i, Σ as a i c ρ 0 a i i =, Σ 0 c =, a i N c N respectively.
32 Applications Since (ρ i Σ )(ρ j Σ ) = (Uρ i ρ j U ) (Σ Σ ) = 0 and (ρ i ρ i)(ρ j ρ j) = (Uρ i ρ j U ) (Uρ i ρ j U ) = 0, for all 1 i j k, we know that both {ρ i Σ } k i=1 and {ρ i ρ i }k i=1 are commuting families of Hermitian matrices.
33 Applications Define M 11 M 12 M M 1N M 21 M 22 M M 2N M = M 31 M 32 M M 3N, M N1 M N2 M N3... M NN where each M ij is an N N square matrix for 1 i, j N such that M ij = 0(i j) and a i 1 a i 2... a i N a i 1 a i 2... a i N M jj = if a i j 0 for some i(1 i k); a i 1 a i 2... a i N otherwise,
34 Applications Clearly, M is a row stochastic matrix. Since ρ i ρ j = Uρ iρ j U = 0 for 1 i j k, N r=1 ai ra j r = 0 and a i r, a j r 0 implies a i ra j r = 0 for each 1 r N and 1 i j k. It follows from tr(ρ i ) = tr(σ ) = 1 that there must at least exist 1 i 1, i 2,..., i k N such that a 1 i 1, a 2 i 2,..., a k i k 0, but a j i s = 0 for all j s(s, j = 1, 2,..., k). For fixed j, there exists at most some 1 i k such that a i j = 0.
35 Applications Thus, (a 1 1 )2... a 1 1 a1 N... a1 N a (a 1 N )2 (a 2 1 )2... a 2 1 a2 N... a2 N a (a 2 N )2... (a k 1 )2... a k 1 ak N... ak N ak 1... (a k N )2 a 1 1 c 1... a 1 1 c N... a 1 N c 1... a 1 N c N a 2 1 = c 1... a 2 1 c N... a 2 N c 1... a 2 N c N M (4.2)... a k 1 c 1... a k 1 c N... a k N c 1... a k N c N is valid.
36 Applications M N 2 It follows that there exists a quantum operation φ : M N 2 satisfying φ (ρ i Σ ) = ρ i ρ i(i = 1, 2,..., k). (4.3) Let φ (ρ) = l i=1 V iρv i, ρ M N 2, where l i=1 V i V i = I. Now, we define φ(ρ) = l [(U U) V i (U U)]ρ[(U U) V i (U U)], ρ M N 2. i=1
37 Applications Clearly, l i=1 [(U U) V i (U U)] [(U U) V i (U U)] = I, so φ : M N 2 M N 2 is a quantum operation and for i = 1, 2,..., k, we have φ(ρ i Σ) = (U U) φ (ρ i Σ )(U U) = (U U) (ρ i ρ i)(u U) = (U ρ iu) (U ρ iu) = ρ i ρ i.
38 Thank you!
Quantum Stochastic Maps and Frobenius Perron Theorem
Quantum Stochastic Maps and Frobenius Perron Theorem Karol Życzkowski in collaboration with W. Bruzda, V. Cappellini, H.-J. Sommers, M. Smaczyński Institute of Physics, Jagiellonian University, Cracow,
More informationQuantum Chaos and Nonunitary Dynamics
Quantum Chaos and Nonunitary Dynamics Karol Życzkowski in collaboration with W. Bruzda, V. Cappellini, H.-J. Sommers, M. Smaczyński Phys. Lett. A 373, 320 (2009) Institute of Physics, Jagiellonian University,
More informationRANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES
RANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES CHI-KWONG LI, YIU-TUNG POON, AND XUEFENG WANG Abstract. Let M n be the set of n n complex matrices. in this note, all the possible ranks of a bipartite
More informationarxiv:quant-ph/ v1 20 Jan 2004
On duality between quantum maps and quantum states Karol Życzkowski 1,2 and Ingemar Bengtsson 3 1 Instytut Fizyki im. Smoluchowskiego, Uniwersytet Jagielloński, ul. Reymonta 4, 30-059 Kraków, Poland 2
More informationLecture 14: Quantum information revisited
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next
More informationCHI-KWONG LI AND YIU-TUNG POON. Dedicated to Professor John Conway on the occasion of his retirement.
INTERPOLATION BY COMPLETELY POSITIVE MAPS CHI-KWONG LI AND YIU-TUNG POON Dedicated to Professor John Conway on the occasion of his retirement. Abstract. Given commuting families of Hermitian matrices {A
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationSummer School on Quantum Information Science Taiyuan University of Technology
Summer School on Quantum Information Science Taiyuan University of Technology Yiu Tung Poon Department of Mathematics, Iowa State University, Ames, Iowa 50011, USA (ytpoon@iastate.edu). Quantum operations
More informationThe Singular Value Decomposition
The Singular Value Decomposition Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) SVD Fall 2015 1 / 13 Review of Key Concepts We review some key definitions and results about matrices that will
More informationStructured Hadamard matrices and quantum information
Structured Hadamard matrices and quantum information Karol Życzkowski in collaboration with Adam G asiorowski, Grzegorz Rajchel (Warsaw) Dardo Goyeneche (Concepcion/ Cracow/ Gdansk) Daniel Alsina, José
More informationStructure of Unital Maps and the Asymptotic Quantum Birkhoff Conjecture. Peter Shor MIT Cambridge, MA Joint work with Anand Oza and Dimiter Ostrev
Structure of Unital Maps and the Asymptotic Quantum Birkhoff Conjecture Peter Shor MIT Cambridge, MA Joint work with Anand Oza and Dimiter Ostrev The Superposition Principle (Physicists): If a quantum
More informationMajorization-preserving quantum channels
Majorization-preserving quantum channels arxiv:1209.5233v2 [quant-ph] 15 Dec 2012 Lin Zhang Institute of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, PR China Abstract In this report, we give
More informationMatrix Arithmetic. a 11 a. A + B = + a m1 a mn. + b. a 11 + b 11 a 1n + b 1n = a m1. b m1 b mn. and scalar multiplication for matrices via.
Matrix Arithmetic There is an arithmetic for matrices that can be viewed as extending the arithmetic we have developed for vectors to the more general setting of rectangular arrays: if A and B are m n
More informationTrace Inequalities for a Block Hadamard Product
Filomat 32:1 2018), 285 292 https://doiorg/102298/fil1801285p Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Trace Inequalities for
More informationCLASSIFICATION OF COMPLETELY POSITIVE MAPS 1. INTRODUCTION
CLASSIFICATION OF COMPLETELY POSITIVE MAPS STEPHAN HOYER ABSTRACT. We define a completely positive map and classify all completely positive linear maps. We further classify all such maps that are trace-preserving
More informationarxiv: v2 [math-ph] 12 Jun 2013
Von Neumann entropy and majorization arxiv:1304.7442v2 [math-ph] 12 Jun 2013 Yuan Li a, and Paul Busch b, a. College of Mathematics and Information Science, Shaanxi Normal University, Xi an, 710062, People
More informationarxiv: v4 [quant-ph] 27 Dec 2015
Quantifying channels output similarity with applications to quantum control Lukasz Pawela 1 and Zbigniew Pucha la 1,2 arxiv:1412.8694v4 [quant-ph] 27 Dec 2015 1 Institute of Theoretical and Applied Informatics,
More informationLinear and Multilinear Algebra. Linear maps preserving rank of tensor products of matrices
Linear maps preserving rank of tensor products of matrices Journal: Manuscript ID: GLMA-0-0 Manuscript Type: Original Article Date Submitted by the Author: -Aug-0 Complete List of Authors: Zheng, Baodong;
More informationPrivate quantum subsystems and error correction
Private quantum subsystems and error correction Sarah Plosker Department of Mathematics and Computer Science Brandon University September 26, 2014 Outline 1 Classical Versus Quantum Setting Classical Setting
More informationSome upper and lower bounds on PSD-rank
Noname manuscript No (will be inserted by the editor) 1 Some upper and lower bounds on PSD-rank 2 Troy Lee Zhaohui Wei Ronald de Wolf 3 4 Received: date / Accepted: date 5 6 7 8 9 10 11 12 13 Abstract
More informationCategorical quantum channels
Attacking the quantum version of with category theory Ian T. Durham Department of Physics Saint Anselm College 19 March 2010 Acknowledgements Some of this work has been the result of some preliminary collaboration
More informationSymmetric and self-adjoint matrices
Symmetric and self-adjoint matrices A matrix A in M n (F) is called symmetric if A T = A, ie A ij = A ji for each i, j; and self-adjoint if A = A, ie A ij = A ji or each i, j Note for A in M n (R) that
More informationSudoku and Matrices. Merciadri Luca. June 28, 2011
Sudoku and Matrices Merciadri Luca June 28, 2 Outline Introduction 2 onventions 3 Determinant 4 Erroneous Sudoku 5 Eigenvalues Example 6 Transpose Determinant Trace 7 Antisymmetricity 8 Non-Normality 9
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationQuantum Statistics -First Steps
Quantum Statistics -First Steps Michael Nussbaum 1 November 30, 2007 Abstract We will try an elementary introduction to quantum probability and statistics, bypassing the physics in a rapid first glance.
More informationarxiv: v3 [math.ra] 22 Aug 2014
arxiv:1407.0331v3 [math.ra] 22 Aug 2014 Positivity of Partitioned Hermitian Matrices with Unitarily Invariant Norms Abstract Chi-Kwong Li a, Fuzhen Zhang b a Department of Mathematics, College of William
More informationLecture 6: Further remarks on measurements and channels
CS 766/QIC 820 Theory of Quantum Information Fall 2011) Lecture 6: Further remarks on measurements and channels In this lecture we will discuss a few loosely connected topics relating to measurements and
More informationINTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS
INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS HANMING ZHANG Abstract. In this paper, we will first build up a background for representation theory. We will then discuss some interesting topics in
More informationQuantum Entanglement and Error Correction
Quantum Entanglement and Error Correction Fall 2016 Bei Zeng University of Guelph Course Information Instructor: Bei Zeng, email: beizeng@icloud.com TA: Dr. Cheng Guo, email: cheng323232@163.com Wechat
More informationLecture 2: Linear operators
Lecture 2: Linear operators Rajat Mittal IIT Kanpur The mathematical formulation of Quantum computing requires vector spaces and linear operators So, we need to be comfortable with linear algebra to study
More informationPhys 201. Matrices and Determinants
Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1
More informationReview of linear algebra
Review of linear algebra 1 Vectors and matrices We will just touch very briefly on certain aspects of linear algebra, most of which should be familiar. Recall that we deal with vectors, i.e. elements of
More informationElementary Row Operations on Matrices
King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix
More informationSome applications of matrix inequalities in Rényi entropy
Some applications of matrix inequalities in Rényi entropy arxiv:608.03362v [math-ph] Aug 206 Hadi Reisizadeh, and S. Mahmoud Manjegani 2, Department of Electrical and Computer Engineering, 2 Department
More informationEnsembles and incomplete information
p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system
More informationLecture 6. Numerical methods. Approximation of functions
Lecture 6 Numerical methods Approximation of functions Lecture 6 OUTLINE 1. Approximation and interpolation 2. Least-square method basis functions design matrix residual weighted least squares normal equation
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 3: Basic Quantum Mechanics 26th September 2016 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information
More informationIntroduction to quantum information processing
Introduction to quantum information processing Fidelity and other distance metrics Brad Lackey 3 November 2016 FIDELITY AND OTHER DISTANCE METRICS 1 of 17 OUTLINE 1 Noise channels 2 Fidelity 3 Trace distance
More informationLecture notes on Quantum Computing. Chapter 1 Mathematical Background
Lecture notes on Quantum Computing Chapter 1 Mathematical Background Vector states of a quantum system with n physical states are represented by unique vectors in C n, the set of n 1 column vectors 1 For
More informationLinear algebra. 1.1 Numbers. d n x = 10 n (1.1) n=m x
1 Linear algebra 1.1 Numbers The natural numbers are the positive integers and zero. Rational numbers are ratios of integers. Irrational numbers have decimal digits d n d n x = 10 n (1.1 n=m x that do
More informationNullity of Measurement-induced Nonlocality. Yu Guo
Jul. 18-22, 2011, at Taiyuan. Nullity of Measurement-induced Nonlocality Yu Guo (Joint work with Pro. Jinchuan Hou) 1 1 27 Department of Mathematics Shanxi Datong University Datong, China guoyu3@yahoo.com.cn
More informationA Sudoku Submatrix Study
A Sudoku Submatrix Study Merciadri Luca LucaMerciadri@studentulgacbe Abstract In our last article ([1]), we gave some properties of Sudoku matrices We here investigate some properties of the Sudoku submatrices
More informationEcon 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis
Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms De La Fuente notes that, if an n n matrix has n distinct eigenvalues, it can be diagonalized. In this supplement, we will provide
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More informationMatrix Operations. Linear Combination Vector Algebra Angle Between Vectors Projections and Reflections Equality of matrices, Augmented Matrix
Linear Combination Vector Algebra Angle Between Vectors Projections and Reflections Equality of matrices, Augmented Matrix Matrix Operations Matrix Addition and Matrix Scalar Multiply Matrix Multiply Matrix
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationConditioning of the Entries in the Stationary Vector of a Google-Type Matrix. Steve Kirkland University of Regina
Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix Steve Kirkland University of Regina June 5, 2006 Motivation: Google s PageRank algorithm finds the stationary vector of a stochastic
More informationComposition of quantum states and dynamical subadditivity
IOP PUBLISHIG JOURAL OF PHYSICS A: MATHEMATICAL AD THEORETICAL J. Phys. A: Math. Theor. 41 (2008) 035305 (15pp) doi:10.1088/1751-8113/41/3/035305 Composition of quantum states and dynamical subadditivity
More informationWhat is the Matrix? Linear control of finite-dimensional spaces. November 28, 2010
What is the Matrix? Linear control of finite-dimensional spaces. November 28, 2010 Scott Strong sstrong@mines.edu Colorado School of Mines What is the Matrix? p. 1/20 Overview/Keywords/References Advanced
More informationHomework 3 - Solutions
Homework 3 - Solutions The Transpose an Partial Transpose. 1 Let { 1, 2,, } be an orthonormal basis for C. The transpose map efine with respect to this basis is a superoperator Γ that acts on an operator
More informationSpectral inequalities and equalities involving products of matrices
Spectral inequalities and equalities involving products of matrices Chi-Kwong Li 1 Department of Mathematics, College of William & Mary, Williamsburg, Virginia 23187 (ckli@math.wm.edu) Yiu-Tung Poon Department
More informationarxiv: v2 [quant-ph] 26 Mar 2012
Optimal Probabilistic Simulation of Quantum Channels from the Future to the Past Dina Genkina, Giulio Chiribella, and Lucien Hardy Perimeter Institute for Theoretical Physics, 31 Caroline Street North,
More informationLecture 2 INF-MAT : , LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky
Lecture 2 INF-MAT 4350 2009: 7.1-7.6, LU, symmetric LU, Positve (semi)definite, Cholesky, Semi-Cholesky Tom Lyche and Michael Floater Centre of Mathematics for Applications, Department of Informatics,
More information1 Matrices and matrix algebra
1 Matrices and matrix algebra 1.1 Examples of matrices A matrix is a rectangular array of numbers and/or variables. For instance 4 2 0 3 1 A = 5 1.2 0.7 x 3 π 3 4 6 27 is a matrix with 3 rows and 5 columns
More informationReview of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem
Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as
More informationBare minimum on matrix algebra. Psychology 588: Covariance structure and factor models
Bare minimum on matrix algebra Psychology 588: Covariance structure and factor models Matrix multiplication 2 Consider three notations for linear combinations y11 y1 m x11 x 1p b11 b 1m y y x x b b n1
More informationThe Singular Value Decomposition (SVD) and Principal Component Analysis (PCA)
Chapter 5 The Singular Value Decomposition (SVD) and Principal Component Analysis (PCA) 5.1 Basics of SVD 5.1.1 Review of Key Concepts We review some key definitions and results about matrices that will
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 7: More on Householder Reflectors; Least Squares Problems Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 15 Outline
More informationSection 9.2: Matrices.. a m1 a m2 a mn
Section 9.2: Matrices Definition: A matrix is a rectangular array of numbers: a 11 a 12 a 1n a 21 a 22 a 2n A =...... a m1 a m2 a mn In general, a ij denotes the (i, j) entry of A. That is, the entry in
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing
More informationOn positive maps in quantum information.
On positive maps in quantum information. Wladyslaw Adam Majewski Instytut Fizyki Teoretycznej i Astrofizyki, UG ul. Wita Stwosza 57, 80-952 Gdańsk, Poland e-mail: fizwam@univ.gda.pl IFTiA Gdańsk University
More informationarxiv: v2 [nlin.si] 15 Oct 2008
Random Quantum Operations Wojciech Bruzda 1, Valerio Cappellini 1, Hans-Jürgen Sommers 2, and Karol Życzkowski1,3 1 Mark Kac Complex Systems Research Centre, Institute of Physics, Jagiellonian University,
More informationLinGloss. A glossary of linear algebra
LinGloss A glossary of linear algebra Contents: Decompositions Types of Matrices Theorems Other objects? Quasi-triangular A matrix A is quasi-triangular iff it is a triangular matrix except its diagonal
More informationSymmetric and anti symmetric matrices
Symmetric and anti symmetric matrices In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally, matrix A is symmetric if. A = A Because equal matrices have equal
More informationCLASSICAL GROUPS DAVID VOGAN
CLASSICAL GROUPS DAVID VOGAN 1. Orthogonal groups These notes are about classical groups. That term is used in various ways by various people; I ll try to say a little about that as I go along. Basically
More informationMathematical Methods for Quantum Information Theory. Part I: Matrix Analysis. Koenraad Audenaert (RHUL, UK)
Mathematical Methods for Quantum Information Theory Part I: Matrix Analysis Koenraad Audenaert (RHUL, UK) September 14, 2008 Preface Books on Matrix Analysis: R. Bhatia, Matrix Analysis, Springer, 1997.
More informationarxiv:quant-ph/ v1 29 Mar 2003
Finite-Dimensional PT -Symmetric Hamiltonians arxiv:quant-ph/0303174v1 29 Mar 2003 Carl M. Bender, Peter N. Meisinger, and Qinghai Wang Department of Physics, Washington University, St. Louis, MO 63130,
More informationQueens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.
Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane c Sateesh R. Mane 2018 8 Lecture 8 8.1 Matrices July 22, 2018 We shall study
More informationPhysics 550. Problem Set 6: Kinematics and Dynamics
Physics 550 Problem Set 6: Kinematics and Dynamics Name: Instructions / Notes / Suggestions: Each problem is worth five points. In order to receive credit, you must show your work. Circle your final answer.
More informationPhysics 221A Fall 2005 Homework 8 Due Thursday, October 27, 2005
Physics 22A Fall 2005 Homework 8 Due Thursday, October 27, 2005 Reading Assignment: Sakurai pp. 56 74, 87 95, Notes 0, Notes.. The axis ˆn of a rotation R is a vector that is left invariant by the action
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 198 NOTES ON MATRIX METHODS 1. Matrix Algebra Margenau and Murphy, The Mathematics of Physics and Chemistry, Chapter 10, give almost
More informationCHAPTER 10 Shape Preserving Properties of B-splines
CHAPTER 10 Shape Preserving Properties of B-splines In earlier chapters we have seen a number of examples of the close relationship between a spline function and its B-spline coefficients This is especially
More informationOutput entropy of tensor products of random quantum channels 1
Output entropy of tensor products of random quantum channels 1 Motohisa Fukuda 1 [Collins, Fukuda and Nechita], [Collins, Fukuda and Nechita] 1 / 13 1 Introduction Aim and background Existence of one large
More informationProperties of Matrix Arithmetic
Properties of Matrix Arithmetic I've given examples which illustrate how you can do arithmetic with matrices. Now I'll give precise definitions of the various matrix operations. This will allow me to prove
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationA PRIMER ON SESQUILINEAR FORMS
A PRIMER ON SESQUILINEAR FORMS BRIAN OSSERMAN This is an alternative presentation of most of the material from 8., 8.2, 8.3, 8.4, 8.5 and 8.8 of Artin s book. Any terminology (such as sesquilinear form
More informationDegradable Quantum Channels
Degradable Quantum Channels Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA May 27, 2010 References The capacity of a quantum channel for simultaneous transmission of classical
More informationSCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE
SCHUR IDEALS AND HOMOMORPHISMS OF THE SEMIDEFINITE CONE BABHRU JOSHI AND M. SEETHARAMA GOWDA Abstract. We consider the semidefinite cone K n consisting of all n n real symmetric positive semidefinite matrices.
More informationEntanglement Measures and Monotones
Entanglement Measures and Monotones PHYS 500 - Southern Illinois University March 30, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones March 30, 2017 1 / 11 Quantifying
More informationBasic Concepts in Linear Algebra
Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University February 2, 2015 Grady B Wright Linear Algebra Basics February 2, 2015 1 / 39 Numerical Linear Algebra Linear
More informationCP-Invariance and Complete Positivity in Quantum Information Theory
in Quantum Information Theory D. W. Kribs, V. I. Paulsen, R. Pereira, and E. Størmer University of Guelph December 10, 2011 Order of Events Operator Systems on Complex Matrices Positive and Completely
More informationNon-square diagonal matrices
Non-square diagonal matrices Aim lecture: We apply the spectral theory of hermitian operators to look at linear maps T : V W which are not necessarily endomorphisms. This gives useful factorisations of
More information. a m1 a mn. a 1 a 2 a = a n
Biostat 140655, 2008: Matrix Algebra Review 1 Definition: An m n matrix, A m n, is a rectangular array of real numbers with m rows and n columns Element in the i th row and the j th column is denoted by
More informationLecture 7: Vectors and Matrices II Introduction to Matrices (See Sections, 3.3, 3.6, 3.7 and 3.9 in Boas)
Lecture 7: Vectors and Matrices II Introduction to Matrices (See Sections 3.3 3.6 3.7 and 3.9 in Boas) Here we will continue our discussion of vectors and their transformations. In Lecture 6 we gained
More informationQuantum computing and mathematical research. Chi-Kwong Li The College of William and Mary
and mathematical research The College of William and Mary Classical computing Classical computing Hardware - Beads and bars. Classical computing Hardware - Beads and bars. Input - Using finger skill to
More informationLinear algebra 2. Yoav Zemel. March 1, 2012
Linear algebra 2 Yoav Zemel March 1, 2012 These notes were written by Yoav Zemel. The lecturer, Shmuel Berger, should not be held responsible for any mistake. Any comments are welcome at zamsh7@gmail.com.
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
More informationCategories and Quantum Informatics: Hilbert spaces
Categories and Quantum Informatics: Hilbert spaces Chris Heunen Spring 2018 We introduce our main example category Hilb by recalling in some detail the mathematical formalism that underlies quantum theory:
More informationNumerical Range of non-hermitian random Ginibre matrices and the Dvoretzky theorem
Numerical Range of non-hermitian random Ginibre matrices and the Dvoretzky theorem Karol Życzkowski Institute of Physics, Jagiellonian University, Cracow and Center for Theoretical Physics, PAS, Warsaw
More informationThe Spectral Theorem for normal linear maps
MAT067 University of California, Davis Winter 2007 The Spectral Theorem for normal linear maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (March 14, 2007) In this section we come back to the question
More informationMatrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...
Chapter Matrices We review the basic matrix operations What is a Matrix? An array of numbers a a n A = a m a mn with m rows and n columns is a m n matrix Element a ij in located in position (i, j The elements
More informationMatrices. Chapter Definitions and Notations
Chapter 3 Matrices 3. Definitions and Notations Matrices are yet another mathematical object. Learning about matrices means learning what they are, how they are represented, the types of operations which
More informationMultiple eigenvalues
Multiple eigenvalues arxiv:0711.3948v1 [math.na] 6 Nov 007 Joseph B. Keller Departments of Mathematics and Mechanical Engineering Stanford University Stanford, CA 94305-15 June 4, 007 Abstract The dimensions
More informationDetermining a span. λ + µ + ν = x 2λ + 2µ 10ν = y λ + 3µ 9ν = z.
Determining a span Set V = R 3 and v 1 = (1, 2, 1), v 2 := (1, 2, 3), v 3 := (1 10, 9). We want to determine the span of these vectors. In other words, given (x, y, z) R 3, when is (x, y, z) span(v 1,
More informationInduced Ginibre Ensemble and random operations
Induced Ginibre Ensemble and random operations Karol Życzkowski in collaboration with Wojciech Bruzda, Marek Smaczyński, Wojciech Roga Jonith Fischmann, Boris Khoruzhenko (London), Ion Nechita (Touluse),
More informationSome bounds for the spectral radius of the Hadamard product of matrices
Some bounds for the spectral radius of the Hadamard product of matrices Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang, Tin-Yau Tam. June 1, 2004 Abstract Some bounds for the spectral radius of the Hadamard
More informationThe query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector
1 Query model In the quantum query model we wish to compute some function f and we access the input through queries. The complexity of f is the number of queries needed to compute f on a worst-case input
More informationMatrices. In this chapter: matrices, determinants. inverse matrix
Matrices In this chapter: matrices, determinants inverse matrix 1 1.1 Matrices A matrix is a retangular array of numbers. Rows: horizontal lines. A = a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 a 41 a
More information