Speaker
Description
The preparation of quantum states is a fundamental task in quantum computing, error correction, and quantum simulation. Designing efficient preparation algorithms and understanding their gate complexity are therefore of central importance. In this talk, we focus on the preparation of many-body quantum states that obey an entanglement area law; such states are naturally represented by tensor networks. We present efficient preparation schemes in both one and two spatial dimensions. A key ingredient involves leveraging measurements and classical feedforward to generate long-range entanglement using only shallow quantum circuits. We then discuss one-dimensional unitaries that preserve the entanglement area law and present a polynomial-time algorithm for their implementation.
