# Matrix Product States with adaptive global symmetries

## TL;DR

This paper introduces an adaptive Matrix Product States algorithm that dynamically incorporates or analyzes symmetries like U(1) and Z2, enhancing quantum many-body simulations without prior symmetry knowledge.

## Contribution

The work presents a novel MPS algorithm with adaptive global symmetries, allowing automatic symmetry detection and handling during simulations, improving flexibility and insight in quantum systems.

## Key findings

- Efficiently captures symmetries in quantum systems.
- Provides insights into symmetry-breaking dynamics.
- Applicable to diverse models including XYZ and bosonic systems.

## Abstract

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 an adaptive $U(1)$ symmetry. This algorithm can take into account of, or benefit from, $U(1)$ or $Z_2$ symmetries when they are present, or analyze the non-symmetric scenario when the symmetries are broken without any external alteration of the code. To give some concrete examples we consider an XYZ model and show the insight that can be gained by (i) searching the ground state and (ii) evolving in time after a symmetry-changing quench. To show the generality of the method, we also consider an interacting bosonic system under the effect of a symmetry-breaking dissipation.