A poster on my work with Chris Bahr, under the supervision of Patrick Hayden, on a quantum complexity theory problem about entanglement, presented at McGill University for an undergraduate computer science poster session. Abstract: The promise problem QSEP-STATE asks if a quantum state described by a circuit is close to a separable (not entangled) state across a given cut, or not. A quantum multiprover protocol was found to give an upper bound for the computational complexity problem of QMIPne, which is the class of problems that can be solved by a computationally bounded quantum verifier exchanging messages with unentangled, computationally unbounded, quantum provers.