Matrix product state is a pure quantum state of many particles, written in the following form: where are complex, square matrices of order . Indices go over states in the computational basis. For qubits, it is. For qudits, it is. It is particularly useful for dealing with ground states of one-dimensional quantum spin models. The parameter is related to the entanglement between particles. In particular, if the state is a product state, it can be described as a matrix product state with. For states that are translationally symmetric, we can choose: In general, every state can be written in the MPS form. However, MPS are practical when is small – for example, does not depend on the particle number. Except for a small number of specific cases, such a thing is not possible, though in many cases it serves as a good approximation. The MPS decomposition is not unique. For introductions see and. In the context of finite automata see. For emphasis placed on the graphical reasoning of tensor networks, see the introduction.
Obtaining MPS
One method to obtain an MPS representation of a quantum state is to use Schmidt decomposition times. Alternatively if the quantum circuit which prepares the many body state is known, one could first try to obtain a matrix product operator representation of the circuit. The local tensors in the matrix product operator will be four index tensors. The local MPS tensor is obtained by contracting one physical index of the local MPO tensor with the state which is injected into the quantum circuit at that site.
Examples
Greenberger–Horne–Zeilinger state
, which for particles can be written as superposition of zeros and ones can be expressed as a Matrix Product State, up to normalization, with or equivalently, using notation from: This notation uses matrices with entries being state vectors, and when multiplying matrices using tensor product for its entries. Such matrix is constructed as Note that tensor product is not commutative. In this particular example, a product of two A matrices is:
W state
, i.e., the superposition of all the computational basis states of Hamming weight one. Even though the state is permutation-symmetric, its simplest MPS representation is not. For example:
