A 2D graph state is a highly entangled state to support general measurement based quantum computation. But its state complexity is relative low. Branching MERA represents also a set of low complexity but high entanglement states.
Question: Can 2D graph state (for example on a regular 2D lattice) be represented by branching MERA? Why or why not?
A little bit confused about this problem. I guess the answer is no, otherwise 2D graph state can be classically approximated. But is there a conclusion somewhere?
No comments:
Post a Comment