Matrix product states with adaptive global symmetries

@article{Guo2019MatrixPS,
  title={Matrix product states with adaptive global symmetries},
  author={Chu Guo and Dario Poletti},
  journal={Physical Review B},
  year={2019}
}
Quantum many body physics simulations with Matrix Product States can often be accelerated if the quantum symmetries present in the system are explicitly taken into account. Conventionally, quantum symmetries have to be determined before hand when constructing the tensors for the Matrix Product States algorithm. In this work, we present a Matrix Product States algorithm with a dynamical $U(1)$ symmetry. This algorithm can take into account of, or benefit from, $U(1)$ or $Z_2$ symmetries when… 

Figures from this paper

Classical simulation of lossy boson sampling using matrix product operators
TLDR
By simulating lossy boson sampling using MPO, it is shown that as an input photon number grows, its computational cost, or MPO EE, behaves differently depending on a loss-scaling, exhibiting a different feature from that of lossless boson sampled.

References

SHOWING 1-10 OF 63 REFERENCES
Finitely correlated states on quantum spin chains
We study a construction that yields a class of translation invariant states on quantum spin chains, characterized by the property that the correlations across any bond can be modeled on a
Matrix product simulations of non-equilibrium steady states of quantum spin chains
A time-dependent density matrix renormalization group method with a matrix product ansatz is employed for explicit computation of non-equilibrium steady state density operators of several integrable
Time evolution of Matrix Product States
TLDR
This work develops several new simulation algorithms for one-dimensional (1D) many-body quantum mechanical systems combining the Matrix Product State variational ansatz (vMPS) with Taylor, Pade and Arnoldi approximations to the evolution operator, and demonstrates that the Arnoldi method is the best one.
Time-evolving a matrix product state with long-ranged interactions
We introduce a numerical algorithm to simulate the time evolution of a matrix product state under a long-ranged Hamiltonian in moderately entangled systems. In the effectively one-dimensional
String order and symmetries in quantum spin lattices.
TLDR
The results allow us to understand in a straightforward way many of the properties of string order parameters, like their robustness or fragility under perturbations and their typical disappearance beyond strictly one-dimensional lattices.
Time evolution algorithms for Matrix Product States and DMRG
TLDR
This work develops several new simulation algorithms for 1D many-body quantum mechanical systems combining the Matrix Product State variational ansatz with Taylor, Pade and Arnoldi approximations to the evolution operator, reaching extremely good accuracy with moderate resources.
Chebyshev matrix product state approach for time evolution
We present and test a new algorithm for time-evolving quantum many-body systems initially proposed by Holzner et al. [Phys. Rev. B 83, 195115 (2011)]. The approach is based on merging the matrix
From density-matrix renormalization group to matrix product states
In this paper we give an introduction to the numerical density matrix renormalization group (DMRG) algorithm, from the perspective of the more general matrix product state (MPS) formulation. We cover
Efficient simulation of one-dimensional quantum many-body systems.
  • G. Vidal
  • Physics
    Physical review letters
  • 2004
TLDR
Numerical analysis indicates that this method can be used, for instance, to efficiently compute time-dependent properties of low-energy dynamics in sufficiently regular but otherwise arbitrary one-dimensional quantum many-body systems.
...
...