Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1803.04844

Space Reduction in Matrix Product State

Lihua Wang, Kwang S. Kim

Published Mar 13, 2018• 0 citations
arXivHTMLPDF

Abstract

We reconstruct a matrix product state (MPS) in reduced spaces using density matrix. This scheme applies to a MPS built on a blocked quantum lattice. Each block contains $N$ physical sites that have a local space of rank $R$. The simulation in the original spaces of rank $R^N$ is used to construct density matrices for every block. They are diagonalized and only the eigenvectors corresponding to significant diagonal elements are used to transform the original spaces to smaller ones and to reconstruct the MPS in those smaller spaces accordingly. Simulations in the reduced spaces are used to reliably extrapolate the result in unreduced spaces. Moreover, to obtain a required accuracy, the ratio of the reduced space rank over the original decreases quickly with $N$. The reduced space has a saturated rank to obtain a demanded accuracy when $N\rightarrow \infty$.

DOI
10.48550/arxiv.1803.04844

Related papers

Scalable Reconstruction of Density Matrices

Tillmann Baumgratz, D. Gross, M. Cramer +1 more

Recent contributions in the field of quantum state tomography have shown that, despite the exponential growth of Hilbert space with the number of subsystems, tomography of one-dimensional quantum systems may still be performed efficiently by tailored reconstruction schemes. Here, we discuss a scalable method to reconstruct mixed states that are well approximated by matrix product operators. The reconstruction scheme only requires local information about the state, giving rise to a reconstruction technique that is scalable in the system size. It is based on a constructive proof that generic matrix product operators are fully determined by their local reductions. We discuss applications of this scheme for simulated data and experimental data obtained in an ion trap experiment.

arXiv:1207.0358•Physical Review Letters•Jul 11, 2013•119 citations

Accurate variational electronic structure calculations with the density matrix renormalization group

Sebastian Wouters

During the past 15 years, the density matrix renormalization group (DMRG) has become increasingly important for ab initio quantum chemistry. The underlying matrix product state (MPS) ansatz is a low-rank decomposition of the full configuration interaction tensor. The virtual dimension of the MPS controls the size of the corner of the many-body Hilbert space that can be reached. Whereas the MPS ansatz will only yield an efficient description for noncritical one-dimensional systems, it can still be used as a variational ansatz for other finite-size systems. Rather large virtual dimensions are then required. The two most important aspects to reduce the corresponding computational cost are a proper choice and ordering of the active space orbitals, and the exploitation of the symmetry group of the Hamiltonian. By taking care of both aspects, DMRG becomes an efficient replacement for exact diagonalization in quantum chemistry. DMRG and Hartree-Fock theory have an analogous structure. The former can be interpreted as a self-consistent mean-field theory in the DMRG lattice sites, and the latter in the particles. It is possible to build upon this analogy to introduce post-DMRG methods. Based on an approximate MPS, these methods provide improved ansätze for the ground state, as well as for excitations. Exponentiation of the single-particle (single-site) excitations for a Slater determinant (an MPS with open boundary conditions) leads to the Thouless theorem for Hartree-Fock theory (DMRG), an explicit nonredundant parameterization of the entire manifold of Slater determinants (MPS wavefunctions). This gives rise to the configuration interaction expansion for DMRG. The Hubbard-Stratonovich transformation lies at the basis of auxiliary field quantum Monte Carlo for Slater determinants. An analogous transformation for spin-lattice Hamiltonians allows to formulate a promising variant for MPSs.

arXiv:1405.1225•May 6, 2014•3 citations

Particle Number Conservation and Block Structures in Matrix Product States

Markus Bachmayr, Michael Götte, Pfeffer, Max

The eigenvectors of the particle number operator in second quantization are characterized by the block sparsity of their matrix product state representations. This is shown to generalize to other classes of operators. Imposing block sparsity yields a scheme for conserving the particle number that is commonly used in applications in physics. Operations on such block structures, their rank truncation, and implications for numerical algorithms are discussed. Explicit and rank-reduced matrix product operator representations of one- and two-particle operators are constructed that operate only on the non-zero blocks of matrix product states.

arXiv:2104.13483•Apr 27, 2021•0 citations

Product Wave Function Renormalization Group: Construction from the Matrix Product Point of View

Kouji Ueda, Tomotoshi Nishino, Kouichi Okunishi +3 more

We present a construction of a matrix product state (MPS) that approximates the largest-eigenvalue eigenvector of a transfer matrix T, for the purpose of rapidly performing the infinite system density matrix renormalization group (DMRG) method applied to two-dimensional classical lattice models. We use the fact that the largest-eigenvalue eigenvector of T can be approximated by a state vector created from the upper or lower half of a finite size cluster. Decomposition of the obtained state vector into the MPS gives a way of extending the MPS, at the system size increment process in the infinite system DMRG algorithm. As a result, we successfully give the physical interpretation of the product wave function renormalization group (PWFRG) method, and obtain its appropriate initial condition.

arXiv:cond-mat/0509320•Journal of the Physical Society of Japan•Jan 15, 2006•15 citations

Density-matrix algorithms for quantum renormalization groups

Steven R. White

A formulation of numerical real-space renormalization groups for quantum many-body problems is presented and several algorithms utilizing this formulation are outlined. The methods are presented and demonstrated using S=1/2 and S=1 Heisenberg chains as test cases. The key idea of the formulation is that rather than keep the lowest-lying eigenstates of the Hamiltonian in forming a new effective Hamiltonian of a block of sites, one should keep the most significant eigenstates of the block density matrix, obtained from diagonalizing the Hamiltonian of a larger section of the lattice which includes the block. This approach is much more accurate than the standard approach; for example, energies for the S=1 Heisenberg chain can be obtained to an accuracy of at least ${10}^{\mathrm{\ensuremath{-}}9}$. The method can be applied to almost any one-dimensional quantum lattice system, and can provide a wide variety of static properties.

Physical review. B, Condensed matter•Oct 1, 1993•3,244 citations

Fermionic Reduced Density Low-Rank Matrix Completion, Noise Filtering, and Measurement Reduction in Quantum Simulations

Linqing Peng, Xing Zhang, Garnet Kin‐Lic Chan

Fermionic reduced density matrices summarize the key observables in Fermionic systems. In electronic systems, the two-particle reduced density matrix (2-RDM) is sufficient to determine the energy and most physical observables of interest. Here, we consider the possibility of using matrix completion to reconstruct the two-particle reduced density matrix to chemical accuracy from partial information. We consider the case of noiseless matrix completion, where the partial information corresponds to a subset of the 2-RDM elements, as well as noisy completion, where the partial information corresponds to both a subset of elements and statistical noise in their values. Through experiments on a set of 24 molecular systems, we find that 2-RDM can be efficiently reconstructed from a reduced amount of information. In the case of noisy completion, this results in a multiple orders of magnitude reduction in the number of measurements needed to determine the 2-RDM with chemical accuracy. These techniques can be readily applied to both classical and quantum algorithms for quantum simulations.

arXiv:2306.05640•Journal of Chemical Theory and Computation•Dec 14, 2023•10 citations
We reconstruct a matrix product state (MPS) in reduced spaces using density matrix. This scheme applies to a MPS built on a blocked quantum lattice. Each block contains NNN physical sites that have a local space of rank RRR. The simulation in the original spaces of rank RNR^NRN is used to construct density matrices for every block. They are diagonalized and only the eigenvectors corresponding to significant diagonal elements are used to transform the original spaces to smaller ones and to reconstruct the MPS in those smaller spaces accordingly. Simulations in the reduced spaces are used to reliably extrapolate the result in unreduced spaces. Moreover, to obtain a required accuracy, the ratio of the reduced space rank over the original decreases quickly with NNN. The reduced space has a saturated rank to obtain a demanded accuracy when N→∞N\rightarrow \inftyN→∞.
Recent contributions in the field of quantum state tomography have shown that, despite the exponential growth of Hilbert space with the number of subsystems, tomography of one-dimensional quantum systems may still be performed efficiently by tailored reconstruction schemes. Here, we discuss a scalable method to reconstruct mixed states that are well approximated by matrix product operators. The reconstruction scheme only requires local information about the state, giving rise to a reconstruction technique that is scalable in the system size. It is based on a constructive proof that generic matrix product operators are fully determined by their local reductions. We discuss applications of this scheme for simulated data and experimental data obtained in an ion trap experiment.
During the past 15 years, the density matrix renormalization group (DMRG) has become increasingly important for ab initio quantum chemistry. The underlying matrix product state (MPS) ansatz is a low-rank decomposition of the full configuration interaction tensor. The virtual dimension of the MPS controls the size of the corner of the many-body Hilbert space that can be reached. Whereas the MPS ansatz will only yield an efficient description for noncritical one-dimensional systems, it can still be used as a variational ansatz for other finite-size systems. Rather large virtual dimensions are then required. The two most important aspects to reduce the corresponding computational cost are a proper choice and ordering of the active space orbitals, and the exploitation of the symmetry group of the Hamiltonian. By taking care of both aspects, DMRG becomes an efficient replacement for exact diagonalization in quantum chemistry. DMRG and Hartree-Fock theory have an analogous structure. The former can be interpreted as a self-consistent mean-field theory in the DMRG lattice sites, and the latter in the particles. It is possible to build upon this analogy to introduce post-DMRG methods. Based on an approximate MPS, these methods provide improved ansätze for the ground state, as well as for excitations. Exponentiation of the single-particle (single-site) excitations for a Slater determinant (an MPS with open boundary conditions) leads to the Thouless theorem for Hartree-Fock theory (DMRG), an explicit nonredundant parameterization of the entire manifold of Slater determinants (MPS wavefunctions). This gives rise to the configuration interaction expansion for DMRG. The Hubbard-Stratonovich transformation lies at the basis of auxiliary field quantum Monte Carlo for Slater determinants. An analogous transformation for spin-lattice Hamiltonians allows to formulate a promising variant for MPSs.
The eigenvectors of the particle number operator in second quantization are characterized by the block sparsity of their matrix product state representations. This is shown to generalize to other classes of operators. Imposing block sparsity yields a scheme for conserving the particle number that is commonly used in applications in physics. Operations on such block structures, their rank truncation, and implications for numerical algorithms are discussed. Explicit and rank-reduced matrix product operator representations of one- and two-particle operators are constructed that operate only on the non-zero blocks of matrix product states.
We present a construction of a matrix product state (MPS) that approximates the largest-eigenvalue eigenvector of a transfer matrix T, for the purpose of rapidly performing the infinite system density matrix renormalization group (DMRG) method applied to two-dimensional classical lattice models. We use the fact that the largest-eigenvalue eigenvector of T can be approximated by a state vector created from the upper or lower half of a finite size cluster. Decomposition of the obtained state vector into the MPS gives a way of extending the MPS, at the system size increment process in the infinite system DMRG algorithm. As a result, we successfully give the physical interpretation of the product wave function renormalization group (PWFRG) method, and obtain its appropriate initial condition.
A formulation of numerical real-space renormalization groups for quantum many-body problems is presented and several algorithms utilizing this formulation are outlined. The methods are presented and demonstrated using S=1/2 and S=1 Heisenberg chains as test cases. The key idea of the formulation is that rather than keep the lowest-lying eigenstates of the Hamiltonian in forming a new effective Hamiltonian of a block of sites, one should keep the most significant eigenstates of the block density matrix, obtained from diagonalizing the Hamiltonian of a larger section of the lattice which includes the block. This approach is much more accurate than the standard approach; for example, energies for the S=1 Heisenberg chain can be obtained to an accuracy of at least ${10}^{\mathrm{\ensuremath{-}}9}$. The method can be applied to almost any one-dimensional quantum lattice system, and can provide a wide variety of static properties.
Fermionic reduced density matrices summarize the key observables in Fermionic systems. In electronic systems, the two-particle reduced density matrix (2-RDM) is sufficient to determine the energy and most physical observables of interest. Here, we consider the possibility of using matrix completion to reconstruct the two-particle reduced density matrix to chemical accuracy from partial information. We consider the case of noiseless matrix completion, where the partial information corresponds to a subset of the 2-RDM elements, as well as noisy completion, where the partial information corresponds to both a subset of elements and statistical noise in their values. Through experiments on a set of 24 molecular systems, we find that 2-RDM can be efficiently reconstructed from a reduced amount of information. In the case of noisy completion, this results in a multiple orders of magnitude reduction in the number of measurements needed to determine the 2-RDM with chemical accuracy. These techniques can be readily applied to both classical and quantum algorithms for quantum simulations.