Given a quantum state we can construct its MPS (Matrix Product State) representation by doing a series of singular value decompositions. Given the freedom to choose arbitrary bond dimensions the MPS representation is powerful enough to represent any quantum state.
I have read that PEPS (Projected Entangled-Pair State) is seen as a natural extension of MPS to general graphs. Then given a quantum state and some graph is there an algorithm that constructs a PEPS equal to that state on that graph ? Any reference to such an algorithm would be much appreciated.