Quantum Computing News

Matrix Product States

Matrix Product States: The Unsung Heroes Solving the Hardest Issues in Quantum Computing and Classical Simulation

Classical simulation approaches continue to be essential for comprehending and developing the fast changing field of quantum technology. Among these, Matrix Product States (MPS) have become a fundamental “workhorse” that offers sophisticated and effective answers to a variety of quantum mechanical problems. Recent advancements demonstrate their dual strength: in addition to being essential for modeling quantum circuits, they are also helping to solve computational issues that were thought to be unsolvable in the past, including calculating characters of the symmetric group.

You can also read MnBi6Te10 Semiconductor: Thinnest Junction For Quantum Tech

Matrix Product States: Compression and Canonical Forms

Fundamentally, an Matrix Product States provides an effective one-dimensional representation of quantum states. Consider describing a complicated quantum state with n qubits. Even systems of moderate scale cannot be directly manipulated due to the exponential growth of the complete state vector. To tackle this, MPS breaks down the quantum state into a set of rank-3 tensors, or more accurately, a product of matrices. The states are named for this “matrix product” form, which also enables substantial compression.

Singular Value Decomposition (SVD) is the key to this compression. Any matrix can be divided into three parts using SVD: diagonal singular value matrices, right-unitary matrices, and left-unitary matrices. Crucially, data can be compressed by removing small, solitary values and their accompanying vectors because they convey little information. This idea is applied to quantum states and is comparable to condensing an image by keeping only the most important single values.

You can also read Microsoft PQC ML-KEM, ML-DSA algorithms for windows & Linux

The bond dimension, represented by hyper-parameter that regulates the degree of approximation and the amount of entanglement that an MPS can represent. Setting a finite introduces an approximation error, which is a commonly accepted trade-off to avoid exponentially enormous computational even though an MPS may accurately represent any state if is allowed to be exponentially large.

The canonical form of MPS is one of its most potent characteristics. Naturally, “left-orthonormal” tensors are produced when an Matrix Product States is constructed from a dense state vector, which is typically done from left to right using SVD. Accordingly, an identity matrix is the only outcome of contracting a site of the MPS from the left. This characteristic makes a lot of calculations easier, including figuring out the state norm.

With tensors to the left of a particular site being left-canonical and those to the right being right-canonical, MPS can also exist in a “right-canonical” or even “mixed canonical” form. Because it simplifies the computation to a single central tensor, this mixed form is especially useful for calculating expectation values of local observables. The Density Matrix Renormalization Group (DMRG) algorithm, a potent technique for locating Hamiltonian ground states, likewise relies heavily on this innate structure.

Additionally, entanglement and area laws are intrinsically linked to MPS. The singular values of the bonds in a 1D system directly encode the entanglement entropy of a sub-system, which is measured by the von Neumann entanglement entropy. In accordance with the area law for 1D systems, the entanglement entropy for a finite bond dimension is constrained by a constant.

You can also read Belenos: Quandela’s Photonic Quantum Computing Innovation

Projected Entangled Pair States (PEPS) have far more complicated algorithms and greater computing costs, but they are better suited for 2D or 3D systems and meet their respective area laws. Because of their simplicity and strong features, widely available Matrix Product States code is frequently a more sensible option because of this complexity, especially for systems where the area legislation requirements are not strictly applicable.

Simulating Quantum Circuits with MPS

Given the existing noise and expense of true quantum gear, Matrix Product States are becoming more and more important for classically mimicking quantum algorithms. For this, PennyLane, an open-source software framework for quantum computing and machine learning, offers tools such as the Default Tensor device that make use of MPS.

An MPS’s canonical form makes applying local gates to it incredibly simple. The MPS structure is restored by splitting the resulting tensor using SVD after contracting the gate’s matrix with the pertinent physical indices of the MPS. However, non-local gates are more difficult.

There are two primary methods:

• Swap-Unswap Method: The Swap-Unswap Method entails applying the gate, “un-swapping” the target qubits back, and “swapping out” sites till they are adjacent.
• Matrix Product Operator (MPO) Method: By creating an MPO for the gate, the Matrix Product Operator (MPO) Method essentially acts on all sites, including identity operations on intermediate qubits. While it can be NP-hard to determine the best contraction path for MPOs, there are effective methods for MPS, such as switching between virtual and physical index contractions.

Setting the bond dimension is a crucial step in performing Matrix Product States simulations. Finite-size scaling, also known as bond dimension scaling, is a common technique used to guarantee the validity of simulation results when working with systems that are too big for precise comparisons. Similar to zero noise extrapolation, this entails running the simulation with increasing bond size and seeing if the results converge to an extrapolated value.

Finite-size scaling provides a quantitative technique for choosing a suitable bond dimension, even though occasionally a qualitative result from a less expensive, lower bond dimension simulation is acceptable. A simulation of a H6 molecule, for example, produced precise results with a bond dimension of 32 and even qualitative findings.

You can also read λambeq Gen II: QNLP Quantum Natural Language Processing

Tackling Computational Hardness: Symmetric Group Characters

MPS are currently being used to solve issues in theoretical physics and pure mathematics in addition to simulating quantum circuits. An Matrix Product States technique for calculating characters of the symmetric group FF has been recently developed. In the worst scenario, the issue of computing irreducible characters of meaning it is at least as challenging as counting the number of solutions to an NP-hard problem. Finding an algorithm whose runtime scales polynomially with n is improbable due to this difficulty.

“Symmetric Group Characters via Matrix Product States” explains the new approach, which computes an MPS that encodes all irreducible characters of a given permutation. This is based on a new mapping that Crichigno and Prakash initially proposed from characters of quantum spin chains. It is possible to read off the letters as amplitudes of a particular quantum state on 2n fermionic modes.

You can also read Quantum Hamiltonian Descent (QHD-ALM) For Non-Convex NLP

This study offers a poly(n) size quantum circuit that can prepare the related MPS as well as a new classical MPS method for these features that numerical benchmarks demonstrate to be competitive with top computer algebra systems.

This quantum circuit is important because the preparation circuit’s size is polynomial, even though the Matrix Product States‘s bond dimension can grow exponentially. For some sampling issues based on symmetric group characteristics, such as integrals over the unitary group, kernel functions in machine learning, and Laughlin states in the fractional quantum Hall effect, this enables effective quantum algorithms. The method can also be used to calculate Kostka numbers, which are essential in representation theory and combinatorics.

In conclusion

Matrix Product States remain a fundamental component of many contemporary classical quantum simulation methods. They are a very useful tool because of their special qualities, which include algorithmic simplicity and the availability of a canonical form. Matrix Product States are unquestionably a flexible and potent tool in both theoretical and applied quantum physics, from facilitating effective simulation of quantum circuits in PennyLane to opening up new possibilities for resolving issues in group theory.

You can also read Optical Lattice Clocks Provide Ultra-Precise Timekeeping