Samiksha Jaiswal (Editor)

Matrix product state

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Matrix product state

Matrix product state (MPS) is a pure quantum state of many particles, written in the following form:

Contents

| Ψ ⟩ = ∑ { s } Tr [ A 1 ( s 1 ) A 2 ( s 2 ) ⋯ A N ( s N ) ] | s 1 s 2 … s N ⟩ ,

where A i ( s i ) are complex, square matrices of order χ (this dimension is called local dimension). Indices s i go over states in the computational basis. For qubits, it is s i ∈ { 0 , 1 } . For qudits (d-level systems), it is s i ∈ { 0 , 1 , … , d − 1 } .

It is particularly useful for dealing with ground states of one-dimensional quantum spin models (e.g. Heisenberg model (quantum)). The parameter χ is related to the entanglement between particles. In particular, if the state is a product state (i.e. not entangled at all), it can be described as a matrix product state with χ = 1 .

For states that are translationally symmetric, we can choose:

A 1 ( s ) = A 2 ( s ) = ⋯ = A N ( s ) ≡ A ( s ) .

In general, every state can be written in the MPS form (with χ growing exponentially with the particle number N). However, MPS are practical when χ is small – for example, does not depend on the particle number. Except for a small number of specific cases (some mentioned in the section Examples), such a thing is not possible, though in many cases it serves as a good approximation.

MPS decomposition is not unique.

Introductions in. and. In the context of finite automata:

Obtaining MPS

One method to obtain MPS is to use Schmidt decomposition N − 1 times.

Greenberger–Horne–Zeilinger state

Greenberger–Horne–Zeilinger state, which for N particles can be written as superposition of N zeros and N ones

| G H Z ⟩ = | 0 ⟩ ⊗ N + | 1 ⟩ ⊗ N 2

can be expressed as a Matrix Product State, up to normalization, with

A ( 0 ) = [ 1 0 0 0 ] A ( 1 ) = [ 0 0 0 1 ] ,

or equivalently, using notation from:

A = [ | 0 ⟩ 0 0 | 1 ⟩ ] .

This notation uses matrices with entries being wave functions (instead of complex numbers), and when multiplying matrices using tensor product for its entries (instead of product of two complex numbers). Such matrix is constructed as

A ≡ | 0 ⟩ A ( 0 ) + | 1 ⟩ A ( 1 ) + … + | d − 1 ⟩ A ( d − 1 ) .

Note that tensor product is not commutative.

In this particular example, a product of two A matrices is:

A A = [ | 00 ⟩ 0 0 | 11 ⟩ ] .

W state

W state, i.e. a being symmetric superposition of a single one among. Even through the state is permutation-symmetric, its simplest MPS representation is not. For example:

A 1 = [ | 0 ⟩ 0 | 0 ⟩ | 1 ⟩ ] A 2 = [ | 0 ⟩ | 1 ⟩ 0 | 0 ⟩ ] A 3 = [ | 1 ⟩ 0 0 | 0 ⟩ ] .

AKLT model

The AKLT ground state wavefunction, which is the historical example of MPS approach:, corresponds to the choice

A + = 2 3   σ + = [ 0 2 / 3 0 0 ] A 0 = − 1 3   σ z = [ − 1 / 3 0 0 1 / 3 ] A − = − 2 3   σ − = [ 0 0 − 2 / 3 0 ]

where the σ 's are Pauli matrices, or

A = 1 3 [ − | 0 ⟩ 2 | + ⟩ − 2 | − ⟩ | 0 ⟩ ] .

Majumdar–Ghosh model

Majumdar–Ghosh ground state can be written as MPS with

A = [ 0 | ↑ ⟩ | ↓ ⟩ − 1 2 | ↓ ⟩ 0 0 1 2 | ↑ ⟩ 0 0 ] .

References

Matrix product state Wikipedia
(Text) CC BY-SA