1

Assuming you are talking about starting from a pure state, your statement is true. There are two steps to the proof: Show that a system without entanglement can implement any classical computation. Show that a system that remains separable can be simulated by a classical computation, proving that there are no calculations it can implement that a classical ...


Only top voted, non community-wiki answers of a minimum length are eligible