Preparing matrix product states via fusion: constraints and extensions
David T. Stephen, Oliver Hart

TL;DR
This paper investigates the deterministic preparation of matrix-product states (MPS) in constant depth using measurements and classical communication, establishing constraints and extending to a broader class called SIMPS for more complex states.
Contribution
It introduces the concept of SIMPS fusion, broadening the scope of state preparation beyond traditional MPS fusion, and provides a framework for measurement-assisted state preparation protocols.
Findings
MPS must have a flat entanglement spectrum for traditional fusion.
States with non-onsite symmetries can be prepared using SIMPS fusion.
SIMPS fusion reduces resource overhead compared to MPS fusion.
Abstract
In the era of noisy, intermediate-scale quantum (NISQ) devices, the efficient preparation of many-body resource states is a task of paramount importance. In this paper we focus on the deterministic preparation of matrix-product states (MPS) in constant depth by utilizing measurements and classical communication to fuse smaller states into larger ones. We place strong constraints on the MPS that can be prepared using this method, which we refer to as MPS fusion. Namely, we establish that it is necessary for the MPS to have a flat entanglement spectrum. Using the recently introduced split-index MPS (SIMPS) representation, we then introduce a family of states that belong to interesting phases of matter protected by non-onsite symmetries, including anomalous and non-invertible symmetries, and also serve as resources for long-range quantum teleportation, but which lie beyond the scope of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPetri Nets in System Modeling · Matrix Theory and Algorithms · DNA and Biological Computing
