Matrix product state

Last updated
Penrose graphical notation (tensor diagram notation) of a matrix product state of five particles. Matrix product state obc tikz.svg
Penrose graphical notation (tensor diagram notation) of a matrix product state of five particles.

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

Contents

where are complex, square matrices of order (this dimension is called local dimension). Indices go over states in the computational basis. For qubits, it is . For qudits (d-level systems), it is .

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 .

For states that are translationally symmetric, we can choose:

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.

The MPS decomposition is not unique. For introductions see [1] and. [2] In the context of finite automata see. [3] For emphasis placed on the graphical reasoning of tensor networks, see the introduction. [4]

Obtaining MPS

One method to obtain an MPS representation of a quantum state is to use Schmidt decomposition N − 1 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

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

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

or equivalently, using notation from: [3]

This notation uses matrices with entries being state vectors (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

Note that tensor product is not commutative.

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

W state

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. [1] For example:

AKLT model

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

where the are Pauli matrices, or

Majumdar–Ghosh model

Majumdar–Ghosh ground state can be written as MPS with

See also

Related Research Articles

<span class="mw-page-title-main">Pauli matrices</span> Matrices important in quantum mechanics and the study of spin

In mathematical physics and mathematics, the Pauli matrices are a set of three 2 × 2 complex matrices that are Hermitian, involutory and unitary. Usually indicated by the Greek letter sigma, they are occasionally denoted by tau when used in connection with isospin symmetries.

<span class="mw-page-title-main">Uncertainty principle</span> Foundational principle in quantum physics

The uncertainty principle, also known as Heisenberg's indeterminacy principle, is a fundamental concept in quantum mechanics. It states that there is a limit to the precision with which certain pairs of physical properties, such as position and momentum, can be simultaneously known. In other words, the more accurately one property is measured, the less accurately the other property can be known.

In quantum field theory, the Dirac spinor is the spinor that describes all known fundamental particles that are fermions, with the possible exception of neutrinos. It appears in the plane-wave solution to the Dirac equation, and is a certain combination of two Weyl spinors, specifically, a bispinor that transforms "spinorially" under the action of the Lorentz group.

In quantum mechanics, a Slater determinant is an expression that describes the wave function of a multi-fermionic system. It satisfies anti-symmetry requirements, and consequently the Pauli principle, by changing sign upon exchange of two electrons. Only a small subset of all possible fermionic wave functions can be written as a single Slater determinant, but those form an important and useful subset because of their simplicity.

<span class="mw-page-title-main">Hadamard transform</span> Involutive change of basis in linear algebra

The Hadamard transform is an example of a generalized class of Fourier transforms. It performs an orthogonal, symmetric, involutive, linear operation on 2m real numbers.

In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate is a basic quantum circuit operating on a small number of qubits. Quantum logic gates are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits.

<span class="mw-page-title-main">Stokes parameters</span> Set of values that describe the polarization state of electromagnetic radiation

The Stokes parameters are a set of values that describe the polarization state of electromagnetic radiation. They were defined by George Gabriel Stokes in 1852, as a mathematically convenient alternative to the more common description of incoherent or partially polarized radiation in terms of its total intensity (I), (fractional) degree of polarization (p), and the shape parameters of the polarization ellipse. The effect of an optical system on the polarization of light can be determined by constructing the Stokes vector for the input light and applying Mueller calculus, to obtain the Stokes vector of the light leaving the system. The original Stokes paper was discovered independently by Francis Perrin in 1942 and by Subrahamanyan Chandrasekhar in 1947, who named it as the Stokes parameters.

In physics, the Majorana equation is a relativistic wave equation. It is named after the Italian physicist Ettore Majorana, who proposed it in 1937 as a means of describing fermions that are their own antiparticle. Particles corresponding to this equation are termed Majorana particles, although that term now has a more expansive meaning, referring to any fermionic particle that is its own anti-particle.

<span class="mw-page-title-main">Spin-1/2</span> Type of matter

In quantum mechanics, spin is an intrinsic property of all elementary particles. All known fermions, the particles that constitute ordinary matter, have a spin of 1/2. The spin number describes how many symmetrical facets a particle has in one full rotation; a spin of 1/2 means that the particle must be rotated by two full turns before it has the same configuration as when it started.

In quantum mechanics, eigenspinors are thought of as basis vectors representing the general spin state of a particle. Strictly speaking, they are not vectors at all, but in fact spinors. For a single spin 1/2 particle, they can be defined as the eigenvectors of the Pauli matrices.

In mathematics and physics, in particular quantum information, the term generalized Pauli matrices refers to families of matrices which generalize the properties of the Pauli matrices. Here, a few classes of such matrices are summarized.

The Steane code is a tool in quantum error correction introduced by Andrew Steane in 1996. It is a CSS code (Calderbank-Shor-Steane), using the classical binary [7,4,3] Hamming code to correct for qubit flip errors and the dual of the Hamming code, the [7,3,4] code, to correct for phase flip errors. The Steane code encodes one logical qubit in 7 physical qubits and is able to correct arbitrary single qubit errors.

The time-evolving block decimation (TEBD) algorithm is a numerical scheme used to simulate one-dimensional quantum many-body systems, characterized by at most nearest-neighbour interactions. It is dubbed Time-evolving Block Decimation because it dynamically identifies the relevant low-dimensional Hilbert subspaces of an exponentially larger original Hilbert space. The algorithm, based on the Matrix Product States formalism, is highly efficient when the amount of entanglement in the system is limited, a requirement fulfilled by a large class of quantum many-body systems in one dimension.

In quantum mechanics, the Pauli equation or Schrödinger–Pauli equation is the formulation of the Schrödinger equation for spin-½ particles, which takes into account the interaction of the particle's spin with an external electromagnetic field. It is the non-relativistic limit of the Dirac equation and can be used where particles are moving at speeds much less than the speed of light, so that relativistic effects can be neglected. It was formulated by Wolfgang Pauli in 1927. In its linearized form it is known as Lévy-Leblond equation.

In quantum mechanics, a raising or lowering operator is an operator that increases or decreases the eigenvalue of another operator. In quantum mechanics, the raising operator is sometimes called the creation operator, and the lowering operator the annihilation operator. Well-known applications of ladder operators in quantum mechanics are in the formalisms of the quantum harmonic oscillator and angular momentum.

In physics, and specifically in quantum field theory, a bispinor is a mathematical construction that is used to describe some of the fundamental particles of nature, including quarks and electrons. It is a specific embodiment of a spinor, specifically constructed so that it is consistent with the requirements of special relativity. Bispinors transform in a certain "spinorial" fashion under the action of the Lorentz group, which describes the symmetries of Minkowski spacetime. They occur in the relativistic spin-1/2 wave function solutions to the Dirac equation.

Spin is an intrinsic form of angular momentum carried by elementary particles, and thus by composite particles such as hadrons, atomic nuclei, and atoms. Spin is quantized, and accurate models for the interaction with spin require relativistic quantum mechanics or quantum field theory.

<span class="mw-page-title-main">Mutually unbiased bases</span>

In quantum information theory, a set of bases in Hilbert space Cd are said to be mutually unbiased to mean, that, if a system is prepared in an eigenstate of one of the bases, then all outcomes of the measurement with respect to the other basis are predicted to occur with an equal probability inexorably equal to 1/d.

In quantum computing, the quantum Fourier transform (QFT) is a linear transformation on quantum bits, and is the quantum analogue of the discrete Fourier transform. The quantum Fourier transform is a part of many quantum algorithms, notably Shor's algorithm for factoring and computing the discrete logarithm, the quantum phase estimation algorithm for estimating the eigenvalues of a unitary operator, and algorithms for the hidden subgroup problem. The quantum Fourier transform was discovered by Don Coppersmith.

In quantum computing and quantum information theory, the Clifford gates are the elements of the Clifford group, a set of mathematical transformations which normalize the n-qubit Pauli group, i.e., map tensor products of Pauli matrices to tensor products of Pauli matrices through conjugation. The notion was introduced by Daniel Gottesman and is named after the mathematician William Kingdon Clifford. Quantum circuits that consist of only Clifford gates can be efficiently simulated with a classical computer due to the Gottesman–Knill theorem.

References

  1. 1 2 Perez-Garcia, D.; Verstraete, F.; Wolf, M.M. (2008). "Matrix product state representations". Quantum Inf. Comput. 7: 401. arXiv: quant-ph/0608197 .
  2. Verstraete, F.; Murg, V.; Cirac, J.I. (2008). "Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems". Advances in Physics. 57 (2): 143–224. arXiv: 0907.2796 . Bibcode:2008AdPhy..57..143V. doi:10.1080/14789940801912366. S2CID   17208624.
  3. 1 2 Crosswhite, Gregory; Bacon, Dave (2008). "Finite automata for caching in matrix product algorithms". Physical Review A . 78 (1): 012356. arXiv: 0708.1221 . Bibcode:2008PhRvA..78a2356C. doi:10.1103/PhysRevA.78.012356. S2CID   4879564.
  4. Biamonte, Jacob; Bergholm, Ville (2017). "Tensor Networks in a Nutshell". arXiv: 1708.00006 [quant-ph].
  5. Affleck, Ian; Kennedy, Tom; Lieb, Elliott H.; Tasaki, Hal (1987). "Rigorous results on valence-bond ground states in antiferromagnets". Physical Review Letters . 59 (7): 799–802. Bibcode:1987PhRvL..59..799A. doi:10.1103/PhysRevLett.59.799. PMID   10035874.
  6. Schollwöck, Ulrich (2011). "The density-matrix renormalization group in the age of matrix product states". Annals of Physics . 326 (1): 96–192. arXiv: 1008.3477 . Bibcode:2011AnPhy.326...96S. doi:10.1016/j.aop.2010.09.012. S2CID   118735367.