Mutltiparticle Entanglement. Andreas Osterloh Krakow,

Size: px
Start display at page:

Download "Mutltiparticle Entanglement. Andreas Osterloh Krakow, 31.03.2014"

Transcription

1 Mutltiparticle Entanglement Andreas Osterloh Krakow,

2 Outline Introduction to entanglement Genuine multipartite entanglement Balanced states Generalizations

3 single particle d ψ H = C d ; ψ = ψ i i i=1 d ρ H H = C d d ; ρ = ρ ij ij R ρ = r i u i u i ; R d i For R=1 the state is called pure. i,j=1

4 many constituents ψ H q =(C d ) q ; ψ = d i 1,...,i q =1 ψ i i 1,...,i q ρ H H = C dq dq ; ρ = ρ = R i r i u i u i ; R dq (d,...,d) i,j=(1,...,1) ρ ij i j Again, for R=1 the state is called pure. This will be the case also here.

5 what is Entanglement?

6 Pure states: 2 qubits ψ = ψ + ψ + ψ + ψ Question : ψ = Φ χ? Why is this an interesting question? Andernfalls > entangled product state: Acting on one spin can t affect the other no info transfer can be induced locally singlet states are entangled: polarized triplet states are disentangled ( )/ 2 J =1,m=1 = =

7 entanglement Indicators Reduced density matrix of pure product states is pure!!! local basis change doesn t affect entanglement local SU invariance of entanglement measures

8 Measures for 2 qubits τ 1 = 4 det ρ (1) (one)-tangle Coffman, Kundu, Wootters, PRA 51, 5236 (2) -Tr ρ (1) log 2 ρ (1) von Neumann entropy Negativity Concurrence Peres, PRL 77, 1413 (1996) Horodecki s, PLA 223, 1 (1996) Vidal, Werner, PRA 65, (22) entanglement measure C = ψ σ 2 σ 2 ψ E(ψ) Concept of entanglement is understood! Hill, Wootters, PRL s 1997 & 1998

9 Concurrence: 2 spins 1/2 Example Hill,Wootters PRL 1997; Wootters PRL 1998 ρ = ψ p BellBell = p +(1 + 1p) productproduct p Bell =( )/ 2 C = p Abouraddy et al. PRA 21 Ingredients R = ρσ 2 y ρ σy 2 ρ C = max{, 2λ max tr R} λ max : largest eigenvalue of R 9

10 Definition A q qudit state is called disentangled q : ρ = p i ψjψ i j i i j=1 normalized but not ON A q qudit state is called biseparable : ρ = i p i ψ i Aψ i A ψ i Bψ i B caution: being non-biseparable is sometimes called genuinely multipartite entangled

11 Genuine Multipartite Entanglement Osterloh, Siewert PRA 72, (25) Osterloh, Siewert IJQI 4, 531 (26) Lohmayer, Osterloh, Siewert, Uhlmann PRL 97, 2652 (26) Osterloh, Siewert, Uhlmann PRA 77, 3231 (28) Eltschka, Osterloh, Siewert, Uhlmann NJP 1, 4314 (28) Đjoković, Osterloh JMP 5, 3359 (29) Eltschka, Bastin, Osterloh, Siewert, Phys. Rev. A 85, 2231 (212) Osterloh, Siewert, Phys. Rev. A 86, 4232 (212)

12 tracing out NO entanglement left! Jedes Teilchen trägt bei Wissen über alle Teilchen nötig still entangled Wissen über 2 Teilchen ausreichend τ 1 & co. (somehow) detect all types C and τ 2 measure bipartite case τ 3 cares for tripartite case SL(2,C) Invarianten erlauben Differenzierung SL(2,C) invariants are the key Dür, Vidal, Cirac PRA 62, (2) Osterloh, J. Appl. Phys. B 98, 69 (21)

13 Vidal Kriterien PRA 2 Monotones local operations can destroy entanglement J =,m= = 1 2 ( ) projective measurement Kollaps der Wellenfunktion 5% or local operations can t entangle with other sites local operations must not enlarge entanglement! Unabhängige nicht WW Systeme bleiben unabhängig

14 local assistance local operations CAN induce entanglement... 1 ( ) 2... elsewhere projective measurement in x-direction 1 ( ± ) à 5% 2 Local unitaries cannot do this non-increasing is entanglement among/with these locally operated systems (e.g. qubits) General local operations needed!!!

15 How to classify Entanglement? Basiswechsel local unitary invariance: SU q Verallgemeinerte Messungen e iασ ; α RC local linear invariance: SL q Interesting: Not all SU-invars are entangl. monotones... Caveat: SL-trafos but all do SL-invars not preserve ARE! normalization

16 How to classify Entanglement? SU-invariance does not discriminate global entanglement from entanglement of only parts SU SL-operations introduce bias and creation generalized GL trafo Ψ + b b 1 SL-invariance only covers Ψ genuine c multipartite entanglement; subtangles are elusive

17 Central idea: combs U SU(2) U ψ Hfor all ψ H ψ I ψ = for all ψ H ψ U IU ψ = Osterloh, Siewert PRA 25 IJQI 26 find anti-linear operators such that

18 ... and filter ideal Comb property zero expectation values for local factors; i.e. Filters are non-local anti-linear operators with zero expectation for all product states Crucial: for any odd number of σ y Filters generate an Ideal within the algebra of polynomial invariants

19 4 qubits τ (1) 4 = σ µ σ ν σ y σ y σ µ σ y σ λ σ y σ y σ ν σ λ σ y τ (2) 4 = σµ σ ν σ y σ y σ µ σ y σ λ σ y σ y σ ν σ y σ τ σ y σ y σ λ σ τ τ (3) 4 = σ µ σ ν σ y σ y σ µ σ ν σ y σ y (1, 3) (2, 3) Osterloh, Siewert PRA 72, (25) Three inequivalent states τ (1) 4 τ (2) 4 τ (3) 4 Φ 1 = GHZ/cat state = + 15 Φ 2 = X state = Φ 3 = cluster state = Complete generating set for the filter-ideal Đjoković, Osterloh JMP 5, 3359 (29)

20 4 Qubits

21 Back to the definition of a comb...

22 ψ P 12 ψ ψ ψ ψ 123 σ µ σ 2 σ 2 ψ ψ 123 σ µ σ 2 σ 2 ψ 123 P 23 = ψ I n ψ... ψ 123 σ µ σ 2 σ 2 ψ 123 P 3 12 ψ123 σ µ σ 2 σ 2 ψ 123

23 a third invariant have a glance at and at σ 2 σ 2 P = 1 2 (σ µ σ µ σ 2 σ 2 ) σ 2 σ 2 σ 2 P 12 P 23 = 1 4 [σ 2 σ 2 σ 2 (σ µ σ µ σ 2 +cyclic) + i klm τ k τ l τ m ] with τ 1 = σ, τ 2 = σ 1, τ 3 = σ 3. i klm τ k τ l τ m P 12 σ µ σ µ σ 2 +cyclic

24 The symmetric Group defining group relations PP=1 ; P 23 P 12 P 23 = P 12 P 23 P 12 = third SL-invariant operator together with and the operators are complete! σ 2 σ µ σ µ i klm τ k τ l τ m identities between different invariants... e.g. 8σ 2 σ 2 σ 2 σ 2 σ 2 σ 2 =(σ 2 σ 2 σ µ σ µ ) 3 = Đjoković, Osterloh JMP 5, 3359 (29) Đjoković, Osterloh JMP 5, 3359 (29) 3σ µ σ 2 σ 2 σ µ σ 2 σ 2 = σ µ σ ν σ λ σ µ σ ν σ λ (σ 2 σ 2 ) 3 3(µ µ)(σ 2 σ 2 ) 2 + 3(µ µ) 2 (σ 2 σ 2 ) (µ µ) 3

25 Genuine multipartite entangled states Balanced states Osterloh, Siewert NJP 12, 7525 (21)

26 σ 2 = σ µ σ µ = i i (+, +) (+, ) (, +) (, ) only balanced part is filtered out Problem: every state has a balanced form

27 Irreducibly balanced states Definition (binary and alternating matrix): ψ = J j=1 Definition (balanced state): J j=1 c j bin{m j } ; c j = B ψ = (bin{m 1 }... bin{m J }) A ψ = 2B ψ Z q J (A ψ ) k,j n j = k {1,...,q} ; n j IN +

28 irreducible balanced: balanced & no balanced part completely unbalanced: without balanced part all modulo local SU-transformations

29 Theorem: Every (irreducibly) balanced state is SL-semistable sketch of the proof: T (i) LF O = t z i t z i ; z i R, t > 1 t q i=1 z ia ij = t w j j =1,...,L q >w j = z i A ij i=1 L 1 Balancedness: A il = w L = and assume that w j < for all j=1,...,l. q i=1 j=1 A ij z i A il = i =1,...,q L 1 j=1 w j! >

30 Results Product states are not irreducibly balanced full products are completely unbalanced (also W) SL(2) irreducibly balanced states stochastic states (irreducibly) balanced states are SL-semistable irreducibly balanced states of normal form are minimal in their length

31 Generalization J j=1 (A ψ ) k,j z j = k {1,...,q} ; z j Z \{} comes from topological phases distinguishes SL-equivalent states as no (additional) top. phase (add.) topological phase W = W = GHZ = GHZ = α α α α 3 1 Johansson, Ericsson, Singh, Sjöqvist, Williamson, PRA 85, 3232 (212)

32 Top. Phases and Entanglement SL-invariants of polynomial degree 2n lead to χ = πm n if several invars are non-zero, it is πm χ = gcd(n 1,...) Example: for GHZ Cl X = d=2n=6 d=2n=4 d=2n=2

33 Question: What (invariants) is highlighting those states? One hint given: if SU-invariant with bidegree (d 1,d 2 ) exists, then the topological phase is χ = 2πm d 1 d 2 Johansson, Ericsson, Singh, Sjöqvist, Williamson, PRA 85, 3232 (212) For three qubits, there is only a single invariant of bidegree (3,1) [and one of bidegree (1,3)] Luque, Thibon, Toumazet, Math. Struct. Comp. Sci. 17, 1133 (27) τ (3,1) =( ψ ij 2 ψ 1ij 2 )(ψ ψ ψ 1 ψ 11 ψ 11 ψ 1 ψ 1 ψ 11 ) +2 ψ ij (ψ 1 ψ 111 ψ 11 ψ 11 )ψ1ij ψ 1ij (ψ ψ 11 ψ 1 ψ 1 )ψij

34 (3,1) evaluated τ (3,1) top. phase GHZ W GHZ W π π π/2 W = W = GHZ = α α α α 3 1 GHZ = χ = 2πm = 2πm d 1 d = πm Generalizations of this concept to more qubits?

35 The partial spin flip c-balanced states as measured by (2n,)-invariant idea: correspondence through partial spin flip Remark: invariant with resp. to local SU(2) transforms α α α α α 4 1 α α α α α 4 1 value is SU(2)-invariant σ q y C σ q y C

36 The derived series SL SU U (2n,) (2n-1,1)... (n+1,n-1) (n,n) last element of series is U-invariant (n,n) is either a product (see example) or a completely unbalanced entangled state W-like (2n-p,p) : states SU-invariant τ (2n-p,p) SU-invars divide zero-class of SL down to U

37 Summary Entanglement classifications needs SL (SU too fine) local SL invariants genuinely N-tangled states irreducibly balanced states are SL-semistable for every irreducible balanced state exists a series of affinely balanced states

38 Thanks to the audience Thierry Bastin Dragomir Đoković Christopher Eltschka Markus Johansson Jens Siewert Eric Sjöqvist Armin Uhlmann

0.1 Phase Estimation Technique

0.1 Phase Estimation Technique Phase Estimation In this lecture we will describe Kitaev s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm We will also use this technique to design

More information

arxiv:quant-ph/9607009v1 11 Jul 1996

arxiv:quant-ph/9607009v1 11 Jul 1996 Distillability of Inseparable Quantum Systems Micha l Horodecki Department of Mathematics and Physics University of Gdańsk, 80 952 Gdańsk, Poland arxiv:quant-ph/9607009v1 11 Jul 1996 Pawe l Horodecki Faculty

More information

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i. Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

More information

Entanglement and its Role in Shor's Algorithm

Entanglement and its Role in Shor's Algorithm ntanglement and its Role in Shor's Algorithm Vivien M. Kendon 1, William J. Munro Trusted Systems Laboratory P Laboratories Bristol PL-2005-215 December 5, 2005* entanglement, Shor's algorithm ntanglement

More information

arxiv:quant-ph/0603009v3 8 Sep 2006

arxiv:quant-ph/0603009v3 8 Sep 2006 Deciding universality of quantum gates arxiv:quant-ph/0603009v3 8 Sep 2006 Gábor Ivanyos February 1, 2008 Abstract We say that collection of n-qudit gates is universal if there exists N 0 n such that for

More information

First and raw version 0.1 23. september 2013 klokken 13:45

First and raw version 0.1 23. september 2013 klokken 13:45 The discriminant First and raw version 0.1 23. september 2013 klokken 13:45 One of the most significant invariant of an algebraic number field is the discriminant. One is tempted to say, apart from the

More information

Characterization Of Polynomials Using Reflection Coefficients

Characterization Of Polynomials Using Reflection Coefficients Applied Mathematics E-Notes, 4(2004), 114-121 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ Characterization Of Polynomials Using Reflection Coefficients José LuisDíaz-Barrero,JuanJosé

More information

On the representability of the bi-uniform matroid

On the representability of the bi-uniform matroid On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large

More information

Quantum Mechanics and Representation Theory

Quantum Mechanics and Representation Theory Quantum Mechanics and Representation Theory Peter Woit Columbia University Texas Tech, November 21 2013 Peter Woit (Columbia University) Quantum Mechanics and Representation Theory November 2013 1 / 30

More information

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

More information

Chapter 6. Orthogonality

Chapter 6. Orthogonality 6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

More information

The Matrix Elements of a 3 3 Orthogonal Matrix Revisited

The Matrix Elements of a 3 3 Orthogonal Matrix Revisited Physics 116A Winter 2011 The Matrix Elements of a 3 3 Orthogonal Matrix Revisited 1. Introduction In a class handout entitled, Three-Dimensional Proper and Improper Rotation Matrices, I provided a derivation

More information

Detection of quantum entanglement in physical systems

Detection of quantum entanglement in physical systems Detection of quantum entanglement in physical systems Carolina Moura Alves Merton College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity 2005 Abstract Quantum entanglement

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α

More information

x1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.

x1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0. Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability

More information

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued). MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0

More information

BOX. The density operator or density matrix for the ensemble or mixture of states with probabilities is given by

BOX. The density operator or density matrix for the ensemble or mixture of states with probabilities is given by 2.4 Density operator/matrix Ensemble of pure states gives a mixed state BOX The density operator or density matrix for the ensemble or mixture of states with probabilities is given by Note: Once mixed,

More information

The Characteristic Polynomial

The Characteristic Polynomial Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

More information

ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.

ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional

More information

Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

More information

Killer Te categors of Subspace in CpNN

Killer Te categors of Subspace in CpNN Three observations regarding Schatten p classes Gideon Schechtman Abstract The paper contains three results, the common feature of which is that they deal with the Schatten p class. The first is a presentation

More information

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

More information

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions. 3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms

More information

= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

More information

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and

More information

Andreas Osterloh Physicist, Dr. habil. rer. nat.

Andreas Osterloh Physicist, Dr. habil. rer. nat. Andreas Osterloh Physicist, Dr. habil. rer. nat. Universität Duisburg-Essen Date of birth June 27nd 1969 Place of birth Bad Oeynhausen Nationality german Family status married, three children Remarks handicapped

More information

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree

More information

Finite dimensional C -algebras

Finite dimensional C -algebras Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n

More information

15.062 Data Mining: Algorithms and Applications Matrix Math Review

15.062 Data Mining: Algorithms and Applications Matrix Math Review .6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

More information

QUANTUM INFORMATION, COMPUTATION AND FUNDAMENTAL LIMITATION

QUANTUM INFORMATION, COMPUTATION AND FUNDAMENTAL LIMITATION Arun K. Pati Theoretical Physics Division QUANTUM INFORMATION, COMPUTATION AND FUNDAMENTAL LIMITATION Introduction Quantum information theory is a marriage between two scientific pillars of the twentieth

More information

Manipulability of the Price Mechanism for Data Centers

Manipulability of the Price Mechanism for Data Centers Manipulability of the Price Mechanism for Data Centers Greg Bodwin 1, Eric Friedman 2,3,4, and Scott Shenker 3,4 1 Department of Computer Science, Tufts University, Medford, Massachusetts 02155 2 School

More information

The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

More information

Modélisation et résolutions numérique et symbolique

Modélisation et résolutions numérique et symbolique Modélisation et résolutions numérique et symbolique via les logiciels Maple et Matlab Jeremy Berthomieu Mohab Safey El Din Stef Graillat Mohab.Safey@lip6.fr Outline Previous course: partial review of what

More information

Physik Department. Matrix Product Formalism

Physik Department. Matrix Product Formalism Physik Department Matrix Product Formalism Diplomarbeit von María Gracia Eckholt Perotti Angefertigt an der Technische Universität München und am Max-Planck-Institut für Quantenoptik Garching, September

More information

Anyone know these guys?

Anyone know these guys? Anyone know these guys? Gavin Brown and Miles Reid We observe that some of our diptych varieties have a beautiful description in terms of key 5-folds V (k) A k+5 that are almost homogeneous spaces. By

More information

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

More information

How To Solve An Npa-Complete Problems With Quantum Computing And Chaotic Dynamics

How To Solve An Npa-Complete Problems With Quantum Computing And Chaotic Dynamics CDMTCS Research Report Series A New Quantum Algorithm for NP-complete Problems Masanori Ohya Igor V. Volovich Science University of Tokyo Steklov Mathematical Institute CDMTCS-194 September 00 Centre for

More information

A note on companion matrices

A note on companion matrices Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod

More information

Orthogonal Diagonalization of Symmetric Matrices

Orthogonal Diagonalization of Symmetric Matrices MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Linear equations Ax D b come from steady state problems. Eigenvalues have their greatest importance in dynamic problems. The solution

More information

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

More information

Lecture 18 - Clifford Algebras and Spin groups

Lecture 18 - Clifford Algebras and Spin groups Lecture 18 - Clifford Algebras and Spin groups April 5, 2013 Reference: Lawson and Michelsohn, Spin Geometry. 1 Universal Property If V is a vector space over R or C, let q be any quadratic form, meaning

More information

Chapter 9 Unitary Groups and SU(N)

Chapter 9 Unitary Groups and SU(N) Chapter 9 Unitary Groups and SU(N) The irreducible representations of SO(3) are appropriate for describing the degeneracies of states of quantum mechanical systems which have rotational symmetry in three

More information

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM

FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT MINING SYSTEM International Journal of Innovative Computing, Information and Control ICIC International c 0 ISSN 34-48 Volume 8, Number 8, August 0 pp. 4 FUZZY CLUSTERING ANALYSIS OF DATA MINING: APPLICATION TO AN ACCIDENT

More information

THE SIGN OF A PERMUTATION

THE SIGN OF A PERMUTATION THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written

More information

Chapter 13: Basic ring theory

Chapter 13: Basic ring theory Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

EXERCISES FOR THE COURSE MATH 570, FALL 2010

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

More information

CLASSIFICATION OF TOPOLOGICAL INSULATORS AND SUPERCONDUCTORS, RESPONSES AND QUANTUM ANOMALIES

CLASSIFICATION OF TOPOLOGICAL INSULATORS AND SUPERCONDUCTORS, RESPONSES AND QUANTUM ANOMALIES CLASSIFICATION OF TOPOLOGICAL INSULATORS AND SUPERCONDUCTORS, RESPONSES AND QUANTUM ANOMALIES ANDREAS W.W. LUDWIG (UC-Santa Barbara) work done in collaboration with: Shinsei Ryu (UC-Berkeley) Andreas Schnyder

More information

8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

More information

Quantum Machine Learning Algorithms: Read the Fine Print

Quantum Machine Learning Algorithms: Read the Fine Print Quantum Machine Learning Algorithms: Read the Fine Print Scott Aaronson For twenty years, quantum computing has been catnip to science journalists. Not only would a quantum computer harness the notorious

More information

SOLVING LINEAR SYSTEMS

SOLVING LINEAR SYSTEMS SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis

More information

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

More information

HYPERCOMPLEX GEOMETRIC DERIVATIVE FROM A CAUCHY-LIKE INTEGRAL FORMULA

HYPERCOMPLEX GEOMETRIC DERIVATIVE FROM A CAUCHY-LIKE INTEGRAL FORMULA International Journal of Pure and Applied Mathematics Volume 68 No. 20, 55-59 HYPERCOMPLEX GEOMETRIC DERIVATIVE FROM A CAUCHY-LIKE INTEGRAL FORMULA M.F. Borges, A.D. Figueiredo 2, J.A. Marão 3 Department

More information

A linear algebraic method for pricing temporary life annuities

A linear algebraic method for pricing temporary life annuities A linear algebraic method for pricing temporary life annuities P. Date (joint work with R. Mamon, L. Jalen and I.C. Wang) Department of Mathematical Sciences, Brunel University, London Outline Introduction

More information

Chapter 7: Products and quotients

Chapter 7: Products and quotients Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

More information

Classification of Cartan matrices

Classification of Cartan matrices Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

More information

FACTORING MATRICES INTO THE PRODUCT OF CIRCULANT AND DIAGONAL MATRICES

FACTORING MATRICES INTO THE PRODUCT OF CIRCULANT AND DIAGONAL MATRICES FACTORING MATRICES INTO THE PRODUCT OF CIRCULANT AND DIAGONAL MATRICES MARKO HUHTANEN AND ALLAN PERÄMÄKI Abstract A generic matrix A C n n is shown to be the product of circulant and diagonal matrices

More information

The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression

The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The SVD is the most generally applicable of the orthogonal-diagonal-orthogonal type matrix decompositions Every

More information

Introduction to Finite Fields (cont.)

Introduction to Finite Fields (cont.) Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

More information

Entanglement Dynamics in Quantum Information Theory

Entanglement Dynamics in Quantum Information Theory Technische Universität München Max-Planck-Institut für Quantenoptik Entanglement Dynamics in Quantum Information Theory Toby S. Cubitt Vollständiger Abdruck der von der Fakultät für Physik der Technischen

More information

7. Some irreducible polynomials

7. Some irreducible polynomials 7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

More information

Master equation for retrodiction of quantum communication signals

Master equation for retrodiction of quantum communication signals Master equation for odiction of quantum communication signals Stephen M. Barnett 1, David T. Pegg 2, John Jeffers 1 and Ottavia Jedrkiewicz 3 1 Department of Physics and Applied Physics, University of

More information

Random graphs with a given degree sequence

Random graphs with a given degree sequence Sourav Chatterjee (NYU) Persi Diaconis (Stanford) Allan Sly (Microsoft) Let G be an undirected simple graph on n vertices. Let d 1,..., d n be the degrees of the vertices of G arranged in descending order.

More information

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

More information

QUADRATIC, EXPONENTIAL AND LOGARITHMIC FUNCTIONS

QUADRATIC, EXPONENTIAL AND LOGARITHMIC FUNCTIONS QUADRATIC, EXPONENTIAL AND LOGARITHMIC FUNCTIONS Content 1. Parabolas... 1 1.1. Top of a parabola... 2 1.2. Orientation of a parabola... 2 1.3. Intercept of a parabola... 3 1.4. Roots (or zeros) of a parabola...

More information

On Adaboost and Optimal Betting Strategies

On Adaboost and Optimal Betting Strategies On Adaboost and Optimal Betting Strategies Pasquale Malacaria School of Electronic Engineering and Computer Science Queen Mary, University of London Email: pm@dcs.qmul.ac.uk Fabrizio Smeraldi School of

More information

Two classes of ternary codes and their weight distributions

Two classes of ternary codes and their weight distributions Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight

More information

Domino Tableaux, Schützenberger Involution, and the Symmetric Group Action

Domino Tableaux, Schützenberger Involution, and the Symmetric Group Action Domino Tableaux, Schützenberger Involution, and the Symmetric Group Action Arkady Berenstein and Anatol N. Kirillov CRM-2510 September 1997 Department of Mathematics, Cornell University, Ithaca, NY 14853,

More information

Isotropic Entanglement

Isotropic Entanglement Isotropic Entanglement (Density of States of Quantum Spin Systems) Ramis Movassagh 1 and Alan Edelman 2 1 Department of Mathematics, Northeastern University 2 Department of Mathematics, M.I.T. Fields Institute,

More information

Refined enumerations of alternating sign matrices. Ilse Fischer. Universität Wien

Refined enumerations of alternating sign matrices. Ilse Fischer. Universität Wien Refined enumerations of alternating sign matrices Ilse Fischer Universität Wien 1 Central question Which enumeration problems have a solution in terms of a closed formula that (for instance) only involves

More information

47 th Symposium on Mathematical Physics

47 th Symposium on Mathematical Physics Institute of Physics, Nicolaus Copernicus University Reports on Mathematical Physics, The Editors Open Systems & Information Dynamics, The Editors 47 th Symposium on Mathematical Physics Toruń, Poland,

More information

Equivalence Concepts for Social Networks

Equivalence Concepts for Social Networks Equivalence Concepts for Social Networks Tom A.B. Snijders University of Oxford March 26, 2009 c Tom A.B. Snijders (University of Oxford) Equivalences in networks March 26, 2009 1 / 40 Outline Structural

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

arxiv:1410.3605v2 [quant-ph] 13 May 2015

arxiv:1410.3605v2 [quant-ph] 13 May 2015 Locality and Classicality: role of entropic inequalities arxiv:1410.3605v2 [quant-ph] 13 May 2015 J. Batle 1, Mahmoud Abdel-Aty 2,3, C. H. Raymond Ooi 4, S. Abdalla 5 and Y. Al-hedeethi 5 1 Departament

More information

Several Classes of Codes and Sequences Derived From a 4 -Valued Quadratic Form Nian Li, Xiaohu Tang, Member, IEEE, and Tor Helleseth, Fellow, IEEE

Several Classes of Codes and Sequences Derived From a 4 -Valued Quadratic Form Nian Li, Xiaohu Tang, Member, IEEE, and Tor Helleseth, Fellow, IEEE 7618 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 11, NOVEMBER 2011 Several Classes of Codes Sequences Derived From a 4 -Valued Quadratic Form Nian Li, Xiaohu Tang, Member, IEEE, Tor Helleseth,

More information

ON FOCK-GONCHAROV COORDINATES OF THE ONCE-PUNCTURED TORUS GROUP

ON FOCK-GONCHAROV COORDINATES OF THE ONCE-PUNCTURED TORUS GROUP ON FOCK-GONCHAROV COORDINATES OF THE ONCE-PUNCTURED TORUS GROUP YUICHI KABAYA Introduction In their seminal paper [3], Fock and Goncharov defined positive representations of the fundamental group of a

More information

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria

More information

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH 31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

More information

Maximum Likelihood Graph Structure Estimation with Degree Distributions

Maximum Likelihood Graph Structure Estimation with Degree Distributions Maximum Likelihood Graph Structure Estimation with Distributions Bert Huang Computer Science Department Columbia University New York, NY 17 bert@cs.columbia.edu Tony Jebara Computer Science Department

More information

MATRICES WITH DISPLACEMENT STRUCTURE A SURVEY

MATRICES WITH DISPLACEMENT STRUCTURE A SURVEY MATRICES WITH DISPLACEMENT STRUCTURE A SURVEY PLAMEN KOEV Abstract In the following survey we look at structured matrices with what is referred to as low displacement rank Matrices like Cauchy Vandermonde

More information

RINGS WITH A POLYNOMIAL IDENTITY

RINGS WITH A POLYNOMIAL IDENTITY RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in

More information

Notes on Symmetric Matrices

Notes on Symmetric Matrices CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.

More information

Quantum Computation: Towards the Construction of a Between Quantum and Classical Computer

Quantum Computation: Towards the Construction of a Between Quantum and Classical Computer Quantum Computation: Towards the Construction of a Between Quantum and Classical Computer Diederik Aerts and Bart D Hooghe Center Leo Apostel for Interdisciplinary Studies (CLEA) Foundations of the Exact

More information

Linear Codes. Chapter 3. 3.1 Basics

Linear Codes. Chapter 3. 3.1 Basics Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

More information

3 1. Note that all cubes solve it; therefore, there are no more

3 1. Note that all cubes solve it; therefore, there are no more Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

More information

Factoring Polynomials

Factoring Polynomials Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent

More information

SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES

SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES SUMMING CURIOUS, SLOWLY CONVERGENT, HARMONIC SUBSERIES THOMAS SCHMELZER AND ROBERT BAILLIE 1 Abstract The harmonic series diverges But if we delete from it all terms whose denominators contain any string

More information

Open Problems in Quantum Information Processing. John Watrous Department of Computer Science University of Calgary

Open Problems in Quantum Information Processing. John Watrous Department of Computer Science University of Calgary Open Problems in Quantum Information Processing John Watrous Department of Computer Science University of Calgary #1 Open Problem Find new quantum algorithms. Existing algorithms: Shor s Algorithm (+ extensions)

More information

LINEAR ALGEBRA. September 23, 2010

LINEAR ALGEBRA. September 23, 2010 LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................

More information

The Markov-Zariski topology of an infinite group

The Markov-Zariski topology of an infinite group Mimar Sinan Güzel Sanatlar Üniversitesi Istanbul January 23, 2014 joint work with Daniele Toller and Dmitri Shakhmatov 1. Markov s problem 1 and 2 2. The three topologies on an infinite group 3. Problem

More information

MATH 10550, EXAM 2 SOLUTIONS. x 2 + 2xy y 2 + x = 2

MATH 10550, EXAM 2 SOLUTIONS. x 2 + 2xy y 2 + x = 2 MATH 10550, EXAM SOLUTIONS (1) Find an equation for the tangent line to at the point (1, ). + y y + = Solution: The equation of a line requires a point and a slope. The problem gives us the point so we

More information

Quantum Computers. And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015. Quantum Computers

Quantum Computers. And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015. Quantum Computers Quantum Computers And How Does Nature Compute? Kenneth W. Regan 1 University at Buffalo (SUNY) 21 May, 2015 1 Includes joint work with Amlan Chakrabarti, U. Calcutta If you were designing Nature, how would

More information

THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties:

THE DYING FIBONACCI TREE. 1. Introduction. Consider a tree with two types of nodes, say A and B, and the following properties: THE DYING FIBONACCI TREE BERNHARD GITTENBERGER 1. Introduction Consider a tree with two types of nodes, say A and B, and the following properties: 1. Let the root be of type A.. Each node of type A produces

More information

Authentic Digital Signature Based on Quantum Correlation

Authentic Digital Signature Based on Quantum Correlation Authentic Digital Signature Based on Quantum Correlation Xiao-Jun Wen, Yun Liu School of Electronic Information Engineering, Beijing Jiaotong University, Beijing 00044, China Abstract: An authentic digital

More information

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION 4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:

More information

Classification Problems

Classification Problems Classification Read Chapter 4 in the text by Bishop, except omit Sections 4.1.6, 4.1.7, 4.2.4, 4.3.3, 4.3.5, 4.3.6, 4.4, and 4.5. Also, review sections 1.5.1, 1.5.2, 1.5.3, and 1.5.4. Classification Problems

More information

The Method of Partial Fractions Math 121 Calculus II Spring 2015

The Method of Partial Fractions Math 121 Calculus II Spring 2015 Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method

More information