Symplectic matrix

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, a symplectic matrix is a 2n×2n matrix M with real entries that satisfies the condition

where MT denotes the transpose of M and Ω is a fixed 2n×2n nonsingular, skew-symmetric matrix. This definition can be extended to 2n×2n matrices with entries in other fields, such as the complex numbers, finite fields, p-adic numbers, and function fields.

Typically Ω is chosen to be the block matrix Ω=[0InIn0], where In is the n×n identity matrix. The matrix Ω has determinant +1 and its inverse is Ω1=ΩT=Ω.

Properties

[edit | edit source]

Generators for symplectic matrices

[edit | edit source]

Every symplectic matrix has determinant +1, and the 2n×2n symplectic matrices with real entries form a subgroup of the general linear group GL(2n;) under matrix multiplication since being symplectic is a property stable under matrix multiplication. Topologically, this symplectic group is a connected noncompact real Lie group of real dimension n(2n+1), and is denoted Sp(2n;). The symplectic group can be defined as the set of linear transformations that preserve the symplectic form of a real symplectic vector space.

This symplectic group has a distinguished set of generators, which can be used to find all possible symplectic matrices. This includes the following sets D(n)={(A00(AT)1):AGL(n;)}N(n)={(InB0In):BSym(n;)} where Sym(n;) is the set of n×n symmetric matrices. Then, Sp(2n;) is generated by the set[1]p. 2 {Ω}D(n)N(n) of matrices. In other words, any symplectic matrix can be constructed by multiplying matrices in D(n) and N(n) together, along with some power of Ω.

Inverse matrix

[edit | edit source]

Every symplectic matrix is invertible with the inverse matrix given by M1=Ω1MTΩ. Furthermore, the product of two symplectic matrices is, again, a symplectic matrix. This gives the set of all symplectic matrices the structure of a group. There exists a natural manifold structure on this group which makes it into a (real or complex) Lie group called the symplectic group.

Determinantal properties

[edit | edit source]

It follows easily from the definition that the determinant of any symplectic matrix is ±1. Actually, it turns out that the determinant is always +1 for any field. One way to see this is through the use of the Pfaffian and the identity Pf(MTΩM)=det(M)Pf(Ω). Since MTΩM=Ω and Pf(Ω)0 we have that det(M)=1.

When the underlying field is real or complex, one can also show this by factoring the inequality det(MTM+I)1.[2]

Block form of symplectic matrices

[edit | edit source]

Suppose Ω is given in the standard form and let M be a 2n×2n block matrix given by M=(ABCD)

where

A,B,C,D

are

n×n

matrices. The condition for

M

to be symplectic is equivalent to the two following equivalent conditions[3]

ATC,BTD

symmetric, and

ATDCTB=I
ABT,CDT

symmetric, and

ADTBCT=I

The second condition comes from the fact that if

M

is symplectic, then

MT

is also symplectic. When

n=1

these conditions reduce to the single condition

det(M)=1

. Thus a

2×2

matrix is symplectic iff it has unit determinant.

Inverse matrix of block matrix

[edit | edit source]

With Ω in standard form, the inverse of M is given by M1=Ω1MTΩ=(DTBTCTAT). The group has dimension n(2n+1). This can be seen by noting that (MTΩM)T=MTΩM is anti-symmetric. Since the space of anti-symmetric matrices has dimension (2n2), the identity MTΩM=Ω imposes (2n2) constraints on the (2n)2 coefficients of M and leaves M with n(2n+1) independent coefficients.

Symplectic transformations

[edit | edit source]

In the abstract formulation of linear algebra, matrices are replaced with linear transformations of finite-dimensional vector spaces. The abstract analog of a symplectic matrix is a symplectic transformation of a symplectic vector space. Briefly, a symplectic vector space (V,ω) is a 2n-dimensional vector space V equipped with a nondegenerate, skew-symmetric bilinear form ω called the symplectic form.

A symplectic transformation is then a linear transformation L:VV which preserves ω, i.e. ω(Lu,Lv)=ω(u,v). Fixing a basis for V, ω can be written as a matrix Ω and L as a matrix M. The condition that L be a symplectic transformation is precisely the condition that M be a symplectic matrix: MTΩM=Ω.

Under a change of basis, represented by a matrix A, we have ΩATΩA MA1MA. One can always bring Ω to either the standard form given in the introduction or the block diagonal form described below by a suitable choice of A.

The matrix Ω

[edit | edit source]

Symplectic matrices are defined relative to a fixed nonsingular, skew-symmetric matrix Ω. As explained in the previous section, Ω can be thought of as the coordinate representation of a nondegenerate skew-symmetric bilinear form. It is a basic result in linear algebra that any two such matrices differ from each other by a change of basis.

The most common alternative to the standard Ω given above is the block diagonal form Ω=[0110000110]. This choice differs from the previous one by a permutation of basis vectors.

Sometimes the notation J is used instead of Ω for the skew-symmetric matrix. This is a particularly unfortunate choice as it leads to confusion with the notion of a complex structure, which often has the same coordinate expression as Ω but represents a very different structure. A complex structure J is the coordinate representation of a linear transformation that squares to In, whereas Ω is the coordinate representation of a nondegenerate skew-symmetric bilinear form. One could easily choose bases in which J is not skew-symmetric or Ω does not square to In.

Given a hermitian structure on a vector space, J and Ω are related via Ωab=gacJcb where gac is the metric. That J and Ω usually have the same coordinate expression (up to an overall sign) is simply a consequence of the fact that the metric g is usually the identity matrix.

Diagonalization and decomposition

[edit | edit source]
  • For any positive definite symmetric 2n×2n real symplectic matrix S, there is a symplectic unitary U, UU(2n,)Sp(2n,)=O(2n)Sp(2n,),such thatS=UTDUforD=diag(λ1,,λn,λ11,,λn1),where the diagonal elements of D are the eigenvalues of S.[4][5]
  • Any real symplectic matrix S has a polar decomposition of the form:[4]S=UR,whereUSp(2n,)U(2n,), andRSp(2n,)Sym+(2n,).
  • Any real symplectic matrix can be decomposed as a product of three matrices:S=O(D00D1)O,where O and O are both symplectic and orthogonal, and D is positive-definite and diagonal.[6] This decomposition is closely related to the singular value decomposition of a matrix and is known as an 'Euler' or 'Bloch-Messiah' decomposition.
  • The set of orthogonal symplectic matrices forms a (maximal) compact subgroup of the symplectic group.[7] This set is isomorphic to the set of unitary matrices of dimension n, U(2n,)Sp(2n,)=O(2n)Sp(2n,)U(n,). Every symplectic orthogonal matrix can be written as

    with VU(n,).

    This equation implies that every symplectic orthogonal matrix has determinant equal to +1 and thus that this is true for all symplectic matrices as its polar decomposition is itself given in terms symplectic matrices.

Complex matrices

[edit | edit source]

If instead M is a 2n × 2n matrix with complex entries, the definition is not standard throughout the literature. Many authors [8] adjust the definition above to

where M* denotes the conjugate transpose of M. In this case, the determinant may not be 1, but will have absolute value 1. In the 2×2 case (n=1), M will be the product of a real symplectic matrix and a complex number of absolute value 1.

Other authors [9] retain the definition (1) for complex matrices and call matrices satisfying (3) conjugate symplectic.

Applications

[edit | edit source]

Transformations described by symplectic matrices play an important role in quantum optics and in continuous-variable quantum information theory. For instance, symplectic matrices can be used to describe Gaussian (Bogoliubov) transformations of a quantum state of light.[10] In turn, the Bloch-Messiah decomposition (2) means that such an arbitrary Gaussian transformation can be represented as a set of two passive linear-optical interferometers (corresponding to orthogonal matrices O and O' ) intermitted by a layer of active non-linear squeezing transformations (given in terms of the matrix D).[11] In fact, one can circumvent the need for such in-line active squeezing transformations if two-mode squeezed vacuum states are available as a prior resource only.[12]

See also

[edit | edit source]

Lua error in mw.title.lua at line 392: bad argument #2 to 'title.new' (unrecognized namespace name 'Portal').

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  3. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  4. ^ a b Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  5. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  6. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  7. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  8. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  9. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  10. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  11. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  12. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).